Bipartiteness of the fixed-p=13 LPS Cayley graph on PGL₂
ProvedOPG37364.lps13Graph_bipartiteLet be prime and choose with . Consider the fixed- graph OPG37364.lps13Graph, on with the fourteen norm- quaternion generators specified in Definitions.Def_opg37364_lps13. If is a quadratic nonresidue modulo , then this graph is bipartite: there is a Boolean coloring of its projective vertices for which the endpoints of every edge have different colors.
The coloring records whether the determinant of a matrix representative is a square. This is well-defined because multiplying a representative by a nonzero scalar multiplies its determinant by a square. Every generator has determinant , so multiplication by a generator exchanges the two colors. The formal hypothesis is legendreSym q 13 = -1, with as the modulus. No connectedness assumption is required.
This is a formalization of the classical determinant-square-class bipartition for the LPS construction, specialized to the existing fixed- graph.
import Definitions.Def_opg37364_lps13 import Mathlib.NumberTheory.LegendreSymbol.Basic set_option autoImplicit false
namespace OPG37364
theorem lps13Graph_bipartite {q : ℕ} [Fact q.Prime]
(hq : 13 < q) (i : LPS13Root q) (hnr : legendreSym q 13 = -1) :
IsBipartite (lps13Graph hq i) := by sorry
end OPG37364