Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (13.4): the cross expansion of the grid-corrected pair λ∘,θ∘\lambda^\circ,\theta^\circλ∘,θ∘ is nonzero

Proved
OddOrder.Peterfalvi.S15.eta_cross_expansion_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 (Fintype G, ∣G∣|G|∣G∣ invertible in C\mathbb CC), let q,pq,pq,p be natural numbers and η:{0,…,q−1}×{0,…,p−1}→CF(G)\eta:\{0,\dots,q-1\}\times\{0,\dots,p-1\}\to\mathrm{CF}(G)η:{0,…,q−1}×{0,…,p−1}→CF(G) an orthonormal family of class functions: ⟨ηij,ηkl⟩=1\langle\eta_{ij},\eta_{kl}\rangle=1⟨ηij​,ηkl​⟩=1 if (i,j)=(k,l)(i,j)=(k,l)(i,j)=(k,l) and 000 otherwise. Let λ,θ\lambda,\thetaλ,θ be class functions on GGG with ⟨λ,θ⟩=0\langle\lambda,\theta\rangle=0⟨λ,θ⟩=0, ⟨λ,ηij⟩=0\langle\lambda,\eta_{ij}\rangle=0⟨λ,ηij​⟩=0 and ⟨ηij,θ⟩=0\langle\eta_{ij},\theta\rangle=0⟨ηij​,θ⟩=0 for all i,ji,ji,j. Let r<qr<qr<q, s<ps<ps<p and δ,δ′∈{1,−1}\delta,\delta'\in\{1,-1\}δ,δ′∈{1,−1}. Then

⟨λ−δ∑i<qηis, θ−δ′∑j<pηrj⟩≠0.\Big\langle\lambda-\delta\sum_{i<q}\eta_{is},\ \theta-\delta'\sum_{j<p}\eta_{rj}\Big\rangle\ne0 .⟨λ−δi<q∑​ηis​, θ−δ′j<p∑​ηrj​⟩=0.

In (13.4) the left side is (ατ,βτ)(\alpha^\tau,\beta^\tau)(ατ,βτ), which vanishes by disjointness of TI-supports; this contradiction closes (13.4).

Preamble
import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_HypothesisBasics
import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_Machinery135
Formal statement
namespace OddOrder.Peterfalvi.S15

open OddOrder.GroupTheory

open OddOrder.RepresentationTheory

open OddOrder.Isaacs

open scoped Pointwise

variable {G : Type*} [Group G]

theorem eta_cross_expansion_ne_zero [Fintype G] [Invertible (Nat.card G : ℂ)] {q p : ℕ}
    (eta : Fin q → Fin p → ClassFunction G ℂ)
    (horth : ∀ (i k : Fin q) (j l : Fin p),
      ClassFunction.inner (eta i j) (eta k l) = if i = k ∧ j = l then 1 else 0)
    (lam theta : ClassFunction G ℂ) (r : Fin q) (s : Fin p)
    (hlam_eta : ∀ (i : Fin q) (j : Fin p), ClassFunction.inner lam (eta i j) = 0)
    (heta_theta : ∀ (i : Fin q) (j : Fin p), ClassFunction.inner (eta i j) theta = 0)
    (hlam_theta : ClassFunction.inner lam theta = 0)
    {δ δ' : ℤ} (hδ : δ = 1 ∨ δ = -1) (hδ' : δ' = 1 ∨ δ' = -1) :
    ClassFunction.inner (lam - (δ : ℂ) • ∑ i : Fin q, eta i s)
      (theta - (δ' : ℂ) • ∑ j : Fin p, eta r j) ≠ 0 := by sorry

end OddOrder.Peterfalvi.S15
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/S15_SAndT_Setup/Machinery135.lean#L295-L344

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