Connectedness of the fixed-13 LPS graph for sufficiently large primes
ProvedOPG37364.lps13Graph_connected_of_largecayley-graphconnectednessgraph-theorylps
Let be a prime with , and let satisfy . Suppose the Legendre symbol satisfies . Then the existing fixed- LPS Cayley graph on is connected.
The conclusion holds for every such choice of . The deliberately coarse threshold suffices for subsequent existence arguments.
Preamble
import Definitions.Def_opg37364_lps13 import Mathlib.NumberTheory.LegendreSymbol.Basic import Mathlib.Tactic set_option autoImplicit false
Formal statement
namespace OPG37364
theorem lps13Graph_connected_of_large
{q : ℕ} [Fact q.Prime] (hqLarge : 13^60 < q)
(i : LPS13Root q) (hnr : legendreSym q 13 = -1) :
IsConnected (lps13Graph (show 13 < q by omega) i) := by sorry
end OPG37364Source
Classical LPS/DSV connectedness, specialized to the existing fourteen norm-13 quaternion generators. Proof assembly uses the proved reduced-word separation bound and the prime-field metabelian consequence of Dickson classification. Original classification formalization: Qiuzhen-CFSG/CFSG, Apache-2.0, commit 96b2a02085dc678f3e0a97b334c31ada599c55fd, https://github.com/Qiuzhen-CFSG/CFSG/blob/96b2a02085dc678f3e0a97b334c31ada599c55fd/Glauberman/DicksonClassification.lean . arexychen contributes specialization, integration, target-environment replay and validation; no novelty claim for the classical mathematics.