Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.1 (pruning two families of pairs): conflicts can be removed by deleting at most ∣H∣|H|∣H∣ plus the number of uncovered points of ZZZ members

Open
OAI.SeymourSecondNeighborhood.Pruning.lemma_3_1

by SamenHossain · Oct 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsgraph-theoryseymour-second-neighborhood

Let XXX be a finite set with an arbitrary binary relation →\to→ (no orientation or irreflexivity is assumed), and let R,C⊆X×XR,C\subseteq X\times XR,C⊆X×X be two families of ordered pairs, regarded as separate copies even where they agree. A left member (p,j)∈R(p,j)\in R(p,j)∈R and a right member (i,s)∈C(i,s)\in C(i,s)∈C conflict if p→ip\to ip→i and s→js\to js→j. Let

Z={(i,j):some (p,j)∈R conflicts with some (i,s)∈C},H={(p,s):some (p,j)∈R conflicts with some (i,s)∈C}.Z=\{(i,j): \text{some }(p,j)\in R\text{ conflicts with some }(i,s)\in C\},\qquad H=\{(p,s): \text{some }(p,j)\in R\text{ conflicts with some }(i,s)\in C\}.Z={(i,j):some (p,j)∈R conflicts with some (i,s)∈C},H={(p,s):some (p,j)∈R conflicts with some (i,s)∈C}.

A point (i,j)(i,j)(i,j) is covered by a member (p,j)∈R(p,j)\in R(p,j)∈R when p→ip\to ip→i, and by a member (i,s)∈C(i,s)\in C(i,s)∈C when s→js\to js→j. Then there are subfamilies R′⊆RR'\subseteq RR′⊆R and C′⊆CC'\subseteq CC′⊆C with no conflicts between them, such that every member of RRR (resp. CCC) that conflicts with no member of CCC (resp. RRR) is retained, and

∣R∖R′∣+∣C∖C′∣  ≤  ∣H∣+∣{z∈Z:z is covered by no member of R′∪C′}∣.|R\setminus R'|+|C\setminus C'|\;\le\;|H|+\bigl|\{z\in Z: z\text{ is covered by no member of }R'\cup C'\}\bigr|.∣R∖R′∣+∣C∖C′∣≤∣H∣+​{z∈Z:z is covered by no member of R′∪C′}​.

This is Lemma 3.1 of the manuscript, its main new ingredient. The proof there builds a bipartite graph on R⊔ZLR\sqcup Z_LR⊔ZL​ and C⊔ZRC\sqcup Z_RC⊔ZR​ (conflicting members adjacent; each member adjacent to the opposite copy of every point of ZZZ it covers), shows by a rank argument with generically chosen real coefficients (Lemma 3.2, lemma_3_2) that a maximum matching has at most ∣Z∣+∣H∣|Z|+|H|∣Z∣+∣H∣ edges, and takes a K\H{o}nig vertex cover of that size; deleting its original members gives the pruning. The statement is purely about finite relations and families of pairs; in the application (prop_4_1) its two cost terms are bounded by the numbers of uncovered points before and after pruning.

Preamble
import Mathlib
import Definitions.Def_SeymourSecondNeighborhood
import Definitions.Def_SeymourSecondNeighborhood_Image

open Finset
Formal statement
namespace OAI.SeymourSecondNeighborhood.Pruning

variable {X : Type*} [Fintype X] [DecidableEq X]

theorem lemma_3_1 (arrow : X → X → Prop) (R C : Finset (X × X)) :
    ∃ R' ⊆ R, ∃ C' ⊆ C,
      (∀ l ∈ R', ∀ c ∈ C', ¬ Conflict arrow l c) ∧
      (∀ l ∈ R, (∀ c ∈ C, ¬ Conflict arrow l c) → l ∈ R') ∧
      (∀ c ∈ C, (∀ l ∈ R, ¬ Conflict arrow l c) → c ∈ C') ∧
      (R \ R').card + (C \ C').card
        ≤ (pointsH arrow R C).card + (uncovered arrow R C R' C').card := by
  sorry

end OAI.SeymourSecondNeighborhood.Pruning
Source
Statement extracted from OpenAI, *A proof of Seymour's second-neighborhood conjecture*, preprint, September 23, 2026, https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/preprints/A-proof-of-Seymours-second-neighborhood-conjecture-September-23-2026/paper.pdf

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