Prime divisors of the index of the normal core
ProvedSubnormalCover.primeFactors_normalCore_indexLet be a subnormal subgroup of finite index of a group , and let be its normal core, the largest normal subgroup of contained in . Then the finite quotient and the index have exactly the same prime divisors: . The inclusion is free for any subgroup, since divides ; the reverse inclusion is the content, and it follows from Lemma 2.1 applied to the conjugates , whose intersection is and each of which is subnormal of index . Formalization note: is written H.normalCore.index, which is definitionally Nat.card (G ⧸ H.normalCore); the finite-index hypothesis guarantees also has finite index (Subgroup.finiteIndex_normalCore), so neither Nat.primeFactors argument is the junk value .
import Mathlib
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 SubnormalCoverRead-back
What the Lean code literally says, in plain math · claude-opus-5
Setting. Let be a type in an arbitrary universe equipped with a group structure (no finiteness or other restriction on ), and let be a subgroup of .
Hypotheses. Two ordinary hypotheses:
- is subnormal: Mathlib's
Subgroup.IsSubnormalis the inductive predicate generated by " is subnormal" together with "if , is subnormal, and viewed inside is normal in , then is subnormal"; equivalently there is a finite chain , each term normal in the next. - has finite index: the class
Subgroup.FiniteIndexsupplied as a hypothesis, whose sole content is , where is the number of left cosets of , equal to by convention when is infinite. So the hypothesis says is finite.
Conclusion. The two finite sets of prime numbers
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:
- denotes Mathlib's
Subgroup.normalCore H, the subgroup , i.e. the largest normal subgroup of contained in (equivalently ); - , again if that coset space is infinite;
-
Nat.primeFactors n, the finite set of prime numbers dividing , with the conventions and .
Degenerate cases. Nothing in the statement asserts that is nonzero; if had infinite index its index would be the junk value with , and the asserted equality would then force , i.e. (as is assumed). In particular the equality carries no information about the sizes of the two indices, only about which primes occur in each. If then both sides are and the claim is trivially true. The statement uses only standard Mathlib notions; none of the accompanying platform definitions appear in it.
Confirmed by the mission captain (proposal self-audit).