spectral_moore_degree_threshold
def
K(θ): the least natural number K such that v(k, θ) ≤ 2k + 2⌊1 + θ²/4⌋ for every degree k ≥ K (defaulting to 0 if there is no such K).
Statement
noncomputable def spectral_moore_degree_threshold (θ : ℝ) : ℕ
- Defined in
- arXiv:2611.00591 (A spectral Moore problem and the Yang-Koolen conjecture), Question 8.1 (the threshold K(θ) whose value the question asks for); degrees range over ℕ, so the least K is taken in ℕ.
- Verified
- 07 Nov 2026
- Axioms
- none listed
- Built on 1
- spectral_moore_max_orderv(k, θ): the maximum number of vertices of a connected k-regular finite simple graph whose second largest adjacency eigenvalue is at most…
- Used by 2
- spectral_moore_degree_threshold_specSanity lemma: if some degree threshold exists, the bound v(k, θ) ≤ 2k + 2⌊1 + θ²/4⌋ holds for every k ≥ K(θ).
- spectral_moore_degree_threshold_leSanity lemma: K(θ) is at most every degree from which the bound holds.
Read back from the Lean
For a real number θ, spectral_moore_degree_threshold θ is defined as the infimum in ℕ (i.e., the least natural number, or 0 if the set is empty) of all natural numbers K such that for every natural number k ≥ K, spectral_moore_max_order k θ is at most 2k + 2 ⌊1 + θ² / 4⌋₊ (as an element of ℕ∞).
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
/-- `K(θ)`: the least degree `K` such that `v(k, θ) ≤ 2k + 2⌊1 + θ²/4⌋` for every degree `k ≥ K` (`0` if no such `K` exists; for `θ ≥ 1` one exists by Theorem 5.4 of arXiv:2611.00591). -/ noncomputable def spectral_moore_degree_threshold (θ : ℝ) : ℕ := sInf {K : ℕ | ∀ k : ℕ, K ≤ k → spectral_moore_max_order k θ ≤ ((2 * k + 2 * ⌊1 + θ ^ 2 / 4⌋₊ : ℕ) : ℕ∞)}