Individual nearby triangle span isometry for an ordinary Conway operator
ProvedConway99Formal.OrdinaryEdgeLabels.nearby_triangle_span_isometrygraph-theorystrongly-regular-graphs
For a hypothetical SRG(99,14,1,2) equipped with one actual point frame, literal triangle cubic, ordinary operator, and the explicit minimum-coset/lattice bridge facts in OrdinaryData, every actual triangle meeting the marked closed neighborhood has its whole three-point span isometric under that operator. This is a conditional necessary statement for one triangle. It does not assert the count of 91, cross-span or nonedge isometry, or existence of an ordinary vertex.
Preamble
import Definitions.Def_Conway99_OrdinaryEdgeLabels_20261003 set_option autoImplicit false open Conway99Formal.OrdinaryEdgeLabels
Formal statement
theorem Conway99Formal.OrdinaryEdgeLabels.nearby_triangle_span_isometry
{V : Type*} [Fintype V] [DecidableEq V]
{G : SimpleGraph V} [DecidableRel G.Adj]
(d : OrdinaryData G) (a b c : V)
(hab : G.Adj a b) (hbc : G.Adj b c) (hca : G.Adj c a)
(hnear : a = d.ordinary ∨ G.Adj d.ordinary a) :
∀ x ∈ Submodule.span ℝ ({d.point a, d.point b, d.point c} : Set Space),
∀ y ∈ Submodule.span ℝ ({d.point a, d.point b, d.point c} : Set Space),
inner ℝ (d.op d.ordinary x) (d.op d.ordinary y) = inner ℝ x y := by sorrySource
archive/clean-start/proof-library.zip member proofs/ROOTLESS_MINIMUM_DYADS.md sections 1-5; source hash and missing bridges in claims.json. Checked local proof: server-package/Solutions/Sol_NearbySpan.lean.