Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Omega and agemo subgroups

Definition
OddOrder_GroupTheory_OmegaSubgroup

by burkh4rt · Nov 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Introduces the omega subgroups Ωn(G)\Omega_n(G)Ωn​(G), absent from Mathlib, which are needed for Bender–Glauberman §1 (Thm 1.11, Cor 1.12, Thm 1.13 on Thompson critical subgroups), §4 (rank theory), §5 (narrow ppp-groups) and Isaacs Thm 4.36.

Main definitions: Omega (Ωn(G)\Omega_n(G)Ωn​(G) at the prime ppp, generated by {g:gpn=1}\{g: g^{p^n}=1\}{g:gpn=1}, shown characteristic), Agemo (the agemo subgroup ℧n(G)\mho_n(G)℧n​(G), BG's Un(G)\mathcal{U}^n(G)Un(G), also characteristic), and omega1OfAbelian (Ω1\Omega_1Ω1​ of an abelian subgroup).

The bundle also proves 10 supporting lemmas used by later statements.

Definition code
/-
Copyright (c) 2026 Yawara Ishida. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yawara Ishida
-/
-- From github.com/yawara/odd-order @ 20a6fccbb63c (Apache-2.0; LICENSE at that commit):
--   OddOrder/GroupTheory/OmegaSubgroup.lean
-- Generated for Prove2Me by deleting declarations; the remaining commands are verbatim except:
-- `private` dropped where another file uses the declaration, and a solution's main theorem
-- renamed `_root_.solution` (platform convention).
import Definitions.Def_OddOrder_GroupTheory_PRank
import Definitions.Def_OddOrder_GroupTheory_CyclicSubgroupUniqueness
import Mathlib.Algebra.Group.Subgroup.Basic
import Mathlib.Algebra.Group.Subgroup.Map
import Mathlib.GroupTheory.Commutator.Basic

namespace OddOrder.GroupTheory

variable (G : Type*) [Group G]

/-- **Omega subgroup** `Ω_n(G)` at prime `p`:
the subgroup of `G` generated by all elements `g` with `g^(p^n) = 1`.

For abelian `p`-groups, this equals the set `{g : g^(p^n) = 1}`. For non-abelian
groups, the generated subgroup is generally larger than this set. -/
def Omega (p n : ℕ) : Subgroup G :=
  Subgroup.closure {g : G | g ^ (p ^ n) = 1}

variable {G}

namespace Omega

variable {p n : ℕ}

/-- An element `g` with `g^(p^n) = 1` is in `Omega p n G`. -/
theorem mem_of_pow_eq_one {g : G} (hg : g ^ (p ^ n) = 1) : g ∈ Omega G p n :=
  Subgroup.subset_closure hg

/-- **`Ω_n(G)` は characteristic**: 任意の自己同型 `φ : G ≃* G` は生成集合
`{g | g ^ (p ^ n) = 1}` を保つ (`(φ g) ^ (p ^ n) = φ (g ^ (p ^ n)) = φ 1 = 1`),
ゆえに `Ω_n(G)` を固定する.

BG Thm 1.13 (issue 0016) で `H = Ω₁(C)` を `C` で characteristic にし,
`C char G` と合わせて ambient `G` での characteristic を導く土台. -/
instance characteristic : (Omega G p n).Characteristic := by
  rw [Subgroup.characteristic_iff_map_eq]
  intro φ
  rw [Omega, MonoidHom.map_closure]
  congr 1
  ext h
  simp only [Set.mem_image, Set.mem_ofPred_eq, MulEquiv.coe_toMonoidHom]
  constructor
  · rintro ⟨g, hg, rfl⟩
    rw [← map_pow, hg, map_one]
  · intro hh
    exact ⟨φ.symm h, by rw [← map_pow, hh, map_one], φ.apply_symm_apply h⟩

end Omega

variable (G) in
/-- **Agemo subgroup** `℧_n(G)` (BG's `𝒰^n(G)`) at prime `p`:
the subgroup of `G` generated by all `p^n`-th powers `x^(p^n)`.

This is the precise dual of `Omega G p n`.  For abelian `p`-groups it equals
the set `{x^(p^n) : x ∈ G}`; for non-abelian groups the generated subgroup is
generally larger.  BG Prop 4.11 / Thm 4.12 / Thm 4.16 use `𝒰^1(R) = Agemo p 1 R`. -/
def Agemo (p n : ℕ) : Subgroup G :=
  Subgroup.closure {g : G | ∃ x : G, g = x ^ (p ^ n)}

namespace Agemo

variable {p n : ℕ}

/-- A `p^n`-th power `x^(p^n)` lies in `Agemo p n G`. -/
theorem mem_of_eq_pow (x : G) : x ^ (p ^ n) ∈ Agemo G p n :=
  Subgroup.subset_closure ⟨x, rfl⟩

/-- **`℧_n(G)` is characteristic**: any automorphism `φ : G ≃* G` permutes the
generating set `{x^(p^n) : x ∈ G}` (`φ (x^(p^n)) = (φ x)^(p^n)`), hence fixes
`℧_n(G)`.  Verbatim dual of `Omega.characteristic`. -/
instance characteristic : (Agemo G p n).Characteristic := by
  rw [Subgroup.characteristic_iff_map_eq]
  intro φ
  rw [Agemo, MonoidHom.map_closure]
  congr 1
  ext h
  simp only [Set.mem_image, Set.mem_ofPred_eq, MulEquiv.coe_toMonoidHom]
  constructor
  · rintro ⟨g, ⟨x, rfl⟩, rfl⟩
    exact ⟨φ x, by rw [map_pow]⟩
  · rintro ⟨x, rfl⟩
    exact ⟨φ.symm x ^ (p ^ n), ⟨φ.symm x, rfl⟩, by rw [map_pow, φ.apply_symm_apply]⟩

end Agemo

open scoped commutatorElement

/-- In a commutative group the agemo subgroup `℧ⁿ(H)` is exactly the range
of the `pⁿ`-th power homomorphism. -/
theorem agemo_eq_range_powMonoidHom {H : Type*} [CommGroup H] {p n : ℕ} :
    Agemo H p n = (powMonoidHom (p ^ n) : H →* H).range := by
  rw [Agemo]
  refine le_antisymm (Subgroup.closure_le _ |>.mpr ?_) ?_
  · rintro g ⟨x, rfl⟩
    exact ⟨x, rfl⟩
  · rintro g ⟨x, rfl⟩
    exact Subgroup.subset_closure ⟨x, rfl⟩

/-- In a commutative group, membership in `℧ⁿ(H)` means being a `pⁿ`-th
power. -/
theorem mem_agemo_iff_of_comm {H : Type*} [CommGroup H] {p n : ℕ} {x : H} :
    x ∈ Agemo H p n ↔ ∃ y, x = y ^ (p ^ n) := by
  rw [agemo_eq_range_powMonoidHom, MonoidHom.mem_range]
  exact ⟨fun ⟨y, hy⟩ => ⟨y, hy.symm⟩, fun ⟨y, hy⟩ => ⟨y, hy.symm⟩⟩

/-- **`Ω₁` of an abelian subgroup**: given a subgroup `H ≤ G` whose
underlying group is commutative (witnessed by `hH : ∀ x y ∈ H, x * y = y * x`),
the set `{g ∈ H | g^p = 1}` is a subgroup of `G`.

This wraps the standard abelian-group fact `(xy)^p = x^p * y^p` and packages
it with the membership-in-`H` predicate to land directly in `Subgroup G`. -/
def omega1OfAbelian (G : Type*) [Group G] (H : Subgroup G) (p : ℕ)
    (hH : ∀ x ∈ H, ∀ y ∈ H, x * y = y * x) :
    Subgroup G where
  carrier := {g : G | g ∈ H ∧ g ^ p = 1}
  mul_mem' := by
    rintro x y ⟨hxH, hxp⟩ ⟨hyH, hyp⟩
    refine ⟨H.mul_mem hxH hyH, ?_⟩
    have hcomm : Commute x y := hH x hxH y hyH
    rw [hcomm.mul_pow, hxp, hyp, mul_one]
  one_mem' := ⟨H.one_mem, one_pow p⟩
  inv_mem' := by
    rintro x ⟨hxH, hxp⟩
    refine ⟨H.inv_mem hxH, ?_⟩
    rw [inv_pow, hxp, inv_one]

variable {p : ℕ}

@[simp]
theorem mem_omega1OfAbelian {H : Subgroup G} {p : ℕ}
    {hH : ∀ x ∈ H, ∀ y ∈ H, x * y = y * x} {g : G} :
    g ∈ omega1OfAbelian G H p hH ↔ g ∈ H ∧ g ^ p = 1 :=
  Iff.rfl

theorem omega1OfAbelian_le {H : Subgroup G} {p : ℕ}
    {hH : ∀ x ∈ H, ∀ y ∈ H, x * y = y * x} :
    omega1OfAbelian G H p hH ≤ H :=
  fun _ hg => hg.1

theorem pow_eq_one_of_mem_omega1OfAbelian {H : Subgroup G} {p : ℕ}
    {hH : ∀ x ∈ H, ∀ y ∈ H, x * y = y * x} {g : G}
    (hg : g ∈ omega1OfAbelian G H p hH) : g ^ p = 1 :=
  hg.2

/-- `Ω₁(H)` of an abelian subgroup is elementary abelian. -/
theorem omega1OfAbelian_isElementaryAbelian {H : Subgroup G} {p : ℕ}
    {hH : ∀ x ∈ H, ∀ y ∈ H, x * y = y * x} :
    (omega1OfAbelian G H p hH).IsElementaryAbelian p := by
  refine ⟨fun x y => Subtype.ext ?_, fun x => Subtype.ext ?_⟩
  · exact hH (x : G) (omega1OfAbelian_le x.2) (y : G) (omega1OfAbelian_le y.2)
  · exact pow_eq_one_of_mem_omega1OfAbelian x.2

/-- An element normalizing `H` normalizes `Ω₁(H)` (abelian form): conjugation by `g` preserves
both membership in `H` and the equation `x ^ p = 1`. -/
theorem mem_normalizer_omega1OfAbelian {H : Subgroup G} {p : ℕ}
    {hH : ∀ x ∈ H, ∀ y ∈ H, x * y = y * x} {g : G}
    (hg : g ∈ Subgroup.normalizer (H : Set G)) :
    g ∈ Subgroup.normalizer ((omega1OfAbelian G H p hH : Subgroup G) : Set G) := by
  rw [Subgroup.mem_set_normalizer_iff] at hg ⊢
  intro h
  constructor
  · rintro ⟨hhH, hhp⟩
    refine ⟨(hg h).mp hhH, ?_⟩
    rw [conj_pow, hhp, mul_one, mul_inv_cancel]
  · rintro ⟨hhH, hhp⟩
    refine ⟨(hg h).mpr hhH, ?_⟩
    rw [conj_pow] at hhp
    have := congrArg (fun z => g⁻¹ * z * g) hhp
    simpa [mul_assoc] using this

/-- If an abelian subgroup `H` has `p`-rank at least `n > 0`, then
`p^n` divides the order of its ambient `Ω₁(H)`.

The proof takes an elementary abelian witness inside `H`, maps it into the ambient group,
and observes that its image lies in `omega1OfAbelian G H p hH`. -/
theorem pow_dvd_card_omega1OfAbelian_of_pos_le_pRank [Finite G]
    {H : Subgroup G} {p : ℕ} [Fact p.Prime]
    {hH : ∀ x ∈ H, ∀ y ∈ H, x * y = y * x} {n : ℕ}
    (hnpos : 0 < n) (hn : n ≤ pRank H p) :
    p ^ n ∣ Nat.card (omega1OfAbelian G H p hH) := by
  obtain ⟨E, hE, hlog⟩ :=
    exists_isElementaryAbelian_log_card_ge_of_pos_le_pRank (G := H) (p := p) hnpos hn
  let K : Subgroup G := E.map H.subtype
  have hK_le : K ≤ omega1OfAbelian G H p hH := by
    rintro x ⟨e, heE, rfl⟩
    refine (mem_omega1OfAbelian).mpr ⟨e.2, ?_⟩
    change ((e : H) : G) ^ p = 1
    have hepowH : (e : H) ^ p = 1 := by
      exact congrArg Subtype.val (hE.pow_eq_one ⟨e, heE⟩)
    exact congrArg Subtype.val hepowH
  have hK_card : Nat.card K = Nat.card E :=
    Subgroup.card_map_of_injective H.subtype_injective
  have hE_card := hE.card_eq_pow_finrank
  have hE_log := hE.log_card_eq_finrank
  have hpow_dvd_E : p ^ n ∣ Nat.card E := by
    rw [hE_card]
    exact pow_dvd_pow p (by simpa [hE_log] using hlog)
  have hE_dvd_omega : Nat.card E ∣ Nat.card (omega1OfAbelian G H p hH) := by
    have hsub : Nat.card (K.subgroupOf (omega1OfAbelian G H p hH)) ∣
        Nat.card (omega1OfAbelian G H p hH) :=
      Subgroup.card_subgroup_dvd_card (K.subgroupOf (omega1OfAbelian G H p hH))
    have hsub_card : Nat.card (K.subgroupOf (omega1OfAbelian G H p hH)) = Nat.card K :=
      Nat.card_congr (Subgroup.subgroupOfEquivOfLe hK_le).toEquiv
    rwa [hsub_card, hK_card] at hsub
  exact hpow_dvd_E.trans hE_dvd_omega

end OddOrder.GroupTheory
Source
Yawara Ishida, Lean 4 formalization of the Feit–Thompson (odd order) theorem, github.com/yawara/odd-order @ 20a6fccbb63c (Apache-2.0), https://github.com/yawara/odd-order/blob/20a6fccbb63c0b138acda9f7fafd798c42f9441b/OddOrder/GroupTheory/OmegaSubgroup.lean

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