The multiplicity inequality
ProvedSubnormalCover.lcm_le_indexMultiplicity_mul_sigmaLet () and be finite-index subgroups of a group , with every subnormal and normal in , and let be such that coincides with a union of left cosets of . Write , , , , and let be any upper bound for the multiplicities . Then case (a) of Sun's Theorem 3.2, eq. (3.8), states . Formalization note. Multiplying (3.8) by and using together with gives the equivalent denominator-free form stated here, ; the hypotheses and are not cosmetic, since the gcd over an empty index set is (which would truncate the natural-number division and make the claim false) and an infinite index would collapse both sides to .
import Mathlib import Definitions.Def_SubnormalCover_uniformCover open Pointwise
namespace SubnormalCover
theorem lcm_le_indexMultiplicity_mul_sigma {G : Type*} [Group G] {k : ℕ} (hk : 0 < k)
(K : Fin k → Subgroup G) (a : Fin k → G) (H : Subgroup G) [H.Normal]
(hHfin : H.index ≠ 0) (hKfin : ∀ i, (K i).index ≠ 0) (hsn : ∀ i, (K i).IsSubnormal)
(hunion : ∀ x ∈ ⋃ i, (a i) • (K i : Set G), ∀ y ∈ H,
x * y ∈ ⋃ i, (a i) • (K i : Set G))
(M : ℕ) (hM : ∀ m, indexMultiplicity K m ≤ M) :
coverLcm K ≤
M * Nat.gcd H.index (Finset.univ.gcd fun i => (K i).index) *
∑ d ∈ (coverLcm K / Finset.univ.gcd fun i => (K i).index).divisors, d := by
sorry
end SubnormalCoverRead-back
What the Lean code literally says, in plain math · claude-opus-5
Setting. Let be an arbitrary type carrying a group structure (no finiteness, commutativity or other assumption on ), and let be a natural number with (so the index type is nonempty). We are given:
- a family of subgroups (indexed by ; the are not assumed pairwise distinct, so the same subgroup may be repeated);
- a family of group elements ;
- a further subgroup which is assumed normal in (supplied as an instance hypothesis);
- the hypothesis , and the hypothesis that for every . Here denotes Mathlib's
Subgroup.index, defined as the cardinality of the set of left cosets of , with the convention that this cardinality is when is infinite; thus "" is exactly the statement " has finite index". In particular and for all ; - the hypothesis that every is subnormal in , in Mathlib's inductive sense: is subnormal, and if , is subnormal and is normal as a subgroup of , then is subnormal — equivalently there is a finite chain , each term normal in the next;
- a closure hypothesis on the union of the left cosets: writing (with the pointwise left translate ), for every and every we have . That is, is stable under right multiplication by ; nothing else relates to the , and nothing asserts that is all of or that the cosets are disjoint — the elements occur nowhere else in the statement;
- a natural number together with : for every natural number (ranging over all of , including and values not attained by any index), the multiplicity is . Since , taking forces ; for the multiplicity is by , so that instance is vacuous.
Conclusion. Put
both taken as the Finset lcm/gcd over all (the empty conventions , are not reachable here because ; with we have and ). Then the theorem asserts the single inequality
where all arithmetic is in : the product is parsed as , the quotient is natural-number (floor) division — here it happens to be exact, since divides each and each divides — and is Mathlib's finite set of positive divisors of , with and , so the sum is the classical divisor-sum (and would be on the unreachable input ).
Degenerate situations the statement allows. If every then all indices are , , , , , and the claim reduces to , which holds since . The hypothesis is satisfied outright by (then and ), a choice permitted whenever , i.e. whenever is finite; it is also satisfied by taking all and any . The subnormality hypothesis and the elements place no further constraint on the numerical quantities appearing in the conclusion beyond what is stated. No relation between and the family other than is assumed, and the case is excluded by .
Confirmed by the mission captain (proposal self-audit).