Uncountably many homogeneous real trees with the same valence
P\'en\'elope Azuelos

TL;DR
This paper demonstrates that for any valence , there are uncountably many homogeneous incomplete real trees with that valence, contrasting with the unique complete case, highlighting the richness of incomplete structures.
Contribution
It shows the existence of uncountably many homogeneous incomplete real trees with a given valence , extending the classification beyond the complete case.
Findings
Uncountably many homogeneous incomplete real trees exist for .
Completeness is necessary for uniqueness when .
Complete real trees are unique for each valence .
Abstract
For any cardinal , there is a unique complete real tree whose points all have valence . In this note, we show that, when , it is necessary to assume completeness. More precisely, we show that there exist uncountably many homogeneous incomplete real trees whose points all have valence .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Advanced Banach Space Theory
