Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A weak adjacency-spectrum bound for sufficiently large fixed-p=13 LPS graphs

Proved
OPG37364.lps13_adjacency_spectrum_lt_twelve_of_large

by arexychen · Sep 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

eigenvalueslps-graphsspectral-graph-theory

There exists a natural threshold BBB such that for every prime q>max⁡{B,13}q>\max\{B,13\}q>max{B,13}, every choice of square root of −1-1−1 in Fq\mathbb F_qFq​, and the resulting fixed-p=13p=13p=13 LPS graph GGG on PGL2(Fq)\mathrm{PGL}_2(\mathbb F_q)PGL2​(Fq​), if 131313 is a quadratic nonresidue modulo qqq, then every real spectral value μ\muμ of the ordinary adjacency matrix satisfies

μ≠14⟹μ<12.\mu\ne14\quad\Longrightarrow\quad\mu<12.μ=14⟹μ<12.

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 OPG37364
Source
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.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me