|
|
|
|
partitions less than cofinality
|
(Result)
|
|
|
If $\lambda<\operatorname{cf}(\kappa)$ then $\kappa\rightarrow(\kappa)^1_\lambda$
This follows easily from the definition of cofinality. For any coloring $f:\kappa\rightarrow\lambda$ then define $g:\lambda\rightarrow\kappa+1$ by $g(\alpha)=|f^{-1}(\alpha)|$ Then $\kappa=\sum_{\alpha<\lambda} g(\alpha)$ and by the normal rules of cardinal arithmetic $\operatorname{sup}_{\alpha<\lambda} g(\alpha)=\kappa$ Since $\lambda<\operatorname{cf}(\kappa)$ there must be some $\alpha<\lambda$
such that $g(\alpha)=\kappa$
|
"partitions less than cofinality" is owned by Henry.
|
|
(view preamble | get metadata)
Cross-references: cardinal arithmetic, normal, coloring, cofinality
There is 1 reference to this entry.
This is version 3 of partitions less than cofinality, born on 2002-08-10, modified 2008-02-15.
Object id is 3287, canonical name is PartitionsLessThanCofinality.
Accessed 1723 times total.
Classification:
| AMS MSC: | 03E04 (Mathematical logic and foundations :: Set theory :: Ordered sets and their cofinalities; pcf theory) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|