Pressing Down Lemma for λ -trees and its applications

Hui Li; Liang-Xue Peng

Czechoslovak Mathematical Journal (2013)

  • Volume: 63, Issue: 3, page 763-775
  • ISSN: 0011-4642

Abstract

top
For any ordinal λ of uncountable cofinality, a λ -tree is a tree T of height λ such that | T α | < cf ( λ ) for each α < λ , where T α = { x T : ht ( x ) = α } . In this note we get a Pressing Down Lemma for λ -trees and discuss some of its applications. We show that if η is an uncountable ordinal and T is a Hausdorff tree of height η such that | T α | ω for each α < η , then the tree T is collectionwise Hausdorff if and only if for each antichain C T and for each limit ordinal α η with cf ( α ) > ω , { ht ( c ) : c C } α is not stationary in α . In the last part of this note, we investigate some properties of κ -trees, κ -Suslin trees and almost κ -Suslin trees, where κ is an uncountable regular cardinal.

How to cite

top

Li, Hui, and Peng, Liang-Xue. "Pressing Down Lemma for $\lambda $-trees and its applications." Czechoslovak Mathematical Journal 63.3 (2013): 763-775. <http://eudml.org/doc/260616>.

@article{Li2013,
abstract = {For any ordinal $\lambda $ of uncountable cofinality, a $\lambda $-tree is a tree $T$ of height $\lambda $ such that $|T_\{\alpha \}|<\{\rm cf\}(\lambda )$ for each $\alpha <\lambda $, where $T_\{\alpha \}=\lbrace x\in T\colon \{\rm ht\}(x)=\alpha \rbrace $. In this note we get a Pressing Down Lemma for $\lambda $-trees and discuss some of its applications. We show that if $\eta $ is an uncountable ordinal and $T$ is a Hausdorff tree of height $\eta $ such that $|T_\{\alpha \}|\le \omega $ for each $\alpha <\eta $, then the tree $T$ is collectionwise Hausdorff if and only if for each antichain $C\subset T$ and for each limit ordinal $\alpha \le \eta $ with $\{\rm cf\}(\alpha )>\omega $, $\lbrace \{\rm ht\}(c)\colon c\in C\rbrace \cap \alpha $ is not stationary in $\alpha $. In the last part of this note, we investigate some properties of $\kappa $-trees, $\kappa $-Suslin trees and almost $\kappa $-Suslin trees, where $\kappa $ is an uncountable regular cardinal.},
author = {Li, Hui, Peng, Liang-Xue},
journal = {Czechoslovak Mathematical Journal},
keywords = {tree; $D$-space; $\lambda $-tree; property $\gamma $; collectionwise Hausdorff; tree; -space; -tree; property ; collectionwise Hausdorff},
language = {eng},
number = {3},
pages = {763-775},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Pressing Down Lemma for $\lambda $-trees and its applications},
url = {http://eudml.org/doc/260616},
volume = {63},
year = {2013},
}

TY - JOUR
AU - Li, Hui
AU - Peng, Liang-Xue
TI - Pressing Down Lemma for $\lambda $-trees and its applications
JO - Czechoslovak Mathematical Journal
PY - 2013
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 63
IS - 3
SP - 763
EP - 775
AB - For any ordinal $\lambda $ of uncountable cofinality, a $\lambda $-tree is a tree $T$ of height $\lambda $ such that $|T_{\alpha }|<{\rm cf}(\lambda )$ for each $\alpha <\lambda $, where $T_{\alpha }=\lbrace x\in T\colon {\rm ht}(x)=\alpha \rbrace $. In this note we get a Pressing Down Lemma for $\lambda $-trees and discuss some of its applications. We show that if $\eta $ is an uncountable ordinal and $T$ is a Hausdorff tree of height $\eta $ such that $|T_{\alpha }|\le \omega $ for each $\alpha <\eta $, then the tree $T$ is collectionwise Hausdorff if and only if for each antichain $C\subset T$ and for each limit ordinal $\alpha \le \eta $ with ${\rm cf}(\alpha )>\omega $, $\lbrace {\rm ht}(c)\colon c\in C\rbrace \cap \alpha $ is not stationary in $\alpha $. In the last part of this note, we investigate some properties of $\kappa $-trees, $\kappa $-Suslin trees and almost $\kappa $-Suslin trees, where $\kappa $ is an uncountable regular cardinal.
LA - eng
KW - tree; $D$-space; $\lambda $-tree; property $\gamma $; collectionwise Hausdorff; tree; -space; -tree; property ; collectionwise Hausdorff
UR - http://eudml.org/doc/260616
ER -

References

top
  1. Borges, C. R., Wehrly, A. C., A study of D -spaces, Topology Proc. 16 (1991), 7-15. (1991) Zbl0787.54023MR1206448
  2. Devlin, K. J., Shelah, S., 10.1112/plms/s3-39.2.237, Proc. Lond. Math. Soc., III. Ser. 39 (1979), 237-252. (1979) MR0548979DOI10.1112/plms/s3-39.2.237
  3. Engelking, R., General Topology. Rev. and compl. ed. Sigma Series in Pure Mathematics 6, Heldermann Berlin (1989). (1989) MR1039321
  4. Fleissner, W. G., 10.1090/S0002-9939-1980-0577767-2, Proc. Am. Math. Soc. 80 (1980), 320-326. (1980) MR0577767DOI10.1090/S0002-9939-1980-0577767-2
  5. Fleissner, W. G., Stanley, A. M., 10.1016/S0166-8641(00)00042-0, Topology Appl. 114 (2001), 261-271. (2001) Zbl0983.54024MR1838325DOI10.1016/S0166-8641(00)00042-0
  6. Fodor, G., Eine Bemerkung zur Theorie der regressiven Funktionen, Acta Sci. Math. 17 (1956), 139-142. (1956) Zbl0072.04302MR0082450
  7. Guo, H. F., Junnila, H., 10.1016/j.topol.2011.06.053, Topology Appl. 158 (2011), 2111-2121. (2011) MR2831896DOI10.1016/j.topol.2011.06.053
  8. Hart, K. P., 10.1016/0166-8641(83)90033-0, Topology Appl. 15 (1983), 151-158. (1983) MR0686092DOI10.1016/0166-8641(83)90033-0
  9. Kunen, K., Set Theory, An Introduction to Independence Proofs. Studies in Logic and the Foundations of Mathematics vol. 102 North-Holland, Amsterdam (1980). (1980) Zbl0443.03021MR0597342
  10. Nyikos, P. J., Various topologies on trees, Proceedings of the Tennessee Topology Conference, Nashville, TN, USA, June 10-11, 1996 World Scientific Singapore P. R. Misra et al. 167-198 (1997). (1997) Zbl0913.54028MR1607401
  11. Douwen, E. K. van, Lutzer, D. J., 10.1090/S0002-9939-97-03902-6, Proc. Am. Math. Soc. 125 (1997), 1237-1245. (1997) MR1396999DOI10.1090/S0002-9939-97-03902-6
  12. Douwen, E. K. van, Pfeffer, W. F., 10.2140/pjm.1979.81.371, Pac. J. Math. 81 (1979), 371-377. (1979) MR0547605DOI10.2140/pjm.1979.81.371

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.