Lemma 8: primality criterion with a cubic factored part
ProvedLL_Decomp126b.lemma8The proposition lemma8_stmt holds: for natural numbers with , even, , odd, , , and , if some satisfies and for every prime , then is prime if and only if or is not a perfect square in . In the lab this assembly is conditional on the open Pocklington leaf.
import Mathlib import Definitions.Def_LL_Decomp126b_lemma8_stmt
namespace LL_Decomp126b theorem lemma8 : lemma8_stmt := by sorry end LL_Decomp126b
Read-back
What the Lean code literally says, in plain math · claude-haiku
The declaration , in the namespace , asserts exactly the proposition . That proposition is a named statement imported from the module , and this item shows neither its quantifiers, hypotheses, nor conclusion. No further mathematical content can be read off from this declaration alone.
The declaration has no binders of its own. It introduces no quantified variables, hypotheses, or typeclass assumptions, so every such condition lies inside .
The proof is only a placeholder, so the declaration is recorded as an unproven claim. Its truth is not established by this item.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.