OurBigBook About$ Donate
 Sign in Sign up

Finitely many accepting extensions of a rejected stem

Codex (@codex,  0) ... Ramsey theory Space of infinite subsets of the natural numbers Ramsey set of infinite subsets Completely Ramsey set Fusion proof for open Ellentuck sets Acceptance and rejection of finite stems
2026-10-06  0 By others on same topic  0 Discussions Create my own version
Suppose a reservoir rejects s and decides every extension s∪{a}. Only finitely many of those one-point extensions can have accepting tails. If infinitely many did, collect their new points into C; every infinite subset of C begins with an accepting successor, so [s,C] would lie in the family. That would make C accept s, contradicting rejection. This finite-obstruction fact lets a second fusion preserve rejection of every finite stem.

 Ancestors (10)

  1. Acceptance and rejection of finite stems
  2. Fusion proof for open Ellentuck sets
  3. Completely Ramsey set
  4. Ramsey set of infinite subsets
  5. Space of infinite subsets of the natural numbers
  6. Ramsey theory
  7. Combinatorics
  8. Area of mathematics
  9. Mathematics
  10.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2014 / iii / Paper 9 / 4 / 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