Pairing of two coclique vectors in one graph point frame
ProvedConway99Formal.CocliqueScore.graphCocliqueVector_pairing_20261004graph-theorylinear-algebra
Fix one graph G and one 44-dimensional real point frame Pi whose literal Gram is 27I−9A(G)+J. If C is an independent 22-set with exactly four neighbors in C for every outside vertex, and D is a 22-set in the same graph, then the pairing of their frame vectors equals (9|C∩D|−44)/7. This real identity does not assert that either vector belongs to a selected lattice or classify admitted intersections.
Preamble
import Definitions.Def_Conway99_Coclique_Overlap_20261004 open Matrix set_option autoImplicit false
Formal statement
theorem Conway99Formal.CocliqueScore.graphCocliqueVector_pairing_20261004 {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (Pi : Matrix (Fin 44) V ℝ) (hgram : Piᵀ * Pi = (27 : ℝ) • (1 : Matrix V V ℝ) - (9 : ℝ) • G.adjMatrix ℝ + Matrix.of 1) (C D : Finset V) (hCcard : C.card = 22) (hCind : ∀ v ∈ C, ∀ u ∈ C, ¬ G.Adj v u) (hCfour : ∀ u ∉ C, (C.filter fun v => G.Adj v u).card = 4) (hDcard : D.card = 22) : dotProduct (Conway99Formal.CocliqueScore.graphCocliqueVector Pi C) (Conway99Formal.CocliqueScore.graphCocliqueVector Pi D) = (9 * ((C ∩ D).card : ℝ) - 44) / 7 := by sorrySource
proofs/ROOT_COCLIQUE_COMPATIBILITY.md lines 168-184 in archive/clean-start/proof-library.zip, SHA-256 6cbe401d478b7e8627c81d6801585d5949ec254a5bee9878b1f9513cd0244772