Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi §11.8: TTT-side grid enumeration alignment

Definition
OddOrder_Peterfalvi_S16_NonExistenceG_TGapGridAlignment

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Aligns the concrete σ\sigmaσ-grid source characters of §12 with the abstract ω\omegaω/η\etaη grid of §15, beginning with the full character-grid equivalence.

Main declarations: monoidHomTransportSubgroupEq (Transport a multiplicative character along equality of its subgroup carrier); omegaMonoidHomEquiv (The abstract S15 omega-grid as an explicit equivalence with all complex linear characters of…); alignedOmegaSourceCharacterOnBase (The S12 aligned-grid source character, transported onto the shared S15 subgroup W); alignedOmegaEtaIndex (The eta-grid pointer selected by the transported S12 source character).

The bundle also proves 8 supporting lemmas used by later statements.

Definition code
/-
Copyright (c) 2026 Yawara Ishida. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yawara Ishida
-/
-- From github.com/yawara/odd-order @ 20a6fccbb63c (Apache-2.0; LICENSE at that commit):
--   OddOrder/Peterfalvi/S16_NonExistenceG/TGapGridAlignment.lean
-- Generated for Prove2Me by deleting declarations; the remaining commands are verbatim except:
-- `private` dropped where another file uses the declaration, and a solution's main theorem
-- renamed `_root_.solution` (platform convention).
import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_TGapNonorthogonality

namespace OddOrder.Peterfalvi.S16

open OddOrder.GroupTheory

open OddOrder.RepresentationTheory

variable {G : Type*} [Group G]

/-- Transport a multiplicative character along equality of its subgroup
carrier. -/
noncomputable def monoidHomTransportSubgroupEq {H K : Subgroup G}
    (h : H = K) (χ : H →* ℂˣ) : K →* ℂˣ :=
  χ.comp (MulEquiv.subgroupCongr h.symm).toMonoidHom

/-- Transport does not change the value of the underlying ambient element. -/
theorem monoidHomTransportSubgroupEq_apply {H K : Subgroup G}
    (h : H = K) (χ : H →* ℂˣ) (x : K) :
    monoidHomTransportSubgroupEq h χ x =
      χ ⟨x, h.symm ▸ x.property⟩ := by
  rfl

/-- The abstract S15 omega-grid as an explicit equivalence with all complex
linear characters of `W`. -/
noncomputable def omegaMonoidHomEquiv [Finite G]
    (base : OddOrder.Peterfalvi.S15.Hypothesis (G := G)) :
    (Fin base.q × Fin base.p) ≃ (↥base.W →* ℂˣ) :=
  Equiv.ofBijective
    (fun ij => omegaMonoidHom base ij.1 ij.2)
    (omegaMonoidHom_bijective base)

@[simp] theorem omegaMonoidHomEquiv_apply [Finite G]
    (base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (ij : Fin base.q × Fin base.p) :
    omegaMonoidHomEquiv base ij = omegaMonoidHom base ij.1 ij.2 := rfl

/-- The S12 aligned-grid source character, transported onto the shared S15
subgroup `W`. -/
noncomputable def alignedOmegaSourceCharacterOnBase [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis base.T)
    (hW : s12.typeP.W = base.W) (hodd : Odd (Nat.card G))
    (i : Fin s12.w1) (j : Fin s12.w2) : ↥base.W →* ℂˣ :=
  monoidHomTransportSubgroupEq hW
    (s12.alignedOmegaSourceCharacter hG hodd i j)

/-- The eta-grid pointer selected by the transported S12 source character. -/
noncomputable def alignedOmegaEtaIndex [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis base.T)
    (hW : s12.typeP.W = base.W) (hodd : Odd (Nat.card G))
    (i : Fin s12.w1) (j : Fin s12.w2) : Fin base.q × Fin base.p :=
  (omegaMonoidHomEquiv base).symm
    (alignedOmegaSourceCharacterOnBase hG base s12 hW hodd i j)

open scoped OddOrder.Peterfalvi.S12.FiniteInduce in
/-- The concrete S12 source-character grid is jointly injective.  This peels
off, in order, transport along the subgroup isomorphism, the product-character
equivalence, and the two normalized factor-character enumerations. -/
theorem alignedOmegaSourceCharacter_injective [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G) {M : Subgroup G}
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis M)
    (hodd : Odd (Nat.card G)) :
    Function.Injective (fun ij : Fin s12.w1 × Fin s12.w2 =>
      s12.alignedOmegaSourceCharacter hG hodd ij.1 ij.2) := by
  classical
  intro ⟨i, j⟩ ⟨i', j'⟩ hij
  let h := (s12.toCertainTypeHypothesis hG hodd).toHypothesis
  have : NeZero (Nat.card h.W1) :=
    ⟨by have := h.one_lt_card_W1; omega⟩
  have : IsCyclic ↥(h.W1 ⊔ h.W2) := h.isCyclic_sup
  let : CommGroup ↥(h.W1 ⊔ h.W2) := IsCyclic.commGroup
  have hW1le : s12.typeP.W1 ≤ M := s12.typeP.W1_le
  have hW2le : s12.typeP.W2 ≤ M :=
    OddOrder.Peterfalvi.S12.typePData_W2_le_self s12.typeP
  have hcardW1 : Nat.card ↥h.W1 = s12.w1 :=
    Nat.card_congr (Subgroup.subgroupOfEquivOfLe hW1le).toEquiv
  have hcardW2sub : Nat.card ↥(h.W2.subgroupOf (h.W1 ⊔ h.W2)) = s12.w2 := by
    rw [Nat.card_congr (Subgroup.subgroupOfEquivOfLe le_sup_right).toEquiv]
    exact Nat.card_congr (Subgroup.subgroupOfEquivOfLe hW2le).toEquiv
  have : NeZero (Nat.card ↥(h.W2.subgroupOf (h.W1 ⊔ h.W2))) :=
    ⟨Nat.card_pos.ne'⟩
  let χ₂ : Fin s12.w2 → (h.W2.subgroupOf (h.W1 ⊔ h.W2)) →* ℂˣ :=
    fun k => OddOrder.Peterfalvi.S12.finCardEquivCharacterGroup _
      (finCongr hcardW2sub.symm k)
  let tic := OddOrder.Peterfalvi.S12.typePData_toTICyclicHypothesis
    s12.typeP hodd
  let e : ↥tic.W ≃* ↥(h.W1 ⊔ h.W2) :=
    (Subgroup.subgroupOfEquivOfLe
      (OddOrder.Peterfalvi.S12.typePData_W_le_self s12.typeP)).symm.trans
      (MulEquiv.subgroupCongr
        (OddOrder.Peterfalvi.S12.typePData_sup_subgroupOf_eq s12.typeP).symm)
  have hsource : ∀ a b, s12.alignedOmegaSourceCharacter hG hodd a b =
      (h.sdiffTICyclicHypothesis.omegaProdChar
        (h.w1CharEquiv (finCongr hcardW1.symm a)) (χ₂ b)).comp
          e.toMonoidHom := by
    intro a b
    unfold OddOrder.Peterfalvi.S12.Hypothesis.alignedOmegaSourceCharacter
    rfl
  change s12.alignedOmegaSourceCharacter hG hodd i j =
    s12.alignedOmegaSourceCharacter hG hodd i' j' at hij
  rw [hsource i j, hsource i' j'] at hij
  have hprod := (MonoidHom.cancel_right (MulEquiv.surjective e)).mp hij
  have hfactors := h.sdiffTICyclicHypothesis.omegaProdChar_inj hprod
  apply Prod.ext
  · exact (finCongr hcardW1.symm).injective
      (h.w1CharEquiv.injective hfactors.1)
  · exact (finCongr hcardW2sub.symm).injective
      ((OddOrder.Peterfalvi.S12.finCardEquivCharacterGroup _).injective
        hfactors.2)

open scoped OddOrder.Peterfalvi.S12.FiniteInduce in
set_option backward.isDefEq.respectTransparency false in
/-- The source row-zero character is trivial on the first type-P factor.
After reconciliation this factor is the target `W₂`. -/
theorem alignedOmegaSourceCharacter_zero_row_apply_of_mem_W1 [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G) {M : Subgroup G}
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis M)
    (hodd : Odd (Nat.card G)) (j : Fin s12.w2)
    (x : ↥(OddOrder.Peterfalvi.S12.typePData_toTICyclicHypothesis
      s12.typeP hodd).W)
    (hx : (x : G) ∈ s12.typeP.W1) :
    s12.alignedOmegaSourceCharacter hG hodd 0 j x = 1 := by
  classical
  let h := (s12.toCertainTypeHypothesis hG hodd).toHypothesis
  have : NeZero (Nat.card h.W1) :=
    ⟨by have := h.one_lt_card_W1; omega⟩
  have : IsCyclic ↥(h.W1 ⊔ h.W2) := h.isCyclic_sup
  let : CommGroup ↥(h.W1 ⊔ h.W2) := IsCyclic.commGroup
  have hW1le : s12.typeP.W1 ≤ M := s12.typeP.W1_le
  have hW2le : s12.typeP.W2 ≤ M :=
    OddOrder.Peterfalvi.S12.typePData_W2_le_self s12.typeP
  have hcardW1 : Nat.card ↥h.W1 = s12.w1 :=
    Nat.card_congr (Subgroup.subgroupOfEquivOfLe hW1le).toEquiv
  have hcardW2sub : Nat.card ↥(h.W2.subgroupOf (h.W1 ⊔ h.W2)) = s12.w2 := by
    rw [Nat.card_congr (Subgroup.subgroupOfEquivOfLe le_sup_right).toEquiv]
    exact Nat.card_congr (Subgroup.subgroupOfEquivOfLe hW2le).toEquiv
  have : NeZero (Nat.card ↥(h.W2.subgroupOf (h.W1 ⊔ h.W2))) :=
    ⟨Nat.card_pos.ne'⟩
  let χ₂ : (h.W2.subgroupOf (h.W1 ⊔ h.W2)) →* ℂˣ :=
    OddOrder.Peterfalvi.S12.finCardEquivCharacterGroup _
      (finCongr hcardW2sub.symm j)
  let tic := OddOrder.Peterfalvi.S12.typePData_toTICyclicHypothesis
    s12.typeP hodd
  let e : ↥tic.W ≃* ↥(h.W1 ⊔ h.W2) :=
    (Subgroup.subgroupOfEquivOfLe
      (OddOrder.Peterfalvi.S12.typePData_W_le_self s12.typeP)).symm.trans
      (MulEquiv.subgroupCongr
        (OddOrder.Peterfalvi.S12.typePData_sup_subgroupOf_eq s12.typeP).symm)
  have hsource : s12.alignedOmegaSourceCharacter hG hodd 0 j =
      (h.sdiffTICyclicHypothesis.omegaProdChar
        (h.w1CharEquiv (finCongr hcardW1.symm (0 : Fin s12.w1))) χ₂).comp
          e.toMonoidHom := by
    unfold OddOrder.Peterfalvi.S12.Hypothesis.alignedOmegaSourceCharacter
    rfl
  have hrow0 : h.w1CharEquiv
      (finCongr hcardW1.symm (0 : Fin s12.w1)) = 1 := by
    rw [show finCongr hcardW1.symm (0 : Fin s12.w1) = 0 from by ext; simp,
      h.w1CharEquiv_zero]
  rw [hsource, MonoidHom.comp_apply]
  apply Units.ext
  change (h.chiColumn χ₂
    (finCongr hcardW1.symm (0 : Fin s12.w1)) :
      ClassFunction h.sdiffTICyclicHypothesis.W ℂ) (e.toMonoidHom x) = 1
  have hex : e.toMonoidHom x ∈ h.sdiffTICyclicHypothesis.W1.subgroupOf
      h.sdiffTICyclicHypothesis.W := by
    apply Subgroup.mem_subgroupOf.mpr
    change (x : G) ∈ s12.typeP.W1
    exact hx
  have hsnd : h.sdiffTICyclicHypothesis.wSnd (e.toMonoidHom x) =
      (1 : h.W2.subgroupOf (h.W1 ⊔ h.W2)) :=
    h.sdiffTICyclicHypothesis.wSnd_eq_one_of_mem_W1 hex
  have hchi : χ₂ (h.sdiffTICyclicHypothesis.wSnd (e.toMonoidHom x)) = 1 := by
    rw [hsnd, map_one]
  rw [OddOrder.Peterfalvi.S06.Hypothesis.chiColumn,
    h.sdiffTICyclicHypothesis.omega_apply]
  change (((h.w1CharEquiv (finCongr hcardW1.symm (0 : Fin s12.w1)))
      (h.sdiffTICyclicHypothesis.wFst (e.toMonoidHom x)) *
      χ₂ (h.sdiffTICyclicHypothesis.wSnd (e.toMonoidHom x)) : ℂˣ) : ℂ) = 1
  rw [Units.val_mul, hrow0, MonoidHom.one_apply, Units.val_one,
    hchi, Units.val_one, one_mul]

open scoped OddOrder.Peterfalvi.S12.FiniteInduce in
set_option backward.isDefEq.respectTransparency false in
/-- The source column-zero character is trivial on the second type-P factor.
After reconciliation this factor is the target `W₁`. -/
theorem alignedOmegaSourceCharacter_zero_column_apply_of_mem_W2 [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G) {M : Subgroup G}
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis M)
    (hodd : Odd (Nat.card G)) (i : Fin s12.w1)
    (x : ↥(OddOrder.Peterfalvi.S12.typePData_toTICyclicHypothesis
      s12.typeP hodd).W)
    (hx : (x : G) ∈ s12.typeP.W2) :
    s12.alignedOmegaSourceCharacter hG hodd i 0 x = 1 := by
  classical
  let h := (s12.toCertainTypeHypothesis hG hodd).toHypothesis
  have : NeZero (Nat.card h.W1) :=
    ⟨by have := h.one_lt_card_W1; omega⟩
  have : IsCyclic ↥(h.W1 ⊔ h.W2) := h.isCyclic_sup
  let : CommGroup ↥(h.W1 ⊔ h.W2) := IsCyclic.commGroup
  have hW1le : s12.typeP.W1 ≤ M := s12.typeP.W1_le
  have hW2le : s12.typeP.W2 ≤ M :=
    OddOrder.Peterfalvi.S12.typePData_W2_le_self s12.typeP
  have hcardW1 : Nat.card ↥h.W1 = s12.w1 :=
    Nat.card_congr (Subgroup.subgroupOfEquivOfLe hW1le).toEquiv
  have hcardW2sub : Nat.card ↥(h.W2.subgroupOf (h.W1 ⊔ h.W2)) = s12.w2 := by
    rw [Nat.card_congr (Subgroup.subgroupOfEquivOfLe le_sup_right).toEquiv]
    exact Nat.card_congr (Subgroup.subgroupOfEquivOfLe hW2le).toEquiv
  have : NeZero (Nat.card ↥(h.W2.subgroupOf (h.W1 ⊔ h.W2))) :=
    ⟨Nat.card_pos.ne'⟩
  let χ₂ : (h.W2.subgroupOf (h.W1 ⊔ h.W2)) →* ℂˣ :=
    OddOrder.Peterfalvi.S12.finCardEquivCharacterGroup _
      (finCongr hcardW2sub.symm (0 : Fin s12.w2))
  let tic := OddOrder.Peterfalvi.S12.typePData_toTICyclicHypothesis
    s12.typeP hodd
  let e : ↥tic.W ≃* ↥(h.W1 ⊔ h.W2) :=
    (Subgroup.subgroupOfEquivOfLe
      (OddOrder.Peterfalvi.S12.typePData_W_le_self s12.typeP)).symm.trans
      (MulEquiv.subgroupCongr
        (OddOrder.Peterfalvi.S12.typePData_sup_subgroupOf_eq s12.typeP).symm)
  have hsource : s12.alignedOmegaSourceCharacter hG hodd i 0 =
      (h.sdiffTICyclicHypothesis.omegaProdChar
        (h.w1CharEquiv (finCongr hcardW1.symm i)) χ₂).comp e.toMonoidHom := by
    unfold OddOrder.Peterfalvi.S12.Hypothesis.alignedOmegaSourceCharacter
    rfl
  have hcol0 : χ₂ = 1 := by
    change OddOrder.Peterfalvi.S12.finCardEquivCharacterGroup _
      (finCongr hcardW2sub.symm (0 : Fin s12.w2)) = 1
    rw [show finCongr hcardW2sub.symm (0 : Fin s12.w2) = 0 from by ext; simp,
      OddOrder.Peterfalvi.S12.finCardEquivCharacterGroup_zero]
  rw [hsource, MonoidHom.comp_apply]
  apply Units.ext
  change (h.chiColumn χ₂ (finCongr hcardW1.symm i) :
    ClassFunction h.sdiffTICyclicHypothesis.W ℂ) (e.toMonoidHom x) = 1
  have hex : e.toMonoidHom x ∈ h.sdiffTICyclicHypothesis.W2.subgroupOf
      h.sdiffTICyclicHypothesis.W := by
    apply Subgroup.mem_subgroupOf.mpr
    change (x : G) ∈ s12.typeP.W2
    exact hx
  have hfst : h.sdiffTICyclicHypothesis.wFst (e.toMonoidHom x) =
      (1 : h.W1.subgroupOf (h.W1 ⊔ h.W2)) :=
    h.sdiffTICyclicHypothesis.wFst_eq_one_of_mem_W2 hex
  have hfirst : h.w1CharEquiv (finCongr hcardW1.symm i)
      (h.sdiffTICyclicHypothesis.wFst (e.toMonoidHom x)) = 1 := by
    rw [hfst, map_one]
  have hsecond : χ₂
      (h.sdiffTICyclicHypothesis.wSnd (e.toMonoidHom x)) = 1 := by
    rw [hcol0, MonoidHom.one_apply]
  rw [OddOrder.Peterfalvi.S06.Hypothesis.chiColumn,
    h.sdiffTICyclicHypothesis.omega_apply]
  change (((h.w1CharEquiv (finCongr hcardW1.symm i))
      (h.sdiffTICyclicHypothesis.wFst (e.toMonoidHom x)) *
      χ₂ (h.sdiffTICyclicHypothesis.wSnd (e.toMonoidHom x)) : ℂˣ) : ℂ) = 1
  rw [Units.val_mul, hfirst, Units.val_one, hsecond, Units.val_one, one_mul]

/-- Restriction of the transported source row-zero axis to the target `W₁`.
Under the reconciled T-side factor swap, this is the source `W₂` axis. -/
noncomputable def alignedOmegaSourceW1Restriction [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis base.T)
    (hW : s12.typeP.W = base.W) (hodd : Odd (Nat.card G))
    (j : Fin s12.w2) : ↥(base.W1.subgroupOf base.W) →* ℂˣ :=
  (alignedOmegaSourceCharacterOnBase hG base s12 hW hodd 0 j).comp
    (base.W1.subgroupOf base.W).subtype

/-- Restriction of the transported source column-zero axis to target `W₂`.
Under the reconciled T-side factor swap, this is the source `W₁` axis. -/
noncomputable def alignedOmegaSourceW2Restriction [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis base.T)
    (hW : s12.typeP.W = base.W) (hodd : Odd (Nat.card G))
    (i : Fin s12.w1) : ↥(base.W2.subgroupOf base.W) →* ℂˣ :=
  (alignedOmegaSourceCharacterOnBase hG base s12 hW hodd i 0).comp
    (base.W2.subgroupOf base.W).subtype

/-- The target `W₁` zero-column label selected by a source `W₂`-axis
character. -/
noncomputable def alignedOmegaColumnIndex [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis base.T)
    (hW : s12.typeP.W = base.W) (hodd : Odd (Nat.card G))
    (j : Fin s12.w2) : Fin base.q :=
  (omegaW1RestrictionEquiv base).symm
    (alignedOmegaSourceW1Restriction hG base s12 hW hodd j)

/-- The target `W₂` zero-row label selected by a source `W₁`-axis
character. -/
noncomputable def alignedOmegaRowIndex [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis base.T)
    (hW : s12.typeP.W = base.W) (hodd : Odd (Nat.card G))
    (i : Fin s12.w1) : Fin base.p :=
  (omegaW2RestrictionEquiv base).symm
    (alignedOmegaSourceW2Restriction hG base s12 hW hodd i)

set_option backward.isDefEq.respectTransparency false in
/-- The target column-zero omega character selected from the source `W₂`
axis equals that transported source character on all of `W`. -/
theorem omegaMonoidHom_alignedOmegaColumnIndex [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis base.T)
    (hW : s12.typeP.W = base.W)
    (_hW1 : s12.typeP.W2 = base.W1)
    (hW2 : s12.typeP.W1 = base.W2)
    (hodd : Odd (Nat.card G)) (j : Fin s12.w2) :
    omegaMonoidHom base
        (alignedOmegaColumnIndex hG base s12 hW hodd j)
        ⟨0, base.p_prime.pos⟩ =
      alignedOmegaSourceCharacterOnBase hG base s12 hW hodd 0 j := by
  apply monoidHom_eq_of_eq_on_W1_W2 base
  · intro x
    have hx := DFunLike.congr_fun
      ((omegaW1RestrictionEquiv base).apply_symm_apply
        (alignedOmegaSourceW1Restriction hG base s12 hW hodd j)) x
    exact hx
  · intro y
    have htarget : omegaMonoidHom base
        (alignedOmegaColumnIndex hG base s12 hW hodd j)
        ⟨0, base.p_prime.pos⟩ y = 1 := by
      apply Units.ext
      change base.omega (alignedOmegaColumnIndex hG base s12 hW hodd j)
        ⟨0, base.p_prime.pos⟩ y = 1
      exact base.omega_col_zero_apply_of_mem_W2 _ y
        (Subgroup.mem_subgroupOf.mp y.property)
    have hsource : alignedOmegaSourceCharacterOnBase
        hG base s12 hW hodd 0 j y = 1 := by
      rw [alignedOmegaSourceCharacterOnBase,
        monoidHomTransportSubgroupEq_apply]
      apply alignedOmegaSourceCharacter_zero_row_apply_of_mem_W1
      exact hW2.symm ▸ Subgroup.mem_subgroupOf.mp y.property
    exact htarget.trans hsource.symm

set_option backward.isDefEq.respectTransparency false in
/-- The target row-zero omega character selected from the source `W₁` axis
equals that transported source character on all of `W`. -/
theorem omegaMonoidHom_alignedOmegaRowIndex [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis base.T)
    (hW : s12.typeP.W = base.W)
    (hW1 : s12.typeP.W2 = base.W1)
    (_hW2 : s12.typeP.W1 = base.W2)
    (hodd : Odd (Nat.card G)) (i : Fin s12.w1) :
    omegaMonoidHom base ⟨0, base.q_prime.pos⟩
        (alignedOmegaRowIndex hG base s12 hW hodd i) =
      alignedOmegaSourceCharacterOnBase hG base s12 hW hodd i 0 := by
  apply monoidHom_eq_of_eq_on_W1_W2 base
  · intro x
    have htarget : omegaMonoidHom base ⟨0, base.q_prime.pos⟩
        (alignedOmegaRowIndex hG base s12 hW hodd i) x = 1 := by
      apply Units.ext
      change base.omega ⟨0, base.q_prime.pos⟩
        (alignedOmegaRowIndex hG base s12 hW hodd i) x = 1
      exact base.omega_row_zero_apply_of_mem_W1 _ x
        (Subgroup.mem_subgroupOf.mp x.property)
    have hsource : alignedOmegaSourceCharacterOnBase
        hG base s12 hW hodd i 0 x = 1 := by
      rw [alignedOmegaSourceCharacterOnBase,
        monoidHomTransportSubgroupEq_apply]
      apply alignedOmegaSourceCharacter_zero_column_apply_of_mem_W2
      exact hW1.symm ▸ Subgroup.mem_subgroupOf.mp x.property
    exact htarget.trans hsource.symm
  · intro y
    have hy := DFunLike.congr_fun
      ((omegaW2RestrictionEquiv base).apply_symm_apply
        (alignedOmegaSourceW2Restriction hG base s12 hW hodd i)) y
    exact hy

set_option backward.isDefEq.respectTransparency false in
/-- The transported source character at `(0,0)` is the trivial character.
The proof uses the two reconciled factors rather than any global uniqueness
claim for the sigma map. -/
theorem alignedOmegaSourceCharacterOnBase_zero_zero [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis base.T)
    (hW : s12.typeP.W = base.W)
    (hW1 : s12.typeP.W2 = base.W1)
    (hW2 : s12.typeP.W1 = base.W2)
    (hodd : Odd (Nat.card G)) :
    alignedOmegaSourceCharacterOnBase hG base s12 hW hodd 0 0 = 1 := by
  apply monoidHom_eq_of_eq_on_W1_W2 base
  · intro x
    rw [alignedOmegaSourceCharacterOnBase,
      monoidHomTransportSubgroupEq_apply, MonoidHom.one_apply]
    apply alignedOmegaSourceCharacter_zero_column_apply_of_mem_W2
    exact hW1.symm ▸ Subgroup.mem_subgroupOf.mp x.property
  · intro y
    rw [alignedOmegaSourceCharacterOnBase,
      monoidHomTransportSubgroupEq_apply, MonoidHom.one_apply]
    apply alignedOmegaSourceCharacter_zero_row_apply_of_mem_W1
    exact hW2.symm ▸ Subgroup.mem_subgroupOf.mp y.property

/-- The transposed source-column index preserves the distinguished zero. -/
theorem alignedOmegaColumnIndex_zero [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis base.T)
    (hW : s12.typeP.W = base.W)
    (hW1 : s12.typeP.W2 = base.W1)
    (hW2 : s12.typeP.W1 = base.W2)
    (hodd : Odd (Nat.card G)) :
    alignedOmegaColumnIndex hG base s12 hW hodd 0 =
      ⟨0, base.q_prime.pos⟩ := by
  rw [alignedOmegaColumnIndex,
    show alignedOmegaSourceW1Restriction hG base s12 hW hodd 0 = 1 by
      unfold alignedOmegaSourceW1Restriction
      rw [alignedOmegaSourceCharacterOnBase_zero_zero
        hG base s12 hW hW1 hW2 hodd, MonoidHom.one_comp]]
  exact omegaW1RestrictionEquiv_symm_one base

/-- The transposed source-row index preserves the distinguished zero. -/
theorem alignedOmegaRowIndex_zero [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis base.T)
    (hW : s12.typeP.W = base.W)
    (hW1 : s12.typeP.W2 = base.W1)
    (hW2 : s12.typeP.W1 = base.W2)
    (hodd : Odd (Nat.card G)) :
    alignedOmegaRowIndex hG base s12 hW hodd 0 =
      ⟨0, base.p_prime.pos⟩ := by
  rw [alignedOmegaRowIndex,
    show alignedOmegaSourceW2Restriction hG base s12 hW hodd 0 = 1 by
      unfold alignedOmegaSourceW2Restriction
      rw [alignedOmegaSourceCharacterOnBase_zero_zero
        hG base s12 hW hW1 hW2 hodd, MonoidHom.one_comp]]
  exact omegaW2RestrictionEquiv_symm_one base

set_option maxHeartbeats 1000000 in
-- The concrete source-grid injectivity proof has a large reducible subgroup term.
/-- The source `W₂` labels inject into the target `W₁` zero-column labels. -/
theorem alignedOmegaColumnIndex_injective [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis base.T)
    (hW : s12.typeP.W = base.W)
    (hW1 : s12.typeP.W2 = base.W1)
    (hW2 : s12.typeP.W1 = base.W2)
    (hodd : Odd (Nat.card G)) :
    Function.Injective (alignedOmegaColumnIndex hG base s12 hW hodd) := by
  intro j k hjk
  have hchars : alignedOmegaSourceCharacterOnBase
      hG base s12 hW hodd 0 j =
      alignedOmegaSourceCharacterOnBase hG base s12 hW hodd 0 k := by
    rw [← omegaMonoidHom_alignedOmegaColumnIndex
        hG base s12 hW hW1 hW2 hodd j,
      ← omegaMonoidHom_alignedOmegaColumnIndex
        hG base s12 hW hW1 hW2 hodd k, hjk]
  have hsource : s12.alignedOmegaSourceCharacter hG hodd 0 j =
      s12.alignedOmegaSourceCharacter hG hodd 0 k := by
    exact (MonoidHom.cancel_right
      (MulEquiv.surjective (MulEquiv.subgroupCongr hW.symm))).mp hchars
  have hp : ((0, j) : Fin s12.w1 × Fin s12.w2) = (0, k) :=
    alignedOmegaSourceCharacter_injective hG s12 hodd hsource
  exact congrArg Prod.snd hp

set_option maxHeartbeats 1000000 in
-- The concrete source-grid injectivity proof has a large reducible subgroup term.
/-- The source `W₁` labels inject into the target `W₂` zero-row labels. -/
theorem alignedOmegaRowIndex_injective [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis base.T)
    (hW : s12.typeP.W = base.W)
    (hW1 : s12.typeP.W2 = base.W1)
    (hW2 : s12.typeP.W1 = base.W2)
    (hodd : Odd (Nat.card G)) :
    Function.Injective (alignedOmegaRowIndex hG base s12 hW hodd) := by
  intro i k hik
  have hchars : alignedOmegaSourceCharacterOnBase
      hG base s12 hW hodd i 0 =
      alignedOmegaSourceCharacterOnBase hG base s12 hW hodd k 0 := by
    rw [← omegaMonoidHom_alignedOmegaRowIndex
        hG base s12 hW hW1 hW2 hodd i,
      ← omegaMonoidHom_alignedOmegaRowIndex
        hG base s12 hW hW1 hW2 hodd k, hik]
  have hsource : s12.alignedOmegaSourceCharacter hG hodd i 0 =
      s12.alignedOmegaSourceCharacter hG hodd k 0 := by
    exact (MonoidHom.cancel_right
      (MulEquiv.surjective (MulEquiv.subgroupCongr hW.symm))).mp hchars
  have hp : ((i, 0) : Fin s12.w1 × Fin s12.w2) = (k, 0) :=
    alignedOmegaSourceCharacter_injective hG s12 hodd hsource
  exact congrArg Prod.fst hp

/-- The transposed source-column label map is bijective. -/
theorem alignedOmegaColumnIndex_bijective [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis base.T)
    (hW : s12.typeP.W = base.W)
    (hW1 : s12.typeP.W2 = base.W1)
    (hW2 : s12.typeP.W1 = base.W2)
    (hodd : Odd (Nat.card G)) :
    Function.Bijective (alignedOmegaColumnIndex hG base s12 hW hodd) := by
  apply (Fintype.bijective_iff_injective_and_card _).mpr
  refine ⟨alignedOmegaColumnIndex_injective
    hG base s12 hW hW1 hW2 hodd, ?_⟩
  simp only [Fintype.card_fin]
  rw [show s12.w2 = Nat.card ↥s12.typeP.W2 from rfl, hW1,
    ← base.q_eq_card_W1]

/-- The transposed source-row label map is bijective. -/
theorem alignedOmegaRowIndex_bijective [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis base.T)
    (hW : s12.typeP.W = base.W)
    (hW1 : s12.typeP.W2 = base.W1)
    (hW2 : s12.typeP.W1 = base.W2)
    (hodd : Odd (Nat.card G)) :
    Function.Bijective (alignedOmegaRowIndex hG base s12 hW hodd) := by
  apply (Fintype.bijective_iff_injective_and_card _).mpr
  refine ⟨alignedOmegaRowIndex_injective
    hG base s12 hW hW1 hW2 hodd, ?_⟩
  simp only [Fintype.card_fin]
  rw [show s12.w1 = Nat.card ↥s12.typeP.W1 from rfl, hW2,
    ← base.p_eq_card_W2]

/-- Zero-preserving transposed enumeration of the source `W₂` axis by the
target `W₁` axis. -/
noncomputable def alignedOmegaColumnEquiv [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis base.T)
    (hW : s12.typeP.W = base.W)
    (hW1 : s12.typeP.W2 = base.W1)
    (hW2 : s12.typeP.W1 = base.W2)
    (hodd : Odd (Nat.card G)) : Fin s12.w2 ≃ Fin base.q :=
  Equiv.ofBijective (alignedOmegaColumnIndex hG base s12 hW hodd)
    (alignedOmegaColumnIndex_bijective hG base s12 hW hW1 hW2 hodd)

/-- Zero-preserving transposed enumeration of the source `W₁` axis by the
target `W₂` axis. -/
noncomputable def alignedOmegaRowEquiv [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis base.T)
    (hW : s12.typeP.W = base.W)
    (hW1 : s12.typeP.W2 = base.W1)
    (hW2 : s12.typeP.W1 = base.W2)
    (hodd : Odd (Nat.card G)) : Fin s12.w1 ≃ Fin base.p :=
  Equiv.ofBijective (alignedOmegaRowIndex hG base s12 hW hodd)
    (alignedOmegaRowIndex_bijective hG base s12 hW hW1 hW2 hodd)

@[simp] theorem alignedOmegaColumnEquiv_zero [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis base.T)
    (hW : s12.typeP.W = base.W)
    (hW1 : s12.typeP.W2 = base.W1)
    (hW2 : s12.typeP.W1 = base.W2)
    (hodd : Odd (Nat.card G)) :
    alignedOmegaColumnEquiv hG base s12 hW hW1 hW2 hodd 0 =
      ⟨0, base.q_prime.pos⟩ :=
  alignedOmegaColumnIndex_zero hG base s12 hW hW1 hW2 hodd

@[simp] theorem alignedOmegaRowEquiv_zero [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis base.T)
    (hW : s12.typeP.W = base.W)
    (hW1 : s12.typeP.W2 = base.W1)
    (hW2 : s12.typeP.W1 = base.W2)
    (hodd : Odd (Nat.card G)) :
    alignedOmegaRowEquiv hG base s12 hW hW1 hW2 hodd 0 =
      ⟨0, base.p_prime.pos⟩ :=
  alignedOmegaRowIndex_zero hG base s12 hW hW1 hW2 hodd

/-- Coordinate-respecting full omega label: map the two source axes to the
transposed target zero axes, multiply those target characters, and only then
use the full omega exhaustion.  No separability of the pre-existing abstract
omega labels is assumed. -/
noncomputable def alignedOmegaProductIndex [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis base.T)
    (hW : s12.typeP.W = base.W)
    (hW1 : s12.typeP.W2 = base.W1)
    (hW2 : s12.typeP.W1 = base.W2)
    (hodd : Odd (Nat.card G))
    (i : Fin s12.w1) (j : Fin s12.w2) : Fin base.q × Fin base.p :=
  (omegaMonoidHomEquiv base).symm
    (omegaMonoidHom base
        (alignedOmegaColumnEquiv hG base s12 hW hW1 hW2 hodd j)
        ⟨0, base.p_prime.pos⟩ *
      omegaMonoidHom base ⟨0, base.q_prime.pos⟩
        (alignedOmegaRowEquiv hG base s12 hW hW1 hW2 hodd i))

/-- The coordinate-respecting eta grid obtained from the factorwise product
pointer. -/
noncomputable def alignedOmegaEtaGrid [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (base : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (s12 : OddOrder.Peterfalvi.S12.Hypothesis base.T)
    (hW : s12.typeP.W = base.W)
    (hW1 : s12.typeP.W2 = base.W1)
    (hW2 : s12.typeP.W1 = base.W2)
    (hodd : Odd (Nat.card G))
    (i : Fin s12.w1) (j : Fin s12.w2) : ClassFunction G ℂ :=
  base.eta
    (alignedOmegaProductIndex hG base s12 hW hW1 hW2 hodd i j).1
    (alignedOmegaProductIndex hG base s12 hW hW1 hW2 hodd i j).2

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_NonExistenceG/TGapGridAlignment.lean

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