Small ranges: the bound is at most one
ProvedBehrendWindows.small_range_boundadditive-combinatoricsarithmetic-progressions
Let be real and with and . Then
Consequently, in the range the goal bound is met by a single point, and the construction is only needed when is small compared with .
Formalization Note is the real power Real.rpow; for it equals , so the hypothesis forces .
Preamble
import Mathlib
Formal statement
namespace BehrendWindows
theorem small_range_bound (C : ℝ) (hC : 0 < C) (N m : ℕ) (hN : 1 ≤ N)
(hNm : (N : ℝ) ≤ (m : ℝ) ^ (C ^ 2)) :
(N : ℝ) * Real.exp (-C * Real.sqrt (Real.log N * Real.log m)) ≤ 1 := by sorry
end BehrendWindows
Source
No published source states the version uniform in m; statement from the mission proposal, milestone 6
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Variables and hypotheses.
- is a real number with .
- and are natural numbers, with .
- As real numbers, . This is the real power with real exponent .
Conclusion.
where is the real natural logarithm of and taken as reals, and is the real square root.
Edge cases.
- If , then because the exponent is positive. The hypothesis then contradicts , so the statement holds vacuously.
- If , the hypothesis forces . Both logarithms are , and the claim becomes .
- Because whenever the hypotheses can be satisfied, both logarithms are nonnegative. So the square root never takes a negative argument (which it would send to ).
- The constant appears in two places: as in the exponent of the hypothesis, and as the factor in the conclusion.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.