The divisor-closure measure counts multiples below the index
ProvedSubnormalCover.muMeasure_divisorClosure_relIndexLet be a group and a subgroup of finite index, and let be subgroups of all containing . Then the totient measure of the divisor closure of the relative indices equals the number of residues below hit by one of the index-progressions:
The proof applies Lemma 3.2 to the family , , , using ; this converts the right-hand side of Sun's Theorem 3.1 into a purely group-theoretic quantity.
Formalization note. is H.relIndex (K i), which is in general, so the hypothesis hHK : ∀ i, H ≤ K i is what makes it mean (argument order confirmed by Subgroup.relIndex_mul_index : H ≤ K → H.relIndex K * K.index = H.index). Finiteness of is spelled H.index ≠ 0 rather than H.FiniteIndex, since Subgroup.index returns 0 for infinite index and the two are equivalent by Subgroup.finiteIndex_iff; the counting set is (Finset.range H.index).filter …, whose decidability instance is found automatically from Fin k being a fintype.
import Mathlib import Definitions.Def_BFFPyramidal_arithmetic
namespace SubnormalCover
open BFFPyramidal
theorem muMeasure_divisorClosure_relIndex {G : Type*} [Group G] (H : Subgroup G)
(hfin : H.index ≠ 0) {k : ℕ} (K : Fin k → Subgroup G) (hHK : ∀ i, H ≤ K i) :
muMeasure (divisorClosure (Finset.univ.image fun i => H.relIndex (K i)))
= ((Finset.range H.index).filter fun n => ∃ i, (K i).index ∣ n).card := by
sorry
end SubnormalCoverRead-back
What the Lean code literally says, in plain math · claude-opus-5
Setting. Let be a group (any type in any universe with a group structure), let be a subgroup, let be a natural number (an implicit argument, so it is inferred from but universally quantified), and let be a family of subgroups of indexed by .
Hypotheses.
- : . Here is Mathlib's
Subgroup.index, defined as the cardinality of the set of left cosets, with the convention that it equals when that set is infinite; so this hypothesis says exactly that has finite index (it is stated as a numeric disequality, not via theFiniteIndextypeclass), and in particular . - : for every index .
No finiteness assumption is imposed on itself, and none is imposed directly on the (whose indices would be by the same convention if they were of infinite index).
Conclusion. An equality of natural numbers:
where:
- is the finite set of natural numbers obtained as the image of the index family under the relative index. Mathlib's of in is the index of inside , i.e. , again by convention if that is infinite; under this is the ordinary index . Duplicate values collapse, so is a set, not a multiset.
- , the set of all positive divisors of members of , using Mathlib's with — so a member of (which would arise from an infinite relative index) contributes nothing to .
- The left-hand side is , the sum of Euler's totient over that divisor-closed set, each element counted once.
- The right-hand side counts the natural numbers in the range (note: is included and is excluded) that are divisible by for at least one .
Degenerate cases silently allowed. If the family is empty: , , the left side is ; the existential is false for every , so the right side is as well, and the statement reads . If , then always satisfies the filter (every natural number, including , divides ), so the right side is at least . The hypothesis rules out the range being taken over ; with (i.e. ) the range is . Nothing here mentions normality, subnormality, cosets other than through the index, or any covering condition.
Confirmed by the mission captain (proposal self-audit).