I Why is cf(x) not equal to \aleph_a when x=\aleph_{a} and a is a limit ordinal?

  • I
  • Thread starter Thread starter cragar
  • Start date Start date
AI Thread Summary
When x equals \aleph_a, where a is a limit ordinal, the cofinality cf(x) is equal to cf(a), leading to the conclusion that cf(x) is not equal to \aleph_a. The definition of cofinality indicates that a subset B of an ordinal A is cofinal if it contains elements arbitrarily large in A. For limit ordinals, the set B can be constructed from smaller ordinals, showing that the cofinality of \aleph_a is less than or equal to the cardinality of B, which is a. Consequently, it can be shown that cf(\aleph_a) is less than or equal to cf(a). This discussion emphasizes the importance of understanding cofinality in relation to limit ordinals and their cardinalities.
cragar
Messages
2,546
Reaction score
3
if x= \aleph_{a} where a is a limit ordinal. then cf(x)=cf(a)
why is the cf(x) not eqaul to \aleph_{a}
is it constructing an order type from the previous cardinals, and using the previous cardinals to construct a sequence
 
Physics news on Phys.org
You have to go back to the definition of cofinality of an ordinal. It's slightly confusing, but here's what I think the definition amounts to:
(I'm going to assume the axiom of choice, because everything gets messier without it)

Let A be an ordinal (which we can represent as the set of all smaller ordinals). Let B be a proper subset of A (that is, B is a set of ordinals, all of which are smaller than A). Then B is cofinal in A if for every \alpha < A, there is a \beta \epsilon B such that \alpha \leq \beta. In other words, B contains arbitrarily large elements of A. So the definition of the cofinality of A: It's the smallest cardinal \alpha such that there is a set B of size \alpha that is cofinal in A.

So a couple of examples: If n is finite ordinal greater than zero, then the cofinality of n is 1. That's because we can let B just be the one-element set B = \{ n-1 \}: If n' < n, then n' \leq n-1.

Another example is \omega: the cofinality of \omega is \omega. To see that, let B be any finite set of natural numbers. Then it has a largest element, max(B). Clearly, this number can't be greater than or equal to every element of \omega. So B is not cofinal in \omega. Turning that around, if B IS cofinal in \omega, then B must be infinite, so its cardinality is \omega.

So now, let's look at the case of \aleph_a. If a is a limit ordinal, then we can let B = \{ \aleph_{a'} | a' < a \}. Then B will be cofinal in \aleph_a. So the cofinality of \aleph_a would be less than or equal to the cardinality of B, which is just a.
 
And notice that stevendaryl's argument that ##cf(\aleph_a) \leq |a|## can be slightly modified to show ##cf(\aleph_a) \leq cf(a)##. Indeed, letting ##C## be some cofinal subset of ##a##, one can verify that ##\{\aleph_c: \ c\in C\}## is cofinal in ##\aleph_a##.
 
I was reading a Bachelor thesis on Peano Arithmetic (PA). PA has the following axioms (not including the induction schema): $$\begin{align} & (A1) ~~~~ \forall x \neg (x + 1 = 0) \nonumber \\ & (A2) ~~~~ \forall xy (x + 1 =y + 1 \to x = y) \nonumber \\ & (A3) ~~~~ \forall x (x + 0 = x) \nonumber \\ & (A4) ~~~~ \forall xy (x + (y +1) = (x + y ) + 1) \nonumber \\ & (A5) ~~~~ \forall x (x \cdot 0 = 0) \nonumber \\ & (A6) ~~~~ \forall xy (x \cdot (y + 1) = (x \cdot y) + x) \nonumber...
Back
Top