Classification of groups of order (Corolário 4.4.1)
OpenCastro2006.groups_order_pqLet have order for distinct primes . Then is cyclic (), or with a nontrivial action (a presentation with , ); the latter occurs only if .
import Mathlib
namespace Castro2006
theorem groups_order_pq {p q : ℕ} (hp : p.Prime) (hq : q.Prime) (hqp : q < p)
{G : Type} [Group G] [Fintype G] (hcard : Fintype.card G = p * q) :
IsCyclic G ∨ (q ∣ p - 1 ∧
∃ φ : Multiplicative (ZMod q) →* MulAut (Multiplicative (ZMod p)),
φ ≠ 1 ∧ Nonempty (G ≃* SemidirectProduct (Multiplicative (ZMod p)) (Multiplicative (ZMod q)) φ)) := by sorry
end Castro2006Read-back
What the Lean code literally says, in plain math · Qwen (same-model blind pass; not an independent sub-agent)
Let be prime numbers with (in particular distinct), and a finite group of order . The conclusion is a disjunction: either is cyclic, or both and there exists a homomorphism (additive cyclic groups written multiplicatively) that is not the trivial homomorphism (), such that . The non-cyclic branch thus requires a nontrivial action and the divisibility ; the action is existentially quantified and only required to be nontrivial (its precise multiplier is not pinned down in this statement).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.