Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

3.1 — no infinite strictly descending chain of ideals below a well-quasi-order

Proved
RobertsonSeymour2010.GM23.Immersion.no_descending_ideals

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

order-theoryp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1well-quasi-order

Let Ω1,Ω2,…\Omega_1,\Omega_2,\dotsΩ1​,Ω2​,… be quasi-orders on subsets of a common ambient set. Write Ω<Ω′\Omega<\Omega'Ω<Ω′ when Ω\OmegaΩ is an ideal of Ω′\Omega'Ω′ (a sub-quasi-order closed downwards in Ω′\Omega'Ω′) and Ω≠Ω′\Omega\ne\Omega'Ω=Ω′. Then there is no sequence such that Ω1\Omega_1Ω1​ is a well-quasi-order and

Ωi+1<Ωifor all i≥1.\Omega_{i+1}<\Omega_i\qquad\text{for all } i\ge1 .Ωi+1​<Ωi​for all i≥1.

In other words, the relation "is a proper ideal of" is well-founded below any well-quasi-order. The paper calls this a well-known lemma and uses it, through 3.2, to run an induction on shadows.

Formalization Note. Quasi-orders are QO X on a common ambient type X; the sequence is indexed from 000, so the paper's Ω1\Omega_1Ω1​ is Ω 0. "Ω≠Ω′\Omega\ne\Omega'Ω=Ω′" is the negation of QO.Same (same ground set and same order on it).

Preamble
import Mathlib
import Definitions.Def_RobertsonSeymour2010_GM23_Immersion_QuasiOrders
Formal statement
namespace RobertsonSeymour2010.GM23.Immersion

theorem no_descending_ideals (X : Type) (Ω : ℕ → QO X) (hΩ : (Ω 0).IsWQO) :
    ¬ ∀ i : ℕ, (Ω (i + 1)).IsProperIdeal (Ω i) := by sorry

end RobertsonSeymour2010.GM23.Immersion
Source
Robertson, Seymour, Graph Minors XXIII. Nash-Williams' immersion conjecture (authors' manuscript, rev. Apr. 18, 2011), 3.1, p. 6
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me