Lemma 3.4: two rescalings of a polynomial lower bound on the growth function
ProvedWolf.exists_const_pow_le_growthFunction_of_le_sub_and_of_le_mulLet be a finite subset of a group and its growth function. Two rescalings of a polynomial lower bound: if for all , with and fixed natural numbers, then for all and some ; and if for all , with , then for all and some .
import Definitions.Def_Chou_Growth import Definitions.Def_MilnorWolf_Growth import Mathlib
namespace Wolf
theorem exists_const_pow_le_growthFunction_of_le_sub_and_of_le_mul {Γ : Type*} [Group Γ] (S : Finset Γ) :
(∀ (r q : ℕ) (c : ℝ), 0 < c →
(∀ m : ℕ, 1 ≤ m → c * ((m : ℝ) - (r : ℝ)) ^ q ≤ (MilnorWolf.growthFunction S m : ℝ)) →
∃ c' : ℝ, 0 < c' ∧ ∀ m : ℕ, 1 ≤ m → c' * (m : ℝ) ^ q ≤ (MilnorWolf.growthFunction S m : ℝ)) ∧
(∀ (l q : ℕ) (c : ℝ), 0 < l → 0 < c →
(∀ m : ℕ, 1 ≤ m → c * ((l * m : ℕ) : ℝ) ^ q ≤ (MilnorWolf.growthFunction S (l * m) : ℝ)) →
∃ c'' : ℝ, 0 < c'' ∧ ∀ m : ℕ, 1 ≤ m → c'' * (m : ℝ) ^ q ≤ (MilnorWolf.growthFunction S m : ℝ)) := by
sorry
end Wolf
Read-back
What the Lean code literally says, in plain math · claude-opus-5
Read-back: exists_const_pow_le_growthFunction_of_le_sub_and_of_le_mul
Setting and the quantities involved
Fix a type (in an arbitrary universe) carrying a group structure, and a finite subset . The type and its group structure are supplied implicitly; the finite set is the one explicit datum the statement takes. Nothing else is assumed about : it is not assumed to generate , not assumed nonempty, and not assumed symmetric (closed under inversion). need not be finitely generated, finite, or infinite.
For a natural number , let
That is, is the closed ball of radius : the set of elements expressible as an ordered product of at most factors, each factor drawn from . The sequence of factors is a finite list, the product is taken in the listed order, and the case (the empty product) is permitted, so the identity element lies in for every , including ; indeed .
Let
be the number of elements of that ball. Because is finite, is a finite set for every , so is a genuine cardinality (the underlying cardinality operator would return the junk value on an infinite set, but that case cannot arise here). In particular for every , and .
Throughout, is compared against real numbers by regarding the natural number as a real number.
What is asserted
For every such and every finite , the assertion is the conjunction of the following two independent statements (A) and (B). They share no variables: the and of (A) are quantified separately from the and of (B).
(A)
For all natural numbers and , and all real numbers with :
if
then there exists a real number such that
Here is subtraction of real numbers — the naturals and are each converted to real numbers first and the difference is then a real number, possibly negative. It is not truncated subtraction of naturals. The exponent is a natural number, so means the -fold product of with itself, with the convention for every real (including and ).
(B)
For all natural numbers and , and all real numbers , with and :
if
then there exists a real number such that
In (B)'s hypothesis, both the polynomial and the ball radius are evaluated at the same product : the hypothesis is a lower bound at the points only, and says nothing at the radii that are not positive multiples of . The product is formed in the natural numbers and then converted to a real number as the base of the power.
The two conclusions of (A) and (B) are word-for-word the same statement; only the name given to the witnessing constant differs.
Precision, scope of the quantifiers, and degenerate cases
-
All inequalities are non-strict () where written , and strict () only in the positivity conditions , , , . The positivity of the constants is over the reals; is over the naturals, i.e. .
-
Radius is excluded from all four families of inequalities, since each is guarded by (over the naturals). So neither hypothesis nor conclusion says anything at .
-
The existential constants are merely asserted to exist, not to be unique, computable, or related to in any stated way. In (A), may depend on , , , , and on the hypothesis itself; in (B), may likewise depend on , , , , . No bound on or in terms of is claimed.
-
Order of quantifiers. In both parts, is fixed before everything else; then the numerical parameters are fixed; then the hypothesis is assumed; and only then is the constant produced. So a single constant is not claimed to work for all or all .
-
The case . Since for every real , (A)'s hypothesis degenerates to " for all " and its conclusion to " for all "; the shift drops out entirely. The same degeneration happens in (B), where the multiplier then only restricts which radii the hypothesis speaks about.
-
The case in (A), and in (B). In each, the hypothesis and the conclusion become literally the same inequality, so the implication is immediate with (respectively ).
-
Small radii in (A). For and the quantity is negative when is odd and positive when is even; at it is , so the hypothesis reads there and is automatic. Thus for odd the hypothesis carries no content at radii below , whereas for even it does.
-
The hypotheses may be impossible to satisfy, making the implications vacuous. For example, if then and for every ; then for any and any neither hypothesis can hold (the left side grows without bound). More generally, whenever is a bounded sequence — for instance when the subgroup generated by is finite — both implications are vacuously satisfied for every . The statement therefore has content only for those whose ball-counting function does admit such a lower bound.
-
What is compared. Every inequality compares a real number on the left with the natural number viewed as a real number on the right; the constant always multiplies the power, and the power's base is the radius (shifted by in (A)'s hypothesis, scaled by in (B)'s), never the constant.
-
No claim about itself — no monotonicity, no submultiplicativity, no upper bound, and no relation between the balls at different radii — is asserted anywhere; such properties appear neither as hypotheses nor as conclusions.
Confirmed by the mission captain (proposal self-audit).