Topological n-cells and Hilbert cubes in inverse limits
Leonard R. Rubin
Applied General Topology · 2018
doi:10.4995/agt.2018.7061 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
It has been shown by S. Mardešić that if a compact metrizable space X has dim X ≥ 1 and X is the inverse limit of an inverse sequence of compact triangulated polyhedra with simplicial bonding maps, then X must contain an arc. We are going to prove that if X = (|K a |,p b a ,(A,)<a href="http://www.codecogs.com/eqnedit.php?latex=\preceq" target="_blank"><img title="\preceq" src="http://latex.codecogs.com/gif.latex?\preceq" alt="" /></a>)is an inverse system in set theory of triangulated polyhedra|K a |with simplicial bonding functions p b a and X = lim X, then there exists a uniquely determined sub-inverse system X X = (|L a |, p b a |L b |,(A,<a href="http://www.codecogs.com/eqnedit.php?latex=\preceq" target="_blank"><img title="\preceq" src="http://latex.codecogs.com/gif.latex?\preceq" alt="" /></a>)) of X where for each a, L a is a subcomplex of K a , each p b a |L b |:|L b | → |L a | is surjective, and lim X X = X. We shall use this to generalize the Mardešić result by characterizing when the inverse limit of an inverse sequence of triangulated polyhedra with simplicial bonding maps must contain a topological n-cell and do the same in the case of an inverse system of finite triangulated polyhedra with simplicial bonding maps. We shall also characterize when the inverse limit of an inverse sequence of triangulated polyhedra with simplicial bonding maps must contain an embedded copy of the Hilbert cube. In each of the above settings, all the polyhedra have the weak topology or all have the metric topology(these topologies being identical when the polyhedra are finite).
Abstract licence: CC BY-NC-ND
References9
9 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.