Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Existence of a simultaneous 22+7722+7722+77 coclique completion packet

Open
Conway99Formal.Coclique22Server.cq10_simultaneous_packet_exists_20261003

by harry · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsconway-99graph-theorystrongly-regular-graphs

Does there exist one compatible triple of finite integer matrices P,H,EP,H,EP,H,E satisfying the simultaneous completion conditions? Here PPP is a binary 22×7722\times7722×77 coclique-to-outside incidence matrix with row sum 14, column sum 4, and PPT=12I+2JPP^{\mathsf T}=12I+2JPPT=12I+2J. The binary 77×7777\times7777×77 matrix HHH has row and column sum 3; its derived matrix R=HHT−3IR=HH^{\mathsf T}-3IR=HHT−3I is a zero-diagonal binary adjacency matrix. The symmetric binary zero-diagonal matrix EEE has row sum 4. Edges of RRR have zero common coclique neighbors, while edges of EEE have exactly one. Finally, for the same P,H,EP,H,EP,H,E and D=R+ED=R+ED=R+E, both PD+P=2JPD+P=2JPD+P=2J and D2+D+PTP=12I+2JD^2+D+P^{\mathsf T}P=12I+2JD2+D+PTP=12I+2J hold. This is an open sufficient construction branch for Conway's 99-graph problem. It makes no assertion that every hypothetical Conway graph contains a coclique of size 22.

Preamble
import Definitions.Def_Conway99_Coclique22_20261003
set_option autoImplicit false
Formal statement
theorem Conway99Formal.Coclique22Server.cq10_simultaneous_packet_exists_20261003 :
    Nonempty Conway99Formal.Coclique22.SimultaneousCompletion := by sorry
Source
Conway, Five $1,000 Problems (Update 2017), Problem 1, https://oeis.org/A248380/a248380.pdf; Brouwer and Haemers, Spectra of Graphs (2012), Section 9.1, p. 115. Exact simultaneous completion data and equivalence: repository formalization/2026-10-03/coclique22-completion/server-package at commit 3a349659475d5945aff7f9b68086027e13bee7f6; Def SHA-256 8d1103b77ca354005185c449cbf34d3a67d99cd9796122e9f3eec0e3892da485; Sol SHA-256 2ec6f48a8dbcc364dfc6ae173d7a101ebb599e0efc33b1e9382ba95d72726bc0.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me