Repository navigation
Research: 平方剰余障害・ψ 型障害・対合上限・有限否定証明書の Lean 化(既知の障害の形式化) - #6
Draft
betyourluck wants to merge 6 commits into
Draft
betyourluck wants to merge 6 commits into
betyourluck wants to merge 6 commits into
Conversation
…sses Known obstruction (Schinzel, Yamamoto; Elsholtz-Tao Prop. 1.6), restated in the normal form of Dahan Thm 3.9(ii): any divisor s of ap+u with s = -1 (mod 4au) forces J(p|s) = -1. Consequences: perfect squares have no witness, p = 1 (mod s) rules out s, and no finite set of fixed witnesses (a,u,s) covers all primes (Dirichlet's theorem from Mathlib). No existence statement is made; witnesses whose s grows with p are untouched. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
For a Dahan pair (a,u) and p = 1 (mod 8): if every odd prime factor q of ap+u satisfies J(p|q) = 1 (equivalently J(-au|q) = 1 when gcd(a,u) = 1), then J(u|p) = 1. Contrapositive: a non-residue shift u always has an odd prime factor of ap+u outside ker psi. A consequence of quadratic reciprocity; it does not assert that a witness exists. Preregistered numeric check (H2'): 36,750 rows with J(u|p) = -1 show no psi-type failure, against 22,370 among the J(u|p) = +1 rows. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Known lemma, not a new result. If M has no divisor s = -1 (mod 4m), the
residues of its prime factors meet each orbit of the fixed-point-free
involution x -> -x^{-1} at most once, so 2|T| <= phi(4m). Fixed-point
freeness comes from -1 not being a square mod 4m (reduce mod 4).
Specialized to Dahan's divisor criterion as no_witness_bound. Equality
attainment (T = ker chi) is not formalized.
Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com>
General lemmas: every divisor of a product of prime powers is a sub-product (dvd_mul_split via gcd, Nat.dvd_prime_pow), so "no divisor s with 4au | s+1" reduces to a decide-able check over the sub-products; primality of the factors is discharged by norm_num. Generated certificates (gen_certificates.py): the two primes 345601 and 670849, which fail every pair of the 53-pair box of the failure atlas, have no Dahan witness at any of those pairs (106 pair theorems, two box theorems). Known criterion; no existence claim and nothing outside the box. Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com>
This was referenced Oct 8, 2026
betyourluck
added a commit
to betyourluck/Outcasts-MathLab
that referenced
this pull request
Oct 8, 2026
Pre-registered in 0e7ac68. On 1,985 primes in (5*10^6, 6*10^6) (125,055 rows), the mean character sign of prime factors 29..997 is -0.0487 against the prediction -0.0462 from "q divides ap+u with probability 1/(q-1), sign fixed at (d|q)" (-1.5 SE); none of the 12 most frequent d is beyond 3 SE; and (-au|q) = (p|q) holds for all 324,013 usable factors (PR AwakeningOS#6 L2 relation). Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
…tion N) Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
…the PR AwakeningOS#6 notes Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
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 #27 までの「反例探し」($u=1 \to 2 \to 3$ と動かす)を一度止め、失敗の構造を分類する方針に切り替えた最初の部品です。
ここで形式化しているのは既知の障害で、新しい結果ではありません。Schinzel・Yamamoto(1965)に始まり、Elsholtz–Tao(arXiv:1107.1010)Proposition 1.6「奇数の平方数には Type I / II の解がない」として整理されている平方剰余の障害を、Dahan(arXiv:2608.24035)Theorem 3.9(ii) の正規形($s \mid ap+u$、$s \equiv -1 \pmod{4au}$)に書き直したものです。存在については何も言いません。
出典の状態(2026-10-10 追記): Elsholtz–Tao は査読済み(J. Aust. Math. Soc. 94 (2013) 50–105)。Dahan(arXiv:2608.24035v1、2026-08)は査読前のプレプリントです。この PR で使うのは判定式の形、Lemma 4.2(
InvolutionBoundで Lean で独立に証明)、Prop 3.13 の数値例だけで、Dahan の検証されていない結果(篩の評価など)には依存しません。base は
mainで、P001 の問題ファイルや他 PR のソースには触れていません。研究モジュールなのでOutcastsMathLab/Research/に置きました。作成者はルナ側(Outcasts Neo & ルナ)です。headfc6ed03までは、境界測量士が Outcasts >>30 で独立レビュー済みです(マージ・採択はしていません)。命題 N の 6 定理(78c557f)は作者しか確認していません。追加
OutcastsMathLab/Research/JacobiObstruction.lean(12 定理。命題 N の 6 定理は 4 回目の push78c557fで追加)+Research/JacobiObstruction/README.mdOutcastsMathLab/Research/PsiObstruction.lean(5 定理)+Research/PsiObstruction/README.mdOutcastsMathLab/Research/InvolutionBound.lean(6 定理、2 回目の push843913bで追加)+Research/InvolutionBound/README.mdOutcastsMathLab/Research/DeterministicFailure.lean(一般補題 4 定理)+OutcastsMathLab/Research/HardPrimes20261005.lean(生成された有限証明書 108 定理)+Research/DeterministicFailure/README.md・gen_certificates.py(3 回目の push で追加)OutcastsMathLab.leanに import 5 行JacobiObstruction: 証人はDivisorWitness p a u s := s ∣ a*p+u ∧ 4*a*u ∣ s+1(研究ブランチの同名の定義と同じ形)。jacobi_eq_one_of_dvd_succwitness_jacobi_eq_neg_oneno_witness_of_squareno_witness_of_mod_eq_onefinite_witnesses_miss_infinitely_many_primesNat.forall_exists_prime_gt_and_modEq)witness_409最後の定理は被覆合同式の障害(Mordell)で、$s$ が $p$ とともに大きくなる証人については何も言いません。本題はそちら側にあります。
追加: 命題 N(
78c557f、6 定理) —witness_jacobi_eq_neg_oneの系です。exists_prime_dvd_jacobiSym_eq_neg_onewitness_has_nonresidue_prime_factorno_smooth_witnesswitness_prime_factor_nonsquarewitness_eleven_nonresiduewitness_1009_eleven小さい素数をすべて平方剰余にもつ素数では、証人に必ず大きい素因数が入ります。小さい素因数の情報だけで証人の存在を決める論法は成り立たない、という形で Outcasts の「条件つき独立」の整理に使いました。
jacobiSymの数値計算のためにMathlib.Tactic.NormNum.LegendreSymbolを import しています。PsiObstruction: ψ 型の障害はjacobi_eq_one_of_prime_factorspsi_obstruction_forces_residuepsi_eq_jacobipsi_kernel_forces_residuenonresidue_shift_escapes_psiInvolutionBound: Dahan Lemma 4.2(対合による上限)neg_one_ne_sqZMod (4m)でZMod 4に写してdecide)card_le_half_of_fixedPointFree_involutioniota_injective/iota_ne_selfcard_le_half_totient_of_no_neg_one_divisordahan_involution_boundprimeResidues M (4m)として定義)no_witness_bound等号の達成($T = \ker\chi$、$\chi(-1) = -1$)は形式化していません。
DeterministicFailure/HardPrimes20261005: 有限否定の証明書Outcasts #28 で境界測量士が「全候補の不成立は Python の有限照合で、Lean で全否定を形式化したとは述べていない」と区別していた部分の、Lean 側の部品です。$ap+u = \prod q_i^{e_i}$ の因数分解を証明書として与えると、一般補題$\prod q_i^{f_i}$ 、$f_i \le e_i$。核は gcd で証明した
mem_subProducts_of_dvd(素数冪の積の約数はすべて部分積dvd_mul_splitとNat.dvd_prime_pow)で約数が有限集合に落ち、(d+1) \bmod 4au \ne 0をdecideで確かめられます(noWitnessCert)。素数性はnorm_num。dvd_mul_splitmem_subProducts_of_dvdsubProducts Lの元no_witness_of_cert/no_divisorWitness_of_certnoWitnessCert = trueからno_witness_345601_box/no_witness_670849_box(生成)生成スクリプト
gen_certificates.pyは Python 側でも全約数を走査して証人がないことをassertしています(Lean とは独立の検査)。箱の外に証人が無いとは言いません(実際にはあります)。数値の照合(Lean の外)
検証(ローカル Windows、Lean 4.34.0 / mathlib v4.34.0)
lake build(Research/の生成物を削除して再コンパイル、78c557f)InvolutionBoundBuilt(17s)、DeterministicFailureBuilt(22s)、PsiObstructionBuilt(23s)、JacobiObstructionBuilt(28s)、HardPrimes20261005Built(17s)、3770 jobs、終了コード 0、警告なし#print axioms(23 + 6 定理)propext/Classical.choice/Quot.soundの部分集合(witness_409はpropextのみ、dvd_mul_splitはpropext/Quot.sound)、sorryAxなしcheck_policy.pyverify.ymlは main 宛て PR で動くが、各 push の前に fork で手動実行)5733528: https://github.com/betyourluck/Outcasts-MathLab/actions/runs/37256678976 — 2 ジョブ success、PsiObstructionBuilt(2.8s)、JacobiObstructionBuilt(3.5s)、3765 jobs、11 定理の公理はローカルと同一、policy 4 files。2 回目843913b: https://github.com/betyourluck/Outcasts-MathLab/actions/runs/37263478755 — 2 ジョブ success、InvolutionBoundBuilt(2.1s)、3766 jobs、Build completed successfully、17 定理の#print axioms、policy 5 files。3 回目fc6ed03: https://github.com/betyourluck/Outcasts-MathLab/actions/runs/37267304124 — 2 ジョブ success、DeterministicFailureBuilt(1.8s)、HardPrimes20261005Built(4.5s)、3769 jobs、Build completed successfully、policy 7 files。4 回目78c557f: https://github.com/betyourluck/Outcasts-MathLab/actions/runs/38023945126 — 2 ジョブ success、5 モジュールすべて Built、3770 jobs、29 定理の公理はローカルと同じく標準の範囲、policy 7 filesgit merge-treea51cc44)とはOutcastsMathLab.leanの import 行で衝突する(内容は両方の行を残せばよい)含まないもの
エルデシュ=シュトラウス方程式の解の存在、Type I の場合、$s$ が$p$ とともに増える証人についての主張、失敗の地図(有限の統計)の Lean 化、Lemma 4.2 の等号達成($T = \ker\chi$)。
🤖 Generated with Claude Code