The binary adjacency image is even and LCD
ProvedConway99Formal.BinaryCode.binary_adjacency_image_even_LCDcoding-theorygraph-theorystrongly-regular-graphs
Let be a finite simple graph with strongly regular parameters , and let be its actual adjacency matrix over . Then , every word in the image of has even weight, and the image has trivial intersection with its orthogonal complement under the standard dot product. The image condition is stated as an actual preimage under ; no rank, minimum-distance, or graph-existence conclusion is assumed.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem Conway99Formal.BinaryCode.binary_adjacency_image_even_LCD
{V : Type*} [Fintype V] [DecidableEq V]
(G : SimpleGraph V) [DecidableRel G.Adj]
(h : G.IsSRGWith 99 14 1 2) :
(G.adjMatrix (ZMod 2)) * (G.adjMatrix (ZMod 2)) = G.adjMatrix (ZMod 2) ∧
(∀ x : V → ZMod 2,
(G.adjMatrix (ZMod 2)).mulVec x ⬝ᵥ (G.adjMatrix (ZMod 2)).mulVec x = 0) ∧
(∀ u : V → ZMod 2,
(∃ x : V → ZMod 2, (G.adjMatrix (ZMod 2)).mulVec x = u) →
(∀ y : V → ZMod 2, u ⬝ᵥ (G.adjMatrix (ZMod 2)).mulVec y = 0) → u = 0) := by sorrySource
Frozen formal source `formalization/2026-10-03/binary-code/BinaryCode.lean`, revision `a45708acebe3f397faccb1b646be906f24f23ee5`, raw SHA-256 `1437e9cd690e050f604a603b7826fef50f4ef1f6c0d21ef32c66c9793cb943e4`; source theorem `Conway99Formal.BinaryCode.solution`, jointly expressing adjacency idempotence, image evenness, and image LCD. The claim inventory is `formalization/2026-10-03/binary-code/claims.json` (raw SHA-256 `da91d6e8c4f067a8b875575bda42404b754b53f1457b366f61e08a7b565b3156`). The formal-algebra suite passed as run `run-d599319567b6` on revision `a45708acebe3f397faccb1b646be906f24f23ee5`; this records source QA, while the standalone candidate awaits coordinator compilation. Packaged standalone solution SHA-256 `6092b5f684039b9ed8f13d5ab4e36a3be966c9a29799cc2e7ae613d164500e78`.