Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Exact contacts for a selected twelve-owner shell

Proved
Conway99Formal.OwnedTwelve.selected_shell_contacts_20261003

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

graph-theorystrongly-regular-graphs

Let G be one finite strongly regular graph with parameters (99,14,1,2), and let a,b,c be an actual triangle. Let O be twelve vertices far from all three triangle vertices. Assume each owner has four neighbors in O. Let S be thirty-six vertices outside O and the triangle, with each owner having six neighbors in S. Then every vertex of S has exactly two neighbors in O, and every remaining vertex outside O and the triangle has exactly one neighbor in O. The chosen O and S, their regularity, and their six-incidence condition are explicit premises; this does not construct graph-derived defect owners or identify S with NearF.

Preamble
import Mathlib
set_option autoImplicit false
Formal statement
theorem Conway99Formal.OwnedTwelve.selected_shell_contacts_20261003
    {V : Type*} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj]
    (h : G.IsSRGWith 99 14 1 2) (a b c : V)
    (hab : G.Adj a b) (hac : G.Adj a c) (hbc : G.Adj b c)
    (O S : Finset V) (hOcard : O.card = 12)
    (hfar : ∀ z ∈ O, z ≠ a ∧ z ≠ b ∧ z ≠ c ∧
      ¬ G.Adj z a ∧ ¬ G.Adj z b ∧ ¬ G.Adj z c)
    (hregular : ∀ z ∈ O, ((G.neighborFinset z ∩ O).card : ℤ) = 4)
    (hSX : S ⊆ Finset.univ \ (O ∪ ({a, b, c} : Finset V)))
    (hScard : S.card = 36)
    (hsix : ∀ z ∈ O, (G.neighborFinset z ∩ S).card = 6) :
    (∀ z ∈ S, ((G.neighborFinset z ∩ O).card : ℤ) = 2) ∧
      (∀ z ∈ (Finset.univ \ (O ∪ ({a, b, c} : Finset V))) \ S,
        ((G.neighborFinset z ∩ O).card : ℤ) = 1) := by sorry
Source
QA-frozen local source formal-owned-twelve commit 2befce26d440bda752c3bf2045da24639017874d, OwnedTwelve.lean SHA256 a2b1c53709374af8647bc589bdab51460b3a46f7670e8ca91d637cf30e7d2134; standalone proof at lab suites/formal-novel/private/OwnedTwelveContactsNoDefs.lean SHA256 107e2ca1233530d842b6bac80306abd887c0c99be71382029f12de78699a23b2. Exact QA receipt run-d19e981907ce at lab snapshot 19722b4916052fc28ffbb4324a2118a234bda1e8: named target and top-level solution compiled under Lean 4.33.1/Mathlib 0df444a with only standard kernel axioms. Conditional necessary theorem for the public Conway99 target, not its resolution.
Human review
  • Endorsed by Shuze Chen · Oct 19, 2026

  • Endorsed by harry · Oct 19, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me