Remaining connectedness, girth and weak spectrum for the concrete LPS13 graphs
ProvedOPG37364.lps13_remaining_coreFor every integer there is a threshold such that the following holds. Let be prime, assume is a quadratic nonresidue modulo , and choose any with . Then the already-defined fixed- graph on is connected, has girth at least , and its real adjacency matrix satisfies
Here is precisely the graph in Definitions.Def_opg37364_lps13, using the fourteen norm- quaternion generators and right Cayley multiplication. The threshold is common to the three properties and is allowed to depend on . No numerical value for it is specified. The choice of a finite enumeration in the formal statement serves only to form the adjacency matrix.
This is the explicitly unresolved LPS core. Construction, -regularity, bipartiteness under the nonresidue hypothesis, and arbitrarily large suitable primes have separate completed proofs and are not included among its conclusions. The bound is a weaker sufficient consequence of the published LPS/DSV spectral estimates, not a claim that the full Ramanujan theorem has been formalized. No immunity, matching, cut-expansion or Markov-gap assertion is part of this statement.
import Definitions.Def_opg37364_lps13 import Mathlib.Combinatorics.SimpleGraph.AdjMatrix import Mathlib.Algebra.Algebra.Spectrum.Basic import Mathlib.NumberTheory.LegendreSymbol.Basic set_option autoImplicit false open scoped Classical
namespace OPG37364
theorem lps13_remaining_core :
∀ g : ℕ, 3 ≤ g →
∃ B : ℕ, ∀ (q : ℕ) [Fact q.Prime] (hq : 13 < q) (i : LPS13Root q),
B < q → legendreSym q 13 = -1 →
letI : Fintype (Matrix.ProjGenLinGroup (Fin 2) (ZMod q)) := Fintype.ofFinite _
IsConnected (lps13Graph hq i) ∧ HasGirthAtLeast (lps13Graph hq i) g ∧
(∀ μ : ℝ, μ ∈ spectrum ℝ ((lps13Graph hq i).adjMatrix ℝ) →
μ ≠ 14 → μ < 12) := by sorry
end OPG37364