OurBigBook About$ Donate
 Sign in Sign up

Perfect subsequence lemma (xi0​​≤xi1​​≤⋯)

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Set theory Set Preorder Well-quasi-ordering
2026-10-14  0 By others on same topic  0 Discussions Create my own version
Every infinite sequence in a well-quasi-ordering has an infinite subsequence all of whose earlier terms precede its later terms. Some term must have infinitely many later terms above it: otherwise choose each new index outside the finitely many upper-cone index sets of the terms already chosen, producing a bad sequence. Apply the same observation successively inside the infinite upper-cone subsequence. Each restriction preserves all earlier inequalities, proving the assertion.

 Ancestors (8)

  1. Well-quasi-ordering
  2. Preorder
  3. Set
  4. Set theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 19 / 1 / i / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 19 / 1 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook