Abstract
It is proved that a dendroid is smooth if and only if it can be represented as Ihe inverse limit of an inverse sequence of finite dendrites with bonding mappings which are monotone relatiye to points forming a thread. As a consequence another proof of the existence of a universal smooth dendroid [4) is obtained.
| Original language | American English |
|---|---|
| Journal | Fundamenta Mathematicae |
| State | Published - Jan 1 1984 |
Disciplines
- Mathematics
- Statistics and Probability
Fingerprint
Dive into the research topics of 'Smooth Dendroids as Inverse Limits of Dendrites'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS