A conditional induced square in an R172 transition packet
ProvedConway99Formal.R172Repaired.Transition.local_square_existsLet G be an actual strongly regular graph with parameters (99,14,1,2), and suppose p is a Transition packet in G satisfying the explicit R170–R171 data: a 36-vertex support, a disjoint 3-vertex clique, the complementary 60-vertex zero-support set, a support centre adjacent to two distinct nonadjacent outer vertices in that zero-support set, the stated row-codegree cap, exclusion of triangle common neighbors, zero-transport at the centre, and nonadjacency of any second common support point to the centre. Then the centre and the two outer vertices can be completed by a fourth vertex to form an induced 4-cycle. This is a conditional local result: constructing p from a uniform-empty branch is a separate open obligation; it does not prove that such a branch or graph exists. The converse from q=1 to a core connector is withdrawn.
import Mathlib import Definitions.Def_r172_repaired set_option autoImplicit false open SimpleGraph Finset open Conway99Formal.R172Repaired
theorem Conway99Formal.R172Repaired.Transition.local_square_exists {V : Type*} [Fintype V] [DecidableEq V] {G : SimpleGraph V} [DecidableRel G.Adj] (p : Transition G) (h : G.IsSRGWith 99 14 1 2) : ∃ x, p.inducedSquare x := by sorry