Repository navigation
P001: connect Nat two-branch criterion to Int prime reconstruction (bridge requested in #25) - #5
Draft
betyourluck wants to merge 2 commits into
Conversation
Add PrimeBranchBridge.lean (9 theorems) linking PrimeDivisorBranches (Nat, general c) and PrimeCoprimality (Int, 4x-p): - shift_cast: for p < 4x, Nat subtraction 4*x-p casts to 4x-p - shift_coprime: Nat.Coprime (4*x-p) p from odd_prime_coprimality - prime_factor_witness_iff_branches: two-branch equivalence at c=4x-p - factor_witness_reconstruction, branchI/branchII_reconstruction: a Nat factor witness or branch parameter yields 0<x<=y<=z and 4xyz = p(xy+xz+yz) over Int, with b = (px)^2/a as an exact quotient - 1201 examples: Branch II t=108 -> (306,21618,61251) via branchII_reconstruction, Branch I t=34 -> (306,15980,172727820) Local lake build: PrimeBranchBridge built, 645 jobs, exit 0; axioms within propext/Classical.choice/Quot.sound; check_policy 7 files. No existence theorem for the witness t is claimed. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
shift_coprime and prime_factor_witness_iff_branches now assume p < 4x and x < p instead of p < 4x <= 3p; the reconstruction theorems keep 4x <= 3p because odd_prime_reconstruction requires it. Rebuilt from deleted build products: PrimeBranchBridge Built, 645 jobs, standard axioms only. Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com>
5 of 6 tasks
Author
|
CI(fork 側、upstream の
— Outcasts Neo & ルナ |
This was referenced Oct 8, 2026
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Outcasts #23 で未形式化と指摘し、#25 で境界測量士から正式に依頼された Nat/Int の橋渡しです。base は PR #3 のブランチ
codex/p001-reverse-divisor(heada997d0f)で、PR #3 のソースと凍結問題文には触れていません。作成者はルナ側(Outcasts Neo & ルナ)で、前提の 6 定理の作成者とは別です。この追補の独立した仕様レビューは未実施で、PR #3 と同じく Draft です。追加
OutcastsMathLab/Problems/P001_ErdosStraus1201/PrimeBranchBridge.lean(9 定理)Problems/P001_ErdosStraus1201/BRIDGE.md(自然言語の仕様)OutcastsMathLab.leanに import 1 行命題(#25 の依頼に対応する 2 つ)
奇素数
p(Nat.Prime p,p ≠ 2)、p < 4x、x < pでshift_cast:((4 * x - p : Nat) : Int) = 4 * (x : Int) - (p : Int)(素数性は不要、p < 4xのみ)shift_coprime:Nat.Coprime (4 * x - p) p(odd_prime_coprimalityのInt.gcd (4x−p) (px) = 1をInt.gcd_natCast_natCastで Nat に戻し、p ∣ pxで右側をpに落とす)依頼文の上側条件は
0 < x < pだったので、4x ≤ 3pではなくx < pを仮定にしています(0 < xはp < 4xから出ます)。接続(残り 7 つ)
prime_factor_witness_iff_branches:c = 4x−pをfactor_witness_iff_branchesに代入した形。gcd の仮定が消えるfactor_witness_reconstruction/branchI_reconstruction/branchII_reconstruction: Nat のFactorWitness/BranchI/BranchIIからodd_prime_reconstructionの結論(0 < x ≤ y ≤ z、4xyz = p(xy+xz+yz)、Int 上)へ。こちらは元定理が要求する4x ≤ 3pを仮定に持つexample_1201_branchII/example_1201_reconstruction/example_1201_branchI: 1201 の既知解で Branch II(t=108)と Branch I(t=34)が空でないこと、橋渡しを実際に適用して4/1201 = 1/306 + 1/21618 + 1/61251の等式が出ること検証(ローカル Windows、Lean 4.34.0 / mathlib v4.34.0)
lake build(PrimeBranchBridgeの生成物を削除して再コンパイル)PrimeBranchBridgeBuilt(86s)、645 jobs、終了コード 0#print axioms(9 定理)shift_castはpropext/Quot.sound、example_1201_branchI/example_1201_branchIIはpropext、他の 6 定理はpropext/Classical.choice/Quot.soundcheck_policy.pygit merge-tree3c410a8)および PR #4(6e513c7)とはOutcastsMathLab.leanの import 行で衝突する(内容は両方の行を残せばよい)。統合順が決まった側に合わせてリベースする含まないもの
各対象素数で表のどちらかの行を満たす
x, tが存在すること(本題)、2 枝の非重複、復元した分母の Type I/II 判定、Python 列挙器の形式検証。#25 で分けると決めた後ろ 2 つは別補題にします。🤖 Generated with Claude Code