Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (14.11.2): classification of the removed unit-norm character χ=X−β\chi=X-\betaχ=X−β

Proved
OddOrder.Peterfalvi.S16.TypeICoherent78Data.etaGrid_projection_sub_beta_classification

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let GGG be a finite minimal simple odd-order group, L≤GL\le GL≤G, data : TypeICoherent78Data L, and hyp a Peterfalvi §13 configuration with grid ηij\eta_{ij}ηij​. Write β\betaβ for (data.h78 hG).beta, ν\nuν for (data.h78 hG).nu (the coherent map), ζt\zeta_tζt​ for (data.h78 hG).hyp76.zeta t, and ζ∗\zeta_*ζ∗​ for the distinguished member ζzetaDistinct\zeta_{\texttt{zetaDistinct}}ζzetaDistinct​. Let m:{0..q−1}×{0..p−1}→Zm : \{0..q-1\}\times\{0..p-1\}\to\mathbb{Z}m:{0..q−1}×{0..p−1}→Z and X=X=X= etaGridProjection hyp m, χ=X−β\chi = X - \betaχ=X−β. Assume

  • for every t∈{0,…,n}t \in \{0,\dots,n\}t∈{0,…,n} with t≠data.ind1Ht\ne \texttt{data.ind1H}t=data.ind1H and all i,ji,ji,j: ⟨ν(ζt),ηij⟩=0\langle\nu(\zeta_t),\eta_{ij}\rangle = 0⟨ν(ζt​),ηij​⟩=0 (every coherent family image is orthogonal to the grid);
  • ⟨χ,χ⟩=1\langle\chi,\chi\rangle = 1⟨χ,χ⟩=1.

Then

χ=ν(ζ∗)orχ=− ν(ζ∗‾).\chi = \nu(\zeta_*)\quad\text{or}\quad \chi = -\,\nu\bigl(\overline{\zeta_*}\bigr).χ=ν(ζ∗​)orχ=−ν(ζ∗​​).

That is, χ\chiχ is either the distinguished coherent image or the negative of the coherent image of its conjugate.

Formalization Note. The conclusion is a let χ := … binding followed by the disjunction.

Preamble
import Definitions.Def_OddOrder_Peterfalvi_S16_GridExpansion
import Definitions.Def_OddOrder_Peterfalvi_S16_PairingCoherence
import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_InducedIrreducible
import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_ColumnOrthogonality
import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_CoherentProjectionRigidity
Formal statement
namespace OddOrder.Peterfalvi.S16

open OddOrder.GroupTheory

open OddOrder.RepresentationTheory

open OddOrder.Peterfalvi.S09

open OddOrder.Peterfalvi.S09.Cert

open scoped BigOperators

variable {G : Type*} [Group G]

namespace TypeICoherent78Data

open scoped OddOrder.Peterfalvi.S12.FiniteInduce in
set_option backward.isDefEq.respectTransparency false in

theorem etaGrid_projection_sub_beta_classification [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    {L : Subgroup G} (data : TypeICoherent78Data L)
    (hyp : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (m : Fin hyp.q → Fin hyp.p → ℤ)
    (heta : ∀ (t : Fin (data.n + 1)), t ≠ data.ind1H →
      ∀ i j, ClassFunction.inner
        ((data.h78 hG).nu ((data.h78 hG).hyp76.zeta t)) (hyp.eta i j) = 0)
    (hchi1 : ClassFunction.inner
      (etaGridProjection hyp m - (data.h78 hG).beta)
      (etaGridProjection hyp m - (data.h78 hG).beta) = 1) :
    let χ := etaGridProjection hyp m - (data.h78 hG).beta
    χ = (data.h78 hG).nu ((data.h78 hG).hyp76.zeta (data.h78 hG).zetaDistinct) ∨
    χ = -((data.h78 hG).nu
      ((data.h78 hG).hyp76.zeta (data.h78 hG).zetaDistinct).conj) := by sorry

end TypeICoherent78Data

end OddOrder.Peterfalvi.S16
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/Peterfalvi/S16_NonExistenceG/CoherentProjectionRigidity.lean#L373-L545

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