If a tree is well pruned then any node will have a node above it at any level of the tree above the nodes level. Doesn't this mean that no branch can have a countable height, because if you assume a branch has countable height x, then you can find a node above level x that is a part of the branch, so the branch didn't have height x. And since it's a $\omega_1$ Aronszajn tree, it has no uncountable branch. Something must be wrong with my reasoning, because dependant choice means that the tree must have an infinite branch.
2026-03-26 04:32:04.1774499524
Do well pruned $\omega_1$ Aronszajn trees have any branches?
230 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in SET-THEORY
- Theorems in MK would imply theorems in ZFC
- What formula proved in MK or Godel Incompleteness theorem
- Proving the schema of separation from replacement
- Understanding the Axiom of Replacement
- Ordinals and cardinals in ETCS set axiomatic
- Minimal model over forcing iteration
- How can I prove that the collection of all (class-)function from a proper class A to a class B is empty?
- max of limit cardinals smaller than a successor cardinal bigger than $\aleph_\omega$
- Canonical choice of many elements not contained in a set
- Non-standard axioms + ZF and rest of math
Related Questions in TREES
- Explanation for the static degree sort algorithm of Deo et al.
- Finding height of a $k$-ary tree
- Clique-width of a tree
- count "informative" paths in tree
- If the weight of edge E $e$ of an MST is decreased by $\delta$. Could total weight of MST decrease by more than $\delta$.
- Probability of two randomly selected leaves of a tree to be connected only at the root
- Proof in graph theory: maximum degree and number of leaves.
- Graph Theory: Number of vertices in a tree.
- The number of, and an enumeration for, the set of full subtrees of the full complete binary tree
- Is the maximum link length function convex?
Related Questions in INFINITARY-COMBINATORICS
- How to understand $e$ and other terms in this probability distribution?
- Existence of Aronszajn tree
- Verifying a proof (under AC) that any (possibly non-finite) graph $G$ has a $\kappa$-coloring ($\kappa$ a cardinal) if $\chi(G)\leq \kappa\leq |V(G)|$
- Finding necessary/sufficient conditions for when a directed graph's geodesic function is unbounded.
- Infinite rooms and doors (2)
- Reduction of families to size $\aleph_1$
- Prove using Koenig's lemma that a rayless connected graph $G$ with $\delta(G) = k$ has a finite subgraph $H$ with $\delta(H)=k$
- Universal Classes of Regular Graphs
- An infinite basis for an ad hoc vector space
- A Bijection Between $\kappa\times\aleph_{\alpha+\kappa}$ and $\aleph_{\alpha+\kappa}$ with Certain Order-Preservation Properties
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Just because there are no cofinal branches, does not mean there are no branches of countable length. This is just a consequence of Hausdorff's maximality principle: every partial order—in particular trees—have maximal chains, branches in the case of trees. If the tree is an Aronszajn tree, then this branch is countable, and if it is pruned, then there are no leaves, and the branch has an order type of a limit ordinal.
Consider the following tree, as a very simple example: Start with one branch of length $\omega$, then above each node in the branch, split into a branch of length $\omega_1$.
The tree has height $\omega_1$, but the original branch from which we split is still a maximal chain, it is still countable, it is still a pruned tree.
What is crucial in the Aronszajn tree construction is that when you are given a branch, and you walk "upwards" on that branch, then either at some point you have to split away from it, or you'll get stuck at a limit step. This is very apparent when you look at the classic construction with rational sequences: we can walk very far on any given branch, but ultimately we get stuck at a limit step. So in order to walk through all the levels, we always have to split from whatever branch we were "walking on".