Why does the tree property hold for regular cardinals but not singular cardinals? (I.e. There exists a tree of height $\kappa$ with countable levels and no cofinal branch for $\kappa$ a singular cardinal)
2025-01-13 02:30:53.1736735453
Set Theory: Tree Property
771 Views Asked by Mary Ogawa https://math.techqa.club/user/mary-ogawa/detail At
1
There are 1 best solutions below
Related Questions in SET-THEORY
- Why is the intersection of countably many homogeneously Suslin subsets of $\,^{\omega} \omega$ homogeneously Suslin?
- Countable Elementary Submodels $M \preccurlyeq H ( \theta) $.
- König's theorem (set theory) implication
- Measure theory Vitali nonmeasurable set.
- Real numbers for beginners
- On the Axiom of Choice for Conglomerates and Skeletons
- Showing extensionality for Mostowski collapse
- on the continuum hypothesis: only finitely many cardinals between $\aleph_0$ and $2^{\aleph_0}$
- Product of metric outer measures
- If $\kappa$ is regular, is $\prod^{\text{fin}}_{\alpha<\kappa}\operatorname{Fn}(\omega,\alpha)$ $\kappa$-cc?
Related Questions in CARDINALS
- The set of all functions from integers to a finite set is uncountable
- Sets with same Cardinality, but no Explicit Bijection?
- König's theorem (set theory) implication
- The cardinality of the set
- If one of two sets has larger cardinality, there is a map onto the other set
- Is there more than one instance of the Empty Set?
- Is aleph-$0$ a natural number?
- Cardinal arithmetic confusion: What is $|\Bbb R|+|\Bbb N|$?
- On singular products of cardinal numbers
- cardinality of a countable sequence of powersets
Related Questions in TREES
- Tree with no nodes of degree 2: prove that # leaves ># internal nodes using average degree and handshake lemma
- Why is the intersection of countably many homogeneously Suslin subsets of $\,^{\omega} \omega$ homogeneously Suslin?
- Intersection of all possible spanning trees of a connected, simple graph.
- There are at least 2 vertex-disjoint paths between every pair of vertices?
- Tree having no vertex of degree 2 has more leaves than internal nodes
- Circuits and Trees
- How can I draw a tree to represent combinations?
- What is a "linear chain" in Graph Theory?
- Trees with no vertex of degree 2 have more leaves than internal nodes
- Find all possible topological-sortings of graph G
Related Questions in INFINITARY-COMBINATORICS
- If $\kappa$ is regular, is $\prod^{\text{fin}}_{\alpha<\kappa}\operatorname{Fn}(\omega,\alpha)$ $\kappa$-cc?
- Uncountable random graphs
- Is there a "model theoretical" proof of Solovay's Stationary Splitting Theorem?
- Is there more simple way to get a doughnut property?
- Consistent choice from an infinite tree of finite sets.
- Prove the existence of some weird family of sets
- Assuming CH, can every tower be extended to a selective ultrafilter (or even a p-point)?
- Does every diagonal intersection contain $0$?
- The Diamond Principle plus implies a Kurepa family.
- Is the dominating number $\frak d$ regular?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Refuting the Anti-Cantor Cranks
- Find $E[XY|Y+Z=1 ]$
- 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?
- What are the Implications of having VΩ as a model for a theory?
- How do we know that the number $1$ is not equal to the number $-1$?
- Defining a Galois Field based on primitive element versus polynomial?
- Is computer science a branch of mathematics?
- Can't find the relationship between two columns of numbers. Please Help
- 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
- A community project: prove (or disprove) that $\sum_{n\geq 1}\frac{\sin(2^n)}{n}$ is convergent
- Alternative way of expressing a quantied statement with "Some"
Popular # Hahtags
real-analysis
calculus
linear-algebra
probability
abstract-algebra
integration
sequences-and-series
combinatorics
general-topology
matrices
functional-analysis
complex-analysis
geometry
group-theory
algebra-precalculus
probability-theory
ordinary-differential-equations
limits
analysis
number-theory
measure-theory
elementary-number-theory
statistics
multivariable-calculus
functions
derivatives
discrete-mathematics
differential-geometry
inequality
trigonometry
Popular Questions
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- 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)$?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- How to find mean and median from histogram
- Difference between "≈", "≃", and "≅"
- Easy way of memorizing values of sine, cosine, and tangent
- How to calculate the intersection of two planes?
- What does "∈" mean?
- If you roll a fair six sided die twice, what's the probability that you get the same number both times?
- Probability of getting exactly 2 heads in 3 coins tossed with order not important?
- Fourier transform for dummies
- Limit of $(1+ x/n)^n$ when $n$ tends to infinity
There are a few issues here.
First of all, the tree property doesn't hold of regular cardinals in general. For example, it provably fails for $\kappa=\omega_1$ (see https://en.wikipedia.org/wiki/Aronszajn_tree), and getting the tree property at $\omega_2$ has high consistency strength relative to ZFC - it is equiconsistent with the existence of a weakly compact cardinal. In fact, in $ZFC+V=L$, every successor cardinal fails to have the tree property - thus, in $ZFC+V=L+$"there are no inaccessibles," the tree property never holds of any uncountable cardinal at all.
Second, you've stated the tree property wrong: the point is not that the levels are countable, but rather that they are small (of size $<\kappa$). (Also, we usually demand that the tree itself have cardinality $\kappa$, if I remember correctly, but this actually doesn't matter: if I have a tree of height $\kappa$ with levels of size $<\kappa$ and no $\kappa$-length branches, I can prune it down to such a tree with size $\kappa$ - just fix a set of $\kappa$-many nodes, the supremum of whose heights is $\kappa$, and look at the induced subtree.)
Finally, here's why the tree property can never hold of $\kappa$ singular. Let $\lambda=cf(\kappa)<\kappa$, let $\{\alpha_\eta: \eta\in\lambda\}$ be a cofinal subset of $\kappa$, and consider the following tree on $\kappa$:
$$T=\{f\in \kappa^{<\kappa}: f(0)<\lambda\mbox{ and }\vert f\vert<\alpha_{f(0)}\mbox{ and } f(\eta)=0 \mbox{ for all }0<\eta<\vert f\vert\}\cup\{\emptyset\}.$$ Basically, $T$ consists of $\lambda$-many branches, with the $\eta$th such branch of height $\alpha_\eta$. Then the height of $T$ is clearly $\sup\{\alpha_\eta: \eta<\lambda\}=\kappa$, but each level is of cardinality at most $\lambda$.