Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Indexing irreducible characters

Definition
OddOrder_GroupTheory_RepresentationTheory_IrrIndexing

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Names the subtype of irreducible complex characters as a first-class indexing type, so that statements on column orthogonality, Brauer permutation and Peterfalvi §3 use a uniform API. Existence and finiteness of the indexing type are not proved here; statements take an explicit Fintype hypothesis.

Main definitions: IrreducibleCharacter (the type of irreducible characters of GGG as class functions), trivialIrreducibleCharacter, and toClassFunction (the underlying class function of an index).

The bundle also proves 7 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/IrrIndexing.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_RepresentationTheory_ZIrr

namespace OddOrder.RepresentationTheory

variable (G : Type*) [Group G]

/-- The type of irreducible complex characters of `G`, as class functions. -/
abbrev IrreducibleCharacter :=
  {φ : ClassFunction G ℂ // IsIrreducibleCharacter φ}

/-- The trivial irreducible character of `G`. -/
def trivialIrreducibleCharacter : IrreducibleCharacter G :=
  ⟨trivialClassFunction G, trivialClassFunction_isIrreducible⟩

namespace IrreducibleCharacter

variable {G}

/-- The underlying class function of an irreducible character index. -/
abbrev toClassFunction (χ : IrreducibleCharacter G) : ClassFunction G ℂ :=
  χ.1

instance : Coe (IrreducibleCharacter G) (ClassFunction G ℂ) :=
  ⟨toClassFunction⟩

@[simp] theorem coe_trivialIrreducibleCharacter :
    ((trivialIrreducibleCharacter G : IrreducibleCharacter G) : ClassFunction G ℂ) =
      trivialClassFunction G :=
  rfl

@[simp] theorem coe_mk (φ : ClassFunction G ℂ) (hφ : IsIrreducibleCharacter φ) :
    ((⟨φ, hφ⟩ : IrreducibleCharacter G) : ClassFunction G ℂ) = φ :=
  rfl

@[simp] theorem isIrreducible (χ : IrreducibleCharacter G) :
    IsIrreducibleCharacter (χ : ClassFunction G ℂ) :=
  χ.2

@[simp] theorem mem_irreducibleCharacters (χ : IrreducibleCharacter G) :
    (χ : ClassFunction G ℂ) ∈ irreducibleCharacters G :=
  χ.2

theorem mem_ZIrr (χ : IrreducibleCharacter G) :
    (χ : ClassFunction G ℂ) ∈ ZIrr G :=
  IsIrreducibleCharacter.mem_ZIrr χ.2

@[ext] theorem ext {χ ψ : IrreducibleCharacter G}
    (h : (χ : ClassFunction G ℂ) = (ψ : ClassFunction G ℂ)) : χ = ψ :=
  Subtype.ext h

@[simp] theorem eta (χ : IrreducibleCharacter G) :
    (⟨(χ : ClassFunction G ℂ), χ.isIrreducible⟩ : IrreducibleCharacter G) = χ :=
  rfl

end IrreducibleCharacter

end OddOrder.RepresentationTheory
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/IrrIndexing.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