13-primitivity of every reduced LPS13 quaternion word
ProvedOPG37364.lps13_reduced_word_not_all_coords_dvd13combinatoricslpsquaternions
Let w be any finite reduced word in the original fourteen integral norm-13 quaternion generators. Reduced means only that no letter is immediately followed by its conjugate generator. Write its ordered product as Q(w)=a₀+a₁i+a₂j+a₃k. Then
This holds for every word length, including the empty word. Thus every reduced word product is 13-primitive. No graph modulus occurs, and no cyclic reduction, pairwise distinctness, normal form, freeness, connectedness, girth or LPS theorem is assumed. The conclusion does not assert that the coordinate gcd is one or that quaternion factorization is unique.
Preamble
import Definitions.Def_opg37364_lps13_words set_option autoImplicit false
Formal statement
namespace OPG37364
theorem lps13_reduced_word_not_all_coords_dvd13
(w : List (Fin 14)) (h : lps13WordReduced w) :
¬ ((13 : ℤ) ∣ (lps13WordProduct w).re ∧
13 ∣ (lps13WordProduct w).imI ∧ 13 ∣ (lps13WordProduct w).imJ ∧
13 ∣ (lps13WordProduct w).imK) := by sorry
end OPG37364
Source
Classical reduced-word context: Davidoff–Sarnak–Valette, Definition 2.6.12 and Theorem 2.6.13 (printed pp.68–69), https://math.bme.hu/~gabor/oktatas/SztoM/DavidoffSarnakValette.pdf ; Xavier Dahan, Regular graphs of large girth and arbitrary degree, arXiv:1110.5259v4, Theorem 2.2, https://arxiv.org/pdf/1110.5259v4 . The fixed-modulus-13 outer-product proof used here is a direct implementation-oriented derivation. The supplied factor table is rechecked in Lean; it is not claimed to be a table or proof printed in those sources. No mathematical novelty or full unique-factorization claim is made.