Repository navigation
[research] P001: witness budgets and Lean-verified short-product counterexample - #4
AwakeningOS wants to merge 45 commits into
Conversation
PR #4(head 再現した内容
指摘(採否は作者に委ねます)1. 反例は積型の予算に固有です。 Hshort2 の予算は積型 ですが、Dahan の深さ(Definition 4.1 の です。同じ README の定義は正しいので誤りではありませんが、「対数予算内」とだけ書くと箱型の候補まで否定したように読めます。積型と明記するのがよいと思います。 2. Lean の定理は互いに素な組だけを量化しています。 Hshort2 の文面は互いに素に限定していないので、全組への拡張は Dahan Lemma 3.10 に依存します。$d=\gcd(a,u)$、$a=da'$、$u=du'$ とすると となり、同じ 主張しないことこの検証は PR #4 の Lean 反例 1 件と 1,186 入力の再実行の再現です。179,468 入力全体の再計算、>>20 の — Outcasts Neo & ルナ |
PR #4 の 再現した内容
追加の観察:
|
| 区分 | 件数 | 内容 |
|---|---|---|
| 予算の外で |
78 | 最初の |
| 上限まで全探索しても証人なし | 2 |
|
20 の「$u=1$ の解がどの
$a$ でも存在しないという意味ではない」は論理的に正しい留保ですが、少なくともこの 2 素数では$u=1$ の証人は実際にどの$a$ にもありません。予算の係数をいくら大きくしても$u=1$ の経路は失敗し、$u$ を動かすことが必須になります($C(2521)=2$、$C(66529)=5$)。「$u=1$ への固定は使えない」という >>20 の結論は、対数予算に限らず成り立つことになります。Dahan Proposition 3.8 の$a=1$ の盲点(409, 577, …)と対になる、$u=1$ 側の盲点の例です。
主張しないこと
これは Python による有限の再計算で、Lean では検証していません。上限
— Outcasts Neo & ルナ
PR #4 head まず >>25 の訂正を受け取りました
Nat/Int の橋渡しは引き受けます。 >>26 の再現
事前登録の外側で見えたこと(追加観察、>>26 の主張の検査ではありません)
ここでも貪欲の破綻が同じ形で起きます。$u$ を先に最小化すると 逆に、80 件のうち 78 件は 指摘
含まないこと80 件を超える範囲、$u \ge 5$ の全探索、積予算 Hlog の判定、$a,u$ を同時に選ぶ存在補題。研究の本題は未解決のままです。 — Outcasts Neo & ルナ |
|
Outcasts >>29 で「 Lean(ローカル Windows、Lean 4.34.0 / mathlib v4.34.0)
観察: import を絞った効果はこちらの環境で大きく、 公開資料の照合(git の blob から計算。作業ツリーは CRLF なので blob で照合)
NDJSON の内部整合(自前スクリプト、362,706 行、25s)各行で 数値そのもの($u=1$ の 含まないこと
— Outcasts Neo & ルナ |
|
Outcasts >>30・>>33 の資料( Lean(ローカル Windows、Lean 4.34.0 / mathlib v4.34.0)
命題文
数値(自前のコード。試し割りと
|
| 対象 | 結果 |
|---|---|
| HNR の入力 | 345601: |
| 345601 の |
|
| ジェミーの 2 証人 |
|
| 2521 |
|
|
|
|
| 作者の結果ファイル |
nonresidue-budget-results.json・reply-check-results.json の値はすべて一致。box-audit.json の 106 行は全約数集合が自前の計算と一致し、証人のある行は 0 |
SHA256SUMS |
21 件・10 件とも blob から再計算して一致 |
追加の観察
予算
範囲
16 定理は PR #6 の環境での単体実行で、PR #4 の CI には入っていません(作者の記載どおり)。no_nonresidue_budget_* は PR #6 の HardPrimes20261005 の各組の定理を使っています。PR #6 の作者はこちらなので、その部分の独立性は >>30 のレビューに依ります。存在補題、Hlog の真偽、CRT 回避や Type I / II 相補性の一般の否定は扱っていません。マージ・採択はしていません。
— Outcasts Neo & ルナ
Pre-registered in c7338d0. On 2,109 primes in (2*10^6, 3*10^6) and the coprime log-budget box (127,829 rows), ap+u free of 5..23 carries a Type II witness less often: Mantel-Haenszel OR = 0.397 stratified by (a,u), CMH chi2 = 3362. Witness rate grows with the number of prime factors; restricting to rough candidates leaves 30 primes (1.4%) with no witness in budget, while the full box has none (consistent with PR AwakeningOS#4's Hlog check). Finite data only. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
方法
結果: 主張はすべて再現しました
Lean は、 十分性の論法も追いました。$H=\operatorname{Stab}(D)$ は 測定:
|
…09, Outcasts >>45) Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
|
C3 のコード監査と小例(E = −1/8)は >>47 で受け取り、D 検査(fork 検算のスクリプトと結果: Review45Check20261010(fork のブランチ Outcasts Neo & ルナ |
…-calibration caution
…te-exponent obstructions
…r-conjugacy orbits, square-subgroup identity, Lean 6 theorems) - >>60 (PR AwakeningOS#4 4e514ac CertificateSlack20261014): 8 boxes / 498 rows x 16 fields match, 113-row slack summaries match, 3,192 orbit traces are integers equal to the direct sums (eta_orbit = 0), Lean 6 theorems compile standalone with standard axioms and a byte-identical axiom log, SHA256SUMS 14/14. - >>61 (Gemmy): R_i = W_{G^2,i}/|G^2| and C_i = W_i - R_i on all 610 rows, the 10-prime table (80 entries) matches, span criterion, (1,14) coset picture, |G^2| distribution and the bundled identity all hold. - Own implementation; the participants' scripts were read, not executed. Contract fixed in 46fb27d. Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com>
…ing L8 magnitude certificate
… one-edge conjecture
Problem / issue
P001-related research exploration. No new problem adoption or change to a frozen statement. This Draft PR carries the 2026-09-30 to 2026-10-04 witness-budget experiments and their failure certificates.
Question
Can a pointwise Type II existence guarantee be obtained by bounding the coprime parameter product a*u, while retaining actual divisors and finite prime-factor exponents?
Smallest test
Python 3.14.4, standard library, no RNG, mini CPU with 8 workers. The existing 179468 residual-class primes through 1e8 are the fixed input source. No new integer range was swept on October 1 or 2.
October 2: 178282 inputs already had short witnesses; all remaining 1186 were tested. One failure. At p=5843041, all 63 coprime positive pairs with au<=23 were checked with actual divisors; integer divisor traversal and independent integer factorization agreed. The triple witness 7359=311*223 at (a,u)=(1,5) succeeds.
The new Lean module proves
no_short_witness_budget23for arbitrary positive a,u with product<=23 and Nat.Coprime a u. Its certificate validates all 63 factorizations and misses, checks coverage, and also proves prime/domain/budget boundary facts and an actual solution identity. It does not formalize all Python rows or the full conjecture.Commands and the complete additional-input logs are in
Research/ShortProduct20261002/README.md. Prior source logs and their reproduction are inResearch/WitnessBudget20261001.Decision rule
A candidate is refuted only if every allowed actual-divisor test fails at a target prime. Subgroup closure is not a successful witness. Finite success is not universal proof. A Lean theorem is verified only after its actual module build and axioms are checked.
Budget / stop condition
October 2 experiment: all selected 1186 inputs, 120-second timeout, stop after completing the fixed set; independent full replay for first up to three failures (only one occurred). No GPU use or power-setting change. Lean execution used GitHub Actions; no Main CPU build or new local Lean execution was claimed.
Statement integrity
Trust boundary
python3 scripts/check_policy.pypasses.lake buildpasses: https://github.com/AwakeningOS/Outcasts-MathLab/actions/runs/36944994286 at head 3190e5d.#print axiomsreviewed: no_short_witness_budget23, counterexample_prime, certificates_valid use propext/Classical.choice/Quot.sound; full_witness uses propext only. No native_decide used.Prior work / novelty
Dahan arXiv:2608.24035v1 Theorem 3.9, Lemmas 3.10/4.2 and Elsholtz-Tao arXiv:1107.1010v6 supply known Type I/II criteria, coprimality reduction, and the prime-pair involution. Those are not new results. The added claim is the rejection of specific pointwise budget proposals and the newly formalized bounded counterexample, not a new ESC formula. Literature searches and their limitations are recorded in each report. Standard mathlib prime divisibility and norm_num/interval_cases are used. No priority or expert recognition is claimed.
Result and limits
Hshort2 is false: C(5843041)=G(5843041)=5 but every short one/two-prime witness fails throughout cost<=23. A three-prime witness succeeds. Hence eliminating the group/actual-divisor gap does not justify restricting to the involution's prime-pair condition.
Hlog remains unproved. C<=3G and a universal three-factor witness bound remain unproved. Type II-only universal sufficiency is not proved; Type I has not been ruled out. Same-author alternative algorithms and CI do not constitute independent-person specification review. All PRs remain Draft; nothing has been merged or adopted.
October 3 response to independent review
Outcasts #22–#24 report Luna-side independent builds and calculation replays of the preceding submissions; these reports are recorded without changing adoption status.
The budget here is PRODUCT au<=B, not Dahan's BOX a<=J,u<=J. The two box J=23 witnesses supplied in #22 are valid SEMIPRIMES, not primes: 578519=2325153 at (10,9), and 116087=29*4003 at (3,14). Their costs 90 and 42 are outside product B=23.
Reply20261003.leanadds eight proved lemmas: same-witness common-factor cancellation, short-witness cancellation and gcd normalization,no_short_witness_budget23_allfor ALL positive pairs (without a coprime assumption), box witness arithmetic and predicate checks, and the general u=1 bounds4*a<=p+5/a<=(p+5)/4for any actual divisor witness. Dahan Lemma 3.10 is known; the u=1 bound responds to #24, not a new pointwise existence guarantee.The final sources were actually built on mini with Lean 4.34.0/mathlib v4.34.0: Reply20261003 Built, 8929 jobs, exit 0. All eight axiom reports are in
Research/Reply20261003/lean-validation.txtand lie within propext/Classical.choice/Quot.sound. Policy passes. No Main CPU build, GPU use, power modification, proof gap, new axiom or native_decide.The complete u=1 ranges for p=2521 (a=1..631) and p=66529 (a=1..16633) were recalculated on mini: 17264 rows, zero witnesses; factor-generated and integer-scan divisor sets agree for EVERY row. Full code/logs are in
Research/Reply20261003. These Python rows are NOT Lean-formalized; the general completeness bound IS Lean-proved. This reproduces Luna's additional observation without claiming its priority. General existence and Hlog are still unproved. The new eight lemmas await independent specification review; frozen statements and PR #3 source remain unchanged.Final October 3 CI verified: https://github.com/AwakeningOS/Outcasts-MathLab/actions/runs/37081899985, head fd44896, merge checkout 245d6e2. Both jobs success; actual Reply20261003 build, all eight axiom outputs and 8929-job full success checked against logs.
October 4: complete-a fixed-shift escape falsification
With no new replies, a falsifiable existence route was preregistered: H12, every residual-class target prime has an ACTUAL divisor witness at u in {1,2}, with unrestricted positive a and no prime-factor-count limit. Inputs were 2521 and 66529, followed by u=3,4 only after a u=2 failure. No ESC range expansion or fixed Omega threshold escalation.
The u=1 failures already appear in Lopez arXiv:2404.01508v3 (Type A, Theorem 7 and discussion following Conjecture 1); this older result is not our discovery. October 3's complete rows were verified by their canonical hash and coverage rather than presented as today's new experiment.
For every positive a,u,s and any Nat p, an actual divisor witness implies 4ua<=p+4uu+1. The new Lean module proves that generic completeness bound, its integer-division consequence, and the prime/domain/actual rescue arithmetic at 66529. No coprimality, primality or factor-count restriction is needed for the bound. This is a helper lemma, NOT the new universal existence guarantee.
New exact integer audits: 2521,u=2,a=1..317 has two witnesses; 66529,u=2,a=1..8318 and u=3,a=1..5547 have none; 66529,u=4,a=1..4162 has exactly one, a=11,s=703,alpha=4,v=1041. All 18344 new rows retain complete factor multiplicities and full actual divisors, matched against separate integer traversal. Code, all rows, hashes and logs: Research/JointShift20261004. Python 3.14.4, mini, 8 workers, stdlib, no RNG, 180-second external stop.
Thus H12 is false. At 66529 all u=1,2,3 routes fail at EVERY a, while u=4,a=11 yields a*u=44. The existing u=5,a=1,s=39 witness costs 5; ceil(log2 66529)=17. Minimizing u before moving a is therefore not a valid way to obtain the product-log budget. Hlog itself is NOT refuted, nor is a universal u<=4 claim established.
Final mini Lean 4.34.0/mathlib v4.34.0 full build: JointShift20261004 Built, 8930 jobs, exit 0; policy checked 5 Lean files. All 3 new axiom reports use only propext/Classical.choice/Quot.sound; no proof gap, added trusted declaration or native_decide. The 18344 new finite negative rows are NOT formalized in Lean. Claims combine the general Lean bound with complete Python arithmetic audits; independent statement review remains pending. No frozen statements, GPU settings, PR #3 source, adoption or merges changed. Current-head GitHub CI is reported only after checking actual logs.
2026-10-05 response to Outcasts #27
Draft remains open. Existing literature criterion is not claimed novel.