Peterfalvi (14.11.3), arithmetic core: a signed sum over a paired grid has norm at least 1
ProvedOddOrder.Peterfalvi.S16.one_le_norm_eta_grid_signed_sumfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be positive odd natural numbers, and let be integer grids with for all . Suppose is invariant under the involution (finNeg, negation in ): , and . Then
where the norm is the absolute value of the (integer) sum viewed as a complex number.
The involution has as its unique fixed point because are odd. This is the arithmetic input consumed by the generic character bound (14.11.3) and the (14.16) parity argument.
Preamble
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_CoherentEtaOrthogonality import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_CoherentProjectionRigidity import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_SubgroupL import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_SubgroupMCore
Formal statement
namespace OddOrder.Peterfalvi.S16
open OddOrder.GroupTheory
open OddOrder.RepresentationTheory
open OddOrder.Isaacs
open scoped Pointwise
open scoped BigOperators
variable {G : Type*} [Group G]
theorem one_le_norm_eta_grid_signed_sum {q p : ℕ} (hq : 0 < q) (hp : 0 < p)
(hqodd : Odd q) (hpodd : Odd p) (n ε : Fin q → Fin p → ℤ)
(hε : ∀ i j, ε i j = 1 ∨ ε i j = -1)
(hpair : ∀ i j, n (finNeg hq i) (finNeg hp j) = n i j)
(h00 : n ⟨0, hq⟩ ⟨0, hp⟩ = 1) :
1 ≤ ‖(∑ i : Fin q, ∑ j : Fin p, (ε i j : ℂ) * (n i j : ℂ))‖ := 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/SubgroupMCore.lean#L1412-L1456