Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (12.16): the witness value/norm package and the final contradiction

Definition
OddOrder_Peterfalvi_S14_MaximalI_NormPackage

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Formalizes the capstone of §12: the character/norm contract CounterexampleDadeData, its construction from the witness Dade calculation, and the final contradiction of Peterfalvi (12.16).

Main declarations: witness_dade_psi_rho_norm_ge (Peterfalvi (7.8.b), the witness hB for a given Dade calculation); witness_dade_psi_rhoM_rho_normSq_lt_one (Peterfalvi (7.3) + (8.17), the witness hC); CounterexampleDadeData (Peterfalvi (12.13)–(12.16), the character/norm contract); witness_value_norm_package (Peterfalvi (12.14)/(12.15) + (7.3)/(7.8.b)/(8.17), the witness value/norm package).

The bundle also proves 3 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/S14_MaximalI/NormPackage.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_S14_MaximalI_RhoMEvaluation

namespace OddOrder.Peterfalvi.S14

open OddOrder.GroupTheory

open OddOrder.RepresentationTheory

open OddOrder.Isaacs

open scoped Pointwise

variable {G : Type*} [Group G]

open scoped OddOrder.Peterfalvi.S12.FiniteInduce in
open OddOrder.Peterfalvi.S09 in
open OddOrder.Peterfalvi.S09.Cert in
/-- **Peterfalvi (7.8.b), the witness `hB` for a *given* Dade calculation** — the parametric form
of `witness_L_zeta_bound`, producing the (7.8.b) norm lower bound for the specific witness Dade
character `ψ = dade.psi` of a *given* `(hyp, coh, dade)` triple (rather than existentially
producing its own): `1 − e/|H| ≤ ‖ψ^ρ‖²`, where `ρ` is the (7.1) `A(L)`-based `chiRhoCF` of
`hyp` and `e = dade.e = [L:H]`.

Rebuilds the witness `Hypothesis78` with the placed family **anchored at `dade.chi`**
(`exists_placed_induced_family` applied to `χ_dist := dade.chi ∈ S`, which is `Ind θ_lin` for a
nontrivial `θ_lin` by the family shape), so the distinguished member is
`ζ_0 = Ind (θ 0) = dade.chi` and the (7.8.b) bound `1 − e/h ≤ ‖ζ_0^{νρ}‖²`
(`zetaNuRhoNormSqGeOfDade`) lands, via `ν = coh.extension` and `ψ = coh.extension dade.chi`,
exactly on `‖chiRhoCF dade.psi‖²` — the `normRho` that the (12.16) `hC` shares. -/
theorem witness_dade_psi_rho_norm_ge [Finite G] (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (hnoV : ¬ ∃ M : Subgroup G, M ∈ maximalSubgroups G ∧ OddOrder.GroupTheory.IsTypeV M)
    {ctr : CounterexampleHypothesis (G := G)} (data : RankTwoWitnessData ctr)
    (hyp : Hypothesis data.L)
    (coh : OddOrder.Peterfalvi.S07.IsCoherent hyp.tau hyp.Sset hyp.A)
    (dade : DadeNotation hyp)
    (hψeq : dade.psi = coh.extension dade.chi)
    (he_eq : dade.e = ((hyp.typeI.typeF.H).subgroupOf data.L).index) :
    (1 : ℝ) - (dade.e : ℝ) / (Nat.card ↥(hyp.typeI.typeF.H) : ℝ)
      ≤ (ClassFunction.inner (hyp.toHypothesis71.chiRhoCF dade.psi)
          (hyp.toHypothesis71.chiRhoCF dade.psi)).re := by
  classical
  -- The Frobenius witness for `L`, transported to `hyp`'s kernel accessor.
  obtain ⟨frob, -⟩ := witness_L_frobenius hG hnoV data
  have hHfrob : hyp.typeI.typeF.H = frob.typeI.typeF.H := by
    rw [hyp.typeI.typeF.H_eq, frob.typeI.typeF.H_eq]
  have hC : OddOrder.Isaacs.Ch06.IsFrobeniusGroup ↥data.L
      ((hyp.typeI.typeF.H).subgroupOf data.L) frob.complement := by
    rw [hHfrob]; exact frob.frobenius
  have hHL : hyp.typeI.typeF.H ≤ data.L := hyp.typeI.typeF.H_le
  have hKnormal : ((hyp.typeI.typeF.H).subgroupOf data.L).Normal := by
    rw [hyp.typeI.typeF.H_eq]
    exact OddOrder.BG.Ch4.S15.maxNilpotentNormalHall_subgroupOf_normal data.L
  have hAH : typeIA data.L hyp.typeI = (hyp.typeI.typeF.H : Set G) \ {1} :=
    witness_typeIA_eq_sharp hG hnoV data hyp
  have hHnorm : ∀ (l : ↥data.L) {h : G}, h ∈ hyp.typeI.typeF.H →
      (l : G) * h * (l : G)⁻¹ ∈ hyp.typeI.typeF.H := by
    intro l h hh
    have hhL : h ∈ data.L := hHL hh
    have hmem : (⟨h, hhL⟩ : ↥data.L) ∈ (hyp.typeI.typeF.H).subgroupOf data.L :=
      (Subgroup.mem_subgroupOf).mpr hh
    have hconj := hKnormal.conj_mem ⟨h, hhL⟩ hmem l
    rw [Subgroup.mem_subgroupOf] at hconj
    simpa using hconj
  -- The placed family anchored at the distinguished `dade.chi`.
  obtain ⟨θlin, hθlin_ne, hχ_eq⟩ := dade.chi_mem
  obtain ⟨n, θ, ind1H, hind1H, h0, htriv, hinj, hcover⟩ :=
    OddOrder.Peterfalvi.S09.Cert.exists_placed_induced_family
      ((hyp.typeI.typeF.H).subgroupOf data.L) dade.chi ⟨θlin, hχ_eq.symm⟩
      (hχ_eq ▸ OddOrder.Peterfalvi.S09.Cert.induce_ne_trivialChar_induce
        ((hyp.typeI.typeF.H).subgroupOf data.L) θlin hθlin_ne)
  -- `Ind (θ 0)(1) = [L:H]`, from `dade.chi(1) = e = [L:H]`.
  have hdeg0 : ClassFunction.induce ((hyp.typeI.typeF.H).subgroupOf data.L)
      (θ 0 : ClassFunction _ ℂ) (1 : ↥data.L)
      = (((hyp.typeI.typeF.H).subgroupOf data.L).index : ℂ) := by
    rw [h0]
    rw [show dade.chi (1 : ↥data.L) = ((dade.e : ℕ) : ℂ) from dade.chi_degree_eq_e, he_eq]
  have hSmem : ∀ i, i ≠ ind1H →
      ClassFunction.induce ((hyp.typeI.typeF.H).subgroupOf data.L) (θ i : ClassFunction _ ℂ)
        ∈ hyp.Sset := by
    intro i hi
    refine ⟨θ i, fun htriv_i => hi (hinj ?_), rfl⟩
    change ClassFunction.induce ((hyp.typeI.typeF.H).subgroupOf data.L) (θ i : ClassFunction _ ℂ)
        = ClassFunction.induce ((hyp.typeI.typeF.H).subgroupOf data.L) (θ ind1H : ClassFunction _ ℂ)
    rw [htriv_i, htriv]
  have hθ0_ne : θ 0 ≠ trivialIrreducibleCharacter ↥((hyp.typeI.typeF.H).subgroupOf data.L) := by
    intro h
    refine hind1H (hinj ?_).symm
    change ClassFunction.induce ((hyp.typeI.typeF.H).subgroupOf data.L) (θ 0 : ClassFunction _ ℂ)
        = ClassFunction.induce ((hyp.typeI.typeF.H).subgroupOf data.L) (θ ind1H : ClassFunction _ ℂ)
    rw [h, htriv]
  let d : Fin (n + 1) → ℂ :=
    fun i => (θ i : ClassFunction ↥((hyp.typeI.typeF.H).subgroupOf data.L) ℂ)
      (1 : ↥((hyp.typeI.typeF.H).subgroupOf data.L))
  have hd : ∀ i, d i = (θ i : ClassFunction ↥((hyp.typeI.typeF.H).subgroupOf data.L) ℂ)
      (1 : ↥((hyp.typeI.typeF.H).subgroupOf data.L)) := fun _ => rfl
  have hdeg : ∀ i, ClassFunction.induce ((hyp.typeI.typeF.H).subgroupOf data.L)
        (θ i : ClassFunction _ ℂ) (1 : ↥data.L)
      = d i * ClassFunction.induce ((hyp.typeI.typeF.H).subgroupOf data.L)
        (θ 0 : ClassFunction _ ℂ) (1 : ↥data.L) := by
    intro i
    rw [ClassFunction.induce_apply_one ((hyp.typeI.typeF.H).subgroupOf data.L)
        (θ i : ClassFunction _ ℂ), hdeg0, hd i]
    ring
  have hdeg_match : ClassFunction.induce ((hyp.typeI.typeF.H).subgroupOf data.L)
        (θ 0 : ClassFunction _ ℂ) (1 : ↥data.L)
      = ClassFunction.induce ((hyp.typeI.typeF.H).subgroupOf data.L)
        (θ ind1H : ClassFunction _ ℂ) (1 : ↥data.L) := by
    rw [hdeg0, htriv]
    change (((hyp.typeI.typeF.H).subgroupOf data.L).index : ℂ)
        = ClassFunction.induce ((hyp.typeI.typeF.H).subgroupOf data.L)
          (trivialClassFunction ↥((hyp.typeI.typeF.H).subgroupOf data.L)) (1 : ↥data.L)
    rw [induce_trivialChar_apply_eq_index _ (Subgroup.one_mem _)]
  have psi_support : ∀ i, (ClassFunction.induce ((hyp.typeI.typeF.H).subgroupOf data.L)
        (θ i : ClassFunction _ ℂ)
      - d i • ClassFunction.induce ((hyp.typeI.typeF.H).subgroupOf data.L)
          (θ 0 : ClassFunction _ ℂ)).support
      ⊆ OddOrder.Peterfalvi.S04.supportInSubgroup (typeIA data.L hyp.typeI) data.L := by
    intro i
    refine (induce_diff_support (θ i) (θ 0) (d i) (hdeg i)).trans ?_
    intro x hx
    rw [Set.mem_sdiff, SetLike.mem_coe, Set.mem_singleton_iff] at hx
    exact (mem_supportInSubgroup_sharp_subgroupOf_iff hyp.typeI.typeF.H hAH x).mpr ⟨hx.1, hx.2⟩
  have hnu_isometry : ∀ i j : Fin (n + 1), i ≠ ind1H → j ≠ ind1H →
      ClassFunction.inner (coh.extension
          (ClassFunction.induce ((hyp.typeI.typeF.H).subgroupOf data.L) (θ i : ClassFunction _ ℂ)))
          (coh.extension
          (ClassFunction.induce ((hyp.typeI.typeF.H).subgroupOf data.L) (θ j : ClassFunction _ ℂ)))
        = ClassFunction.inner
          (ClassFunction.induce ((hyp.typeI.typeF.H).subgroupOf data.L) (θ i : ClassFunction _ ℂ))
          (ClassFunction.induce ((hyp.typeI.typeF.H).subgroupOf data.L) (θ j : ClassFunction _
              ℂ)) :=
    fun i j hi hj => coherence_extension_inner_eq_on_family coh (hSmem i hi) (hSmem j hj)
  have hagree : ∀ i : Fin (n + 1), i ≠ 0 → i ≠ ind1H →
      hyp.toHypothesis71.τ ⟨ClassFunction.induce ((hyp.typeI.typeF.H).subgroupOf data.L)
          (θ i : ClassFunction _ ℂ)
          - d i • ClassFunction.induce ((hyp.typeI.typeF.H).subgroupOf data.L)
            (θ 0 : ClassFunction _ ℂ), psi_support i⟩
        = coh.extension (ClassFunction.induce ((hyp.typeI.typeF.H).subgroupOf data.L)
            (θ i : ClassFunction _ ℂ))
          - d i • coh.extension (ClassFunction.induce ((hyp.typeI.typeF.H).subgroupOf data.L)
            (θ 0 : ClassFunction _ ℂ)) := by
    intro i _ hi_ind
    obtain ⟨deg_i, -, hdeg_i_eq⟩ := irreducibleCharacter_apply_one_eq_pos_natCast (θ i)
    exact coherence_hagree_dadeMap hyp.dadeData.dade coh
      (hSmem i hi_ind) (hSmem 0 (Ne.symm hind1H)) (m0 := 1) (mi := deg_i) (by norm_num)
      (by rw [hd i, hdeg_i_eq, Nat.cast_one, div_one]) (psi_support i)
  -- The concrete witness `Hypothesis78`, anchored at `ζ_0 = dade.chi`.
  set H78 := hypothesis78OfDade hyp.toHypothesis71
    (hyp.dadeData.dade.fullDadeIsometryData).toDadeIsometryData.isDadeIsometry
    hyp.typeI.typeF.H hHL hHnorm hAH θ hinj hcover d psi_support hdeg ind1H hind1H htriv hdeg_match
    coh.extension hnu_isometry hagree with hH78def
  -- (7.8) input `a`: `(β, ζ_0^ν) + 1 ∈ ℤ`.
  obtain ⟨a, ha⟩ := exists_betaDecomp_a H78
    (Submodule.sub_mem _
      (ClassFunction.induce_mem_ZIrr _ (θ ind1H).property.mem_ZIrr)
      (ClassFunction.induce_mem_ZIrr _ (θ 0).property.mem_ZIrr))
    (coh.extension_mem_ZIrr _ (Submodule.subset_span (hSmem 0 (Ne.symm hind1H))))
  -- (7.8.b) `smallIndex`: `2e + 1 ≤ h`, from the Frobenius size bound.
  have hodd : Odd (Nat.card ↥data.L) :=
    hG.odd.of_dvd_nat (Subgroup.card_subgroup_dvd_card data.L)
  have hKodd : Odd (Nat.card ↥((hyp.typeI.typeF.H).subgroupOf data.L)) :=
    hodd.of_dvd_nat (Subgroup.card_subgroup_dvd_card _)
  have hCodd : Odd (Nat.card ↥frob.complement) :=
    hodd.of_dvd_nat (Subgroup.card_subgroup_dvd_card frob.complement)
  have hKcard : Nat.card ↥((hyp.typeI.typeF.H).subgroupOf data.L) = Nat.card hyp.typeI.typeF.H :=
    Nat.card_congr (Subgroup.subgroupOfEquivOfLe hHL).toEquiv
  have hKnt : ((hyp.typeI.typeF.H).subgroupOf data.L) ≠ ⊥ := by
    have : Nontrivial ↥hyp.typeI.typeF.H :=
      (Subgroup.nontrivial_iff_ne_bot _).mpr hyp.typeI.typeF.H_nontrivial
    have : Nontrivial ↥((hyp.typeI.typeF.H).subgroupOf data.L) :=
      (Subgroup.subgroupOfEquivOfLe hHL).toEquiv.nontrivial
    exact (Subgroup.nontrivial_iff_ne_bot _).mp inferInstance
  have hcompl : Nat.card ↥((hyp.typeI.typeF.H).subgroupOf data.L) * Nat.card ↥frob.complement
      = Nat.card ↥data.L := hC.isComplement.card_mul_card
  have hsmall : H78.smallIndex := by
    have hfrob := frobenius_two_mul_card_complement_add_one_le_card_kernel hC hKodd hCodd hKnt
    change 2 * H78.complementIndex + 1 ≤ H78.kernelOrder
    have hke : H78.kernelOrder = Nat.card ↥((hyp.typeI.typeF.H).subgroupOf data.L) := by
      rw [hKcard]; rfl
    have hce : H78.complementIndex = Nat.card ↥frob.complement := by
      change Nat.card ↥data.L / Nat.card hyp.typeI.typeF.H = Nat.card ↥frob.complement
      rw [← hKcard, ← hcompl, Nat.mul_div_cancel_left _ Nat.card_pos]
    rw [hke, hce]; exact hfrob
  -- The (7.8.b) bound for `H78`.
  have hbound : 1 - (H78.complementIndex : ℝ) / (H78.kernelOrder : ℝ) ≤ H78.zetaNuRhoNormSq :=
    zetaNuRhoNormSqGeOfDade hyp.toHypothesis71
      (hyp.dadeData.dade.fullDadeIsometryData).toDadeIsometryData.isDadeIsometry
      hyp.typeI.typeF.H hHL hHnorm hAH θ hinj hcover d psi_support hdeg ind1H hind1H htriv
      hdeg_match coh.extension hnu_isometry hagree
      (witness_L_hzeta0nu hG hyp hC coh hAH (θ 0) hθ0_ne)
      (inner_self_induce_eq_one_of_frobeniusGroup hC (θ 0) hθ0_ne) a ha hsmall
  -- Identify the three `H78` projections with the `dade.psi` shape.
  have hke : H78.kernelOrder = Nat.card ↥(hyp.typeI.typeF.H) := rfl
  have hce : H78.complementIndex
      = Nat.card ↥data.L / Nat.card ↥(hyp.typeI.typeF.H) := rfl
  have hznorm : H78.zetaNuRhoNormSq
      = (ClassFunction.inner (hyp.toHypothesis71.chiRhoCF dade.psi)
          (hyp.toHypothesis71.chiRhoCF dade.psi)).re := by
    change (ClassFunction.inner
        (hyp.toHypothesis71.chiRhoCF (coh.extension (ClassFunction.induce
          ((hyp.typeI.typeF.H).subgroupOf data.L) (θ 0 : ClassFunction _ ℂ))))
        (hyp.toHypothesis71.chiRhoCF (coh.extension (ClassFunction.induce
          ((hyp.typeI.typeF.H).subgroupOf data.L) (θ 0 : ClassFunction _ ℂ))))).re = _
    rw [h0, ← hψeq]
  -- `dade.e = [L:H] = |L|/|H|` matches the `complementIndex`.
  have hidx_card : ((hyp.typeI.typeF.H).subgroupOf data.L).index
      = Nat.card ↥data.L / Nat.card ↥(hyp.typeI.typeF.H) := by
    have h1 : Nat.card ↥((hyp.typeI.typeF.H).subgroupOf data.L)
        * ((hyp.typeI.typeF.H).subgroupOf data.L).index = Nat.card ↥data.L :=
      Subgroup.card_mul_index _
    rw [hKcard] at h1
    exact (Nat.div_eq_of_eq_mul_right Nat.card_pos h1.symm).symm
  rw [hke, hce, hznorm] at hbound
  have he2 : (dade.e : ℝ)
      = ((Nat.card ↥data.L / Nat.card ↥(hyp.typeI.typeF.H) : ℕ) : ℝ) := by
    rw [he_eq, hidx_card]
  rw [← he2] at hbound
  exact hbound

open scoped OddOrder.Peterfalvi.S12.FiniteInduce in
open OddOrder.Peterfalvi.S09 in
open OddOrder.Peterfalvi.S09.Cert in
/-- **Peterfalvi (7.3) + (8.17), the witness `hC`**: for the witness Dade character
`ψ = dade.psi`, the two `ρ`-norms sum to less than `1`:
`‖ψ^{ρ_M}‖² + ‖ψ^ρ‖² < 1`, where `ρ_M` is the `A₁(M) = K^#`-based collapse
(`hypothesis71SharpKernel`) and `ρ` the `A(L)`-based one.

Proof shape (Peterfalvi p. 68): apply the (7.3) integral inequality on both sides; the two
upper bounds integrate `‖ψ‖²` over the thickened supports `Ã₁(M)` and `Ã(L)`, which are
**disjoint** by the (8.18.c) mixed disjointness (`nonconjugate_thickened_mixed_disjoint_or_swap`
— either branch suffices: the witness `L` has `A(L) = A₁(L)` (Frobenius), and `Ã₁ ⊆ Ã` is
monotone).  Neither support contains `1`, so the joint integral is at most
`‖ψ‖² − |G|⁻¹·‖ψ(1)‖² = 1 − |G|⁻¹·‖ψ(1)‖²`, and `ψ(1) ≠ 0` (`ψ ∈ ℤ[Irr G]` of norm `1` is
`±` an irreducible, `one_le_normSq_apply_one_of_mem_ZIrr_of_inner_self_one`) makes it
strictly less than `1`. -/
theorem witness_dade_psi_rhoM_rho_normSq_lt_one [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (hnoV : ¬ ∃ M : Subgroup G, M ∈ maximalSubgroups G ∧ OddOrder.GroupTheory.IsTypeV M)
    {ctr : CounterexampleHypothesis (G := G)} (data : RankTwoWitnessData ctr)
    (hyp : Hypothesis data.L)
    (coh : OddOrder.Peterfalvi.S07.IsCoherent hyp.tau hyp.Sset hyp.A)
    (dade : DadeNotation hyp)
    (hψeq : dade.psi = coh.extension dade.chi)
    (hψZ : dade.psi ∈ ZIrr G)
    (hypM : Hypothesis ctr.M) :
    (ClassFunction.inner ((hypothesis71SharpKernel hypM).chiRhoCF dade.psi)
        ((hypothesis71SharpKernel hypM).chiRhoCF dade.psi)).re
      + (ClassFunction.inner (hyp.toHypothesis71.chiRhoCF dade.psi)
          (hyp.toHypothesis71.chiRhoCF dade.psi)).re < 1 := by
  classical
  -- `‖ψ‖² = 1`: the coherent extension is isometric on `S ∋ dade.chi`, and members of `S`
  -- are norm-`1` induced characters of the Frobenius kernel.
  obtain ⟨frob, -⟩ := witness_L_frobenius hG hnoV data
  have hHfrob : hyp.typeI.typeF.H = frob.typeI.typeF.H := by
    rw [hyp.typeI.typeF.H_eq, frob.typeI.typeF.H_eq]
  have hC : OddOrder.Isaacs.Ch06.IsFrobeniusGroup ↥data.L
      ((hyp.typeI.typeF.H).subgroupOf data.L) frob.complement := by
    rw [hHfrob]; exact frob.frobenius
  have hKnormal : ((hyp.typeI.typeF.H).subgroupOf data.L).Normal := by
    rw [hyp.typeI.typeF.H_eq]
    exact OddOrder.BG.Ch4.S15.maxNilpotentNormalHall_subgroupOf_normal data.L
  obtain ⟨θlin, hθlin_ne, hχ_eq⟩ := dade.chi_mem
  have hnorm1 : ClassFunction.inner dade.psi dade.psi = 1 := by
    rw [hψeq, coherence_extension_inner_eq_on_family coh dade.chi_mem dade.chi_mem, hχ_eq]
    exact inner_self_induce_eq_one_of_frobeniusGroup hC θlin hθlin_ne
  -- The two (7.3) integral inequalities.
  have h73L := Hypothesis71.chiRho_integral_inequality hyp.toHypothesis71
    (hyp.dadeData.dade.fullDadeIsometryData).toDadeIsometryData.isDadeIsometry
    dade.psi
  have h73M := Hypothesis71.chiRho_integral_inequality (hypothesis71SharpKernel hypM)
    ((hypM.dadeData.dade.fullDadeIsometryData).restrict
      (sharpSubgroup_H_subset_typeIA hypM.typeI)
      (sharpSubgroup_H_conj_mem hypM)).toDadeIsometryData.isDadeIsometry
    dade.psi
  -- The two Dade supports are disjoint ((8.18.c), either branch).
  have hsuppL_eq : hyp.toHypothesis71.hyp.dadeSupport
      = OddOrder.Peterfalvi.S10.ftThickenedSupport data.L (typeIA data.L hyp.typeI) :=
    hyp.dadeData.dadeSupport_eq_ftThickenedSupport
  have hsuppM_sub := hypothesis71SharpKernel_dadeSupport_subset hypM
  have hdisjSet : Disjoint hyp.toHypothesis71.hyp.dadeSupport
      ((hypothesis71SharpKernel hypM).hyp.dadeSupport) := by
    rcases nonconjugate_thickened_mixed_disjoint_or_swap hG hyp hypM
      (witness_L_not_conj_M hG hnoV data) with hd | hd
    · -- `Ã(L) ∩ Ã₁(M) = ∅`
      exact Disjoint.mono hsuppL_eq.le hsuppM_sub hd
    · -- `Ã(M) ∩ Ã₁(L) = ∅`; `Ã₁(M) ⊆ Ã(M)` and the witness `Ã(L) = Ã₁(L)`
      have hMsub : (hypothesis71SharpKernel hypM).hyp.dadeSupport ⊆
          OddOrder.Peterfalvi.S10.ftThickenedSupport ctr.M (typeIA ctr.M hypM.typeI) := by
        refine hsuppM_sub.trans (ftThickenedSupport_mono ?_)
        rw [A1_eq_sharpSubgroup_H hypM]
        exact sharpSubgroup_H_subset_typeIA hypM.typeI
      have hLsub : hyp.toHypothesis71.hyp.dadeSupport ⊆
          OddOrder.Peterfalvi.S10.ftThickenedSupport data.L
            (A1 data.L PeterfalviType.I) := by
      -- `typeIA L = H^# = A₁(L)` for the Frobenius witness
        rw [hsuppL_eq,
          show typeIA data.L hyp.typeI = A1 data.L PeterfalviType.I from
            (witness_typeIA_eq_sharp hG hnoV data hyp).trans (A1_eq_sharpSubgroup_H hyp).symm]
      exact Disjoint.mono hLsub hMsub hd.symm
  -- Finset forms of the two supports.
  set SL : Finset G :=
    Finset.univ.filter (fun x : G => x ∈ hyp.toHypothesis71.hyp.dadeSupport) with hSL
  set SM : Finset G :=
    Finset.univ.filter
      (fun x : G => x ∈ (hypothesis71SharpKernel hypM).hyp.dadeSupport) with hSM
  have hdisjFin : Disjoint SL SM := by
    rw [Finset.disjoint_left]
    intro x hxL hxM
    rw [hSL, Finset.mem_filter] at hxL
    rw [hSM, Finset.mem_filter] at hxM
    exact Set.disjoint_left.mp hdisjSet hxL.2 hxM.2
  -- ℝ-forms of the (7.3) right-hand sides.
  have hre : ∀ s : Finset G,
      (((Nat.card G : ℂ)⁻¹ * ((∑ x ∈ s, ‖(dade.psi : G → ℂ) x‖ ^ 2 : ℝ) : ℂ))).re
        = (Nat.card G : ℝ)⁻¹ * ∑ x ∈ s, ‖(dade.psi : G → ℂ) x‖ ^ 2 := by
    intro s
    rw [show ((Nat.card G : ℂ))⁻¹ = (((Nat.card G : ℝ)⁻¹ : ℝ) : ℂ) by push_cast; ring,
      ← Complex.ofReal_mul, Complex.ofReal_re]
  -- Combine: the joint integral over `SL ∪ SM` is `< 1`.
  have hone_L : (1 : G) ∉ hyp.toHypothesis71.hyp.dadeSupport :=
    OddOrder.Peterfalvi.S04.Hypothesis.one_notMem_dadeSupport _
  have hone_M : (1 : G) ∉ (hypothesis71SharpKernel hypM).hyp.dadeSupport :=
    OddOrder.Peterfalvi.S04.Hypothesis.one_notMem_dadeSupport _
  have hsub_erase : SL ∪ SM ⊆ Finset.univ.erase 1 := by
    intro x hx
    refine Finset.mem_erase.mpr ⟨?_, Finset.mem_univ x⟩
    rintro rfl
    rcases Finset.mem_union.mp hx with h | h
    · exact hone_L (Finset.mem_filter.mp h).2
    · exact hone_M (Finset.mem_filter.mp h).2
  have hsum_union_le : ∑ x ∈ SL ∪ SM, ‖(dade.psi : G → ℂ) x‖ ^ 2
      ≤ ∑ x ∈ Finset.univ.erase 1, ‖(dade.psi : G → ℂ) x‖ ^ 2 :=
    Finset.sum_le_sum_of_subset_of_nonneg hsub_erase (fun x _ _ => by positivity)
  -- Total Parseval mass: `∑_G ‖ψ‖² = |G|` (from `‖ψ‖² = 1`).
  have htotal : ∑ x : G, ‖(dade.psi : G → ℂ) x‖ ^ 2 = (Nat.card G : ℝ) := by
    have h := inner_self_eq_realCast (G := G) dade.psi
    rw [hnorm1] at h
    have hr : (1 : ℝ) = (Nat.card G : ℝ)⁻¹ * ∑ x : G, Complex.normSq (dade.psi x) := by
      exact_mod_cast h
    have hns : (∑ x : G, Complex.normSq (dade.psi x))
        = ∑ x : G, ‖(dade.psi : G → ℂ) x‖ ^ 2 :=
      Finset.sum_congr rfl fun x _ => Complex.normSq_eq_norm_sq _
    have hGne : (Nat.card G : ℝ) ≠ 0 := by
      have : (0 : ℝ) < Nat.card G := by exact_mod_cast Nat.card_pos
      exact this.ne'
    rw [hns] at hr
    field_simp at hr
    linarith
  have herase : ∑ x ∈ Finset.univ.erase 1, ‖(dade.psi : G → ℂ) x‖ ^ 2
      = (Nat.card G : ℝ) - ‖(dade.psi : G → ℂ) 1‖ ^ 2 := by
    have h := Finset.add_sum_erase Finset.univ
      (fun x : G => ‖(dade.psi : G → ℂ) x‖ ^ 2) (Finset.mem_univ 1)
    rw [htotal] at h
    linarith
  -- Strictness: `‖ψ(1)‖² ≥ 1`.
  have hpsi1 : 1 ≤ ‖(dade.psi : G → ℂ) 1‖ ^ 2 :=
    one_le_normSq_apply_one_of_mem_ZIrr_of_inner_self_one hψZ hnorm1
  have hGpos : (0 : ℝ) < (Nat.card G : ℝ) := by exact_mod_cast Nat.card_pos
  -- Assemble.
  rw [hre SL] at h73L
  rw [hre SM] at h73M
  have hsum_split : ∑ x ∈ SL, ‖(dade.psi : G → ℂ) x‖ ^ 2
        + ∑ x ∈ SM, ‖(dade.psi : G → ℂ) x‖ ^ 2
      = ∑ x ∈ SL ∪ SM, ‖(dade.psi : G → ℂ) x‖ ^ 2 :=
    (Finset.sum_union hdisjFin).symm
  have hbound : (Nat.card G : ℝ)⁻¹ * (∑ x ∈ SL, ‖(dade.psi : G → ℂ) x‖ ^ 2)
      + (Nat.card G : ℝ)⁻¹ * (∑ x ∈ SM, ‖(dade.psi : G → ℂ) x‖ ^ 2) < 1 := by
    have hinv_pos : (0 : ℝ) < (Nat.card G : ℝ)⁻¹ := by positivity
    have hchain : ∑ x ∈ SL, ‖(dade.psi : G → ℂ) x‖ ^ 2
          + ∑ x ∈ SM, ‖(dade.psi : G → ℂ) x‖ ^ 2
        ≤ (Nat.card G : ℝ) - ‖(dade.psi : G → ℂ) 1‖ ^ 2 := by
      rw [hsum_split, ← herase]
      exact hsum_union_le
    have h1 : (Nat.card G : ℝ) - ‖(dade.psi : G → ℂ) 1‖ ^ 2 ≤ (Nat.card G : ℝ) - 1 := by
      linarith
    calc (Nat.card G : ℝ)⁻¹ * (∑ x ∈ SL, ‖(dade.psi : G → ℂ) x‖ ^ 2)
          + (Nat.card G : ℝ)⁻¹ * (∑ x ∈ SM, ‖(dade.psi : G → ℂ) x‖ ^ 2)
        = (Nat.card G : ℝ)⁻¹ * (∑ x ∈ SL, ‖(dade.psi : G → ℂ) x‖ ^ 2
            + ∑ x ∈ SM, ‖(dade.psi : G → ℂ) x‖ ^ 2) := by ring
      _ ≤ (Nat.card G : ℝ)⁻¹ * ((Nat.card G : ℝ) - 1) := by
          have := hchain.trans h1
          exact mul_le_mul_of_nonneg_left this hinv_pos.le
      _ < 1 := by
          rw [mul_sub, inv_mul_cancel₀ hGpos.ne']
          have : (0 : ℝ) < (Nat.card G : ℝ)⁻¹ * 1 := by positivity
          linarith
  linarith [h73M, h73L, hbound]

/-- **Peterfalvi (12.13)–(12.16), the character/norm contract** packaging every fact that the
numerical endgame `counterexample_contradiction_of_facts` consumes.  Bundling them here isolates the
deep §7/§12 content — the Dade calculation `ψ = χ^{τ₁}` of (12.13), the coset/value facts
(12.14)/(12.15), and the `ρ`/`ρM` integral inequalities (7.3)/(7.8.b) — into a single
faithfully-typed obligation, leaving the (12.16) capstone `counterexample_contradiction` a
`sorry`-free assembly.

Field map to the textbook (`H = L_F`, the Fitting kernel of the witness subgroup `L`):
* `ε`/`hε` — a primitive `p`-th root of unity (the cyclotomic base of (1.10));
* `ψ`/`hψ` — the virtual character `ψ = χ^{τ₁}` of (12.13) (`ZIrr` membership = it is a
  ℤ-combination of irreducibles, from the Dade isometry image);
* `e` — the common degree `χ(1) = e` of the coherent family `S` ((12.6)); `he`/`h2e` = (12.12);
* `h_const` = (12.14) (`ψ` constant on the coset `xK`); `h_psix` = (1.10.a) applied to `χ`;
  `h_psig_int` = (12.15) (`ψ(g) ∈ ℤ`);
* `kK`/`kKp`/`kM`/`kH` = `|K|`/`|K'|`/`|M|`/`|H|`; `hidx` = (8.1.c), `hM` = (12.11);
* `hA` = (12.15) norm relation for `ρM`, `hB` = (7.8.b) for `ρ`, `hC` = (7.3)+(8.17). -/
structure CounterexampleDadeData {ctr : CounterexampleHypothesis (G := G)}
    (witness : RankTwoWitnessData ctr) (g : G) where
  ε : ℂ
  hε : IsPrimitiveRoot ε ctr.p
  ψ : ClassFunction G ℂ
  hψ : ψ ∈ ZIrr G
  e : ℤ
  mval : ℤ
  he : 3 ≤ e
  h2e : 2 * e ≤ (ctr.p : ℤ) + 1
  h_const : ψ (witness.x * g) = ψ witness.x
  h_psix : ∃ w : ℂ, IsIntegral ℤ w ∧ ψ witness.x - (e : ℂ) = (1 - ε) * w
  h_psig_int : ψ g = (mval : ℂ)
  kK : ℝ
  kKp : ℝ
  kM : ℝ
  kH : ℝ
  normRhoM : ℝ
  normRho : ℝ
  hkKp : 0 < kKp
  hkM : 0 < kM
  hkH : 0 < kH
  hidx : 4 * kKp ≤ kK
  hM : kM ≤ kK * kH
  hA : (kK - kKp) / kM * (mval : ℝ) ^ 2 ≤ normRhoM
  hB : (1 : ℝ) - (e : ℝ) / kH ≤ normRho
  hC : normRhoM + normRho < 1

open scoped OddOrder.Peterfalvi.S12.FiniteInduce in
/-- **Peterfalvi (12.14)/(12.15) + (7.3)/(7.8.b)/(8.17), the witness value/norm package** — the
deep §7/§12 content the (12.16) contradiction consumes beyond the arithmetic, bundled as one
faithfully-typed obligation for the specific witness Dade character `ψ = dade.psi`.

Concretely, for the (12.9) witness `L` with its (12.13) Dade calculation `ψ = χ^{τ₁}` of degree
`e = dade.e = [L:H]`, and the commuting `g ∈ C_K(x) ∖ K'`, it supplies:
* `mval`, `h_psig_int` — (12.15): `ψ(g) ∈ ℤ` (`ψ` constant on `K − K′`, integer-valued there);
* `h_const` — (12.14): `ψ(x·g) = ψ(x)` (`ψ` constant on the coset `xK`);
* `hidx` — the fixed-point-free `[K:K'] ≥ 4` of (8.1.c), as `4·|K'| ≤ |K|`;
* `h2e` — the degree bound `2e ≤ p+1` of (12.12);
* `normRhoM`, `normRho`, `hA`, `hB`, `hC` — the `ρ`/`ρM` norm estimates: `hA` = (12.15) norm
  relation `‖ψ^{ρM}‖² ≥ (|K−K'|/|M|)·ψ(g)²`, `hB` = (7.8.b) `‖ψ^ρ‖² ≥ 1 − e/|H|`, `hC` =
  (7.3)+(8.17) `‖ψ^{ρM}‖² + ‖ψ^ρ‖² < 1`.

⚠ **The former "genuinely still-missing" note is stale (issue 0172 §12 監査, 2026-08-07)**: every
conjunct is now discharged in the proof below by a named lemma —
`counterexample_psi_int_on_K_sub_Kprime`
((12.15) integrality), `psi_constant_on_xK` ((12.14)), `witness_two_mul_index_le_p_add_one`
((12.12)), `four_mul_card_Kprime_le` ((8.1.c)), `counterexample_chiRhoA1_normSq_ge` ((12.15) `ρM`
norm relation), `witness_dade_psi_rho_norm_ge` ((7.8.b)) and
`witness_dade_psi_rhoM_rho_normSq_lt_one` ((7.3)+(8.17)).  The theorem is `#print axioms`-clean.
Each conjunct is the genuine (12.14)/(12.15)/(12.12)/(8.1.c)/(7.x) fact for the *specific* witness
character `ψ = dade.psi` of the genuine witness `L` (tied to `ctr`/`witness`/`hyp`/`dade` via
`data` and `hψZ`), with `e = dade.e` and `|K|,|K'|,|M|,|H|` the genuine cardinalities — not a free
arithmetic implication. -/
theorem witness_value_norm_package [Finite G] (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (hnoV : ¬ ∃ M : Subgroup G, M ∈ maximalSubgroups G ∧ OddOrder.GroupTheory.IsTypeV M)
    {ctr : CounterexampleHypothesis (G := G)} {L : Subgroup G}
    (data : RankTwoWitnessData ctr) (hLeq : L = data.L)
    {g : G} (_hg_comm : Commute data.x g) (hgK : g ∈ ctr.K) (hgK' : g ∉ ctr.Kprime)
    (hyp : Hypothesis L) (coh : OddOrder.Peterfalvi.S07.IsCoherent hyp.tau hyp.Sset hyp.A)
    (dade : DadeNotation hyp)
    (hψeq : dade.psi = coh.extension dade.chi)
    (he_eq : dade.e = ((hyp.typeI.typeF.H).subgroupOf L).index) (hψZ : dade.psi ∈ ZIrr G) :
    ∃ (mval : ℤ) (normRhoM normRho : ℝ),
      dade.psi (data.x * g) = dade.psi data.x ∧
      dade.psi g = (mval : ℂ) ∧
      2 * (dade.e : ℤ) ≤ (ctr.p : ℤ) + 1 ∧
      4 * (Nat.card ↥ctr.Kprime : ℝ) ≤ (Nat.card ↥ctr.K : ℝ) ∧
      ((Nat.card ↥ctr.K : ℝ) - (Nat.card ↥ctr.Kprime : ℝ)) / (Nat.card ↥ctr.M : ℝ)
          * (mval : ℝ) ^ 2 ≤ normRhoM ∧
      (1 : ℝ) - (dade.e : ℝ) / (Nat.card ↥(hyp.typeI.typeF.H) : ℝ) ≤ normRho ∧
      normRhoM + normRho < 1 := by
  classical
  subst hLeq
  have : Fact ctr.p.Prime := ⟨ctr.p_prime⟩
  -- The type-I (12.1) Hypothesis for `M`.
  obtain ⟨hypM⟩ := exists_typeI_hypothesis hG ctr.M_maximal ctr.M_typeI
  -- The Frobenius witness for `L` (for the `S`-irreducibility of `dade.chi`).
  obtain ⟨frob, -⟩ := witness_L_frobenius hG hnoV data
  have hHfrob : hyp.typeI.typeF.H = frob.typeI.typeF.H := by
    rw [hyp.typeI.typeF.H_eq, frob.typeI.typeF.H_eq]
  have hC : OddOrder.Isaacs.Ch06.IsFrobeniusGroup ↥data.L
      ((hyp.typeI.typeF.H).subgroupOf data.L) frob.complement := by
    rw [hHfrob]; exact frob.frobenius
  -- Bundle `dade.chi` as an irreducible with its (12.2) decomposition data.
  have hchi0_irr : IsIrreducibleCharacter dade.chi :=
    Sset_isIrreducibleCharacter hyp hC dade.chi_mem
  obtain ⟨chi0, hchi0_coe⟩ : ∃ t : IrreducibleCharacter ↥data.L,
      (t : ClassFunction ↥data.L ℂ) = dade.chi := ⟨⟨_, hchi0_irr⟩, rfl⟩
  have hchi0_mem : (chi0 : ClassFunction ↥data.L ℂ) ∈ hyp.Sset := by
    rw [hchi0_coe]; exact dade.chi_mem
  have data0 : CharacterDecompositionData hyp (chi0 : ClassFunction ↥data.L ℂ) :=
    (character_decomposition_and_dade_domain hG hyp hchi0_mem).choose
  have hchi0_cons : chi0 ∈ data0.constituents := by
    obtain ⟨φ, hφcoe, hφmem⟩ := Sset_self_mem_constituents hyp hC hchi0_mem data0
    have hφeq : φ = chi0 := Subtype.ext hφcoe
    rwa [hφeq] at hφmem
  have hpsi0 : dade.psi = coh.extension (chi0 : ClassFunction ↥data.L ℂ) := by
    rw [hchi0_coe]; exact hψeq
  -- (12.15): `ψ(g) = mval ∈ ℤ` on `K − K′`.
  obtain ⟨mval, hmval⟩ := counterexample_psi_int_on_K_sub_Kprime hG hnoV data hyp coh data0
    hchi0_cons hchi0_mem hpsi0 hψZ hypM hgK hgK'
  refine ⟨mval,
    (ClassFunction.inner ((hypothesis71SharpKernel hypM).chiRhoCF dade.psi)
      ((hypothesis71SharpKernel hypM).chiRhoCF dade.psi)).re,
    (ClassFunction.inner (hyp.toHypothesis71.chiRhoCF dade.psi)
      (hyp.toHypothesis71.chiRhoCF dade.psi)).re,
    ?_, hmval, ?_, ?_, ?_, ?_, ?_⟩
  · -- (12.14): `ψ` constant on the coset `x·K`.
    exact psi_constant_on_xK hG hyp coh data dade data0 hchi0_cons hchi0_mem hpsi0
      (witness_L_not_conj_M hG hnoV data) g hgK
  · -- (12.12): `2e ≤ p + 1`.
    have h := witness_two_mul_index_le_p_add_one hG hnoV data hyp
    rw [he_eq]
    exact_mod_cast h
  · -- (8.1.c): `4·|K′| ≤ |K|`.
    exact_mod_cast four_mul_card_Kprime_le hG ctr
  · -- (12.15) norm relation `hA`.
    exact counterexample_chiRhoA1_normSq_ge hG hnoV data hyp coh data0 hchi0_cons hchi0_mem
      hpsi0 hypM hgK hgK' hmval
  · -- (7.8.b) `hB`.
    exact witness_dade_psi_rho_norm_ge hG hnoV data hyp coh dade hψeq he_eq
  · -- (7.3)+(8.17) `hC`.
    exact witness_dade_psi_rhoM_rho_normSq_lt_one hG hnoV data hyp coh dade hψeq hψZ hypM

open scoped OddOrder.Peterfalvi.S12.FiniteInduce in
/-- **Peterfalvi (12.13)–(12.15) + (7.3)/(7.8.b)**, the construction of the character/norm contract
of (12.16).  Given the rank-two witness of (12.9) and a commuting element `g ∈ C_K(x) ∖ K'`
(`exists_witness_g`), the §7/§12 machinery produces the Dade calculation `ψ = χ^{τ₁}` and its
associated `ρ`/`ρM` norm bounds.

**Assembly** (`sorry`-free modulo the two genuine deep pins): the (12.6) coherence
`witness_L_coherent` + the distinguished `χ ∈ S` (`exists_distinguished_char`, degree `e = [L:H]`)
realize the (12.13) `dade = dadeNotation_of_coherence …` with `ψ = coh.extension χ ∈ ZIrr G`; then
each `CounterexampleDadeData` field is discharged:
* `ε`/`hε` — a primitive `p`-th root of unity (`Complex.isPrimitiveRoot_exp`);
* `e := dade.e = [L:H]`, `he : 3 ≤ e` from `three_le_index` (`|U|` odd `> 1`);
* `kK`/`kKp`/`kM`/`kH` := `|K|`/`|K'|`/`|M|`/`|H|` with positivity from `Nat.card_pos`, and
  `hM : |M| ≤ |K|·|H|` from `card_M_le` (12.11);
* `h_psix` from the proven (12.14) evaluation `ψ(x) = χ(x)` (`witness_dade_psi_apply_x_eq_chi`)
  and the `L`-side (1.10.a) congruence `χ(x) ≡ χ(1) = e (mod 1 − ε)`;
* `mval`/`h_const`/`h_psig_int`/`h2e`/`hidx`/`hA`/`hB`/`hC` from the deep value/norm package
  `witness_value_norm_package` (the (12.14)/(12.15)/(12.12)/(8.1.c)/(7.x) content). -/
theorem exists_counterexample_dade_data [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (hnoV : ¬ ∃ M : Subgroup G, M ∈ maximalSubgroups G ∧ OddOrder.GroupTheory.IsTypeV M)
    (ctr : CounterexampleHypothesis (G := G))
    (witness : RankTwoWitnessData ctr) {g : G}
    (hg_comm : Commute witness.x g) (hgK : g ∈ ctr.K) (hgK' : g ∉ ctr.Kprime) :
    Nonempty (CounterexampleDadeData witness g) := by
  classical
  have : Fact ctr.p.Prime := ⟨ctr.p_prime⟩
  -- The witness (12.13) Dade calculation with its proven (12.14) evaluation `ψ(x) = χ(x)`.
  obtain ⟨hyp, coh, dade, hψeq, he_eq, hψZ, hχZ, hψx_eq⟩ :=
    witness_dade_psi_apply_x_eq_chi hG hnoV witness
  -- A primitive `p`-th root of unity.
  obtain ⟨ε, hε⟩ : ∃ ε : ℂ, IsPrimitiveRoot ε ctr.p :=
    ⟨_, Complex.isPrimitiveRoot_exp ctr.p ctr.p_prime.pos.ne'⟩
  -- `3 ≤ e = [L:H]`.
  have hthree : 3 ≤ dade.e := he_eq ▸ three_le_index hG hyp
  -- (12.14) + the `L`-side (1.10.a): `ψ(x) = χ(x) ≡ χ(1) = e (mod 1 − ε)` (`h_psix`),
  -- with no coherent-extension degree identity `ψ(1) = e` needed.
  have hxL : witness.x ∈ witness.L := witness_x_mem_L hG hnoV witness
  have hxp : (⟨witness.x, hxL⟩ : ↥witness.L) ^ ctr.p = 1 := by
    apply Subtype.ext
    push_cast
    exact witness.x_mem_omega1
  obtain ⟨w, hw, hweq⟩ := OddOrder.RepresentationTheory.exists_integral_apply_sub_of_commute
    ctr.p_prime.pos hε hχZ hxp (Commute.one_right _)
  rw [mul_one, dade.chi_degree_eq_e] at hweq
  have h_psix : ∃ w : ℂ, IsIntegral ℤ w ∧ dade.psi witness.x - (dade.e : ℂ) = (1 - ε) * w := by
    refine ⟨w, hw, ?_⟩
    rw [hψx_eq]
    exact hweq
  -- `H = L_F` (kernel of the witness) has the same order as the maximal nilpotent normal Hall.
  have hHcard : (Nat.card ↥(hyp.typeI.typeF.H) : ℝ)
      = (Nat.card ↥(maxNilpotentNormalHall witness.L) : ℝ) := by
    rw [hyp.typeI.typeF.H_eq]
  -- The deep value/norm package (12.14)/(12.15)/(12.12)/(8.1.c)/(7.x).
  obtain ⟨mval, normRhoM, normRho, h_const, h_psig_int, h2e, hidx, hA, hB, hC⟩ :=
    witness_value_norm_package hG hnoV witness rfl hg_comm hgK hgK' hyp coh dade hψeq he_eq hψZ
  -- `|M| ≤ |K|·|H|` (12.11).
  have hM : (Nat.card ↥ctr.M : ℝ)
      ≤ (Nat.card ↥ctr.K : ℝ) * (Nat.card ↥(maxNilpotentNormalHall witness.L) : ℝ) := by
    have := card_M_le hG hnoV witness
    calc (Nat.card ↥ctr.M : ℝ)
        ≤ ((Nat.card ↥ctr.K * Nat.card ↥(maxNilpotentNormalHall witness.L) : ℕ) : ℝ) := by
          exact_mod_cast this
      _ = (Nat.card ↥ctr.K : ℝ) * (Nat.card ↥(maxNilpotentNormalHall witness.L) : ℝ) := by
          push_cast; ring
  exact ⟨{
    ε := ε
    hε := hε
    ψ := dade.psi
    hψ := hψZ
    e := (dade.e : ℤ)
    mval := mval
    he := by exact_mod_cast hthree
    h2e := h2e
    h_const := h_const
    h_psix := h_psix
    h_psig_int := h_psig_int
    kK := (Nat.card ↥ctr.K : ℝ)
    kKp := (Nat.card ↥ctr.Kprime : ℝ)
    kM := (Nat.card ↥ctr.M : ℝ)
    kH := (Nat.card ↥(maxNilpotentNormalHall witness.L) : ℝ)
    normRhoM := normRhoM
    normRho := normRho
    hkKp := by exact_mod_cast (Nat.card_pos (α := ↥ctr.Kprime))
    hkM := by exact_mod_cast (Nat.card_pos (α := ↥ctr.M))
    hkH := by exact_mod_cast (Nat.card_pos (α := ↥(maxNilpotentNormalHall witness.L)))
    hidx := hidx
    hM := hM
    hA := hA
    hB := by
      -- `(↑(dade.e : ℤ) : ℝ) = (dade.e : ℝ)` and `|H| = |maxNilpotentNormalHall L|`.
      rw [show (((dade.e : ℤ) : ℝ)) = (dade.e : ℝ) by push_cast; ring, ← hHcard]
      exact hB
    hC := hC }⟩

/-- **Peterfalvi (12.16)**: the minimal counterexample of (12.8) is impossible.

The rank-two witness of (12.9) (`exists_rankTwoWitness`) and the commuting element `g ∈ C_K(x) ∖ K'`
(`exists_witness_g`) are extracted unconditionally; the deep §7/§12 character calculation is bundled
into `exists_counterexample_dade_data`; the contradiction then follows from the numerical endgame
`counterexample_contradiction_of_facts`. -/
theorem counterexample_contradiction [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (hnoV : ¬ ∃ M : Subgroup G, M ∈ maximalSubgroups G ∧ OddOrder.GroupTheory.IsTypeV M)
    (ctr : CounterexampleHypothesis (G := G)) :
    False := by
  obtain ⟨_, _, ⟨witness⟩⟩ := exists_rankTwoWitness hG ctr
  obtain ⟨g, hg_comm, hgK, hgK'⟩ := exists_witness_g witness
  obtain ⟨d⟩ := exists_counterexample_dade_data hG hnoV ctr witness hg_comm hgK hgK'
  exact counterexample_contradiction_of_facts ctr.p_prime d.hε d.hψ witness.x_mem_omega1 hg_comm
    d.he d.h2e d.h_const d.h_psix d.h_psig_int d.hkKp d.hkM d.hkH d.hidx d.hM d.hA d.hB d.hC

/-- **Peterfalvi (12.7), `π = ∅`** (the headline consequence of (12.16)): no prime lies in the
set `π` of (12.8).  Were `π` nonempty, (12.8) (`exists_counterexampleHypothesis`) would build a
minimal counterexample, contradicting (12.16) (`counterexample_contradiction`). -/
theorem pi_empty [Finite G] (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (hnoV : ¬ ∃ M : Subgroup G, M ∈ maximalSubgroups G ∧ OddOrder.GroupTheory.IsTypeV M) :
    ∀ q : ℕ, q.Prime → ¬ InPi (G := G) q := by
  by_contra h
  push Not at h
  obtain ⟨ctr⟩ := exists_counterexampleHypothesis hG h
  exact counterexample_contradiction hG hnoV ctr

/-- **Peterfalvi (12.7)**: every maximal subgroup of type I is Frobenius, with kernel `M_F`.

Since `π = ∅` by (12.16) (`pi_empty`), the easy direction `typeI_frobenius_of_pi_empty` applies
and gives the Frobenius decomposition with kernel `M_F = typeF.H` and complement `typeF.U`.  (The
`kernel_eq_MF` carrier is vacuous here: the `frobenius` field already names `typeF.H = M_F` as the
kernel, so the identification holds definitionally.) -/
theorem typeI_frobenius [Finite G] (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (hnoV : ¬ ∃ M : Subgroup G, M ∈ maximalSubgroups G ∧ OddOrder.GroupTheory.IsTypeV M)
    {M : Subgroup G} (hM : M ∈ maximalSubgroups G) (hType : IsTypeI M) :
    ∃ data : TypeIFrobeniusData M, data.kernel_eq_MF := by
  obtain ⟨data⟩ := hType
  exact ⟨{ typeI := data
           complement := data.typeF.U.subgroupOf M
           kernel_eq_MF := True
           kernel_eq_MF_holds := trivial
           frobenius := typeI_frobenius_of_pi_empty hG (pi_empty hG hnoV) hM data }, trivial⟩

end OddOrder.Peterfalvi.S14
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/S14_MaximalI/NormPackage.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