Cylinder presentations and constructible ℝ-spaces
Presentations
Levels are S : CriticalValues n, a strictly increasing a : Fin (n + 1) → ℝ (see
reeb-constructible-cosheaf.md). A cylinder presentation P : CylinderPresentation n has
- vertex pieces
V ifori : Fin (n + 1)and edge piecesE efore : Fin n, each an arbitrary topological space; - continuous endpoint maps
left e : E e → V e.castSuccandright e : E e → V e.succ.
The levels are not stored in the presentation; every construction takes S explicitly. Endpoint
maps need not be injective, surjective or embeddings. Empty pieces, isolated vertices and parallel
edges are allowed. There are no edge pieces below a 0 or above a n.
Realization and normal form
P.Realization S is the quotient of the finite sum
(Σ i, V i) ⊕ (Σ e, E e × [a e, a (e+1)])
by the equivalence closure of exactly two identifications per edge (EndpointRel):
(y, a e) ~ left e y and (y, a (e+1)) ~ right e y. It carries the quotient topology, with
quotient map CylinderPresentation.quotMk. The realization of a simple graph by dart cells is a
different construction, in namespace TDA.Reeb.GraphRealization, whose short names Realization,
quotMk, lift and others coincide with names here (reeb-graph-realization.md).
The closure has a normal form (nf): a cylinder end goes to its vertex image, and every other
point is fixed. Two raw points are identified exactly when their normal forms agree (eqvGen_iff).
Hence:
- distinct vertex points are never identified (
ofVertex_eq_ofVertex_iff); - distinct points of an open strip
E e × K e, withK e = (a e, a (e+1)), are never identified (ofStrip_injective), and no strip point equals a vertex point (ofVertex_ne_ofStrip); - every point is a vertex point or a strip point (
exists_rep).
Two cylinder ends of different edges are identified when their endpoint images coincide, through transitivity.
Constructors, height and universal property
ofVertex i : V i → P.Realization S and ofCylinder e : E e × [a e, a (e+1)] → P.Realization S
are continuous, and ofCylinder_segBot, ofCylinder_segTop are the two endpoint identities. The
continuous height P.height S is a i on V i and the real coordinate on a cylinder, by
definition.
A family of continuous maps on all vertex pieces and closed cylinders satisfying the two endpoint
equations (CompatibleMaps) descends to a unique continuous map on the realization (lift,
lift_unique, existsUnique_lift). liftEquiv is this correspondence as an equivalence, with
both inverse laws; the inverse restricts a map to the pieces.
For a fixed presentation, affine changes of the strictly increasing level list give
CylinderPresentation.levelHomeomorph. With compact locally path-connected pieces, the
transported height is constructible. See
Level perturbations of a fixed presentation
for the stability bounds, supremum lower bound and exact translation distance.
Strip and fiber normal forms
The first three are homeomorphisms onto subspaces of the realization, not only bijections.
- Open strip.
ofStrip eis an open embedding ofE e × K e, andstripHomeomorphidentifiesE e × K ewithheight ⁻¹' K e, compatibly with the height. - Regular fiber. For
t ∈ K e,regularFiberHomeomorphidentifiesE ewithheight ⁻¹' {t}. - Critical fiber.
criticalFiberHomeomorphidentifiesV iwithheight ⁻¹' {a i}. The subspace topology onV icomes from collars: an openU ⊆ V iis the trace of the open set consisting ofUand the cylinder points within a fixed width of an end whose endpoint image lies inU(isInducing_ofVertex). - Exterior. Heights lie in
[a 0, a n](height_mem_Icc), so nothing lies over the tailslowerTail = (-∞, a 0)andupperTail = (a n, ∞)(height_preimage_lowerTail,height_preimage_upperTail).
The closed cylinder does not embed in general. When left e is not injective, distinct bottom
ends of E e × [a e, a (e+1)] are identified (pinch_ofCylinder_not_injective in the fixtures).
Topological properties
Hausdorffness. If every V i and every E e is Hausdorff, so is the realization
(t2Space). Two distinct points are separated as follows.
- Different heights: by preimages of disjoint open sets under the continuous height.
- Equal regular heights: both points lie in one open strip, since a regular height determines its
edge. They are separated in the Hausdorff space
E e × K eand carried over by the open embedding. - Equal critical heights: both are points of one
V i. Disjoint open sets ofV iextend to disjoint open collars. A collar widthδwith0 < δand2δ ≤ a (e+1) - a efor everyemakes collars saturated and keeps collars of disjoint sets disjoint (exists_collarWidth,disjoint_collar).
The proof uses neither compactness nor properness. It uses no separation property of the quotient itself. With Hausdorff pieces, no non-Hausdorff example exists, so none is included among the fixtures.
Compactness and local path-connectedness. If all pieces are compact, the realization is compact
(compactSpace): it is a quotient of a finite sum of compact spaces. If all pieces are locally
path-connected, so is the realization (locallyPathConnectedSpace), since closed segments are
locally path-connected (locallyPathConnectedSpace_seg). All three results are registered as
conditional instances.
Finite data
ofFiniteData D turns finite incidence data D : FiniteReebData n into a presentation with
discrete pieces. Its realization is the same Realization, not a separate model, and it is
Hausdorff, compact and locally path-connected with no further hypothesis. Six simp lemmas expose
its projections. A map of finite data φ : D.Hom D' gives a continuous map
realizeHom S φ between the realizations at the same S, defined through lift. It preserves
height (height_realizeHom), sends the identity to the identity (realizeHom_id) and preserves
composition (realizeHom_comp).
Fixtures
TDA.Reeb.ConstructibleSpaceExamples states every fixture about the quotient:
n = 0: every presentation realizesV 0at the single height (homeomorphZero);- all pieces empty: an empty realization;
- missing edges: a point at each of two levels and no edge gives a realization that is not preconnected;
- an empty vertex piece forces the adjacent edge pieces empty; nothing lies over
[a e, a (e+1))whenV e.castSuccis empty, and for concrete data the critical fiber at an emptyV 0is empty; - noninjective attachment: a two-point edge piece with constant left endpoint map; the bottom ends are identified, while the top ends and regular points stay apart;
- parallel edges: two edges between the same vertices give a regular fiber with two points;
- a disconnected realization, two disjoint segments, separated by a label obtained from
lift; - empty fibers below
a 0and abovea n.
Source correspondence
de Silva, Munch and Patel, Categorified Reeb Graphs, §2.2, define a constructible ℝ-space from
critical values a 0 < ⋯ < a n, locally path-connected compact spaces 𝕍ᵢ and 𝔼ᵢ, and
continuous maps 𝕝ᵢ : 𝔼ᵢ → 𝕍ᵢ, 𝕣ᵢ : 𝔼ᵢ → 𝕍ᵢ₊₁. The space is the quotient of the disjoint
union of 𝕍ᵢ × {aᵢ} and 𝔼ᵢ × [aᵢ, aᵢ₊₁] by the two endpoint identifications, and the height is
the projection to the second factor.
Realizationis this quotient. Compactness and local path-connectedness are hypotheses ofcompactSpaceandlocallyPathConnectedSpace, not part of the data. Hausdorffness is proved from Hausdorff pieces alone.- The source's constructible ℝ-spaces form a full subcategory of ℝ-spaces: morphisms are all
continuous height-preserving maps. A map between cylinder pieces may vary with height, so finite
data maps do not describe all morphisms.
realizeHomrealizes only maps of finite data. - Lemma 2.4, the cylinder principle, states that the fiber inclusions
𝕍ᵢ → f⁻¹(aᵢ₋₁, aᵢ₊₁)and𝔼ᵢ → f⁻¹(aᵢ, aᵢ₊₁)are homotopy equivalences. The open-strip homeomorphismE e × K e ≃ height ⁻¹' K eis the geometric input for the second; neither homotopy equivalence is formalized here.
Not claimed here: the category of constructible ℝ-spaces as objects over ℝ isomorphic to a
realization, its TopCat or Over packaging, maps of general presentations, the comparison with
the Reeb quotient, the homotopy equivalences of Lemma 2.4 over stars, changes of the critical
levels, and any embedding of a closed cylinder.
Source: de Silva, Munch and Patel, Categorified Reeb Graphs, §2.2.