Scaling law for the totient measure of a divisor closure
ProvedBFFPyramidal.muMeasure_divisorClosure_image_mulFor every positive integer and every finite set of positive integers,
where , is the divisor closure and is the totient measure .
This scaling law is the arithmetic engine of the induction in Berger-Felzenbaum-Fraenkel: it converts a multiplicative change in a set of subgroup orders into a multiplicative change in the measure bounding the size of a union of cosets. For it reduces to Gauss's identity .
Formalization note. is R.image (fun m => k * m). Both hypotheses matter: , and every member of is positive (otherwise Nat.divisors 0 = ∅ makes the two sides disagree).
import Mathlib import Definitions.Def_BFFPyramidal_arithmetic
namespace BFFPyramidal
theorem muMeasure_divisorClosure_image_mul (k : ℕ) (hk : 0 < k) (R : Finset ℕ)
(hR : ∀ m ∈ R, 0 < m) :
muMeasure (divisorClosure (R.image (fun m => k * m)))
= k * muMeasure (divisorClosure R) := by
sorry
end BFFPyramidal
Read-back
What the Lean code literally says, in plain math · claude-opus-5
Read-back: BFFPyramidal.muMeasure_divisorClosure_image_mul
The vocabulary. All quantities live in the natural numbers (so every arithmetic operation below is natural-number arithmetic; no subtraction and no division occur anywhere in the statement, hence no truncation or division-by-zero junk values arise). Two auxiliary notions, both taken from the imported definitions file, must be unfolded.
For a finite set (a Finset, i.e. a duplicate-free finite listing of naturals), the divisor closure is
the finite union, taken inside , of the divisor sets of the members of . Here is Mathlib's Nat.divisors m, which is the set of positive divisors of with the convention : the element of , if present, contributes nothing at all to (in particular ever, and ). Also .
For a finite set , the measure is
the sum of Euler's totient over the (distinct) members of , with Mathlib's conventions and . Note .
(A third definition in the same imported file, the greatest prime factor , plays no role in this statement.)
The assertion. The declaration is a universally quantified statement with four explicit arguments, in this order, and no implicit or instance-implicit arguments beyond the ambient Mathlib typeclass machinery for :
- a natural number ;
- a proof of (i.e. ; strict inequality, so is excluded by hypothesis);
- a finite set ;
- a proof that every member of is strictly positive: (so ; this is a hypothesis about the members of only, imposing nothing else — may be empty, may be a singleton, may contain , and need not be closed under divisibility or under anything else).
Under these hypotheses the claim is the exact equation in
where denotes the image finite set (the image of under , with duplicates collapsed; since this map is injective, so ). Spelled out with all definitions unfolded, the claim is
Both unions are unions of sets, so a divisor lying in for two distinct members of is counted once only on each side, not once per member; the identity is therefore not a term-by-term claim about individual but a claim about the merged divisor sets.
Degenerate and boundary cases included by the quantifiers.
- satisfies the positivity hypothesis vacuously; then , both divisor closures are empty, and the equation reads , i.e. .
- is allowed: the equation reads , which is Gauss's totient identity .
- is allowed and makes the two sides syntactically the same quantity.
- The value never enters either summation, because for any ; and by hypothesis, and since and all are positive. So the convention is never exercised.
- The excluded case would give , hence and left side , while the right side is ; likewise, were allowed as a member of , it would contribute nothing to either side. In that sense the two side conditions and are not required to make the displayed equation come out true in those boundary configurations; both hypotheses are nonetheless present and must be supplied by any caller. Neither hypothesis is unsatisfiable: e.g. , satisfies both, so the statement is not vacuous.
Form of the artifact. The equality is stated as an equation between two natural numbers (not an inequality, not an equivalence), for all and all finite meeting the two conditions, with the order of quantification , then the positivity of , then , then the positivity of the members of . The file supplies no proof: the proof body is sorry, so the declaration is asserted as an axiom-like placeholder rather than established.
Confirmed by the mission captain (proposal self-audit).