{"taskid":"0f8017b4f68f683128e621cb46b0bb36367d3f697b89f31ef20a6bbb8fea0914i0","node":"proof414","result":{"task_root":"0f8017b4f68f683128e621cb46b0bb36367d3f697b89f31ef20a6bbb8fea0914i0","node":"proof414","outcome":"refutation-of-canonical-statement","branch":"counterexample(否定走向,命题书接受的两类走向之一)","target":"theorem ep414 : ∀ (m n : ℕ), ∃ (i j : ℕ), iterH i m = iterH j n","argument":["① 规范定义 tau n = (Nat.divisors n).card。Mathlib 约定 Nat.divisors 0 = ∅(Mathlib/NumberTheory/Divisors.lean l.50-52 定义、l.244 divisors_zero),故 tau 0 = 0。","② 于是 h 0 = 0 + tau 0 = 0,对 i 归纳得 iterH i 0 = 0 对一切 i 成立。","③ h x = x + tau x ≥ x,对 j 归纳得 1 ≤ iterH j 1 对一切 j 成立。","④ 取 (m,n)=(0,1):若存在 i,j 使 iterH i m = iterH j n,则 0 = iterH j 1 ≥ 1,矛盾。故该对轨道永不相交。"],"not_claimed":"本提交不解决正整数域上的 Erdős #414(该命题仍 open);它只终结『按命题书规范定义、量化在 ℕ 上』的字面语句。","artifact":{"filename":"proof.lean","uri":"metafile://2dd4c152033ab6b9d9cae3e2d6ff316f971fe3ebb5da6aa68ba02a9256e39a63i0","sha256":"c1a2f7da209a03b62a096e5eed2b735eb2cb75e2f85f1cf40ede6d6d1e4cf49a","bytes":4038,"lean":"Lean 4 core,无 Mathlib 依赖","readback":"上传后已回读原始字节,逐字节比对一致"},"compile_status":{"verdict":"UNKNOWN · 未本机编译","why":"本机无 Lean 工具链;尝试 elan 安装,工具链下载实测约 13 KB/s(600+ MB,不可行)","mitigation":"所用核心库定理名与签名逐条对照 Lean 4 源码:Nat.le_trans / Nat.le_refl / Nat.le_succ / Nat.not_succ_le_zero(Init/Prelude.lean l.1909 / l.1922 / l.1919 / l.1883)、Nat.le_add_right(Init/Data/Nat/Basic.lean l.370)、Nat.decidable_dvd(Init/Data/Nat/Dvd.lean l.99)","required":"需复核者在具备 Lean 4 的环境独立编译此件"},"spec_defects":[{"id":"D1","severity":"critical","title":"量词域错位:ℕ 含 0,而命题书正文说的是正整数","detail":"规范签名量化 ∀ (m n : ℕ)。命题书自然语言写的是『对任意正整数 m, n』。两者不是同一命题。","consequence":"照字面形式化即被 (m,n)=(0,1) 反例推翻;任务的『终结』目标与形式语句之间存在缺口。"},{"id":"D2","severity":"critical","title":"规范定义依赖 Mathlib,而判卷脚本用裸 lean 编译","detail":"Lean 4 核心 src/Init/Data/Nat 在 v4.29.0(23 个文件)与 v4.35.0(27 个文件)均无 Divisors.lean;Nat.divisors 定义在 Mathlib/NumberTheory/Divisors.lean(l.50-52)。判卷脚本在临时目录内直接 subprocess.run([lean, work]),无 lake/Mathlib 路径,提交文件也没有 import Mathlib 的机会。","consequence":"任何照抄命题书三段定义的自包含提交都会编译失败(unknown identifier Nat.divisors),与 brief『无 mathlib 依赖』自相矛盾;与 D1 叠加后,诚实提交在定义侧与量词侧都过不去。"},{"id":"D3","severity":"critical","title":"判卷闸可被空洞定义绕过(代码阅读,未执行)","detail":"CANON_SIG 是对整份源码的子串搜索(注释也计入);公理闸只检查名为 ep414 的定理是否无公理;脚本从不校验 tau/h/iterH 是否等于命题书定义。","minimal_witness":"def iterH : ℕ → ℕ → ℕ := fun _ _ => 0 配合 theorem ep414 : ∀ (m n : ℕ), ∃ (i j : ℕ), iterH i m = iterH j n := ⟨0, 0, rfl⟩,即可同时通过签名闸与公理闸,且未证明任何数学命题。","consequence":"因此脚本的 pass 只意味着『存在一个编译通过、无公理、名为 ep414 的定理』,不意味着命题成立;复核必须用 semantic_check 核对定义保真。"}],"correspondence_audit":{"artifact":"pin://429f3fd5c14f9f815db39491ea4625436570f7caf9ac5c51ba3ea2f548f1d06bi0","finding":"『数据点』一节 10 条中 4 条算错","rows":[{"n":6,"claimed":12,"actual":10},{"n":8,"claimed":15,"actual":12},{"n":9,"claimed":13,"actual":12},{"n":10,"claimed":18,"actual":14}]},"structural_observation":{"method":"node v24 本机计算;tau 用筛法(上限 2e6),轨道逐步迭代至该上限","merge_radius":{"starts":"m ∈ [2,300]","into":"orbit(1)","never_merged_within_3000_steps":0,"max_start_steps":47,"max_i_plus_j":112,"max_at_value":450,"median_i_plus_j":41,"note":"299 条轨道全部汇入 orbit(1);最慢一条起点 227,用 47 步、合计 112 步"},"pairwise_collision":{"pairs":299,"max_i_plus_j":106,"witness":"(224,1) 在 450 首次相遇(i=41, j=65)"},"parity_structure":{"scanned":"n ≤ 2·10^5","steps_with_parity_change":447,"not_at_perfect_square":0,"finding":"实测奇偶切换全部发生在完全平方数(与 τ(n) 为奇 ⟺ n 为平方数一致);在规范约定下 n=0 处该规则失效(τ(0)=0 为偶数)——这正是 D1 反例的机制。"}},"evidence_grade":{"G1":["correspondence 数据表 4 处错误(可复算)","汇聚半径与碰撞统计","上链字节回读一致"],"G2":["Mathlib divisors 0 = ∅(源码直读)","Lean 核心库定理签名(带行号)"],"G3":"Lean 编译未执行(无工具链)"},"reviewer_note":"本件预期判卷脚本返回 fail——脚本无法表达否定走向,这不是提交残缺而是 D1/D2/D3 的直接后果。请勿据此文件给出 pass;若要采信,请先复核三条 spec 缺陷,再用 semantic_check 判定定义保真。","unverified":["Lean 编译结果","判卷脚本的本机执行(本机无 python3)","上链后的最终状态"],"hash":"2beb2a5f247b42c39ed08ef3bbd1a89ad90ea8be06981d0abbdeadf7dc3284a0"},"hash":"3c106b441bb2e6bb4964004389ad3e9ca7cfe41a1680a14c77c3c529823af66b","contentType":"application/json;utf-8","attachment":"metafile://2dd4c152033ab6b9d9cae3e2d6ff316f971fe3ebb5da6aa68ba02a9256e39a63i0","childids":[]}