Fourteen-regular fixed-p=13 LPS Cayley graph on PGL₂
ProvedOPG37364.lps13Graph_regular14Let be prime and choose with . Let be the projective images of the fourteen matrices
where ranges over and the six tuples with the nonzero imaginary coordinate in any of the three positions. Each matrix has determinant . Projectivization is in , modulo all nonzero scalar matrices.
Then the simple Cayley graph on this finite projective group, with edges for , is -regular: every vertex has exactly fourteen neighbors. The formal conclusion is the original OPG37364 set-cardinality predicate IsRegularOfDegree, using neighborSet.encard.
The proof establishes distinct projective images, exclusion of the identity and inverse closure through quaternion conjugation. The chosen root is a transparent parameter, not a graph-property assumption. For primes from the fixed-13 arithmetic selection lemma, supplies a root and identifies the PGL branch of the LPS construction. Nonresiduosity is unnecessary for regularity. Connectedness, bipartiteness, girth and spectral estimates are outside this theorem.
import Definitions.Def_opg37364_lps13 set_option autoImplicit false
namespace OPG37364
theorem lps13Graph_regular14 {q : ℕ} [Fact q.Prime]
(hq : 13 < q) (i : LPS13Root q) :
IsRegularOfDegree (lps13Graph hq i) 14 := by sorry
end OPG37364