This repository contains the formal verification of the Lemoine Predictive Process, a constructive method for settling Lemoine’s Conjecture. The project utilizes Lean 4 to demonstrate that a valid prime partition for any odd integer
Lemoine's Conjecture states that every odd number
Where
- 🔍 The Clue: If a test fails, the resulting composite number
$C$ is not random; it serves as a mathematical clue that contains the key to the next step. - 🔑 The Key: Every clue
$C$ is mathematically guaranteed to contain the next prime ($p_{key}$ ) via the governing modular identity:
- 🔓 The Solution: The search is proven well-founded by demonstrating the available candidate list strictly decreases in length with each recursive step. Because the algorithm follows strict recursive rules of modular arithmetic, it is mathematically forced to terminate at a valid prime partition,
$p_{success}$ .
- 📝 The Lemoine Predictive Theorem - A Machine-Verified Constructive Proof of Lemoine's Conjecture.pdf: The full research manuscript detailing the logic and formalization.
-
lemoine_predictive_theorem.lean: Constructive proof of Lemoine's Conjecture via a guided logical chain. -
lemoine_generalized_theorem.lean: Generalized constructive proof of Lemoine's Conjecture via a linear search. -
Lemoine Partition Calculator.html: A standalone tool to verify partitions for any odd integer$N > 5$ .
Direct links to the formalized Lean 4 files:
Jonathan
ORCID: 0009-0008-7345-1407