Exact simultaneous P H E completion equivalence for a 22-coclique
ProvedConway99Formal.Coclique22Server.cq09_simultaneous_equivalence_20261003graph-theorystrongly-regular-graphs
A strongly regular graph with parameters and a specified independent 22-set exists if and only if a single simultaneous binary packet exists. Here is with row sum 14, column sum four and . The binary matrix has row and column sum three; is a binary zero-diagonal edge matrix whose edges have . The matrix is a degree-four adjacency matrix whose edges have . For , the same matrices satisfy
The forward construction must use the actual outside triangles of one graph. The converse constructs a graph from the same packet. This equivalence does not assert that either side exists.
Preamble
import Definitions.Def_Conway99_Coclique22_20261003 set_option autoImplicit false open Matrix Finset
Formal statement
theorem Conway99Formal.Coclique22Server.cq09_simultaneous_equivalence_20261003 :
Nonempty Conway99Formal.Coclique22.SimultaneousCompletion ↔
Conway99Formal.Coclique22.HasCoclique99 := by sorrySource
archive/clean-start/proof-library.zip!proofs/COCLIQUE22.md SHA-256 ecdefe7569c56cff259816da8660e5375bdd64bfaeea3771b3b2f4c0712292d3; archive/clean-start/proof-library.zip!proofs/COCLIQUE22_REVIEW.md SHA-256 d51c8b3e09cbd22f63bb29a779b9ac874ebd72725cbccf34630bfdfc1d0eddbf. Formal source: formalization/2026-10-03/coclique22-completion at commit 9f00682e6161089cdce7b915368ea7cbb01a3194. This is a private intermediate packet, not a proof of the public Conway 99 target. Assigned component CQ09 in COCLIQUE22.md lines 89–100.