Fixed-point-free congruence: a subgroup of prime order acting fixed-point-freely on gives
ProvedOddOrder.Peterfalvi.S16.card_modEq_one_of_prime_normalizing_fpffeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a finite group, and subgroups of , and a prime. Assume , normalizes (A ≤ normalizer U), and acts on fixed-point-freely by conjugation: for all and ,
Then
The -group acts on with as its only fixed point, so the fixed-point congruence for -group actions gives .
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 card_modEq_one_of_prime_normalizing_fpf {G : Type*} [Group G] [Finite G]
{U A : Subgroup G} {p : ℕ} (hp : p.Prime) (hA_card : Nat.card ↥A = p)
(hA_norm : A ≤ Subgroup.normalizer (U : Set G))
(hfpf : ∀ a ∈ A, a ≠ 1 → ∀ u ∈ U, u ≠ 1 → (a : G) * u * (a : G)⁻¹ ≠ u) :
Nat.card ↥U ≡ 1 [MOD p] := 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#L499-L541