Formal Verification of Parity Obstructions and Fixed-Point Exclusions for Proper-Divisor Moments (OEIS A245211) in Lean 4
Year: 2026
Type: preprint
Abstract: Let a(n) = sum_{d | n, d < n} d * tau(d) denote the first moment of the divisor-count function tau(d) restricted to the proper positive divisors of n (OEIS A245211, introduced by Jaroslav Krizek in 2014). Krizek observed that a(21) = 21 and asked whether n = 21 is the unique fixed point of a(n); the problem is formalized as an open conjecture in the Google DeepMind Formal Conjectures repository (FormalConjectures/OEIS/245211.lean). Working in Lean 4.35.0 with Gemini 4 Argon and Gemini 4 Hydrogen, the author builds a dependency-free six-module formalization (Basic, Dominance, Families, Parity, OmegaFour, TableCerts) of OEIS A245211 and its companion sequences (OEIS A038040, A060640, A245212, A245213, and A245214) and proves: (1) the Fundamental Dominance Theorem, showing that any factorization n = k * m with 1 < k, 1 < m, and k <= tau(m) forces a(n) >= 1 + m * tau(m) >= n + 1 > n, together with the sharpened prime-power bound e * tau(m) < p; (2) the General Parity Obstruction Theorem, proving that every exact prime-power exponent e of a non-square fixed point satisfies e = 0 or 1 (mod 4); (3) unconditional exclusion of all even positive integers, all primes (a(p) = 1), all prime powers (a(p^k) = 1 mod p), all multiples of 3 other than 21, and the complete classification of all fixed points with Omega(n) <= 4 prime factors counted with multiplicity (proving Omega(n) <= 4 and a(n) = n implies n = 21); (4) for Omega(n) = 5, unconditional exclusion of all non-squarefree families (p^5, p^4*q, p^3*q^2, p^3*q*r, p^2*q^2*r, p^2*q*r*s) and the lower bound p >= 17 on any squarefree p*q*r*s*t fixed point; and (5) kernel-certified evaluation of all 66 OEIS table entries, min(A245213) = 72, min(A245214) = 144, the near-miss a(725) = 724, and bounded uniqueness across 1 <= n <= 150, complemented by an independent Python sieve to N = 1,000,000 and an exhaustive Python branch-and-bound hyperbolic search across all 43,849 prime triples (p_1, p_2, p_3) finding zero squarefree Omega(n) = 5 solutions.
Author: Sugui, Mar Allen
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236718217
