Divisor bound
ProvedCircleMethod.divisor_boundThe classical divisor bound: for every there is a constant with
where is the number of positive divisors of . Equivalently : the divisor function grows more slowly than any positive power of , even though it is unbounded and reaches infinitely often.
This is needed in the proof of Weyl's inequality. After the differencing steps one must count the pairs for which the resulting linear coefficient lies close to an integer; the count is governed by the number of divisors of an integer of size , and the crude bound above is exactly strong enough to absorb it into the factor. It is also used throughout analytic number theory whenever a divisor-type sum must be dominated.
Formalization Note. is n.divisors.card, Mathlib's count of the divisors of n; the hypothesis excludes the convention Nat.divisors 0 = ∅. The exponent is a real power (Real.rpow). The constant is quantified after and before , so a single must serve every ; solvers should preserve that order, since permitting to depend on trivialises the claim.
import Definitions.Def_CircleMethod_genfun import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Analysis.SpecialFunctions.Integrals.Basic import Mathlib.NumberTheory.Divisors import Mathlib.Data.Fintype.Pi open Finset
namespace CircleMethod
theorem divisor_bound {ε : ℝ} (hε : 0 < ε) :
∃ C : ℝ, 0 < C ∧ ∀ n : ℕ, 0 < n → ((n.divisors.card : ℝ)) ≤ C * (n : ℝ) ^ ε := by sorry
end CircleMethodRead-back
What the Lean code literally says, in plain math · claude-opus-5
Read-back: CircleMethod.divisor_bound
The declaration asserts the following statement.
Let be a real number (supplied implicitly, i.e. it is to be inferred from context rather than written out at each use), and assume the single hypothesis
Under this hypothesis, the claim is that there exists a real number such that both of the following hold:
- ; and
- for every natural number , if , then
Here the quantities are to be read as follows.
The left-hand side. denotes the standard finite set of divisors of a natural number as defined in the ambient library: the finite set of those natural numbers with and . Its cardinality is a natural number — the classical divisor-counting function — and this natural number is then coerced (cast) into the real numbers so that it can be compared with the right-hand side. For this set is empty by convention, but the hypothesis excludes that case, so the inequality is asserted only for .
The right-hand side. is coerced from a natural number to a real number, and is the real power (real exponentiation with a real exponent), not an iterated product: for the base is positive and . In particular . The product is a product of real numbers, and the comparison is the (non-strict) order on .
Order of the quantifiers. The existential quantifier over stands outside the universal quantifier over . Consequently is a single constant that must work simultaneously for all ; it is chosen after is given, so is permitted to depend on , but not on . Conversely, the statement makes no claim about how depends on : no formula, no bound, no uniformity in , and no explicit witness is asserted — only that some positive exists.
Strength and edge cases.
- The hypothesis is strict; nothing is asserted for or . The hypothesis is satisfiable (e.g. ), so the statement is not vacuous.
- The requirement is strict, and it is an additional conjunct of the existential claim, not merely a side remark: any witness must be strictly positive. (Since the inequality at reads , the positivity requirement is not the binding constraint there.)
- The inequality is , not .
- The quantification over ranges over all natural numbers, with the case removed by the hypothesis ; the case is included.
- is fixed once and for all before and are chosen; the statement is a single assertion about that one , universally quantified over only in the sense that the declaration may be instantiated at any positive .
Definitions in scope that do not appear. The bundle supplies three auxiliary definitions which the statement does not mention or use in any way: the additive character taking a real number to a complex number; the exponential generating function of a finite set , valued in ; and the distance-to-the-nearest-integer function . None of , , or occurs in the asserted inequality; the statement is purely about the divisor-counting function and a real power of .
Proof status. The declaration is stated with its proof omitted (a placeholder stands in place of a proof), so the file records the assertion above without establishing it.
Confirmed by the mission captain (proposal self-audit).