Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Classification of groups of order pqpqpq (Corolário 4.4.1)

Open
Castro2006.groups_order_pq

by LG · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

classificationgroup-theory

Let GGG have order pqpqpq for distinct primes p>qp>qp>q. Then GGG is cyclic (G≅ZpqG\cong\mathbb{Z}_{pq}G≅Zpq​), or G≅Zp⋊ZqG\cong\mathbb{Z}_p\rtimes\mathbb{Z}_qG≅Zp​⋊Zq​ with a nontrivial action (a presentation ⟨α,β∣αp=βq=1, βαβ−1=αs⟩\langle\alpha,\beta\mid\alpha^p=\beta^q=1,\ \beta\alpha\beta^{-1}=\alpha^s\rangle⟨α,β∣αp=βq=1, βαβ−1=αs⟩ with s≢1(modp)s\not\equiv1\pmod ps≡1(modp), sq≡1(modp)s^q\equiv1\pmod psq≡1(modp)); the latter occurs only if q∣p−1q\mid p-1q∣p−1.

Preamble
import Mathlib
Formal statement
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 Castro2006
Source
https://web.archive.org/web/20070509023602/http://www.mat.ibilce.unesp.br/posgraduacao/dissertacoes/dissertacao_Francielle.pdf
Read-back

What the Lean code literally says, in plain math · Qwen (same-model blind pass; not an independent sub-agent)

Let p,qp,qp,q be prime numbers with q<pq<pq<p (in particular distinct), and GGG a finite group of order p⋅qp\cdot qp⋅q. The conclusion is a disjunction: either GGG is cyclic, or both q∣(p−1)q\mid(p-1)q∣(p−1) and there exists a homomorphism φ:(Z/qZ)→Aut⁡(Z/pZ)\varphi:(\mathbb{Z}/q\mathbb{Z})\to\operatorname{Aut}(\mathbb{Z}/p\mathbb{Z})φ:(Z/qZ)→Aut(Z/pZ) (additive cyclic groups written multiplicatively) that is not the trivial homomorphism (φ≠1\varphi\ne1φ=1), such that G≅(Z/pZ)⋊φ(Z/qZ)G\cong(\mathbb{Z}/p\mathbb{Z})\rtimes_{\varphi}(\mathbb{Z}/q\mathbb{Z})G≅(Z/pZ)⋊φ​(Z/qZ). The non-cyclic branch thus requires a nontrivial action and the divisibility q∣p−1q\mid p-1q∣p−1; the action is existentially quantified and only required to be nontrivial (its precise multiplier is not pinned down in this statement).

Human review
  • Endorsed by Shuze Chen · Nov 18, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 18, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me