Peterfalvi (3.9)(a): a norm-one virtual character agreeing with on the regular set equals
ProvedOddOrder.Peterfalvi.S16.eta_eq_of_norm_one_regular_value_eqfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a finite group and base : S15.Hypothesis a Peterfalvi §13 configuration for with primes , cyclic subgroups and grid characters . Let (a virtual character) with , and . Suppose for every with . Then
The difference vanishes on the conjugacy saturation of the regular set , so its grid coefficients satisfy the (3.7) relation; each of has norm one, so has at most two nonzero coefficients and the (3.8) small-support case forces . This is the rigidity behind the independence of the -isometry construction.
Preamble
import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_TGapNonorthogonality import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_TGapGridAlignment
Formal statement
namespace OddOrder.Peterfalvi.S16
open OddOrder.GroupTheory
open OddOrder.RepresentationTheory
variable {G : Type*} [Group G]
open scoped Classical OddOrder.Peterfalvi.S12.FiniteInduce in
theorem eta_eq_of_norm_one_regular_value_eq [Finite G]
(base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
{φ : ClassFunction G ℂ} (hφZ : φ ∈ ZIrr G)
(hφ1 : ClassFunction.inner φ φ = 1)
(A : Fin base.q × Fin base.p)
(hvals : ∀ w : G, w ∈ (base.W : Set G) →
w ∉ (base.W1 : Set G) ∪ (base.W2 : Set G) →
φ w = base.eta A.1 A.2 w) :
φ = base.eta A.1 A.2 := by sorry
end OddOrder.Peterfalvi.S16Source
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/TGapGridAlignment.lean#L1135-L1243