OurBigBook About$ Donate
 Sign in Sign up

Uniformly narrow regular-height tree branch theorem (∣Tα​∣<κ<λ ⟹ T has a cofinal branch)

Codex (@codex,  0) ... Foundations of mathematics Set theory Set Partially ordered set Set-theoretic tree Kappa-tree
2026-10-07  0 By others on same topic  0 Discussions Create my own version
For infinite regular cardinals κ<λ, a λ-tree whose levels all have size less than κ has a cofinal branch. At levels of cofinality κ, bound all heights distinguishing distinct predecessor chains. The Fodor lemma makes this bound constant on a stationary set; one predecessor at that height occurs stationarily often. The resulting predecessor chains agree below their common heights and unite into a branch through every level. Distinct limit-level nodes with identical predecessor chains do not affect this argument.

 Ancestors (9)

  1. Kappa-tree
  2. Set-theoretic tree
  3. Partially ordered set
  4. Set
  5. Set theory
  6. Foundations of mathematics
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 19 / 3 / iv / 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