Equal sign supports of a norm-sixteen integer eigenvector
ProvedConway99Formal.Norm16.norm16_integer_eigenvector_supportgraph-theoryspectral-graph-theorystrongly-regular-graphs
Let be a finite simple graph with strongly regular parameters , and let be an integer vector satisfying the eigenrelation in the actual vertex coordinates of . If its squared Euclidean norm is , then exactly eight vertices have coordinate and exactly eight have coordinate . The theorem does not assume or assert that such a vector exists in every graph with these parameters.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem Conway99Formal.Norm16.norm16_integer_eigenvector_support
{V : Type*} [Fintype V] [DecidableEq V]
(G : SimpleGraph V) [DecidableRel G.Adj]
(h : G.IsSRGWith 99 14 1 2) (a : V → ℤ)
(ha : ∀ v, (∑ u : V, G.adjMatrix ℤ v u * a u) = -4 * a v)
(hnorm : (∑ v : V, a v * a v) = 16) :
(Finset.univ.filter (fun v => a v = 1)).card = 8 ∧
(Finset.univ.filter (fun v => a v = -1)).card = 8 := by sorrySource
Formalization in `formalization/2026-10-03/norm16-geometry/Norm16Geometry.lean`, source revision `a45708acebe3f397faccb1b646be906f24f23ee5` (SHA-256 `b83a93ee0fc9db04974b574eda0c48c9e82eeab8477082d47e6ab02aa66005d9`), theorem `Conway99Formal.Norm16.norm16_support_card`. This is the accepted integer minus-four minimum argument in `archive/clean-start/proof-library.zip`, member `proofs/INTEGER_MINUS_FOUR_MINIMUM.md` (SHA-256 `8ad639473c3d1e73eed4bec9a23161b1cd7d524f95a1bf2c507cf60081a31789`), specialized to norm sixteen. The source package records further accepted zero-geometry and cross-design claims, but they are not premises or conclusions here. Formal novelty QA passed as run `run-24ffe37f1c61` on integration revision `a45708acebe3f397faccb1b646be906f24f23ee5`; the final standalone candidate wrapper is submitted for coordinator compilation. Packaged standalone solution SHA-256 `dd61a715bd3061f8bbdd4683e12b0d90d71fa852d33874326d8b8ef34f9b3838`.