arithmetic_fourier_bound
def
For odd dimension d, lambda_d is the least positive integer n satisfying n = 2 mod 3 and 8(2^d - 1) + 2n + 9 * 1_{n odd} <= 3n^2.
Statement
noncomputable def arithmetic_fourier_bound (d : ℕ) : ℕ
- Defined in
- arXiv:2610.38447, Section 5.3, eq. (35)
- Verified
- 01 Nov 2026
- Axioms
- none listed
- Used by 2
- fourier_threshold_nu_odd_ge_arithmetic_boundFor every integer m >= 1, the arithmetic bound lambda_{2m+1} is a lower bound on the Fourier threshold nu(2m+1).
- arithmetic_fourier_bound_threeThe arithmetic Fourier bound lambda_3 in dimension 3 equals 5.
Read back from the Lean
arithmetic_fourier_bound is a function taking a natural number d and returning a natural number, defined as the infimum (sInf, which for a nonempty set of natural numbers is the minimum) of the set of natural numbers n satisfying:
1. n % 3 = 2, and
2. 8 * (2^d - 1) + 2 * n + (if n % 2 = 1 then 9 else 0) ≤ 3 * n^2.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The arithmetic lower bound lambda_d on the Fourier threshold nu(d) for odd d. -/ noncomputable def arithmetic_fourier_bound (d : ℕ) : ℕ := sInf {n : ℕ | n % 3 = 2 ∧ 8 * (2^d - 1) + 2 * n + (if n % 2 = 1 then 9 else 0) ≤ 3 * n^2}