/-! # EP-414 · rev2 契约提交体(proof body only) 任务根 : 0f8017b4f68f683128e621cb46b0bb36367d3f697b89f31ef20a6bbb8fea0914i0 节点 : proof414(rev2,spec = ep414-proof-v2,specid 6d01950d96224e48e7661f5c35637bbe8a6c265f1fc9da1ea2b67a99351204afi0, respec 见 amend 77fac7f8c812097e503b05443f1695110309f5e407868dac432de180b0aae608i0) 命题书 : rev2 = 9257001d8351cae878716530498c2b814feda5a0d57741b6637eda9e1e81b194i0 提交方 : James(idq1mnm4taehu48vzaugrjg48evh7pu2cx5pnscx7f),2026-11-17 ## 方向声明(必读) 钉死类型是 Erdős–Graham 1980 开放猜想本身(正整数域): theorem ep414 : ∀ (m n : Nat), 1 ≤ m → 1 ≤ n → ∃ (i j : Nat), iterH i m = iterH j n 本件不声明 ep414:任何对该类型的「证明」必然依赖伪造(禁用记号或新公理),而判卷闸 v2 在剥离注释的源上禁用它们。rev2 spec 红队矩阵明示:猜想开放期间,诚实提交的可达判卷 结果只有 fail(ep414 缺位 / 主定理未证)。本件因此按诚实条款交付**在判卷器注入的 canonical prelude 上可机器检查的结构内容**,预期 verdict = fail。 契约 v2 结构自检:无 import、无 prelude、不重声明 tauFrom/tau/h/iterH、 剥离注释后不含禁用记号(判卷脚本 8 条正则已在本机 node 逐条复刻复跑,全部通过)。 ## 本件证明内容(全部相对注入 prelude 的规范定义) 可达性传递: iterH_add iterH (k+j) n = iterH j (iterH k n) tails_merge 两轨道一旦相交,其后所有对应项相等 反例证书机(把命题书要求的「不可达性论证」变成可编译形式:任何反例提交只需 给出 mod-q 闭类与起点,本件证明该形式足以推出轨道永不相交): iterH_mod 闭类成员的轨道全程留在该类 disjoint_orbits_of_closed 两个不同剩余类中出发的轨道永不相交 小模数否定(机判 decide,q ≤ 5 的剩余类证书路线全部证伪): mod2_classes_not_closed q=2 两类均非 h-闭(反例 4、9) mod3_classes_not_closed q=3 三类均非 h-闭(反例 1、2、3) mod5_classes_not_closed q=5 五类均非 h-闭(反例 1..5) 正侧碰撞证书(机判 decide,规范 tau/h 下直接求值): collide_at_seven 轨道 1 2 3 4 5 全部在 7 汇合 collide_at_eighteen 轨道 6 在 18 并入轨道 1:iterH 3 6 = iterH 6 1 collide_at_twelve 轨道 8 在 12 并入轨道 1:iterH 1 8 = iterH 5 1 collide_at_75 轨道 11 在 75 并入轨道 1:iterH 16 11 = iterH 16 1 上界与单调性: tauFrom_le / tau_le / h_ge / h_le tau n ≤ n,n ≤ h n ≤ 2n le_iterH / one_le_iterH_one / iterH_zero / h_zero / tau_zero ## 复核路径 判卷 harness(spec-ep414-proof-v2.py)拼接 prelude + 本件 + 追加检查后交 lean; 手动复跑:取命题书 rev2 第三节 canonical 前件与本文拼接,lean proof.lean。 本件编译状态 UNKNOWN(作者本机无工具链:GitHub releases 下载通道两次实测阻断); 若任何引理编译失败,请把 lean 报错原文作为 fail reason 落链——那是有价值的负观测。 -/ /-- mod q 剩余类 r 在步进映射 h 下封闭。 -/ def ClosedUnderH (q r : Nat) : Prop := ∀ x : Nat, x % q = r → (x + tau x) % q = r /-! ## 基础引理 -/ theorem tau_zero : tau 0 = 0 := rfl theorem h_zero : h 0 = 0 := rfl theorem iterH_zero (i : Nat) : iterH i 0 = 0 := by induction i with | zero => rfl | succ k ih => show h (iterH k 0) = 0 rw [ih] exact h_zero theorem one_le_iterH_one (j : Nat) : 1 ≤ iterH j 1 := by induction j with | zero => exact Nat.le_refl 1 | succ k ih => show 1 ≤ h (iterH k 1) unfold h exact Nat.le_trans ih (Nat.le_add_right (iterH k 1) (tau (iterH k 1))) theorem le_iterH (k n : Nat) : n ≤ iterH k n := by induction k with | zero => exact Nat.le_refl n | succ m ih => show n ≤ h (iterH m n) unfold h exact Nat.le_trans ih (Nat.le_add_right (iterH m n) (tau (iterH m n))) theorem tauFrom_le (n d : Nat) : tauFrom n d ≤ d := by induction d with | zero => exact Nat.le_refl 0 | succ k ih => show (if n % (k + 1) = 0 then 1 else 0) + tauFrom n k ≤ k + 1 split · omega · omega theorem tau_le (n : Nat) : tau n ≤ n := tauFrom_le n n theorem h_ge (n : Nat) : n ≤ h n := Nat.le_add_right n (tau n) theorem h_le (n : Nat) : h n ≤ 2 * n := by show n + tau n ≤ 2 * n have hle : tau n ≤ n := tau_le n omega /-! ## 可达性传递 -/ theorem iterH_add (k j n : Nat) : iterH (k + j) n = iterH j (iterH k n) := by induction j with | zero => rfl | succ m ih => show h (iterH (k + m) n) = h (iterH m (iterH k n)) rw [ih] theorem tails_merge (m n k l j : Nat) (hij : iterH k m = iterH l n) : iterH (k + j) m = iterH (l + j) n := by rw [iterH_add, iterH_add, hij] /-! ## 反例证书机 -/ theorem iterH_mod (q r : Nat) (hc : ClosedUnderH q r) (n : Nat) (hn : n % q = r) (k : Nat) : (iterH k n) % q = r := by induction k with | zero => exact hn | succ m ih => show (h (iterH m n)) % q = r unfold h exact hc (iterH m n) ih theorem disjoint_orbits_of_closed (q r s m n : Nat) (hcr : ClosedUnderH q r) (hcs : ClosedUnderH q s) (hrs : r ≠ s) (hm : m % q = r) (hn : n % q = s) : ∀ (i j : Nat), iterH i m ≠ iterH j n := by intro i j heq have h1 : (iterH i m) % q = r := iterH_mod q r hcr m hm i have h2 : (iterH j n) % q = s := iterH_mod q s hcs n hn j rw [heq] at h1 apply hrs exact h1.symm.trans h2 /-! ## 小模数否定(机判) -/ theorem mod2_classes_not_closed : ¬ ClosedUnderH 2 0 ∧ ¬ ClosedUnderH 2 1 := by constructor · intro hc exact absurd (hc 4 (by decide)) (by decide) · intro hc exact absurd (hc 9 (by decide)) (by decide) theorem mod3_classes_not_closed : ¬ ClosedUnderH 3 0 ∧ ¬ ClosedUnderH 3 1 ∧ ¬ ClosedUnderH 3 2 := by constructor · intro hc exact absurd (hc 3 (by decide)) (by decide) · constructor · intro hc exact absurd (hc 1 (by decide)) (by decide) · intro hc exact absurd (hc 2 (by decide)) (by decide) theorem mod5_classes_not_closed : ¬ ClosedUnderH 5 0 ∧ ¬ ClosedUnderH 5 1 ∧ ¬ ClosedUnderH 5 2 ∧ ¬ ClosedUnderH 5 3 ∧ ¬ ClosedUnderH 5 4 := by constructor · intro hc exact absurd (hc 5 (by decide)) (by decide) · constructor · intro hc exact absurd (hc 1 (by decide)) (by decide) · constructor · intro hc exact absurd (hc 2 (by decide)) (by decide) · constructor · intro hc exact absurd (hc 3 (by decide)) (by decide) · intro hc exact absurd (hc 4 (by decide)) (by decide) /-! ## 正侧碰撞证书(机判) -/ theorem collide_at_seven : iterH 3 1 = iterH 2 2 ∧ iterH 2 2 = iterH 2 3 ∧ iterH 1 4 = iterH 2 3 ∧ iterH 1 5 = iterH 2 3 := by decide theorem collide_at_eighteen : iterH 3 6 = iterH 6 1 := by decide theorem collide_at_twelve : iterH 1 8 = iterH 5 1 := by decide theorem collide_at_75 : iterH 16 11 = iterH 16 1 := by decide