Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.2 (subset deficit): a minimal counterexample has positive indegrees and satisfies ∣F2(S)∖F(S)∣<∣F(S)∖S∣|F^2(S)\setminus F(S)|<|F(S)\setminus S|∣F2(S)∖F(S)∣<∣F(S)∖S∣ for every nonempty proper SSS

Proved
OAI.SeymourSecondNeighborhood.lemma_2_2

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

combinatoricsgraph-theoryseymour-second-neighborhood

Let DDD be a finite nonempty oriented graph on VVV (a loopless asymmetric relation rrr) in which every vertex vvv is bad, i.e. ∣N1+(v)∣>∣N2+(v)∣|N_1^+(v)|>|N_2^+(v)|∣N1+​(v)∣>∣N2+​(v)∣, where N1+(v)N_1^+(v)N1+​(v) is the out-neighborhood and N2+(v)N_2^+(v)N2+​(v) the set of vertices at directed distance exactly two. Assume DDD is minimal in the following two senses: every proper subrelation r′⊊rr'\subsetneq rr′⊊r (obtained by deleting at least one arc) has a good vertex, and every nonempty proper induced subgraph D[W]D[W]D[W], ∅≠W⊊V\emptyset\neq W\subsetneq V∅=W⊊V, has a good vertex. Write F(S)={y:∃x∈S, x→y}F(S)=\{y:\exists x\in S,\ x\to y\}F(S)={y:∃x∈S, x→y} for the one-step image (fwd). Then every vertex of DDD has an in-neighbor, and

∣F2(S)∖F(S)∣<∣F(S)∖S∣for every ∅≠S⊊V|F^2(S)\setminus F(S)|<|F(S)\setminus S|\qquad\text{for every }\emptyset\neq S\subsetneq V∣F2(S)∖F(S)∣<∣F(S)∖S∣for every ∅=S⊊V

(SubsetDeficit). This is Lemma 2.2 of the manuscript, which adapts the arc-deletion argument of Seacrest's Lemma 4 (arXiv:1808.06293): for SSS fixed, put I=F(S)∩SI=F(S)\cap SI=F(S)∩S, E=F(S)∖SE=F(S)\setminus SE=F(S)∖S and g(T)=∣F(T)∖(I∪T)∣g(T)=|F(T)\setminus(I\cup T)|g(T)=∣F(T)∖(I∪T)∣ for T⊆ET\subseteq ET⊆E; deleting the arcs from SSS to E∖TE\setminus TE∖T and using arc-minimality produces a nonempty Q⊆E∖TQ\subseteq E\setminus TQ⊆E∖T with g(T∪Q)−g(T)<∣Q∣g(T\cup Q)-g(T)<|Q|g(T∪Q)−g(T)<∣Q∣, and iterating from T=∅T=\emptysetT=∅ to T=ET=ET=E gives g(E)<∣E∣g(E)<|E|g(E)<∣E∣. The two minimality hypotheses are exactly what a counterexample of minimum order and then minimum number of arcs provides (the induced-subgraph hypothesis follows from the main theorem for smaller orders).

Preamble
import Mathlib
import Definitions.Def_SeymourSecondNeighborhood
import Definitions.Def_SeymourSecondNeighborhood_Image

open Finset
Formal statement
namespace OAI.SeymourSecondNeighborhood

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

theorem lemma_2_2 [Nonempty V] (r : V → V → Prop) (hr : IsOriented r)
    (hbad : ∀ v, ¬ GoodVertex r v)
    (hmin_arcs : ∀ r' : V → V → Prop, (∀ a b, r' a b → r a b) → (∃ a b, r a b ∧ ¬ r' a b) →
      ∃ v, GoodVertex r' v)
    (hmin_order : ∀ W : Finset V, W.Nonempty → W ≠ univ →
      ∃ v : W, GoodVertex (fun a b : W => r a b) v) :
    PosIndeg r ∧ SubsetDeficit r := by
  sorry

end OAI.SeymourSecondNeighborhood
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