Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

BG §13: Lemma 13.1 (ppp-interaction with a different maximal subgroup M∗M^*M∗)

Definition
OddOrder_BG_Ch3_MaximalSubgroups_S13_Lemma131

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Formalizes Lemma 13.1 of Bender–Glauberman, Local Analysis for the Odd Order Theorem, §13: for M∗∈MM^*\in\mathcal{M}M∗∈M nonconjugate to MMM, p∈π(E)∩π(M∗)p\in\pi(E)\cap\pi(M^*)p∈π(E)∩π(M∗), p∉τ1(M∗)p\notin\tau_1(M^*)p∈/τ1​(M∗) and [Mσ∩M∗,M∩M∗]≠1[M_\sigma\cap M^*,M\cap M^*]\ne 1[Mσ​∩M∗,M∩M∗]=1: (a) all ppp-subgroups of M∩M∗M\cap M^*M∩M∗ centralize Mσ∩M∗M_\sigma\cap M^*Mσ​∩M∗; (b) p∉τ2(M∗)p\notin\tau_2(M^*)p∈/τ2​(M∗); (c) if p∈τ1(M)p\in\tau_1(M)p∈τ1​(M) then p∈β(G)p\in\beta(G)p∈β(G). It is the root of the dependency graph of §13.

The bundle consists of lemmas only.

The bundle also proves 17 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/BG/Ch3_MaximalSubgroups/S13_Lemma131.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_BG_Ch3_MaximalSubgroups_S12_Corollary1216
import Definitions.Def_OddOrder_BG_Ch3_MaximalSubgroups_S12_Lemma1211

namespace OddOrder.BG.Ch3.S13

open OddOrder.GroupTheory

open OddOrder.Isaacs

open OddOrder.BG.Ch3.S12

open scoped Pointwise

variable {G : Type*} [Group G]

/-- `p`-rank is invariant under group isomorphism. -/
theorem pRank_eq_of_mulEquiv {A B : Type*} [Group A] [Finite A] [Group B] [Finite B]
    {p : ℕ} (e : A ≃* B) : pRank A p = pRank B p :=
  le_antisymm (pRank_le_of_injective (f := e.toMonoidHom) e.injective)
    (pRank_le_of_injective (f := e.symm.toMonoidHom) e.symm.injective)

/-- If `N ≤ H` are subgroups whose orders have the same `p`-adic valuation (equivalently, `N`
contains a Sylow `p`-subgroup of `H`), then `pRank ↥H p ≤ pRank ↥N p`. A Sylow `p`-subgroup of
`N` then has order `p ^ v_p(|H|)`, so it is a Sylow `p`-subgroup of `H`, and `pRank` is realised
on Sylow subgroups (`pRank_sylow_eq`). Reusable. -/
theorem pRank_le_of_factorization_card_eq [Finite G] {p : ℕ} [Fact p.Prime]
    {N H : Subgroup G} (hNH : N ≤ H)
    (hfact : (Nat.card ↥H).factorization p = (Nat.card ↥N).factorization p) :
    pRank ↥H p ≤ pRank ↥N p := by
  classical
  obtain ⟨Q⟩ : Nonempty (Sylow p ↥N) := inferInstance
  set Pn : Subgroup G := (Q : Subgroup ↥N).map N.subtype with hPndef
  have hPnN : Pn ≤ N := Subgroup.map_subtype_le _
  have hPnH : Pn ≤ H := hPnN.trans hNH
  have hPncard : Nat.card ↥Pn = p ^ (Nat.card ↥N).factorization p := by
    rw [hPndef, Subgroup.card_map_of_injective N.subtype_injective]
    exact Sylow.card_eq_multiplicity Q
  have hPnHcard : Nat.card ↥(Pn.subgroupOf H) = p ^ (Nat.card ↥H).factorization p := by
    rw [Nat.card_congr (Subgroup.subgroupOfEquivOfLe hPnH).toEquiv, hPncard, hfact]
  set S : Sylow p ↥H := Sylow.ofCard (Pn.subgroupOf H) hPnHcard with hSdef
  calc pRank ↥H p
      = pRank ↥(S : Subgroup ↥H) p := (pRank_sylow_eq S).symm
    _ = pRank ↥(Pn.subgroupOf H) p := by rw [hSdef, Sylow.coe_ofCard]
    _ = pRank ↥Pn p := pRank_eq_of_mulEquiv (Subgroup.subgroupOfEquivOfLe hPnH)
    _ = pRank ↥(Pn.subgroupOf N) p :=
        (pRank_eq_of_mulEquiv (Subgroup.subgroupOfEquivOfLe hPnN)).symm
    _ ≤ pRank ↥N p := pRank_mono_of_le (Pn.subgroupOf N)

/-- If `H = K ⊔ N` with `K ⊴ H` (`K.subgroupOf H` normal in `↥H`), then `H' ≤ K ⊔ N'` (derived
subgroups in `G`). Modulo `K`, the quotient `↥H ⧸ K` is generated by the image of `N`, so its
derived subgroup is the image of `N'`; pulling back gives `H' ≤ K ⊔ N'`. Reusable. -/
theorem derivedInG_le_sup_of_normal {H K N : Subgroup G} (hKH : K ≤ H) (hNH : N ≤ H)
    (hsup : K ⊔ N = H) (hKnorm : (K.subgroupOf H).Normal) :
    derivedInG H ≤ K ⊔ derivedInG N := by
  classical
  have : (K.subgroupOf H).Normal := hKnorm
  have hsupTop : K.subgroupOf H ⊔ N.subgroupOf H = ⊤ := by
    apply Subgroup.map_injective H.subtype_injective
    rw [Subgroup.map_sup, Subgroup.subgroupOf_map_subtype, Subgroup.subgroupOf_map_subtype,
      inf_eq_left.mpr hKH, inf_eq_left.mpr hNH, hsup, ← MonoidHom.range_eq_map,
      Subgroup.range_subtype]
  set φ := QuotientGroup.mk' (K.subgroupOf H) with hφdef
  have hφsurj : Function.Surjective φ := QuotientGroup.mk'_surjective _
  have hmapKM : Subgroup.map φ (K.subgroupOf H) = ⊥ := by
    rw [Subgroup.map_eq_bot_iff, hφdef, QuotientGroup.ker_mk']
  have hmapNM : Subgroup.map φ (N.subgroupOf H) = ⊤ := by
    have h1 : Subgroup.map φ (K.subgroupOf H ⊔ N.subgroupOf H) = ⊤ := by
      rw [hsupTop, Subgroup.map_top_of_surjective φ hφsurj]
    rwa [Subgroup.map_sup, hmapKM, bot_sup_eq] at h1
  have hcomm_le : (⁅(⊤ : Subgroup ↥H), ⊤⁆ : Subgroup ↥H) ≤
      K.subgroupOf H ⊔ ⁅N.subgroupOf H, N.subgroupOf H⁆ := by
    have hmapeq : Subgroup.map φ ⁅(⊤ : Subgroup ↥H), ⊤⁆ =
        Subgroup.map φ ⁅N.subgroupOf H, N.subgroupOf H⁆ := by
      rw [Subgroup.map_commutator, Subgroup.map_commutator,
        Subgroup.map_top_of_surjective φ hφsurj, hmapNM]
    calc (⁅(⊤ : Subgroup ↥H), ⊤⁆ : Subgroup ↥H)
        ≤ Subgroup.comap φ (Subgroup.map φ ⁅(⊤ : Subgroup ↥H), ⊤⁆) := Subgroup.le_comap_map _ _
      _ = Subgroup.comap φ (Subgroup.map φ ⁅N.subgroupOf H, N.subgroupOf H⁆) := by rw [hmapeq]
      _ = ⁅N.subgroupOf H, N.subgroupOf H⁆ ⊔ φ.ker := Subgroup.comap_map_eq _ _
      _ = ⁅N.subgroupOf H, N.subgroupOf H⁆ ⊔ K.subgroupOf H := by
            rw [hφdef, QuotientGroup.ker_mk']
      _ = K.subgroupOf H ⊔ ⁅N.subgroupOf H, N.subgroupOf H⁆ := sup_comm _ _
  have hdown := Subgroup.map_mono (f := H.subtype) hcomm_le
  rw [Subgroup.map_commutator, ← MonoidHom.range_eq_map, Subgroup.range_subtype,
    Subgroup.map_sup, Subgroup.subgroupOf_map_subtype, inf_eq_left.mpr hKH,
    Subgroup.map_commutator, Subgroup.subgroupOf_map_subtype, inf_eq_left.mpr hNH] at hdown
  rw [show derivedInG H = ⁅H, H⁆ from Subgroup.map_subtype_commutator H,
    show derivedInG N = ⁅N, N⁆ from Subgroup.map_subtype_commutator N]
  exact hdown

/-- **Product formula for a normal sup** (`[Finite G]` via instances): for `K, L ≤ H` with `K ⊴ H`
(`K.subgroupOf H` normal in `↥H`), `|K ⊔ L| · |K ⊓ L| = |K| · |L|`. Computed inside `↥H` where `K`
is genuinely normal. Reusable. -/
theorem card_normal_sup_mul_card_inf {H K L : Subgroup G} (hKH : K ≤ H) (hLH : L ≤ H)
    (hKnorm : (K.subgroupOf H).Normal) :
    Nat.card ↥(K ⊔ L) * Nat.card ↥(K ⊓ L) = Nat.card ↥K * Nat.card ↥L := by
  classical
  have : (K.subgroupOf H).Normal := hKnorm
  have hsupSub : K.subgroupOf H ⊔ L.subgroupOf H = (K ⊔ L).subgroupOf H := by
    apply Subgroup.map_injective H.subtype_injective
    rw [Subgroup.map_sup, Subgroup.subgroupOf_map_subtype, Subgroup.subgroupOf_map_subtype,
      Subgroup.subgroupOf_map_subtype, inf_eq_left.mpr hKH, inf_eq_left.mpr hLH,
      inf_eq_left.mpr (sup_le hKH hLH)]
  have hform := Subgroup.card_HK_mul_card_inf_eq_card_mul_card (K.subgroupOf H) (L.subgroupOf H)
  rw [show (↑(K.subgroupOf H) * ↑(L.subgroupOf H) : Set ↥H)
      = ↑(K.subgroupOf H ⊔ L.subgroupOf H) from (Subgroup.normal_mul _ _).symm, hsupSub,
    SetLike.coe_sort_coe] at hform
  rw [Nat.card_congr (Subgroup.subgroupOfEquivOfLe (sup_le hKH hLH)).toEquiv,
    show K.subgroupOf H ⊓ L.subgroupOf H = (K ⊓ L).subgroupOf H from
      (Subgroup.comap_inf K L H.subtype).symm,
    Nat.card_congr (Subgroup.subgroupOfEquivOfLe (le_trans inf_le_left hKH)).toEquiv,
    Nat.card_congr (Subgroup.subgroupOfEquivOfLe hKH).toEquiv,
    Nat.card_congr (Subgroup.subgroupOfEquivOfLe hLH).toEquiv] at hform
  exact hform

/-- `⁅M_σ, M⁆ ≤ M_σ`: the radical `M_σ` is normal in `M`. (Reusable; via the normality of
`(M_σ).subgroupOf M` inside `↥M`.) -/
theorem Msigma_commutator_M_le (M : Subgroup G) :
    ⁅S10.Msigma M, M⁆ ≤ S10.Msigma M := by
  classical
  have : ((S10.Msigma M).subgroupOf M).Normal := by rw [S10.Msigma_subgroupOf]; infer_instance
  have h1 : ⁅(S10.Msigma M).subgroupOf M, (⊤ : Subgroup ↥M)⁆ ≤ (S10.Msigma M).subgroupOf M :=
    Subgroup.commutator_le_left _ _
  have h2 := Subgroup.map_mono (f := M.subtype) h1
  rwa [Subgroup.map_commutator, Subgroup.map_subgroupOf_eq_of_le (S10.Msigma_le M),
    ← MonoidHom.range_eq_map, Subgroup.range_subtype] at h2

/-- **Lemma 13.1, step 1** (mmd L3534): from `⁅M_σ∩M*, M∩M*⁆ ≠ 1`, the commutator lies in
`M_σ ⊓ M*'`, so there is a prime `q ∈ σ(M)` dividing `|M*'|`. -/
theorem exists_sigma_prime_dvd_derived_Mstar [Finite G] {M Mstar : Subgroup G}
    (hcomm : ⁅S10.Msigma M ⊓ Mstar, M ⊓ Mstar⁆ ≠ ⊥) :
    ∃ q : ℕ, q.Prime ∧ q ∈ S10.sigma M ∧
      q ∈ (Nat.card ↥(derivedInG Mstar)).primeFactors := by
  classical
  have hMsig : ⁅S10.Msigma M ⊓ Mstar, M ⊓ Mstar⁆ ≤ S10.Msigma M :=
    (Subgroup.commutator_mono inf_le_left inf_le_left).trans (Msigma_commutator_M_le M)
  have hderiv : ⁅S10.Msigma M ⊓ Mstar, M ⊓ Mstar⁆ ≤ derivedInG Mstar := by
    have hmono := Subgroup.commutator_mono (H₁ := S10.Msigma M ⊓ Mstar) (H₂ := M ⊓ Mstar)
      (K₁ := Mstar) (K₂ := Mstar) inf_le_right inf_le_right
    rwa [show ⁅Mstar, Mstar⁆ = derivedInG Mstar from (Subgroup.map_subtype_commutator Mstar).symm]
      at hmono
  have hne : S10.Msigma M ⊓ derivedInG Mstar ≠ ⊥ := fun hbot =>
    hcomm (le_bot_iff.mp ((le_inf hMsig hderiv).trans hbot.le))
  have hcardne : Nat.card ↥(S10.Msigma M ⊓ derivedInG Mstar) ≠ 1 := by
    have hnt : Nontrivial ↥(S10.Msigma M ⊓ derivedInG Mstar) :=
      (Subgroup.nontrivial_iff_ne_bot _).mpr hne
    exact (Finite.one_lt_card_iff_nontrivial.mpr hnt).ne'
  obtain ⟨q, hqp, hqdvd⟩ := Nat.exists_prime_and_dvd hcardne
  have hcardpos : ∀ K : Subgroup G, Nat.card ↥K ≠ 0 := fun K => Nat.card_pos.ne'
  refine ⟨q, hqp, ?_, ?_⟩
  · refine S10.Msigma_isPiGroup M q (Nat.mem_primeFactors.mpr ⟨hqp, ?_, hcardpos _⟩)
    exact hqdvd.trans (Subgroup.card_dvd_of_le inf_le_left)
  · exact Nat.mem_primeFactors.mpr ⟨hqp, hqdvd.trans (Subgroup.card_dvd_of_le inf_le_right),
      hcardpos _⟩

/-- `M_β ≤ M'` (= `derivedInG M`): via `M_β ≤ M_σ ≤ M'` (`β(M) ⊆ σ(M)` + `Msigma_le_derived`).
Reusable; mirrors the `hMβD` step inside `S10.derivedQuotientMbeta_isNilpotent`. -/
theorem Mbeta_le_derived [Finite G] (hG : IsMinimalSimpleOdd G) {M : Subgroup G}
    (hM : M ∈ maximalSubgroups G) : S10.Mbeta M ≤ derivedInG M :=
  le_trans (Subgroup.map_mono (Ch03.oPiCore_mono
    (fun _r hr => S10.alpha_subset_sigma hG hM (S10.beta_subset_alpha M hr)) ↥M))
    (S10.Msigma_le_derived hG hM)

/-- **Lemma 13.1, step 2** (mmd L3534): for `q ∉ β(M*)` dividing `|M*'|`, there is a Sylow
`q`-subgroup `Y` of `M*'` with the Frattini decomposition `M* = O_{β(M*)∪{q}}(M*') ⊔ N_{M*}(Y)`.
The `{β∪{q}}`-core `K := O_{β(M*)∪{q}}(M*')` is normal in `M*` (characteristic in `M*' ⊴ M*`) and a
`{β(M*)∪{q}}`-group, so `[M* : N_{M*}(Y)]` is prime to every `p ∉ β(M*) ∪ {q}` — the input that
places a Sylow `p` of `M*` inside `N_{M*}(Y)` in step 3. Adapts the Cor 10.9 Frattini machinery of
`S10_BetaRadical`. -/
theorem exists_sylow_frattini_decomp [Finite G] (hG : IsMinimalSimpleOdd G)
    {Mstar : Subgroup G} (hMstar : Mstar ∈ maximalSubgroups G) {q : ℕ} [Fact q.Prime]
    (hqβ : q ∉ S10.beta Mstar) (hq_dvd : q ∣ Nat.card ↥(derivedInG Mstar)) :
    ∃ Y : Subgroup G, Y ≠ ⊥ ∧ IsPGroup q ↥Y ∧ Y ≤ derivedInG Mstar ∧
      Mstar = opiCoreInG (S10.beta Mstar ∪ {q}) (derivedInG Mstar) ⊔
        (Mstar ⊓ Subgroup.normalizer (Y : Set G)) := by
  classical
  set D := derivedInG Mstar with hDdef
  have hDM : D ≤ Mstar := Subgroup.map_subtype_le _
  obtain ⟨Q⟩ : Nonempty (Sylow q ↥D) := inferInstance
  set Y : Subgroup G := (Q : Subgroup ↥D).map D.subtype with hYdef
  have hYD : Y ≤ D := Subgroup.map_subtype_le _
  have hYq : IsPGroup q ↥Y :=
    Q.isPGroup'.of_equiv (Subgroup.equivMapOfInjective _ D.subtype D.subtype_injective)
  -- `|Y| = q ^ v_q(|D|)`: `Y` is a Sylow `q`-subgroup of `D`.
  have hYcard : Nat.card ↥Y = q ^ (Nat.card ↥D).factorization q := by
    rw [hYdef, Subgroup.card_map_of_injective D.subtype_injective]
    exact Sylow.card_eq_multiplicity Q
  have hvpos : 0 < (Nat.card ↥D).factorization q :=
    (Fact.out : q.Prime).factorization_pos_of_dvd Nat.card_pos.ne' hq_dvd
  have hYne : Y ≠ ⊥ := by
    intro hbot
    rw [hbot, Subgroup.card_bot] at hYcard
    have h1lt : 1 < q ^ (Nat.card ↥D).factorization q :=
      Nat.one_lt_pow hvpos.ne' (Fact.out : q.Prime).one_lt
    omega
  -- `M*_β ≤ D`, normal in `↥D`, and a `q′`-group.
  have hMβD : S10.Mbeta Mstar ≤ D := Mbeta_le_derived hG hMstar
  have hMβnorm : ((S10.Mbeta Mstar).subgroupOf D).Normal :=
    (Subgroup.normal_subgroupOf_iff_le_normalizer hMβD).mpr
      (hDM.trans (le_normalizer_opiCoreInG (S10.beta Mstar) Mstar))
  have hNq' : ¬ q ∣ Nat.card ↥((S10.Mbeta Mstar).subgroupOf D) := by
    rw [Nat.card_congr (Subgroup.subgroupOfEquivOfLe hMβD).toEquiv]
    intro hdvd
    exact hqβ (isPiSubgroup_opiCoreInG (S10.beta Mstar) Mstar q
      (Nat.mem_primeFactors.mpr ⟨Fact.out, hdvd, Nat.card_pos.ne'⟩))
  -- `M*_β ⊔ Q ◁ D` (nilpotent quotient `D/M*_β`).
  have hMβQnorm : ((S10.Mbeta Mstar).subgroupOf D ⊔ (Q : Subgroup ↥D)).Normal :=
    S10.normal_sup_sylow_of_quotient_nilpotent
      (S10.derivedQuotientMbeta_isNilpotent hG hMstar) hNq' Q
  set K : Subgroup G := opiCoreInG (S10.beta Mstar ∪ {q}) D with hKdef
  have hKD : K ≤ D := Subgroup.map_subtype_le _
  set MβQ : Subgroup G := ((S10.Mbeta Mstar).subgroupOf D ⊔ (Q : Subgroup ↥D)).map D.subtype
    with hMβQdef
  have hMβQ_le_D : MβQ ≤ D := Subgroup.map_subtype_le _
  have hMβQ_pi : Subgroup.IsPiSubgroup (S10.beta Mstar ∪ {q}) MβQ := by
    intro r hr
    rw [hMβQdef, Subgroup.card_map_of_injective D.subtype_injective] at hr
    have hdvd : Nat.card ↥((S10.Mbeta Mstar).subgroupOf D ⊔ (Q : Subgroup ↥D)) ∣
        Nat.card ↥((S10.Mbeta Mstar).subgroupOf D) * Nat.card ↥(Q : Subgroup ↥D) := by
      have hform := Subgroup.card_HK_mul_card_inf_eq_card_mul_card
        ((S10.Mbeta Mstar).subgroupOf D) (Q : Subgroup ↥D)
      rw [show (↑((S10.Mbeta Mstar).subgroupOf D) * ↑(Q : Subgroup ↥D) : Set ↥D)
          = ↑((S10.Mbeta Mstar).subgroupOf D ⊔ (Q : Subgroup ↥D) : Subgroup ↥D) from
          (Subgroup.normal_mul ((S10.Mbeta Mstar).subgroupOf D) (Q : Subgroup ↥D)).symm] at hform
      exact ⟨_, hform.symm⟩
    have hr_prime := Nat.prime_of_mem_primeFactors hr
    rcases (Nat.Prime.dvd_mul hr_prime).mp ((Nat.mem_primeFactors.mp hr).2.1.trans hdvd) with h | h
    · exact Or.inl (isPiSubgroup_opiCoreInG (S10.beta Mstar) Mstar r
        (Nat.mem_primeFactors.mpr ⟨hr_prime,
          (Nat.card_congr (Subgroup.subgroupOfEquivOfLe hMβD).toEquiv) ▸ h, Nat.card_pos.ne'⟩))
    · refine Or.inr ?_
      obtain ⟨k, hk⟩ := IsPGroup.iff_card.mp Q.isPGroup'
      exact (Nat.prime_dvd_prime_iff_eq hr_prime Fact.out).mp (hr_prime.dvd_of_dvd_pow (hk ▸ h))
  have hMβQ_le_K : MβQ ≤ K := by
    refine le_opiCoreInG_of_normal_of_isPiSubgroup hMβQ_le_D ?_ hMβQ_pi
    rw [Subgroup.subgroupOf, Subgroup.comap_map_eq_self_of_injective D.subtype_injective]
    exact hMβQnorm
  have hY_le_K : Y ≤ K :=
    le_trans (hYdef ▸ Subgroup.map_mono (le_sup_right : (Q : Subgroup ↥D) ≤ _))
      (hMβQdef ▸ hMβQ_le_K)
  -- `|K|_q = |D|_q`, so `Y` is a Sylow `q`-subgroup of `K`.
  have hKq_card : (Nat.card ↥K).factorization q = (Nat.card ↥D).factorization q := by
    refine le_antisymm
      ((Nat.factorization_le_iff_dvd Nat.card_pos.ne' Nat.card_pos.ne').mpr
        (Subgroup.card_dvd_of_le hKD) q) ?_
    have hdvd : q ^ (Nat.card ↥D).factorization q ∣ Nat.card ↥K :=
      hYcard ▸ Subgroup.card_dvd_of_le hY_le_K
    exact (Nat.Prime.pow_dvd_iff_le_factorization Fact.out Nat.card_pos.ne').mp hdvd
  have hKnorm : (K.subgroupOf Mstar).Normal :=
    (Subgroup.normal_subgroupOf_iff_le_normalizer (hKD.trans hDM)).mpr
      (le_normalizer_opiCoreInG_of_le_normalizer (S10.beta Mstar ∪ {q})
        (S10.le_normalizer_derivedInG Mstar))
  -- **Frattini** in `↥M*`: `M* = K ⊔ N_{M*}(Y)`.
  have hYK_card : Nat.card ↥((Y.subgroupOf Mstar).subgroupOf (K.subgroupOf Mstar)) =
      q ^ (Nat.card ↥(K.subgroupOf Mstar)).factorization q := by
    have hYM : Y ≤ Mstar := hYD.trans hDM
    have hle : Y.subgroupOf Mstar ≤ K.subgroupOf Mstar := Subgroup.subgroupOf_mono Mstar hY_le_K
    rw [Nat.card_congr (Subgroup.subgroupOfEquivOfLe hle).toEquiv,
      Nat.card_congr (Subgroup.subgroupOfEquivOfLe hYM).toEquiv,
      Nat.card_congr (Subgroup.subgroupOfEquivOfLe (hKD.trans hDM)).toEquiv,
      hYcard, hKq_card]
  set P : Sylow q ↥(K.subgroupOf Mstar) :=
    Sylow.ofCard ((Y.subgroupOf Mstar).subgroupOf (K.subgroupOf Mstar)) hYK_card with hP
  have hPmap : (P : Subgroup ↥(K.subgroupOf Mstar)).map (K.subgroupOf Mstar).subtype =
      Y.subgroupOf Mstar := by
    rw [hP, Sylow.coe_ofCard, Subgroup.subgroupOf_map_subtype,
      inf_eq_left.mpr (Subgroup.subgroupOf_mono Mstar hY_le_K)]
  have hFrattini := Sylow.normalizer_sup_eq_top P
  rw [hPmap, ← Subgroup.subgroupOf_normalizer_eq (hYD.trans hDM)] at hFrattini
  -- transport `⊤ = N_{M*}(Y).subgroupOf M* ⊔ K.subgroupOf M*` to `M* = K ⊔ N_{M*}(Y)`.
  refine ⟨Y, hYne, hYq, hYD, ?_⟩
  have hmap := congrArg (Subgroup.map Mstar.subtype) hFrattini
  rw [Subgroup.map_sup, Subgroup.subgroupOf_map_subtype, Subgroup.subgroupOf_map_subtype,
    ← MonoidHom.range_eq_map, Subgroup.range_subtype, inf_eq_left.mpr (hKD.trans hDM),
    inf_comm, sup_comm] at hmap
  exact hmap.symm

/-- **Lemma 13.1, step 3 = conclusion (b)** (mmd L3538): under the Lemma 13.1 hypotheses,
`p ∉ τ₂(M*)`. Assume `p ∈ τ₂(M*)`. Step 1 gives `q ∈ σ(M) ∩ π(M*')`; step 2 the Frattini
decomposition `M* = K ⊔ N_{M*}(Y)` with `K = O_{β(M*)∪{q}}(M*') ⊴ M*` and `Y` a Sylow `q` of
`M*'`. Since `p ∉ β(M*)` (`τ₂ ∩ σ = ∅ ⊇ β`) and `p ≠ q` (`p ∈ π(E)`, `q ∈ σ(M)`,
`π(E) ∩ σ(M) = ∅`), the `{β(M*)∪{q}}`-group `K` has order prime to `p`, so `[M* : N_{M*}(Y)]`
is prime to `p` and `r_p(N_{M*}(Y)) = r_p(M*) = 2`. But Lemma 12.1(g) gives `p ∉ β(G)`, so
Corollary 12.16(a) forces `r_p(N_{M*}(Y)) ≤ 1` — a contradiction. Cites the S12_E statement
`sigma_subgroup_pRank_normalizer_le_one`. -/
theorem not_mem_tau2_of_interaction [Finite G] (hG : IsMinimalSimpleOdd G)
    {M E E₁ E₂ E₃ : Subgroup G} (h : SubgroupESetup M E E₁ E₂ E₃) {p : ℕ} [Fact p.Prime]
    {Mstar : Subgroup G} (hMstar : Mstar ∈ maximalSubgroups G)
    (hpE : p ∈ (Nat.card ↥E).primeFactors)
    (hcomm : ⁅S10.Msigma M ⊓ Mstar, M ⊓ Mstar⁆ ≠ ⊥)
    (hnc : ¬ ∃ g : G, MulAut.conj g • M = Mstar) :
    p ∉ tau2 Mstar := by
  classical
  intro hpτ2
  -- step 1: a prime `q ∈ σ(M) ∩ π(M*')`.
  obtain ⟨q, hqp, hqσ, hqπ⟩ := exists_sigma_prime_dvd_derived_Mstar hcomm
  have : Fact q.Prime := ⟨hqp⟩
  -- conjugacy is symmetric (inlined `not_conj_symm`).
  have hnc' : ¬ ∃ g : G, MulAut.conj g • Mstar = M := by
    rintro ⟨g, hg⟩
    exact hnc ⟨g⁻¹, by rw [← hg, ← mul_smul, ← map_mul, inv_mul_cancel, map_one, one_smul]⟩
  -- `q ∉ β(M*)` from `σ(M) ∩ α(M*) = ∅` (Lemma 10.12(a), swapped) + `β ⊆ α`.
  have hqα : q ∉ S10.alpha Mstar := fun ha =>
    Set.eq_empty_iff_forall_notMem.mp
      ((S10.disjoint_of_not_conj hG hMstar h.mem_maximal hnc').1.2) q ⟨ha, hqσ⟩
  have hqβ : q ∉ S10.beta Mstar := fun hb => hqα (S10.beta_subset_alpha Mstar hb)
  -- step 2: Frattini decomposition `M* = K ⊔ N`, `Y` a Sylow `q` of `M*'`.
  obtain ⟨Y, hYne, hYq, hYD, hdecomp⟩ :=
    exists_sylow_frattini_decomp hG hMstar hqβ (Nat.dvd_of_mem_primeFactors hqπ)
  have hDM : derivedInG Mstar ≤ Mstar := Subgroup.map_subtype_le _
  set K : Subgroup G := opiCoreInG (S10.beta Mstar ∪ {q}) (derivedInG Mstar) with hKdef
  set N : Subgroup G := Mstar ⊓ Subgroup.normalizer (Y : Set G) with hNdef
  have hKD : K ≤ derivedInG Mstar := Subgroup.map_subtype_le _
  have hKM : K ≤ Mstar := hKD.trans hDM
  have hNM : N ≤ Mstar := inf_le_left
  -- `K ⊴ M*` (characteristic in `M*' ⊴ M*`).
  have hKnorm : (K.subgroupOf Mstar).Normal :=
    (Subgroup.normal_subgroupOf_iff_le_normalizer hKM).mpr
      (le_normalizer_opiCoreInG_of_le_normalizer (S10.beta Mstar ∪ {q})
        (S10.le_normalizer_derivedInG Mstar))
  -- `p ∤ |K|`: `p ∉ β(M*)` (`τ₂ ∩ σ = ∅ ⊇ β`) and `p ≠ q` (`π(E) ∩ σ(M) = ∅`).
  have hpσMstar : p ∉ S10.sigma Mstar := ((mem_tau2_iff Mstar p).mp hpτ2).1
  have hpβMstar : p ∉ S10.beta Mstar := fun hb =>
    hpσMstar (S10.alpha_subset_sigma hG hMstar (S10.beta_subset_alpha Mstar hb))
  have hpq : p ≠ q := fun he => (h.not_mem_sigma_of_mem_primeFactors hG hpE) (he ▸ hqσ)
  have hpK : ¬ p ∣ Nat.card ↥K := by
    intro hdvd
    have hmem : p ∈ (Nat.card ↥K).primeFactors :=
      Nat.mem_primeFactors.mpr ⟨Fact.out, hdvd, Nat.card_pos.ne'⟩
    rcases isPiSubgroup_opiCoreInG (S10.beta Mstar ∪ {q}) (derivedInG Mstar) p hmem with hβ | hq'
    · exact hpβMstar hβ
    · exact hpq (Set.mem_singleton_iff.mp hq')
  -- product formula in `↥M*`: `|M*| · |K ⊓ N| = |K| · |N|`.
  have hsupTop : K.subgroupOf Mstar ⊔ N.subgroupOf Mstar = ⊤ := by
    apply Subgroup.map_injective Mstar.subtype_injective
    rw [Subgroup.map_sup, Subgroup.subgroupOf_map_subtype, Subgroup.subgroupOf_map_subtype,
      inf_eq_left.mpr hKM, inf_eq_left.mpr hNM, ← hdecomp,
      ← MonoidHom.range_eq_map, Subgroup.range_subtype]
  have eTop : Nat.card ↥(↑(K.subgroupOf Mstar) * ↑(N.subgroupOf Mstar) : Set ↥Mstar)
            = Nat.card ↥Mstar := by
    rw [(Subgroup.normal_mul (K.subgroupOf Mstar) (N.subgroupOf Mstar)).symm, hsupTop,
      SetLike.coe_sort_coe, Subgroup.card_top]
  have hcardId : Nat.card ↥Mstar * Nat.card ↥(K ⊓ N) = Nat.card ↥K * Nat.card ↥N := by
    have hform := Subgroup.card_HK_mul_card_inf_eq_card_mul_card
      (K.subgroupOf Mstar) (N.subgroupOf Mstar)
    have e2 : Nat.card ↥(K.subgroupOf Mstar) = Nat.card ↥K :=
      Nat.card_congr (Subgroup.subgroupOfEquivOfLe hKM).toEquiv
    have e3 : Nat.card ↥(N.subgroupOf Mstar) = Nat.card ↥N :=
      Nat.card_congr (Subgroup.subgroupOfEquivOfLe hNM).toEquiv
    have e4 : Nat.card ↥(K.subgroupOf Mstar ⊓ N.subgroupOf Mstar) = Nat.card ↥(K ⊓ N) := by
      have hinf : K.subgroupOf Mstar ⊓ N.subgroupOf Mstar = (K ⊓ N).subgroupOf Mstar :=
        (Subgroup.comap_inf K N Mstar.subtype).symm
      rw [hinf]
      exact Nat.card_congr (Subgroup.subgroupOfEquivOfLe (le_trans inf_le_left hKM)).toEquiv
    rw [eTop, e4, e2, e3] at hform
    exact hform
  -- `v_p(|M*|) = v_p(|N|)` (since `v_p(|K|) = v_p(|K ⊓ N|) = 0`).
  have hfact : (Nat.card ↥Mstar).factorization p = (Nat.card ↥N).factorization p := by
    have happ : (Nat.card ↥Mstar).factorization p + (Nat.card ↥(K ⊓ N)).factorization p
              = (Nat.card ↥K).factorization p + (Nat.card ↥N).factorization p := by
      have hcong := congrArg (fun n => n.factorization p) hcardId
      simpa only [Nat.factorization_mul (Nat.card_pos (α := ↥Mstar)).ne' Nat.card_pos.ne',
        Nat.factorization_mul (Nat.card_pos (α := ↥K)).ne' Nat.card_pos.ne',
        Finsupp.add_apply] using hcong
    have hfK0 : (Nat.card ↥K).factorization p = 0 := Nat.factorization_eq_zero_of_not_dvd hpK
    have hfKN0 : (Nat.card ↥(K ⊓ N)).factorization p = 0 :=
      Nat.factorization_eq_zero_of_not_dvd
        (fun hd => hpK (hd.trans (Subgroup.card_dvd_of_le inf_le_left)))
    omega
  -- `2 ≤ r_p(N_{M*}(Y))`.
  have h2N : 2 ≤ pRank ↥N p := by
    have hr2 : pRank ↥Mstar p = 2 := tau2_pRank_eq_two hpτ2
    have hle := pRank_le_of_factorization_card_eq hNM hfact
    omega
  -- `p ∉ β(G)` (Lemma 12.1(g)).
  obtain ⟨A, hA, hAM⟩ := exists_mem_elemAbelianOfRank_two_le_of_tau2 (Fact.out : p.Prime) hpτ2
  have hpβG : ¬ S10.idealPrime p G :=
    (isMaximalElementaryAbelian_of_mem_tau2 hG hMstar (Fact.out : p.Prime) hpτ2 hAM hA).2
  -- Corollary 12.16(a): `r_p(N_{M*}(Y)) ≤ 1` (S12_E `sigma_subgroup_pRank_normalizer_le_one`).
  have hYpi : Subgroup.IsPiSubgroup (S10.sigma M) Y := by
    intro r hr
    obtain ⟨k, hk⟩ := IsPGroup.iff_card.mp hYq
    have hr_prime := Nat.prime_of_mem_primeFactors hr
    have hrq : r = q := (Nat.prime_dvd_prime_iff_eq hr_prime hqp).mp
      (hr_prime.dvd_of_dvd_pow (hk ▸ Nat.dvd_of_mem_primeFactors hr))
    rw [hrq]; exact hqσ
  have hYM : Y ≤ Mstar := hYD.trans hDM
  have hHY : Mstar ∈ maximalSubgroupsContaining Y :=
    mem_maximalSubgroupsContaining.mpr ⟨mem_maximalSubgroups.mp hMstar, hYM⟩
  have hle1 := sigma_subgroup_pRank_normalizer_le_one hG h hYne hYpi hpE hpβG hHY hnc
  rw [← hNdef] at hle1
  omega

/-- **τ-partition** for a prime `p ∈ π(M*)` (`M*` maximal): if `p ∉ τ₁(M*)` and `p ∉ τ₂(M*)`, then
`p ∈ σ(M*) ∪ τ₃(M*)`. If `p ∉ σ(M*)` then `p ∉ α(M*)` gives `r_p(M*) ≤ 2`, `p ∉ τ₂(M*)` gives
`r_p(M*) ≠ 2` (so `= 1` since `r_p(M*) ≥ 1`), and `p ∉ τ₁(M*)` then forces `p ∈ π(M*')`, i.e.
`p ∈ τ₃(M*)`. -/
theorem mem_sigma_or_tau3_of_not_tau1_tau2 [Finite G] (hG : IsMinimalSimpleOdd G)
    {Mstar : Subgroup G} (hMstar : Mstar ∈ maximalSubgroups G) {p : ℕ} [Fact p.Prime]
    (hpMstar : p ∈ (Nat.card ↥Mstar).primeFactors)
    (hpτ1 : p ∉ tau1 Mstar) (hpτ2 : p ∉ tau2 Mstar) :
    p ∈ S10.sigma Mstar ∨ p ∈ tau3 Mstar := by
  classical
  by_cases hpσ : p ∈ S10.sigma Mstar
  · exact Or.inl hpσ
  · refine Or.inr ?_
    have hpα : p ∉ S10.alpha Mstar := fun ha => hpσ (S10.alpha_subset_sigma hG hMstar ha)
    have hrank_le : pRank ↥Mstar p ≤ 2 := by
      by_contra hr
      exact hpα ((S10.mem_alpha_iff Mstar p).mpr ⟨hpMstar, by omega⟩)
    have hrank_ge : 1 ≤ pRank ↥Mstar p := one_le_pRank_of_mem_primeFactors hpMstar
    have hrank1 : pRank ↥Mstar p = 1 := by
      rcases (by omega : pRank ↥Mstar p = 1 ∨ pRank ↥Mstar p = 2) with h1 | h2
      · exact h1
      · exact absurd ((mem_tau2_iff Mstar p).mpr ⟨hpσ, h2⟩) hpτ2
    have hpderiv : p ∈ (Nat.card ↥(derivedInG Mstar)).primeFactors := by
      by_contra hpND
      exact hpτ1 ((mem_tau1_iff Mstar p).mpr ⟨hpσ, hpND, hrank1⟩)
    exact (mem_tau3_iff Mstar p).mpr ⟨hpσ, hpderiv, hrank1⟩

/-- For a prime `p ∈ π(M*)` with `p ∉ τ₁(M*)` and `p ∉ τ₂(M*)` (so `p ∈ σ(M*) ∪ τ₃(M*)`),
`p ∈ π(M*')`. In the `σ` case a Sylow `p`-subgroup lies in `M*_σ ⊆ M*'`; in the `τ₃` case
`p ∈ π(M*')` by definition (`tau3_mem_derived_primeFactors`). -/
theorem mem_primeFactors_derived_of_not_tau1_tau2 [Finite G] (hG : IsMinimalSimpleOdd G)
    {Mstar : Subgroup G} (hMstar : Mstar ∈ maximalSubgroups G) {p : ℕ} [Fact p.Prime]
    (hpMstar : p ∈ (Nat.card ↥Mstar).primeFactors)
    (hpτ1 : p ∉ tau1 Mstar) (hpτ2 : p ∉ tau2 Mstar) :
    p ∈ (Nat.card ↥(derivedInG Mstar)).primeFactors := by
  classical
  rcases mem_sigma_or_tau3_of_not_tau1_tau2 hG hMstar hpMstar hpτ1 hpτ2 with hpσ | hτ3
  · obtain ⟨SM⟩ : Nonempty (Sylow p ↥Mstar) := inferInstance
    set S : Subgroup G := (SM : Subgroup ↥Mstar).map Mstar.subtype with hSdef
    have hScard : Nat.card ↥S = p ^ (Nat.card ↥Mstar).factorization p := by
      rw [hSdef, Subgroup.card_map_of_injective Mstar.subtype_injective,
        Sylow.card_eq_multiplicity SM]
    have hSMle : S ≤ Mstar := hSdef ▸ Subgroup.map_subtype_le _
    have hSpi : Ch03.Subgroup.IsPiGroup (S10.sigma Mstar) S := by
      intro r hr
      rw [hScard] at hr
      have hr_prime := Nat.prime_of_mem_primeFactors hr
      have hrp : r = p := (Nat.prime_dvd_prime_iff_eq hr_prime Fact.out).mp
        (hr_prime.dvd_of_dvd_pow (Nat.mem_primeFactors.mp hr).2.1)
      rw [hrp]; exact hpσ
    have hS_le_deriv : S ≤ derivedInG Mstar :=
      (S10.sigma_subgroup_le_Msigma_of_isHall (S10.Msigma_isHall hG hMstar) hSMle hSpi).trans
        (S10.Msigma_le_derived hG hMstar)
    have hpS : p ∣ Nat.card ↥S := by
      rw [hScard]
      exact dvd_pow_self p ((Fact.out : p.Prime).factorization_pos_of_dvd Nat.card_pos.ne'
        (Nat.dvd_of_mem_primeFactors hpMstar)).ne'
    exact Nat.mem_primeFactors.mpr ⟨Fact.out, hpS.trans (Subgroup.card_dvd_of_le hS_le_deriv),
      Nat.card_pos.ne'⟩
  · exact tau3_mem_derived_primeFactors hτ3

/-- **Lemma 13.1, step 4 = conclusion (c)** (mmd L3540): under the Lemma 13.1 hypotheses plus
`p ∈ τ₁(M)` (and `p ∉ τ₂(M*)`, conclusion (b)), `p ∈ β(G)`. Assume `¬(p ∈ β(G))`. Then
`p ∈ π(M*')` (`mem_primeFactors_derived_of_not_tau1_tau2`, since `p ∈ σ(M*) ∪ τ₃(M*)`), and the
Frattini decomposition `M* = K ⊔ N` with `K = O_{β(M*)∪{q}}(M*') ⊴ M*` (`p ∤ |K|`) gives
`M*' ≤ K ⊔ N'` (`derivedInG_le_sup_of_normal`), so `v_p(|M*'|) ≤ v_p(|N'|)` and hence
`p ∈ π(N_{M*}(Y)')`. But Corollary 12.16(b) gives `p ∉ π(N_{M*}(Y)')` — contradiction. -/
theorem mem_idealPrime_of_tau1_of_interaction [Finite G] (hG : IsMinimalSimpleOdd G)
    {M E E₁ E₂ E₃ : Subgroup G} (h : SubgroupESetup M E E₁ E₂ E₃) {p : ℕ} [Fact p.Prime]
    {Mstar : Subgroup G} (hMstar : Mstar ∈ maximalSubgroups G)
    (hpE : p ∈ (Nat.card ↥E).primeFactors) (hpMstar : p ∈ (Nat.card ↥Mstar).primeFactors)
    (hpτ1Mstar : p ∉ tau1 Mstar) (hpτ2Mstar : p ∉ tau2 Mstar)
    (hcomm : ⁅S10.Msigma M ⊓ Mstar, M ⊓ Mstar⁆ ≠ ⊥)
    (hnc : ¬ ∃ g : G, MulAut.conj g • M = Mstar) (hpτ1M : p ∈ tau1 M) :
    S10.idealPrime p G := by
  classical
  by_contra hnotideal
  -- shared setup (cf. step (b)); `p ∉ β(M*)` here comes from `¬idealPrime`.
  obtain ⟨q, hqp, hqσ, hqπ⟩ := exists_sigma_prime_dvd_derived_Mstar hcomm
  have : Fact q.Prime := ⟨hqp⟩
  have hnc' : ¬ ∃ g : G, MulAut.conj g • Mstar = M := by
    rintro ⟨g, hg⟩
    exact hnc ⟨g⁻¹, by rw [← hg, ← mul_smul, ← map_mul, inv_mul_cancel, map_one, one_smul]⟩
  have hqα : q ∉ S10.alpha Mstar := fun ha =>
    Set.eq_empty_iff_forall_notMem.mp
      ((S10.disjoint_of_not_conj hG hMstar h.mem_maximal hnc').1.2) q ⟨ha, hqσ⟩
  have hqβ : q ∉ S10.beta Mstar := fun hb => hqα (S10.beta_subset_alpha Mstar hb)
  obtain ⟨Y, hYne, hYq, hYD, hdecomp⟩ :=
    exists_sylow_frattini_decomp hG hMstar hqβ (Nat.dvd_of_mem_primeFactors hqπ)
  have hDM : derivedInG Mstar ≤ Mstar := Subgroup.map_subtype_le _
  set K : Subgroup G := opiCoreInG (S10.beta Mstar ∪ {q}) (derivedInG Mstar) with hKdef
  set N : Subgroup G := Mstar ⊓ Subgroup.normalizer (Y : Set G) with hNdef
  have hKD : K ≤ derivedInG Mstar := Subgroup.map_subtype_le _
  have hKM : K ≤ Mstar := hKD.trans hDM
  have hNM : N ≤ Mstar := inf_le_left
  have hKnorm : (K.subgroupOf Mstar).Normal :=
    (Subgroup.normal_subgroupOf_iff_le_normalizer hKM).mpr
      (le_normalizer_opiCoreInG_of_le_normalizer (S10.beta Mstar ∪ {q})
        (S10.le_normalizer_derivedInG Mstar))
  have hpβMstar : p ∉ S10.beta Mstar := fun hb => hnotideal ((S10.mem_beta_iff Mstar p).mp hb).2
  have hpq : p ≠ q := fun he => (h.not_mem_sigma_of_mem_primeFactors hG hpE) (he ▸ hqσ)
  have hpK : ¬ p ∣ Nat.card ↥K := by
    intro hdvd
    have hmem : p ∈ (Nat.card ↥K).primeFactors :=
      Nat.mem_primeFactors.mpr ⟨Fact.out, hdvd, Nat.card_pos.ne'⟩
    rcases isPiSubgroup_opiCoreInG (S10.beta Mstar ∪ {q}) (derivedInG Mstar) p hmem with hβ | hq'
    · exact hpβMstar hβ
    · exact hpq (Set.mem_singleton_iff.mp hq')
  have hYpi : Subgroup.IsPiSubgroup (S10.sigma M) Y := by
    intro r hr
    obtain ⟨k, hk⟩ := IsPGroup.iff_card.mp hYq
    have hr_prime := Nat.prime_of_mem_primeFactors hr
    have hrq : r = q := (Nat.prime_dvd_prime_iff_eq hr_prime hqp).mp
      (hr_prime.dvd_of_dvd_pow (hk ▸ Nat.dvd_of_mem_primeFactors hr))
    rw [hrq]; exact hqσ
  have hYM : Y ≤ Mstar := hYD.trans hDM
  have hHY : Mstar ∈ maximalSubgroupsContaining Y :=
    mem_maximalSubgroupsContaining.mpr ⟨mem_maximalSubgroups.mp hMstar, hYM⟩
  -- `p ∈ π(M*')` and `p ∈ π(N')`.
  have hpMstarDeriv : p ∈ (Nat.card ↥(derivedInG Mstar)).primeFactors :=
    mem_primeFactors_derived_of_not_tau1_tau2 hG hMstar hpMstar hpτ1Mstar hpτ2Mstar
  have hpNderiv : p ∈ (Nat.card ↥(derivedInG N)).primeFactors := by
    have hN'M : derivedInG N ≤ Mstar := (Subgroup.map_subtype_le _).trans hNM
    have hML : derivedInG Mstar ≤ K ⊔ derivedInG N :=
      derivedInG_le_sup_of_normal hKM hNM hdecomp.symm hKnorm
    have hprod := card_normal_sup_mul_card_inf hKM hN'M hKnorm
    have hpMul : p ∣ Nat.card ↥K * Nat.card ↥(derivedInG N) :=
      (Nat.dvd_of_mem_primeFactors hpMstarDeriv).trans
        ((Subgroup.card_dvd_of_le hML).trans ⟨Nat.card ↥(K ⊓ derivedInG N), hprod.symm⟩)
    exact Nat.mem_primeFactors.mpr
      ⟨Fact.out, ((Nat.Prime.dvd_mul Fact.out).mp hpMul).resolve_left hpK, Nat.card_pos.ne'⟩
  -- Corollary 12.16(b): `p ∉ π(N')`.
  have hax := sigma_subgroup_not_mem_primeFactors_derived_of_tau1 hG h hYne hYpi hpE hnotideal hpτ1M
    hHY hnc
  rw [← hNdef] at hax
  exact hax hpNderiv

/-- `M*'/M*_α` is nilpotent: it is `(M*'/M*_β) ⧸ (M*_α/M*_β)`, a quotient of the nilpotent
`M*'/M*_β` (`derivedQuotientMbeta_isNilpotent`, `M*_β ≤ M*_α`). Via the third isomorphism
`quotientQuotientEquivQuotient` + `Group.nilpotent_of_surjective`. -/
theorem derivedQuotientMalpha_isNilpotent [Finite G] (hG : IsMinimalSimpleOdd G)
    {M : Subgroup G} (hM : M ∈ maximalSubgroups G)
    [((S10.Malpha M).subgroupOf (derivedInG M)).Normal] :
    Group.IsNilpotent (↥(derivedInG M) ⧸ (S10.Malpha M).subgroupOf (derivedInG M)) := by
  classical
  have hMβD : S10.Mbeta M ≤ derivedInG M := Mbeta_le_derived hG hM
  have hMle : derivedInG M ≤ M := Subgroup.map_subtype_le _
  have hMβnorm : ((S10.Mbeta M).subgroupOf (derivedInG M)).Normal :=
    (Subgroup.normal_subgroupOf_iff_le_normalizer hMβD).mpr
      (hMle.trans (le_normalizer_opiCoreInG (S10.beta M) M))
  have := S10.derivedQuotientMbeta_isNilpotent hG hM
  have hsub : (S10.Mbeta M).subgroupOf (derivedInG M) ≤
      (S10.Malpha M).subgroupOf (derivedInG M) :=
    Subgroup.subgroupOf_mono _ (Subgroup.map_mono (Ch03.oPiCore_mono (S10.beta_subset_alpha M) ↥M))
  have : Group.IsNilpotent
      ((↥(derivedInG M) ⧸ (S10.Mbeta M).subgroupOf (derivedInG M)) ⧸
        ((S10.Malpha M).subgroupOf (derivedInG M)).map
          (QuotientGroup.mk' ((S10.Mbeta M).subgroupOf (derivedInG M)))) :=
    Group.nilpotent_of_surjective (QuotientGroup.mk' _) (QuotientGroup.mk'_surjective _)
  exact Group.nilpotent_of_surjective
    (QuotientGroup.quotientQuotientEquivQuotient _ _ hsub).toMonoidHom
    (QuotientGroup.quotientQuotientEquivQuotient _ _ hsub).surjective

/-- For `p ∈ π(M*) ∖ τ₁(M*) ∖ τ₂(M*)` (`p ∈ σ(M*) ∪ τ₃(M*)`), there is a Sylow `p`-subgroup `S`
of `M*` (as a subgroup of `G`) lying in `M*'`. In the `σ` case `S ⊆ M*_σ ⊆ M*'`; in the `τ₃` case
`S` is a Sylow `p` of the complement `E*` (`p ∉ σ`, so `|E*|_p = |M*|_p`) and `S ⊆ E*' ⊆ M*'`
(`sylow_le_derived_of_mem_tau3`). -/
theorem exists_sylow_le_derivedInG_of_not_tau1_tau2 [Finite G] (hG : IsMinimalSimpleOdd G)
    {Mstar : Subgroup G} (hMstar : Mstar ∈ maximalSubgroups G) {p : ℕ} [Fact p.Prime]
    (hpMstar : p ∈ (Nat.card ↥Mstar).primeFactors)
    (hpτ1 : p ∉ tau1 Mstar) (hpτ2 : p ∉ tau2 Mstar) :
    ∃ S : Subgroup G, S ≤ Mstar ∧ IsPGroup p ↥S ∧
      Nat.card ↥S = p ^ (Nat.card ↥Mstar).factorization p ∧ S ≤ derivedInG Mstar := by
  classical
  rcases mem_sigma_or_tau3_of_not_tau1_tau2 hG hMstar hpMstar hpτ1 hpτ2 with hpσ | hτ3
  · -- σ: any Sylow `p` of `M*` lies in `M*_σ ⊆ M*'`.
    obtain ⟨SM⟩ : Nonempty (Sylow p ↥Mstar) := inferInstance
    refine ⟨(SM : Subgroup ↥Mstar).map Mstar.subtype, Subgroup.map_subtype_le _,
      SM.isPGroup'.of_equiv (Subgroup.equivMapOfInjective _ _ Mstar.subtype_injective), ?_, ?_⟩
    · rw [Subgroup.card_map_of_injective Mstar.subtype_injective, Sylow.card_eq_multiplicity SM]
    · have hSpi : Ch03.Subgroup.IsPiGroup (S10.sigma Mstar)
          ((SM : Subgroup ↥Mstar).map Mstar.subtype) := by
        intro r hr
        rw [Subgroup.card_map_of_injective Mstar.subtype_injective,
          Sylow.card_eq_multiplicity SM] at hr
        obtain ⟨k, hk⟩ := IsPGroup.iff_card.mp SM.isPGroup'
        have hr_prime := Nat.prime_of_mem_primeFactors hr
        have hrp : r = p := (Nat.prime_dvd_prime_iff_eq hr_prime Fact.out).mp
          (hr_prime.dvd_of_dvd_pow (Nat.mem_primeFactors.mp hr).2.1)
        rw [hrp]; exact hpσ
      exact (S10.sigma_subgroup_le_Msigma_of_isHall (S10.Msigma_isHall hG hMstar)
        (Subgroup.map_subtype_le _) hSpi).trans (S10.Msigma_le_derived hG hMstar)
  · -- τ₃: Sylow `p` of the complement `E*`, via the de-privatized lemma.
    obtain ⟨Es, E1s, E2s, E3s, hs⟩ := exists_subgroupESetup hG hMstar
    obtain ⟨PE⟩ : Nonempty (Sylow p ↥Es) := inferInstance
    have hpσ : p ∉ S10.sigma Mstar := ((mem_tau3_iff Mstar p).mp hτ3).1
    have hEscard : (Nat.card ↥Es).factorization p = (Nat.card ↥Mstar).factorization p := by
      have hnorm : ((S10.Msigma Mstar).subgroupOf Mstar).Normal := by
        rw [S10.Msigma_subgroupOf]; infer_instance
      have hmul := card_normal_sup_mul_card_inf (S10.Msigma_le Mstar) hs.E_le hnorm
      rw [hs.E_compl_sup, hs.E_compl_inf, Subgroup.card_bot, mul_one] at hmul
      have hpMsig : ¬ p ∣ Nat.card ↥(S10.Msigma Mstar) := fun hd =>
        hpσ (S10.Msigma_isPiGroup Mstar p
          (Nat.mem_primeFactors.mpr ⟨Fact.out, hd, Nat.card_pos.ne'⟩))
      rw [hmul, Nat.factorization_mul Nat.card_pos.ne' Nat.card_pos.ne', Finsupp.add_apply,
        Nat.factorization_eq_zero_of_not_dvd hpMsig, zero_add]
    refine ⟨(PE : Subgroup ↥Es).map Es.subtype, (Subgroup.map_subtype_le _).trans hs.E_le,
      PE.isPGroup'.of_equiv (Subgroup.equivMapOfInjective _ _ Es.subtype_injective), ?_, ?_⟩
    · rw [Subgroup.card_map_of_injective Es.subtype_injective, Sylow.card_eq_multiplicity PE,
        hEscard]
    · exact (sylow_le_derived_of_mem_tau3 hG hs hτ3 PE).1.trans (derivedInG_le_derivedInG hs.E_le)

/-- The foundation Sylow `S ⊆ M*'` lies in `K_a = O_{α(M*)∪{p}}(M*')`. If `p ∈ α(M*)` then
`S ⊆ M*_α ⊆ K_a`; otherwise `M*_α ⊔ S ⊴ M*'` (`M*'/M*_α` nilpotent + `normal_sup_sylow`), a
`{α(M*)∪{p}}`-group, hence `⊆ K_a`. -/
theorem sylow_le_opiCoreInG_alpha_p [Finite G] (hG : IsMinimalSimpleOdd G)
    {Mstar : Subgroup G} (hMstar : Mstar ∈ maximalSubgroups G) {p : ℕ} [Fact p.Prime]
    {S : Subgroup G} (hS_le_deriv : S ≤ derivedInG Mstar)
    (hScard : Nat.card ↥S = p ^ (Nat.card ↥Mstar).factorization p) :
    S ≤ opiCoreInG (S10.alpha Mstar ∪ {p}) (derivedInG Mstar) := by
  classical
  set D := derivedInG Mstar with hDdef
  have hDM : D ≤ Mstar := Subgroup.map_subtype_le _
  have hMαD : S10.Malpha Mstar ≤ D :=
    (S10.Malpha_le_Msigma hG hMstar).trans (S10.Msigma_le_derived hG hMstar)
  have hMαnorm : ((S10.Malpha Mstar).subgroupOf D).Normal :=
    (Subgroup.normal_subgroupOf_iff_le_normalizer hMαD).mpr
      (hDM.trans (le_normalizer_opiCoreInG (S10.alpha Mstar) Mstar))
  by_cases hpα : p ∈ S10.alpha Mstar
  · -- `p ∈ α(M*)`: `S ⊆ M*_α ⊆ K_a`.
    have hSMstar : S ≤ Mstar := hS_le_deriv.trans hDM
    have hSαsub : Ch03.Subgroup.IsPiGroup (S10.alpha Mstar) (S.subgroupOf Mstar) := by
      intro r hr
      rw [Nat.card_congr (Subgroup.subgroupOfEquivOfLe hSMstar).toEquiv, hScard] at hr
      have hr_prime := Nat.prime_of_mem_primeFactors hr
      have : r = p := (Nat.prime_dvd_prime_iff_eq hr_prime Fact.out).mp
        (hr_prime.dvd_of_dvd_pow (Nat.mem_primeFactors.mp hr).2.1)
      rw [this]; exact hpα
    have hsub := S10.isPiGroup_le_of_normal_isHallSubgroup
      (S10.Malpha_subgroupOf_isHall_of_isHall (S10.Malpha_isHall hG hMstar)) hSαsub
    have h2 := Subgroup.map_mono (f := Mstar.subtype) hsub
    rw [Subgroup.map_subgroupOf_eq_of_le hSMstar,
      Subgroup.map_subgroupOf_eq_of_le (S10.Malpha_le Mstar)] at h2
    exact h2.trans (le_opiCoreInG_of_normal_of_isPiSubgroup hMαD hMαnorm
      (fun r hr => Or.inl (S10.Malpha_isPiGroup Mstar r hr)))
  · -- `p ∉ α(M*)`: `M*_α ⊔ S ⊴ M*'`, a `{α∪p}`-group containing `S`.
    have hDp : (Nat.card ↥Mstar).factorization p = (Nat.card ↥D).factorization p :=
      le_antisymm
        ((Nat.Prime.pow_dvd_iff_le_factorization Fact.out Nat.card_pos.ne').mp
          (hScard ▸ Subgroup.card_dvd_of_le hS_le_deriv))
        ((Nat.Prime.pow_dvd_iff_le_factorization Fact.out Nat.card_pos.ne').mp
          ((Nat.ordProj_dvd _ p).trans (Subgroup.card_dvd_of_le hDM)))
    have hScardD : Nat.card ↥(S.subgroupOf D) = p ^ (Nat.card ↥D).factorization p := by
      rw [Nat.card_congr (Subgroup.subgroupOfEquivOfLe hS_le_deriv).toEquiv, hScard, hDp]
    set Q : Sylow p ↥D := Sylow.ofCard (S.subgroupOf D) hScardD with hQdef
    have hQmap : (Q : Subgroup ↥D).map D.subtype = S := by
      rw [hQdef, Sylow.coe_ofCard, Subgroup.subgroupOf_map_subtype, inf_eq_left.mpr hS_le_deriv]
    have hNp' : ¬ p ∣ Nat.card ↥((S10.Malpha Mstar).subgroupOf D) := by
      rw [Nat.card_congr (Subgroup.subgroupOfEquivOfLe hMαD).toEquiv]
      exact fun hdvd => hpα (S10.Malpha_isPiGroup Mstar p
        (Nat.mem_primeFactors.mpr ⟨Fact.out, hdvd, Nat.card_pos.ne'⟩))
    have hSupNorm : ((S10.Malpha Mstar).subgroupOf D ⊔ (Q : Subgroup ↥D)).Normal :=
      S10.normal_sup_sylow_of_quotient_nilpotent
        (derivedQuotientMalpha_isNilpotent hG hMstar) hNp' Q
    set MaS : Subgroup G :=
      ((S10.Malpha Mstar).subgroupOf D ⊔ (Q : Subgroup ↥D)).map D.subtype with hMaSdef
    have hMaS_le_D : MaS ≤ D := Subgroup.map_subtype_le _
    have hMaS_norm : (MaS.subgroupOf D).Normal := by
      rw [hMaSdef, Subgroup.subgroupOf, Subgroup.comap_map_eq_self_of_injective D.subtype_injective]
      exact hSupNorm
    have hMaS_pi : Subgroup.IsPiSubgroup (S10.alpha Mstar ∪ {p}) MaS := by
      intro r hr
      rw [hMaSdef, Subgroup.card_map_of_injective D.subtype_injective] at hr
      have hdvd : Nat.card ↥((S10.Malpha Mstar).subgroupOf D ⊔ (Q : Subgroup ↥D)) ∣
          Nat.card ↥((S10.Malpha Mstar).subgroupOf D) * Nat.card ↥(Q : Subgroup ↥D) := by
        have hform := Subgroup.card_HK_mul_card_inf_eq_card_mul_card
          ((S10.Malpha Mstar).subgroupOf D) (Q : Subgroup ↥D)
        rw [show (↑((S10.Malpha Mstar).subgroupOf D) * ↑(Q : Subgroup ↥D) : Set ↥D)
            = ↑((S10.Malpha Mstar).subgroupOf D ⊔ (Q : Subgroup ↥D)) from
            (Subgroup.normal_mul _ _).symm] at hform
        exact ⟨_, hform.symm⟩
      have hr_prime := Nat.prime_of_mem_primeFactors hr
      rcases (Nat.Prime.dvd_mul hr_prime).mp ((Nat.mem_primeFactors.mp hr).2.1.trans hdvd)
        with hα | hq
      · refine Or.inl (S10.Malpha_isPiGroup Mstar r (Nat.mem_primeFactors.mpr ⟨hr_prime, ?_,
          Nat.card_pos.ne'⟩))
        rwa [Nat.card_congr (Subgroup.subgroupOfEquivOfLe hMαD).toEquiv] at hα
      · obtain ⟨k, hk⟩ := IsPGroup.iff_card.mp Q.isPGroup'
        exact Or.inr (Set.mem_singleton_iff.mpr
          ((Nat.prime_dvd_prime_iff_eq hr_prime Fact.out).mp (hr_prime.dvd_of_dvd_pow (hk ▸ hq))))
    have hS_le_MaS : S ≤ MaS :=
      hQmap ▸ Subgroup.map_mono (le_sup_right : (Q : Subgroup ↥D) ≤ _)
    exact hS_le_MaS.trans (le_opiCoreInG_of_normal_of_isPiSubgroup hMaS_le_D hMaS_norm hMaS_pi)

/-- `⁅K, H⁆ ≤ K` whenever `K ⊴ H` (`K.subgroupOf H` normal in `↥H`). Generalises
`Msigma_commutator_M_le`. -/
theorem commutator_le_of_subgroupOf_normal {H K : Subgroup G} (hKH : K ≤ H)
    [(K.subgroupOf H).Normal] : ⁅K, H⁆ ≤ K := by
  classical
  have h1 : ⁅K.subgroupOf H, (⊤ : Subgroup ↥H)⁆ ≤ K.subgroupOf H := Subgroup.commutator_le_left _ _
  have h2 := Subgroup.map_mono (f := H.subtype) h1
  rwa [Subgroup.map_commutator, Subgroup.map_subgroupOf_eq_of_le hKH,
    ← MonoidHom.range_eq_map, Subgroup.range_subtype] at h2

/-- **BG Lemma 13.1(a)** (mmd L3542): under the Lemma 13.1 hypotheses (`p ∉ τ₁(M*)`,
`p ∉ τ₂(M*)`), every `p`-subgroup `P` of `M ⊓ M*` centralizes `M_σ ⊓ M*`. Let
`K_a = O_{α(M*)∪{p}}(M*') ⊴ M*`; a Sylow `p` of `M*` lies in `K_a` (`sylow_le_opiCoreInG_alpha_p`),
so `p ∤ [M* : K_a]` and `P ⊆ K_a`. As `α(M*) ∩ σ(M) = ∅` and `p ∉ σ(M)`, `K_a` is a `σ(M)'`-group,
so `M_σ ⊓ K_a = ⊥` and `⁅M_σ ⊓ M*, P⁆ ⊆ M_σ ⊓ K_a = ⊥`. -/
theorem pSubgroup_centralizes_Msigma_inf [Finite G] (hG : IsMinimalSimpleOdd G)
    {M E E₁ E₂ E₃ : Subgroup G} (h : SubgroupESetup M E E₁ E₂ E₃) {p : ℕ} [Fact p.Prime]
    {Mstar : Subgroup G} (hMstar : Mstar ∈ maximalSubgroups G)
    (hpE : p ∈ (Nat.card ↥E).primeFactors) (hpMstar : p ∈ (Nat.card ↥Mstar).primeFactors)
    (hpτ1 : p ∉ tau1 Mstar) (hpτ2 : p ∉ tau2 Mstar)
    (hnc : ¬ ∃ g : G, MulAut.conj g • M = Mstar)
    {P : Subgroup G} (hPM : P ≤ M ⊓ Mstar) (hPp : IsPGroup p ↥P) :
    P ≤ Subgroup.centralizer ((S10.Msigma M ⊓ Mstar : Subgroup G) : Set G) := by
  classical
  obtain ⟨S, _, _, hScard, hS_le_deriv⟩ :=
    exists_sylow_le_derivedInG_of_not_tau1_tau2 hG hMstar hpMstar hpτ1 hpτ2
  have hDM : derivedInG Mstar ≤ Mstar := Subgroup.map_subtype_le _
  set Ka : Subgroup G := opiCoreInG (S10.alpha Mstar ∪ {p}) (derivedInG Mstar) with hKadef
  have hKaM : Ka ≤ Mstar := (Subgroup.map_subtype_le _).trans hDM
  have hKa_norm : (Ka.subgroupOf Mstar).Normal :=
    (Subgroup.normal_subgroupOf_iff_le_normalizer hKaM).mpr
      (le_normalizer_opiCoreInG_of_le_normalizer (S10.alpha Mstar ∪ {p})
        (S10.le_normalizer_derivedInG Mstar))
  have hKa_pi : Subgroup.IsPiSubgroup (S10.alpha Mstar ∪ {p}) Ka :=
    isPiSubgroup_opiCoreInG _ _
  have hS_le_Ka : S ≤ Ka := sylow_le_opiCoreInG_alpha_p hG hMstar hS_le_deriv hScard
  have hKaP : Nat.card ↥(Ka.subgroupOf Mstar) = Nat.card ↥Ka :=
    Nat.card_congr (Subgroup.subgroupOfEquivOfLe hKaM).toEquiv
  -- `p ∤ [M* : K_a]`: `|K_a|_p = |M*|_p` (`S ⊆ K_a`, `|S| = |M*|_p`).
  have hpindex : ¬ p ∣ (Ka.subgroupOf Mstar).index := by
    have heq : (Nat.card ↥Ka).factorization p = (Nat.card ↥Mstar).factorization p :=
      le_antisymm
        ((Nat.factorization_le_iff_dvd Nat.card_pos.ne' Nat.card_pos.ne').mpr
          (Subgroup.card_dvd_of_le hKaM) p)
        ((Nat.Prime.pow_dvd_iff_le_factorization Fact.out Nat.card_pos.ne').mp
          (hScard ▸ Subgroup.card_dvd_of_le hS_le_Ka))
    intro hdvd
    have hcong : (Nat.card ↥(Ka.subgroupOf Mstar) * (Ka.subgroupOf Mstar).index).factorization p
        = (Nat.card ↥Mstar).factorization p := by rw [Subgroup.card_mul_index]
    rw [Nat.factorization_mul Nat.card_pos.ne' Subgroup.index_ne_zero_of_finite,
      Finsupp.add_apply, hKaP, heq] at hcong
    have hidx : 0 < (Ka.subgroupOf Mstar).index.factorization p :=
      (Fact.out : p.Prime).factorization_pos_of_dvd Subgroup.index_ne_zero_of_finite hdvd
    omega
  -- `P ⊆ K_a`: the image of `P` in `↥M* ⧸ K_a` is a `p`-group of order prime to `p`, hence trivial.
  have hPMstar : P ≤ Mstar := hPM.trans inf_le_right
  have hP_le_Ka : P ≤ Ka := by
    have himg_pg : IsPGroup p ↥((P.subgroupOf Mstar).map
        (QuotientGroup.mk' (Ka.subgroupOf Mstar))) :=
      (hPp.of_equiv (Subgroup.subgroupOfEquivOfLe hPMstar).symm).map _
    have himg_dvd : Nat.card ↥((P.subgroupOf Mstar).map
        (QuotientGroup.mk' (Ka.subgroupOf Mstar))) ∣ (Ka.subgroupOf Mstar).index :=
      Subgroup.card_subgroup_dvd_card _
    have himg_card1 : Nat.card ↥((P.subgroupOf Mstar).map
        (QuotientGroup.mk' (Ka.subgroupOf Mstar))) = 1 := by
      obtain ⟨k, hk⟩ := IsPGroup.iff_card.mp himg_pg
      rw [hk]
      rcases Nat.eq_zero_or_pos k with hk0 | hk0
      · rw [hk0, pow_zero]
      · exact absurd (hk ▸ himg_dvd)
          (fun hd => hpindex (dvd_trans (dvd_pow_self p hk0.ne') hd))
    have hsub : P.subgroupOf Mstar ≤ Ka.subgroupOf Mstar := by
      have hbot := Subgroup.card_eq_one.mp himg_card1
      rw [Subgroup.map_eq_bot_iff, QuotientGroup.ker_mk'] at hbot
      exact hbot
    have h2 := Subgroup.map_mono (f := Mstar.subtype) hsub
    rwa [Subgroup.map_subgroupOf_eq_of_le hPMstar,
      Subgroup.map_subgroupOf_eq_of_le hKaM] at h2
  -- `M_σ ⊓ K_a = ⊥` (`K_a` is a `σ(M)'`-group).
  have hnc' : ¬ ∃ g : G, MulAut.conj g • Mstar = M := by
    rintro ⟨g, hg⟩
    exact hnc ⟨g⁻¹, by rw [← hg, ← mul_smul, ← map_mul, inv_mul_cancel, map_one, one_smul]⟩
  have hασ : S10.alpha Mstar ∩ S10.sigma M = ∅ :=
    (S10.disjoint_of_not_conj hG hMstar h.mem_maximal hnc').1.2
  have hpσM : p ∉ S10.sigma M := h.not_mem_sigma_of_mem_primeFactors hG hpE
  have hKa_pi' : Subgroup.IsPiSubgroup (S10.sigma M)ᶜ Ka := by
    intro r hr
    rcases hKa_pi r hr with hα | hp'
    · exact fun hrσ => Set.eq_empty_iff_forall_notMem.mp hασ r ⟨hα, hrσ⟩
    · rw [Set.mem_singleton_iff] at hp'; rw [hp']; exact hpσM
  have hinf_bot : S10.Msigma M ⊓ Ka = ⊥ :=
    (Subgroup.disjoint_of_coprime_natCard
      (coprime_card_of_isPiSubgroup_of_isPiSubgroup_compl (S10.Msigma_isPiGroup M) hKa_pi')).eq_bot
  -- `⁅M_σ ⊓ M*, P⁆ ⊆ M_σ ⊓ K_a = ⊥`.
  have hcomm_Msig : ⁅S10.Msigma M ⊓ Mstar, P⁆ ≤ S10.Msigma M :=
    (Subgroup.commutator_mono inf_le_left (hPM.trans inf_le_left)).trans
      (Msigma_commutator_M_le M)
  have hcomm_Ka : ⁅S10.Msigma M ⊓ Mstar, P⁆ ≤ Ka := by
    rw [Subgroup.commutator_comm]
    exact (Subgroup.commutator_mono hP_le_Ka inf_le_right).trans
      (commutator_le_of_subgroupOf_normal hKaM)
  have hcomm_bot : ⁅S10.Msigma M ⊓ Mstar, P⁆ = ⊥ :=
    le_bot_iff.mp (hinf_bot ▸ le_inf hcomm_Msig hcomm_Ka)
  exact Subgroup.commutator_eq_bot_iff_le_centralizer.mp
    (Subgroup.commutator_comm (S10.Msigma M ⊓ Mstar) P ▸ hcomm_bot)

end OddOrder.BG.Ch3.S13
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/BG/Ch3_MaximalSubgroups/S13_Lemma131.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