Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Prime divisors of the index of the normal core

Proved
SubnormalCover.primeFactors_normalCore_index

by burkh4rt · Sep 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsgroup-theory

Let HHH be a subnormal subgroup of finite index of a group GGG, and let HGH_GHG​ be its normal core, the largest normal subgroup of GGG contained in HHH. Then the finite quotient G/HGG/H_GG/HG​ and the index [G:H][G:H][G:H] have exactly the same prime divisors: P(∣G/HG∣)=P([G:H])P(|G/H_G|)=P([G:H])P(∣G/HG​∣)=P([G:H]). The inclusion P([G:H])⊆P(∣G/HG∣)P([G:H])\subseteq P(|G/H_G|)P([G:H])⊆P(∣G/HG​∣) is free for any subgroup, since [G:H][G:H][G:H] divides [G:HG][G:H_G][G:HG​]; the reverse inclusion is the content, and it follows from Lemma 2.1 applied to the conjugates aiHai−1a_iHa_i^{-1}ai​Hai−1​, whose intersection is HGH_GHG​ and each of which is subnormal of index [G:H][G:H][G:H]. Formalization note: ∣G/HG∣|G/H_G|∣G/HG​∣ is written H.normalCore.index, which is definitionally Nat.card (G ⧸ H.normalCore); the finite-index hypothesis guarantees HGH_GHG​ also has finite index (Subgroup.finiteIndex_normalCore), so neither Nat.primeFactors argument is the junk value 000.

Preamble
import Mathlib
Formal statement
namespace SubnormalCover

/-- **Sun, Lemma 2.2 / equation (2.2).**

If `H` is a *subnormal* subgroup of finite index of a group `G`, then the order of the quotient
`G / H_G` by the normal core `H_G` of `H` has exactly the same prime divisors as the index
`[G : H]`, i.e. `P(|G / H_G|) = P([G : H])`.

Here `|G / H_G|` is spelled `H.normalCore.index`, which is definitionally `Nat.card (G ⧸ H.normalCore)`.
The inclusion `P([G : H]) ⊆ P(|G / H_G|)` holds for every subgroup, since `[G : H]` divides
`[G : H_G]`; subnormality is what makes the reverse inclusion true. -/
theorem primeFactors_normalCore_index {G : Type*} [Group G] (H : Subgroup G)
    (hsn : H.IsSubnormal) (hfin : H.FiniteIndex) :
    H.normalCore.index.primeFactors = H.index.primeFactors := by
  sorry

end SubnormalCover
Source
Z.-W. Sun, On the Herzog-Schönheim conjecture for uniform covers of groups, J. Algebra 273 (2004) 153-175, https://doi.org/10.1016/S0021-8693(03)00526-X, Lemma 2.2, eq. (2.2)
Read-back

What the Lean code literally says, in plain math · claude-opus-5

Setting. Let GGG be a type in an arbitrary universe equipped with a group structure (no finiteness or other restriction on GGG), and let HHH be a subgroup of GGG.

Hypotheses. Two ordinary hypotheses:

  • HHH is subnormal: Mathlib's Subgroup.IsSubnormal is the inductive predicate generated by "⊤\top⊤ is subnormal" together with "if H≤KH \le KH≤K, KKK is subnormal, and HHH viewed inside KKK is normal in KKK, then HHH is subnormal"; equivalently there is a finite chain H=H0⊴H1⊴⋯⊴Hn=GH = H_0 \trianglelefteq H_1 \trianglelefteq \cdots \trianglelefteq H_n = GH=H0​⊴H1​⊴⋯⊴Hn​=G, each term normal in the next.
  • HHH has finite index: the class Subgroup.FiniteIndex supplied as a hypothesis, whose sole content is [G:H]≠0[G : H] \neq 0[G:H]=0, where [G:H]:=Nat.card(G/H)[G : H] := \mathrm{Nat.card}(G/H)[G:H]:=Nat.card(G/H) is the number of left cosets of HHH, equal to 000 by convention when G/HG/HG/H is infinite. So the hypothesis says G/HG/HG/H is finite.

Conclusion. The two finite sets of prime numbers

P([G:HG])andP([G:H])\mathcal{P}\big([G : H_G]\big) \quad\text{and}\quad \mathcal{P}\big([G : H]\big)P([G:HG​])andP([G:H])

are equal as finite sets (equality in Finset ℕ, hence mutual inclusion in both directions, not merely one inclusion and not a statement about multiplicities or exponents). Here:

  • HGH_GHG​ denotes Mathlib's Subgroup.normalCore H, the subgroup {a∈G:bab−1∈H for all b∈G}\{a \in G : b a b^{-1} \in H \text{ for all } b \in G\}{a∈G:bab−1∈H for all b∈G}, i.e. the largest normal subgroup of GGG contained in HHH (equivalently ⋂g∈GgHg−1\bigcap_{g \in G} gHg^{-1}⋂g∈G​gHg−1);
  • [G:HG]=Nat.card(G/HG)[G : H_G] = \mathrm{Nat.card}(G / H_G)[G:HG​]=Nat.card(G/HG​), again 000 if that coset space is infinite;
  • P(n)=\mathcal{P}(n) = P(n)= Nat.primeFactors n, the finite set of prime numbers dividing nnn, with the conventions P(0)=∅\mathcal{P}(0) = \varnothingP(0)=∅ and P(1)=∅\mathcal{P}(1) = \varnothingP(1)=∅.

Degenerate cases. Nothing in the statement asserts that [G:HG][G : H_G][G:HG​] is nonzero; if HGH_GHG​ had infinite index its index would be the junk value 000 with P(0)=∅\mathcal{P}(0) = \varnothingP(0)=∅, and the asserted equality would then force P([G:H])=∅\mathcal{P}([G:H]) = \varnothingP([G:H])=∅, i.e. [G:H]=1[G:H] = 1[G:H]=1 (as [G:H]≠0[G:H] \neq 0[G:H]=0 is assumed). In particular the equality carries no information about the sizes of the two indices, only about which primes occur in each. If H=GH = GH=G then both sides are ∅\varnothing∅ and the claim is trivially true. The statement uses only standard Mathlib notions; none of the accompanying platform definitions appear in it.

Human review
  • Endorsed by Shuze Chen · Sep 14, 2026

  • Endorsed by burkh4rt · Sep 14, 2026

    Confirmed by the mission captain (proposal self-audit).

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