Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (9.1): the elementary-abelian chief-factor bridge

Definition
OddOrder_GroupTheory_RepresentationTheory_WielandtElabBridge

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

For the chief-series assembly of Wielandt's fixed-point formula (Peterfalvi (9.1)), each elementary-abelian chief factor VVV of the solvable group HHH is viewed as a Z/p\mathbb{Z}/pZ/p-linear representation of L=U⋊EL=U\rtimes EL=U⋊E through an action φ:L→Aut(V)\varphi:L\to\mathrm{Aut}(V)φ:L→Aut(V); this file builds that representation and bridges to the module-level counting.

The main declaration: elabRepresentation.

The bundle also proves 5 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/RepresentationTheory/WielandtElabBridge.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_CoprimeAction
import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_ElementaryAbelianRepresentation
import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_WielandtCounting
import Mathlib.FieldTheory.Finiteness

namespace OddOrder.GroupTheory

open Module Representation

variable {L V : Type*} [Group L] [CommGroup V]

/-- The `ZMod p`-linear `L`-representation on `Additive V` attached to an action
`φ : L →* MulAut V` of `L` on `V`.  Built from `φ` via `MulDistribMulAction.compHom` and the
ambient `ZMod p`-module structure on `Additive V` (supplied by `IsElementaryAbelian.zmodModule`
for an elementary abelian `V`).  The action is `ρ l = φ l` (independent of the scalars). -/
noncomputable def elabRepresentation (p : ℕ) [Module (ZMod p) (Additive V)]
    (φ : L →* MulAut V) :
    Representation (ZMod p) L (Additive V) :=
  letI : MulDistribMulAction L V := MulDistribMulAction.compHom V φ
  Representation.ofDistribMulAction (ZMod p) L (Additive V)

theorem elabRepresentation_apply (p : ℕ) [Module (ZMod p) (Additive V)] (φ : L →* MulAut V)
    (l : L) (x : V) :
    elabRepresentation p φ l (Additive.ofMul x) = Additive.ofMul (φ l x) := rfl

/-- **The fixed-point bridge.**  The group fixed-point subgroup `C_V(X) = fixedSubgroup φ X` and
the module invariants `V^X = invariants (ρ.comp X.subtype)` of the elementary-abelian
representation have the same cardinality: they are the same subset of `V = Additive V`,
identified by `Additive.ofMul`. -/
theorem card_fixedSubgroup_eq_card_invariants (p : ℕ) [Module (ZMod p) (Additive V)] [Finite V]
    (φ : L →* MulAut V) (X : Subgroup L) :
    Nat.card ↥(fixedSubgroup φ X) =
      Nat.card ↥(invariants ((elabRepresentation p φ).comp X.subtype)) :=
  Nat.card_congr <| (Additive.ofMul (α := V)).subtypeEquiv fun x => by
    simp only [mem_fixedSubgroup, mem_invariants, MonoidHom.comp_apply, Subgroup.coe_subtype]
    constructor
    · intro hx l
      rw [elabRepresentation_apply, hx l.1 l.2]
    · intro hx l hl
      have h := hx ⟨l, hl⟩
      rw [elabRepresentation_apply] at h
      exact Additive.ofMul.injective h

/-- **Cardinality form of the fixed-point bridge** (`|C_V(X)| = p ^ dim V^X`).  Combines
`card_fixedSubgroup_eq_card_invariants` with `Module.card_eq_pow_finrank` for the finite
`ZMod p`-vector space `V^X`. -/
theorem card_fixedSubgroup_eq_pow_finrank (p : ℕ) [Fact p.Prime] [Module (ZMod p) (Additive V)]
    [Finite V] (φ : L →* MulAut V) (X : Subgroup L) :
    Nat.card ↥(fixedSubgroup φ X) =
      p ^ Module.finrank (ZMod p) ↥(invariants ((elabRepresentation p φ).comp X.subtype)) := by
  have : NeZero p := ⟨(Fact.out : p.Prime).pos.ne'⟩
  classical
  let : Fintype ↥(invariants ((elabRepresentation p φ).comp X.subtype)) := Fintype.ofFinite _
  rw [card_fixedSubgroup_eq_card_invariants p, Nat.card_eq_fintype_card,
    Module.card_eq_pow_finrank (K := ZMod p), ZMod.card]

/-- Being fixed by all of `⊤ ≤ G` is being fixed by all of `G`: the invariants of
`ρ.comp ⊤.subtype` coincide with `ρ.invariants`. -/
theorem invariants_comp_top_subtype {k G W : Type*} [CommRing k] [Group G] [AddCommGroup W]
    [Module k W] (ρ : Representation k G W) :
    invariants (ρ.comp (⊤ : Subgroup G).subtype) = ρ.invariants := by
  ext v
  simp only [mem_invariants, MonoidHom.comp_apply, Subgroup.coe_subtype]
  exact ⟨fun h g => h ⟨g, Subgroup.mem_top g⟩, fun h g => h g⟩

/-- **Per-factor cardinality form of Wielandt (9.1)** on a single elementary-abelian module `V`.
Given the dimension identity (⋆) `hdim` — the conclusion of
`WielandtCounting.finrank_elab_identity`, itself modulo the kernel-FPF fact (†) — raising it to
the `p`-th power through the fixed-point
bridge yields the cardinality identity `|C_V(UE)|^{|E|} · |V| = |C_V(E)|^{|E|} · |C_V(U)|`.

Here `C_V(UE) = fixedSubgroup φ ⊤` (the whole group `L = U ⊔ E` fixes), and the three terms of
`hdim` are `dim V^{UE} = dim ρ.invariants`, `dim V^E`, `dim V^U`, together with `dim V`.  This is
the per-chief-factor input that the chief-series multiplicativity multiplies up to the group-level
formula `wielandt_fixedPoint_frobenius`. -/
theorem card_fixedSubgroup_wielandt_of_dim (p : ℕ) [Fact p.Prime] [Module (ZMod p) (Additive V)]
    [Finite V] {U E : Subgroup L} [Fintype E] (φ : L →* MulAut V)
    (hdim : Fintype.card E * Module.finrank (ZMod p) ↥(elabRepresentation p φ).invariants +
        Module.finrank (ZMod p) (Additive V) =
      Fintype.card E *
          Module.finrank (ZMod p) ↥(invariants ((elabRepresentation p φ).comp E.subtype)) +
        Module.finrank (ZMod p) ↥(invariants ((elabRepresentation p φ).comp U.subtype))) :
    Nat.card ↥(fixedSubgroup φ ⊤) ^ Nat.card E * Nat.card V =
      Nat.card ↥(fixedSubgroup φ E) ^ Nat.card E * Nat.card ↥(fixedSubgroup φ U) := by
  have : NeZero p := ⟨(Fact.out : p.Prime).pos.ne'⟩
  classical
  let : Fintype V := Fintype.ofFinite _
  have hV : Nat.card V = p ^ Module.finrank (ZMod p) (Additive V) := by
    rw [Nat.card_eq_fintype_card, ← Fintype.card_additive V,
      Module.card_eq_pow_finrank (K := ZMod p), ZMod.card]
  have hTop := card_fixedSubgroup_eq_pow_finrank p φ (⊤ : Subgroup L)
  rw [invariants_comp_top_subtype] at hTop
  rw [hTop, card_fixedSubgroup_eq_pow_finrank p φ E, card_fixedSubgroup_eq_pow_finrank p φ U, hV,
    ← pow_mul, ← pow_mul, ← pow_add, ← pow_add]
  congr 1
  simp only [Nat.card_eq_fintype_card]
  rw [mul_comm _ (Fintype.card E), mul_comm _ (Fintype.card E)]
  exact hdim

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/RepresentationTheory/WielandtElabBridge.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