Row-profile census for diagonal- rows of an orbit-matrix candidate
ProvedConway99.diag_two_offdiag_profilecombinatoricsconway-99orbit-matrixstrongly-regular-graphs
Let be a matrix over satisfying the Conway99 orbit-matrix equations: is symmetric, every row sums to , and equals on the diagonal and off the diagonal. For a row with diagonal entry , the eight off-diagonal entries sum to with square-sum . Their value multiset is then exactly one of or , stated as fiber counts over the value classes through (larger entries are excluded by the square sum). In particular every diagonal- row contains an off-diagonal zero. This is the diagonal- case of the row-profile census feeding the trace- branch of Wilbrink's Theorem 5.
Preamble
import Mathlib.Data.Matrix.Basic import Mathlib.Algebra.BigOperators.Fin
Formal statement
open scoped BigOperators
namespace Conway99
/-
Row-profile census for diagonal-2 rows of a Conway99 orbit-matrix
candidate. Machine-verified census (2026-09-08): eight off-diagonal
entries with sum 12 and square-sum 28 form exactly the multisets
{0,0,1,1,2,2,3,3} or {0,1,1,1,1,2,2,4}. Stated as fiber counts over the
value classes 0..5 (entries above 5 are excluded by the square sum).
Research infrastructure for `no_orbit_matrix_ten_of_no_four`; not an
upload candidate until checked in the exact pinned environment.
-/
theorem diag_two_offdiag_profile
(C : Matrix (Fin 9) (Fin 9) ℕ) (hsymm : ∀ i j, C i j = C j i)
(hrow : ∀ i, ∑ j, C i j = 14)
(hsq : ∀ i j, (∑ k, C i k * C k j) + C i j = (if i = j then 12 else 0) + 22)
(i : Fin 9) (hi : C i i = 2) :
((((Finset.univ.erase i).filter (fun k => C i k = 0)).card = 2 ∧
((Finset.univ.erase i).filter (fun k => C i k = 1)).card = 2 ∧
((Finset.univ.erase i).filter (fun k => C i k = 2)).card = 2 ∧
((Finset.univ.erase i).filter (fun k => C i k = 3)).card = 2 ∧
((Finset.univ.erase i).filter (fun k => C i k = 4)).card = 0 ∧
((Finset.univ.erase i).filter (fun k => C i k = 5)).card = 0) ∨
(((Finset.univ.erase i).filter (fun k => C i k = 0)).card = 1 ∧
((Finset.univ.erase i).filter (fun k => C i k = 1)).card = 4 ∧
((Finset.univ.erase i).filter (fun k => C i k = 2)).card = 2 ∧
((Finset.univ.erase i).filter (fun k => C i k = 3)).card = 0 ∧
((Finset.univ.erase i).filter (fun k => C i k = 4)).card = 1 ∧
((Finset.univ.erase i).filter (fun k => C i k = 5)).card = 0)) := by sorry
end Conway99
Source
H. A. Wilbrink, 'On the (99,14,1,2) strongly regular graph', EUT Report 84-WSK-03, 1984, Theorem 5, pp. 350-354, https://pure.tue.nl/ws/files/2449333/256699.pdf ; row-moment census for the trace-10, no-four branch.