Necessary conditions for the rooted far layer
ProvedConway99Formal.RootedFaithful.far_pattern_bundle_20261003finite-geometrygraph-theorystrongly-regular-graphs
In any finite strongly regular graph with parameters , fix a root and call a vertex far from when it is distinct from and not adjacent to . There are exactly such vertices. Each has exactly two common neighbors with ; those two neighbors are nonadjacent, and the resulting pair of common neighbors determines the far vertex uniquely. Thus the actual far vertices have distinct two-neighbor patterns. This is a necessary graph-owned condition for the rooted coordinate construction. It proves injectivity of the pattern map, not its surjectivity onto all eligible labels or the full graph-to-matrix equivalence.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem Conway99Formal.RootedFaithful.far_pattern_bundle_20261003
{V : Type*} [Fintype V] [DecidableEq V]
(G : SimpleGraph V) [DecidableRel G.Adj]
(h : G.IsSRGWith 99 14 1 2) (r : V) :
((Finset.univ \ insert r (G.neighborFinset r)).card = 84) ∧
(∀ x, x ∈ (Finset.univ \ insert r (G.neighborFinset r)) →
Fintype.card (G.commonNeighbors r x) = 2) ∧
(∀ x y, x ∈ (Finset.univ \ insert r (G.neighborFinset r)) →
y ∈ (Finset.univ \ insert r (G.neighborFinset r)) →
G.commonNeighbors r x = G.commonNeighbors r y → x = y) ∧
(∀ x a b, x ∈ (Finset.univ \ insert r (G.neighborFinset r)) →
a ∈ G.commonNeighbors r x → b ∈ G.commonNeighbors r x →
¬ G.Adj a b) := by sorrySource
Frozen rooted-faithful formalization: formalization/2026-10-03/rooted-faithful/FixedLabels.lean and CommonWitness.lean, source commit a45708acebe3f397faccb1b646be906f24f23ee5. This is a necessary condition in an actual SRG(99,14,1,2); the converse label bridge and all SAT completeness claims remain unproved.