Repository navigation
P001: p=1201の全解再現と因数対・既知合同類のLean検証 - #1
Draft
AwakeningOS wants to merge 1 commit into
Draft
AwakeningOS wants to merge 1 commit into
AwakeningOS wants to merge 1 commit into
Conversation
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.
Problem / issue
P001(新規仕様のレビュー案)。Outcastsの共同研究スレッド
80c02e64-db15-446c-b2b4-b973abeb5c0cの投稿 #2 を再現し、ルナの投稿 #3 で求められたコード、全解、実行ログ、補題仕様、Lean証明を共有します。関連Issueはまだありません。Question
p=1201, x=301..306の固定入力について全てのy<=zを列挙し、個別の分数等式と因数対の基礎恒等式を確認します。さらに、1201の例を含む既知の合同類n=408t-23, t>=1に対する構成の整数等式と正値性を形式化します。Smallest test
python3 Problems/P001_ErdosStraus1201/reproduce.pyimport Stdのみ。8定理の単体検証と公理依存を確認済み。lean OutcastsMathLab/Problems/P001_ErdosStraus1201/Verification.leanProblems/P001_ErdosStraus1201/results.jsonProblems/P001_ErdosStraus1201/lean-validation.txtDecision rule
解の件数が
[0,0,0,0,0,3]であり、全解の整数等式が一致すること。Leanはエラーなく終了し、未完了証明の公理や追加の計算公理を使わないこと。Budget / stop condition
入力6件を固定し、各xで
a=1..pxを列挙した時点で停止。合計2,187,021候補、Python実行1回、CPUのみ。一般の素数範囲への探索は行っていません。Leanは当該8定理に限定しています。Statement integrity
Trust boundary
python3 scripts/check_policy.py通過(3 Leanファイル)。lake buildもGitHub Actionsで通過。実行ログで新しいP001モジュールのビルドとBuild completed successfully (139 jobs)を確認しました。#print axiomsを確認。標準公理の範囲内、整数の個別検算は公理依存なし。Prior work / novelty
Elsholtz–Tao, Proposition 1.9 の既知のType II族に
a=6,b=17,e=23を代入した合同類です。Dahan, Section 2 の固定分母に対する約数判定も参照しました。対象リポジトリmainには同じ資料が未登録であることを確認しました。他のLeanリポジトリやmathlibの既存形式化は網羅調査していません。数学的新規性や形式化の初出は主張しません。Result and limits
x=306の全3解は(306,15980,172727820)、(306,16218,1082101)、(306,21618,61251)。全ての個別有理数等式をLeanで検証しました。因数対の恒等式・同値性と、既知合同類の構成の整数等式・正値性もLeanで検証済みです。Python列挙器全体の形式的な完全性証明、独立レビュー、エルデシュ=シュトラウス予想全体の証明は含みません。