Congruence for units of order modulo (Lema 4.5.2)
ProvedCastro2006.lema_4_5_2congruencesnumber-theory
Let be prime, an integer, , with but . If is odd then ; if then .
Preamble
import Mathlib
Formal statement
namespace Castro2006
theorem lema_4_5_2 {p : ℕ} (hp : p.Prime) (a : ℤ) (n : ℕ) (hn : 2 ≤ n)
(hap : a ^ p ≡ 1 [ZMOD p ^ n]) (ha1 : ¬(a ≡ 1 [ZMOD p ^ n])) :
(p ≠ 2 → a ≡ 1 [ZMOD p ^ (n - 1)]) ∧
(p = 2 → (a ≡ 1 [ZMOD 2 ^ (n - 1)] ∨ a ≡ -1 [ZMOD 2 ^ (n - 1)])) := by sorry
end Castro2006Source
Read-back
What the Lean code literally says, in plain math · Qwen (same-model blind pass; not an independent sub-agent)
Let be prime, an integer, and a natural number with . Assume but (integer congruences, Int.ModEq). The conclusion is a conjunction of two implications: (i) if then ; (ii) if then or . Because , the exponent is at least , so no truncated natural subtraction occurs. The statement does not mention the auxiliary quantity (the largest with ); it packages the two cases as the single disjunction when .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.