Squared polynomial trace as weighted closed reduced-word counts for LPS13
ProvedOPG37364.lps13_squared_trace_eq_closed_reduced_word_countLet q>13 be prime, choose i in F_q with i²=-1, and let G be the existing fixed-p=13 LPS Cayley graph on PGL₂(F_q). Let A be its ordinary real adjacency matrix and N the number of vertices. Define P₀=1, P₁=X and P_{m+2}=X P_{m+1}-13 P_m. Let C_k count length-k words in the original fourteen generator indices with no adjacent conjugate pair and with projective product equal to the identity. Then, for every natural m,
The square on the left is matrix multiplication, not the square of the trace. The finite word model is Fin k → Fin 14 in the original generator order. This identity needs no connectedness, nonresiduosity, girth or spectral hypotheses and assumes no counting estimate. Its proof distinguishes B₂=A²−14I from P₂(A)=A²−13I, proves the continuation-factor-13 recurrence, and proves the polynomial square identity for all m.
import Definitions.Def_opg37364_lps13_trace set_option autoImplicit false open scoped Classical BigOperators
namespace OPG37364
theorem lps13_squared_trace_eq_closed_reduced_word_count
{q : ℕ} [Fact q.Prime] (hq : 13 < q) (i : LPS13Root q) (m : ℕ) :
Matrix.trace
((Polynomial.aeval ((lps13Graph hq i).adjMatrix ℝ)
(lps13NonbacktrackingPolynomial m))^2) =
(Fintype.card (LPS13Vertex q) : ℝ) * ∑ j ∈ Finset.range (m+1),
(13 : ℝ)^j * ∑ r ∈ Finset.range (m-j+1),
(lps13ClosedReducedWordCount hq i (2*r) : ℝ) := by sorry
end OPG37364