Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (14.14): single-branch Bessel bound (hL−1)/eL≤eM−1(h_L-1)/e_L\le e_M-1(hL​−1)/eL​≤eM​−1

Proved
OddOrder.Peterfalvi.S16.bessel_bound_of_inner_beta_zeta_ne_zero

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let GGG be a finite group which is minimal simple odd-order (hG), and let L,ML,ML,M be maximal subgroups of GGG that are not conjugate (¬ IsConjugateSubgroup L M), with (7.8) coherence data dataL : TypeICoherent78Data L and dataM : TypeICoherent78Data M. Let βM=\beta_M=βM​= (dataM.h78 hG).beta and let ν(ζ∗)\nu(\zeta_*)ν(ζ∗​) be the coherent image (dataL.h78 hG).nu ((dataL.h78 hG).hyp76.zeta (dataL.h78 hG).zetaDistinct) of the distinguished member of the LLL-family. Assume

⟨βM, ν(ζ∗)⟩≠0.\langle\beta_M,\ \nu(\zeta_*)\rangle\neq0 .⟨βM​, ν(ζ∗​)⟩=0.

Then, in Q\mathbb{Q}Q,

hL−1eL  ≤  eM−1,\frac{h_L-1}{e_L}\;\le\;e_M-1,eL​hL​−1​≤eM​−1,

where hL=∣dataL.kernelIn∣h_L=|\texttt{dataL.kernelIn}|hL​=∣dataL.kernelIn∣ (Nat.card), eL=[L:dataL.kernelIn]e_L=[L:\texttt{dataL.kernelIn}]eL​=[L:dataL.kernelIn] is the index of dataL.kernelIn and eMe_MeM​ is the complement index (dataM.h78 hG).complementIndex.

The proof compares the Bessel inequality for the LLL-family with ∥ΓM∥2≤eM−1\|\Gamma_M\|^2\le e_M-1∥ΓM​∥2≤eM​−1 ((7.8.b)), using the degree-square sum ∑di2=(hL−1)/eL\sum d_i^2=(h_L-1)/e_L∑di2​=(hL​−1)/eL​.

Formalization Note. The theorem is stated in a section with variables [Finite G], L M, dataL, dataM, hG; subtractions hL−1h_L-1hL​−1 and eM−1e_M-1eM​−1 are performed after casting to Q\mathbb{Q}Q.

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

open OddOrder.GroupTheory

open OddOrder.RepresentationTheory

open OddOrder.Peterfalvi.S09

open OddOrder.Peterfalvi.S09.Cert

open scoped OddOrder.Peterfalvi.S12.FiniteInduce

variable {G : Type*} [Group G]

section Pairing

variable [Finite G] {L M : Subgroup G}

variable (dataL : TypeICoherent78Data L) (dataM : TypeICoherent78Data M)

variable (hG : OddOrder.BG.IsMinimalSimpleOdd G)

theorem bessel_bound_of_inner_beta_zeta_ne_zero
    (hL : L ∈ maximalSubgroups G) (hM : M ∈ maximalSubgroups G)
    (hnc : ¬ OddOrder.BG.Ch4.S14.IsConjugateSubgroup L M)
    (hpair : ClassFunction.inner ((dataM.h78 hG).beta)
        ((dataL.h78 hG).nu
          ((dataL.h78 hG).hyp76.zeta ((dataL.h78 hG).zetaDistinct))) ≠ 0) :
    ((Nat.card ↥dataL.kernelIn : ℚ) - 1) / (((dataL.kernelIn).index : ℕ) : ℚ)
      ≤ (((dataM.h78 hG).complementIndex : ℕ) : ℚ) - 1 := by sorry

end Pairing

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_PairingBessel.lean#L418-L531

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