Formal verification of Oppermann’s and Legendre’s Conjectures in Lean 4 via Synchronized Infinity and Square Pair Synchronization (0-sorry).
-
Updated
Nov 10, 2026 - Lean
Formal verification of Oppermann’s and Legendre’s Conjectures in Lean 4 via Synchronized Infinity and Square Pair Synchronization (0-sorry).
Legendre's conjecture: exponent progress, formalized reductions, and a no-sorry/no-axiom audit. Deep analytic proofs are NOT formalized.
Real-process formal verification of Legendre conjecture in Lean 4. Leveraging strong normalization of type theory, potential infinity automatically evolves, purging unrequested ZFC actual infinity and overriding OpenAI's Result 013 via phase-locked invariants (0 sorrys/axioms).
Draft (unpublished): exact explicit-formula verification of the function-field Legendre conjecture for d <= 10, fluctuations of prime counts, and a characteristic-2 anomaly.
Legendre's conjecture in function fields (v7): proved for q >= d-1 (Hayes-Weil), verified for every q when d <= 8, conjecture for q <= d-2. Paper, review, code, data.
To associate your repository with the legendre-conjecture topic, visit your repo's landing page and select "manage topics."