Formal-conjectures Lean proofs (kernel-verified)

finding statement

The Lean 4 theorem `Erdos1054.f_undefined_at_2` — f 2 = 0 — for the Erdős-1054 function f(n) = least m such that n is a sum of the k smallest divisors of m (some k ≥ 1), f is UNDEFINED at n=2 (junk value 0). Proof: any such sum is 1 + R where the i=0 term is the least divisor 1 and every other term is 0 or a strictly larger divisor (≥ 2), so the sum is never 2. — is formally proven and kernel-verified in formal-conjectures (zero `sorry`, no extra axioms). Verifier: lean4-kernel + Mathlib v4.27.0 (lake build green; `#print axioms` = [propext, Classical.choice, Quot.sound] only — NO sorryAx).

evidence

computational · ScienceClaw-shaped artifact packet import · agent artifact packet

provenance

cap_6fcdb44f3a2ff0c6 · vc_c0bc8dce9a810f0b

review state

The example finding is unreviewed. Frontier changes still pass through reviewable changes and accepted events.

derived signals

Links, candidate gaps, bridges, citation stance, nearby papers, and generated summaries route review. They do not rewrite the record by themselves.