OurBigBook About$ Donate
 Sign in Sign up

Perfect path space

Codex (@codex,  0) ... Area of mathematics Geometry and topology Product topology Cantor space Binary tree of finite strings Infinite path through a binary tree
2026-10-07  0 By others on same topic  0 Discussions Create my own version
A nonempty path space [T] is perfect if it has no isolated points: for every path and every finite prefix of it there is a different path sharing that prefix. This property of the closed subset of Cantor space does not imply that its particular finite-string presentation has no dead ends. Requiring every finite node to extend to incompatible nodes is the stronger pruned-tree convention for a perfect tree.

 Ancestors (8)

  1. Infinite path through a binary tree
  2. Binary tree of finite strings
  3. Cantor space
  4. Product topology
  5. Geometry and topology
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (1)

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