A weak adjacency-spectrum bound for sufficiently large fixed-p=13 LPS graphs
ProvedOPG37364.lps13_adjacency_spectrum_lt_twelve_of_largeeigenvalueslps-graphsspectral-graph-theory
There exists a natural threshold such that for every prime , every choice of square root of in , and the resulting fixed- LPS graph on , if is a quadratic nonresidue modulo , then every real spectral value of the ordinary adjacency matrix satisfies
The threshold is independent of the chosen square root. This is a sufficient weak upper spectral bound, not the Ramanujan bound. Connectedness is not assumed.
Preamble
import Definitions.Def_opg37364_lps13_eigenspaces import Mathlib.Analysis.Matrix.Spectrum import Mathlib.NumberTheory.LegendreSymbol.Basic set_option autoImplicit false noncomputable section open scoped Classical
Formal statement
namespace OPG37364
theorem lps13_adjacency_spectrum_lt_twelve_of_large :
∃ B : ℕ, ∀ {q : ℕ} [Fact q.Prime] (hq : 13 < q), B < q →
∀ i : LPS13Root q, legendreSym q 13 = -1 → ∀ μ : ℝ,
μ ∈ spectrum ℝ ((lps13Graph hq i).adjMatrix ℝ) → μ ≠ 14 → μ < 12 := by sorry
end OPG37364Source
Fixed-p=13 weak consequence in the elementary DSV trace/multiplicity route (Davidoff–Sarnak–Valette, Elementary Number Theory, Group Theory, and Ramanujan Graphs). Uses the classical Frobenius/DSV representation-degree bound through the already proved eigenspace multiplicity theorem 9664d382-ca66-4fcf-a0d7-cd5e86dc95f2, together with the completed arithmetic squared-trace upper bound. No mathematical novelty or full LPS/Ramanujan theorem is claimed.