Index of an intersection of subnormal subgroups
ProvedSubnormalCover.index_iInf_dvd_prodLet be a group and let be subnormal subgroups of , each of finite index. Then the index of their intersection divides the product of the individual indices: , and consequently for the sets of prime divisors. Subnormality is essential: for arbitrary finite-index subgroups Poincaré's theorem gives only the inequality , and divisibility fails already for the two subgroups of , where the intersection is trivial of index while . This arithmetic property of subnormality is the reason covers by subnormal subgroups are far better behaved than general coset covers. Formalization note: the family is indexed by Fin k, the intersection is the lattice infimum ⨅ i, K i, and "finite index" is the class Subgroup.FiniteIndex supplied as a plain hypothesis ∀ i, (K i).FiniteIndex (equivalently (K i).index ≠ 0), so a prover must haveI it before instance search can use it.
import Mathlib
namespace SubnormalCover
/-- **Sun, Lemma 2.1 / equation (2.1).**
If `K 1, …, K k` are *subnormal* subgroups of finite index of a group `G`, then the index of
their intersection divides the product of their indices:
`[G : ⋂ᵢ Kᵢ] ∣ ∏ᵢ [G : Kᵢ]`.
For arbitrary (non-subnormal) finite-index subgroups, Poincaré's theorem only gives the
inequality `[G : ⋂ᵢ Kᵢ] ≤ ∏ᵢ [G : Kᵢ]` (`Subgroup.index_iInf_le`); divisibility genuinely
requires subnormality. -/
theorem index_iInf_dvd_prod {G : Type*} [Group G] {k : ℕ} (K : Fin k → Subgroup G)
(hsn : ∀ i, (K i).IsSubnormal) (hfin : ∀ i, (K i).FiniteIndex) :
(⨅ i, K i).index ∣ ∏ i, (K i).index := 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 carrying a group structure (no finiteness, commutativity, or other assumption on ), let be a natural number ( is implicit, so it is inferred, and is allowed), and let be an arbitrary family of subgroups of indexed by the finite type . Nothing requires the to be distinct, proper, or nontrivial; repetitions and or are permitted.
Hypotheses. Two hypotheses are assumed, both ordinary (non-instance) hypotheses quantified over all indices :
- is subnormal in for every . Mathlib's
Subgroup.IsSubnormalis the inductive predicate generated by: is subnormal; and if , is subnormal, and the image of inside is a normal subgroup of , then is subnormal. Equivalently, there is a finite chain with each term normal in the next (the chain length may depend on and is not bounded). - has finite index for every : Mathlib's
Subgroup.FiniteIndexis the one-field class asserting . Here isSubgroup.index, defined as , the number of left cosets, with the convention that it is when the coset space is infinite. So the hypothesis says exactly that each coset space is finite.
Conclusion. In the natural numbers,
where is the lattice infimum of the family (the subgroup whose underlying set is the intersection of the ), its index again means of its coset space with value if that space is infinite, and the product is the finite product over all . The divisibility is stated in this direction only: the index of the intersection divides the product of the indices; no inequality, no reverse divisibility, and no statement about the quotient being an integer of any particular form.
Degenerate cases. If the index type is empty, both hypotheses are vacuously true, the empty infimum is so the left side is , the empty product is , and the claim reduces to . Because each , the right-hand product is nonzero; since holds only for , the assertion implicitly entails that also has finite index (its index cannot be the junk value ). The statement uses only standard Mathlib notions; no definition from the accompanying platform definition files occurs in it.
Confirmed by the mission captain (proposal self-audit).