Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Elementary abelian subgroup families Epn(G)\mathcal{E}_p^n(G)Epn​(G)

Definition
OddOrder_GroupTheory_ElementaryAbelianFamily

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

A shared module introducing the Bender–Glauberman family Epn(G)\mathcal{E}_p^n(G)Epn​(G) of elementary abelian ppp-subgroups of a given order pnp^npn (equivalently rank nnn), which BG uses throughout §4–§16. The maximal family E∗\mathcal{E}^*E∗ is handled by the existing predicate IsMaximalElementaryAbelian; only the order-indexed family is new here.

The main declaration: elemAbelianOfRank.

The bundle also proves 1 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/ElementaryAbelianFamily.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_ElementaryAbelian

namespace OddOrder.GroupTheory

variable {G : Type*} [Group G]

/-- **BG `ℰ_p^n(G)`**: the elementary abelian `p`-subgroups of `G` of order `p^n`
(equivalently, of rank `n`). The single-element form `ℰ^1(A)` (order-`p` subgroups of `A`)
is `{X ∈ elemAbelianOfRank G p 1 | X ≤ A}`. -/
def elemAbelianOfRank (G : Type*) [Group G] (p n : ℕ) : Set (Subgroup G) :=
  {A | A.IsElementaryAbelian p ∧ Nat.card A = p ^ n}

@[simp]
theorem mem_elemAbelianOfRank {p n : ℕ} {A : Subgroup G} :
    A ∈ elemAbelianOfRank G p n ↔ A.IsElementaryAbelian p ∧ Nat.card A = p ^ n :=
  Iff.rfl

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/ElementaryAbelianFamily.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