Branch points and stability
Algebraic Topology
2020-03-16 v1
Abstract
The hierarchy poset and branch point poset for a data set both admit a calculus of least upper bounds. A method involving upper bounds is used to show that the map of branch points associated to the inclusion of data sets is a controlled homotopy equivalence, where the control is expressed by an upper bound relation that is constrained by Hausdorff distance.
Cite
@article{arxiv.2003.06285,
title = {Branch points and stability},
author = {J. F. Jardine},
journal= {arXiv preprint arXiv:2003.06285},
year = {2020}
}
Comments
8 pages. arXiv admin note: substantial text overlap with arXiv:1908.06323