Statement of the cubic Pocklington criterion
DefinitionLL_Decomp126b_lemma8_stmtThe proposition asserting: for all natural numbers with , , even, , odd, , , and , if there exists with (stated as ) and for every prime , then is prime if and only if or is not the square of an integer. Here is natural-number division and , are integer powers.
import Mathlib
namespace LL_Decomp126b
def lemma8_stmt : Prop := ∀ N R F s r : ℕ,
2 ≤ N → 2 ≤ F → Even F → Nat.Coprime R F → Odd N →
N = R * F + 1 → R = 2 * F * s + r → r < 2 * F → N < 2 * F ^ 3 →
(∃ a : ℤ, Int.ModEq (N : ℤ) (a ^ (N - 1)) 1 ∧
∀ p : ℕ, p.Prime → p ∣ F → Int.gcd (a ^ ((N - 1) / p) - 1) N = 1) →
(N.Prime ↔ s = 0 ∨ ¬ IsSquare ((r : ℤ) ^ 2 - 8 * s))
end LL_Decomp126bRead-back
What the Lean code literally says, in plain math · claude-haiku
For naturals , assume , , even, , odd, , , , . Assume also an integer exists with and for every prime . Then is prime if and only if or is not a perfect square in .
The witness ranges over all integers, including and negative values. The division is exact, because and , so no truncation occurs. The oddness hypothesis is implied by even and . The pair is the quotient and remainder of by . The integer can be negative, and negative integers are not squares, so the right side holds whenever . When the right side is true for every , so in that case the statement asserts that is prime.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.