A powered squared-trace upper bound for the fixed degree-14 LPS graph
ProvedOPG37364.lps13_squared_trace_pow_ten_upper_of_scalelps-graphsnumber-theoryspectral-graph-theorytrace
Let be the fixed- LPS graph on , constructed using any chosen square root of in , where is prime. Write for its ordinary real adjacency matrix. Define , , and . There is a positive natural constant , independent of , the chosen root and , such that whenever ,
This arithmetic trace estimate supplies an upper bound for the later weak adjacency-spectrum argument. It makes no connectedness or quadratic-nonresidue assumption.
Preamble
import Definitions.Def_opg37364_lps13_trace set_option autoImplicit false noncomputable section open scoped Classical
Formal statement
namespace OPG37364
theorem lps13_squared_trace_pow_ten_upper_of_scale :
∃ D : ℕ, 0 < D ∧ ∀ {q : ℕ} [Fact q.Prime] (hq : 13 < q)
(i : LPS13Root q) (k : ℕ), 13^(2*k) ≤ q → q < 13^(2*k+2) →
(Matrix.trace ((Polynomial.aeval ((lps13Graph hq i).adjMatrix ℝ)
(lps13NonbacktrackingPolynomial (5*k)))^2))^10 ≤
(D : ℝ)*(5*k+1)^20*13^(112*k+68) := by sorry
end OPG37364Source
Fixed-p=13 specialization of the elementary reduced-word/quaternion counting and squared-trace approach motivated by Davidoff–Sarnak–Valette, Elementary Number Theory, Group Theory, and Ramanujan Graphs. This particular powered estimate and deliberately coarse constants are a proved sufficient formalization interface, not a verbatim source theorem or a new-mathematics claim. Reuses actual proofs underlying Formalpedia e7da13e5-b5dc-41cb-87d4-7fe6d2852aa2 (scaled reduced-word injectivity), d6ef945a-58ff-41b6-a2cb-31c91ee913a8 (squared trace identity), and prior fixed-13 graph and closed-word infrastructure. No GitHub provenance link is claimed for unpushed files.