Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.3 (transitive-tournament blow-up): D[Tm]D[T_m]D[Tm​] with m>∣V(D)∣m>|V(D)|m>∣V(D)∣ turns the subset deficit into strict expansion ∣U∣+∣F2(U)∣<2∣F(U)∣|U|+|F^2(U)|<2|F(U)|∣U∣+∣F2(U)∣<2∣F(U)∣ for every nonempty proper UUU

Proved
OAI.SeymourSecondNeighborhood.lemma_2_3

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

combinatoricsgraph-theoryseymour-second-neighborhood

Let DDD be an oriented graph on a finite vertex set VVV with n=∣V∣n=|V|n=∣V∣, in which every vertex has an in-neighbor and which satisfies the subset deficit ∣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 S⊆VS\subseteq VS⊆V. Let m>nm>nm>n and let G=D[Tm]G=D[T_m]G=D[Tm​] be the graph on V×{0,…,m−1}V\times\{0,\dots,m-1\}V×{0,…,m−1} obtained by replacing each vertex by a transitive tournament on mmm labels (arcs from smaller to larger labels) and, for every arc v→wv\to wv→w of DDD, putting all arcs from the block at vvv to the block at www (blowup r m). Then GGG is an oriented graph, every vertex of GGG has an in-neighbor, and

∣U∣+∣FG2(U)∣<2 ∣FG(U)∣for every ∅≠U⊊V(G)|U|+|F_G^2(U)|<2\,|F_G(U)|\qquad\text{for every }\emptyset\neq U\subsetneq V(G)∣U∣+∣FG2​(U)∣<2∣FG​(U)∣for every ∅=U⊊V(G)

(StrictExpander), where FGF_GFG​ is the one-step image operator of GGG. This is Lemma 2.3 of the manuscript. In the proof, for a nonempty proper UUU with label sets TvT_vTv​ in the blocks and support S={v:Tv≠∅}S=\{v:T_v\neq\emptyset\}S={v:Tv​=∅}, one has ∣FG(U)∣=m∣F(S)∣+∑v∈S∖F(S)∣f(Tv)∣|F_G(U)|=m|F(S)|+\sum_{v\in S\setminus F(S)}|f(T_v)|∣FG​(U)∣=m∣F(S)∣+∑v∈S∖F(S)​∣f(Tv​)∣ and ∣FG2(U)∣≤m∣F(S)∪F2(S)∣+∑v∈S∖(F(S)∪F2(S))∣f2(Tv)∣|F_G^2(U)|\le m|F(S)\cup F^2(S)|+\sum_{v\in S\setminus(F(S)\cup F^2(S))}|f^2(T_v)|∣FG2​(U)∣≤m∣F(S)∪F2(S)∣+∑v∈S∖(F(S)∪F2(S))​∣f2(Tv​)∣, where fff is the image operator of the transitive tournament, which satisfies ∣T∣−2∣f(T)∣+∣f2(T)∣≤1|T|-2|f(T)|+|f^2(T)|\le1∣T∣−2∣f(T)∣+∣f2(T)∣≤1; summing gives ∣U∣−2∣FG(U)∣+∣FG2(U)∣≤m (∣F2(S)∖F(S)∣−∣F(S)∖S∣)+n≤−m+n<0|U|-2|F_G(U)|+|F_G^2(U)|\le m\,(|F^2(S)\setminus F(S)|-|F(S)\setminus S|)+n\le -m+n<0∣U∣−2∣FG​(U)∣+∣FG2​(U)∣≤m(∣F2(S)∖F(S)∣−∣F(S)∖S∣)+n≤−m+n<0 when S≠VS\neq VS=V, and ∣U∣−∣V(G)∣<0|U|-|V(G)|<0∣U∣−∣V(G)∣<0 when S=VS=VS=V. The same product construction appears in Brantner, Brockman, Kay and Snively, Involve 2 (2009), Theorem 4.3.

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_3 (r : V → V → Prop) (hr : IsOriented r) (hin : PosIndeg r)
    (hdef : SubsetDeficit r) (m : ℕ) (hm : Fintype.card V < m) :
    IsOriented (blowup r m) ∧ PosIndeg (blowup r m) ∧ StrictExpander (blowup r m) := 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