Local cylinder comparisons and constructibility of path components
Setting
Levels are S : CriticalValues n with a 0 < ⋯ < a n, stars J i = (a (i-1), a (i+1)) and gaps
K e = (a e, a (e+1)), with infinite ends at the extremes (see reeb-constructible-cosheaf.md).
A presentation P : CylinderPresentation n has arbitrary topological pieces V i, E e and
continuous endpoint maps (see reeb-constructible-space.md). Write X = P.Realization S and
h = P.height S.
For an open interval W, P.heightPreimage S W is the subspace {x : X // h x ∈ W}. Its path
components are (intervalComponents h).obj W by definition (intervalComponents_obj_eq, proved by
rfl). The fiber inclusions are
vertexFiberInclusion i : V i → heightPreimage (J i),v ↦ ofVertex i v;regularFiberInclusion e t : E e → heightPreimage (K e),y ↦ ofStrip e (y, t)for a chosent ∈ K e.
The clamp homotopy
Clamp data c : S.ClampData J consist of lo ≤ hi with [lo, hi] ⊆ J such that every level
lying in J lies in [lo, hi]. Put κ t = max lo (min hi t) and κ_s t = t + s (κ t − t) for
s ∈ [0, 1].
- On raw pieces, a vertex point is fixed and a cylinder point
(y, t)of edgeegoes to(y, projIcc (κ_s t)). Curried per piece, this is a continuous map from the whole raw sum intoC([0,1], X)(continuous_clampRaw). - It respects the endpoint relation over
J(clampRaw_nf). An end of a cylinder whose level lies inJhas its level in[lo, hi], soκ_sfixes it and the end still goes to its vertex image. No injectivity, surjectivity or embedding property of the endpoint maps is used. - The quotient map restricted to the open saturated set
h⁻¹ Jis a quotient map. So the family descends to a continuousclampFamily c : C(heightPreimage J, C([0,1], X)). It uncurries to a jointly continuous map because[0,1]is locally compact. - Inside
J,κ tstays in the segment of the edge (clampHeight_mem_seg): ifa (e+1) ∈ J, it lies in[lo, hi], solo ≤ a (e+1); ifa (e+1) ∉ J, thenJlies belowa (e+1)and so doeslo. The case ofa eis symmetric. Hence the height ofclampFamily c u sisκ_s (h u)(height_clampFamily), which lies betweenh uandκ (h u) ∈ [lo, hi]. - For every open interval
Wwith[lo, hi] ⊆ W ≤ J, the family mapsheightPreimage Winto itself. It is a homotopy from the identity to the end mapu ↦ clampFamily c u 1(clampHomotopy).
Continuity is inherited from the raw sum through the quotient map, so no separate argument is
needed at a critical level or at the boundary of a strip. The clamp homotopy is an ordinary
homotopy, not a homotopy over ℝ, because heights move.
Homotopy equivalences
- Vertex. Take
J = J iandlo = hi = a i. The end map lands in the critical fiberh⁻¹{a i} ≅ V i(criticalFiberHomeomorph). Reading it there gives a retraction whose composite withvertexFiberInclusion iis the identity on the nose. The other composite is the end map, homotopic to the identity. SovertexHomotopyEquiv i : V i ≃ₕ heightPreimage (J i). - Regular gap. Take
J = K eandlo = hi = t; no level lies inK e. The end map lands inh⁻¹{t} ≅ E e(regularFiberHomeomorph), givingregularHomotopyEquiv e t. - Nested intervals. Let
I ≤ JwithInonempty and the same levels inIandJ. Takeloandhito be the minimum and maximum of one point ofItogether with the levels inI(exists_clampData_of_le). Then[lo, hi] ⊆ I, and every level ofJlies in[lo, hi]. The end map is a mapheightPreimage J → heightPreimage I, and both composites with the inclusion are end maps of the same homotopy restricted toW = IandW = J. So the inclusion is a homotopy equivalence (nestedHomotopyEquiv).
These need no hypothesis on the pieces. The forward map of each HomotopyEquiv is the inclusion; that is the interface. The homotopy inverses are chosen clamp retractions and are not
part of it. The construction shows that the inclusion heightPreimage I → heightPreimage J is a
homotopy equivalence; it does not exhibit heightPreimage I as a deformation retract, since the
clamp also moves points of heightPreimage I.
Component bijections and incidence
Homotopic maps induce equal maps on path components (componentMap_eq_of_homotopic), so a
homotopy equivalence induces an equivalence on ZerothHomotopy (componentEquivOfHomotopyEquiv)
whose forward map is componentMap of the forward map. This gives
vertexComponentsEquiv i : ZerothHomotopy (V i) ≃ (intervalComponents h).obj (J i)
edgeComponentsEquiv e t : ZerothHomotopy (E e) ≃ (intervalComponents h).obj (K e)
with generators sent to the classes of the inclusions (vertexComponentsEquiv_mk,
edgeComponentsEquiv_mk).
The cylinder line from (y, t) to (y, a e) stays in J e.castSucc (joinedIn_cylinder). So
the gap-to-star map carries the edge bijection to the left endpoint map:
(intervalComponents h).map (K e ≤ J e.castSucc) ∘ edgeComponentsEquiv e t
= vertexComponentsEquiv e.castSucc ∘ componentMap (left e)
(map_K_le_J_castSucc_edgeComponentsEquiv), and analogously through J e.succ with right e
(map_K_le_J_succ_edgeComponentsEquiv). The conjugated forms
vertexComponentsEquiv_symm_map_castSucc and vertexComponentsEquiv_symm_map_succ state
componentMap (left e) and componentMap (right e) as the conjugated functor maps. These
proofs use paths only, not retractions.
Naturality
Let P and P' be presentations over the same S, and let φ : P.Realization S →
P'.Realization S be any continuous map with P'.height S ∘ φ = P.height S. No presentation map
is assumed; a height-preserving map may vary along a cylinder.
φrestricts to fibers, definingvertexFiberMap φ i : V i → V' iandregularFiberMap φ e t : E e → E' ethrough the fiber homeomorphisms, withmap_ofVertex_eqandmap_ofStrip_eq.- The fiber inclusions commute with
φon the nose (vertexFiberInclusion_naturality,regularFiberInclusion_naturality, stated withpreimageRestrict). - Hence the component bijections are natural for
componentNatTrans φ(componentNatTrans_vertexComponentsEquiv,componentNatTrans_edgeComponentsEquiv) and for its restriction to open intervals (whiskerLeft_componentNatTrans_vertexComponentsEquiv,whiskerLeft_componentNatTrans_edgeComponentsEquiv).
The chosen retractions and homotopies are not claimed to commute with φ.
Height independence on path components
The edge bijection does not depend on the regular height: edgeComponentsEquiv e t =
edgeComponentsEquiv e t' (edgeComponentsEquiv_indep), by the cylinder line inside K e.
Combined with naturality, componentMap (regularFiberMap φ e t) does not depend on t
(componentMap_regularFiberMap_indep).
Pointwise independence is false in general. Take E e = V = S¹ with identity endpoint maps, and
let φ rotate the strip point at height t by an angle θ(t) vanishing at both levels. Then φ
is continuous and height-preserving, and regularFiberMap φ e t is rotation by θ(t). When the
edge piece of the target is discrete, the path-component statement does give pointwise
independence (regularFiberMap_indep_of_discrete). For a realized map of finite data the regular
fiber map is the edge component of the data map at every height (regularFiberMap_realizeHom).
Constructibility
intervalComponents_isConstructibleAt proves S.IsConstructibleAt (intervalComponents h) under
Finite (ZerothHomotopy (P.V i)) and Finite (ZerothHomotopy (P.E e)) for every piece. These are
its only hypotheses.
- Finite values (
finite_intervalComponents). The empty interval has an empty value. For nonemptyI, every point ofheightPreimage Iis joined inside it to one of two kinds of point: a vertex point at a level ofI, along its cylinder line when an endpoint level of its edge lies inI; or the strip point at one fixed height ofI, whenIcontains neither endpoint level, which forcesI ≤ K e. This gives a surjection from the finite type(Σ levels k in I, π₀ (V k)) ⊕ (Σ e with I ≤ K e, π₀ (E e)). Compactness of an open inverse image is never used; it fails in general, sinceh⁻¹(K e) ≅ E e × K e. - Bijectivity (
intervalComponents_map_bijective). For nonemptyI ≤ Jwith the same levels, the map(intervalComponents h).map (homOfLE _)equals the component bijection ofnestedHomotopyEquiv. - Exterior values are empty by
height_preimage_lowerTailandheight_preimage_upperTail.
Corollaries: compact locally path-connected pieces have finitely many path components, so they
suffice (isConstructibleAt_of_compact_lpc); realized finite data have discrete pieces, which are
their own path components (finiteData_isConstructibleAt).
The cosheaf condition is not reproved here: intervalComponents_isIntervalCosheaf gives it for
every continuous height.
Fixtures
TDA.Reeb.ConstructibleCylinderExamples computes the intervalComponents of realized
finite data:
n = 0with two vertices: the value onℝhas two elements, and the inclusion of(-1, 1)intoℝis bijective;- a pinch over levels
0 < 1whose two edges both start at vertex0, a noninjective left endpoint map: the gap and the ray starJ 0 = (-∞, 1)have two components each, both branches map to vertex0, and the right incidenceK 0 ≤ J 1sends edgeyto vertexy; - the proper inclusion
K 0 ≤ J 0into the ray crosses the level0, outside the equal-level condition, and is not injective; - the regular interval
(1/4, 3/4)avoids every level, has a nonempty inverse image with two components, and its inclusion into the gap is bijective; - empty values on the lower tail for
n = 0and on(2, 3)above the pinch; - height independence on the pinch: the realized data map reversing the edges has the same
regular fiber map, the reversal, at
1/2and3/4, and it is not the identity; the edge component bijections at the two heights agree; n = 2with levels0 < 1 < 2: in the bounded starJ 1 = (0, 2)the lower edge arrives by right incidence at vertex0and the upper edge by left incidence at vertex1, in different components.
Source correspondence
de Silva, Munch and Patel, Categorified Reeb Graphs:
- §2.2, Lemma 2.4 (cylinder principle): the fiber inclusions
𝕍ᵢ → f⁻¹(aᵢ₋₁, aᵢ₊₁)and𝔼ᵢ → f⁻¹(aᵢ, aᵢ₊₁)at somea ∈ (aᵢ, aᵢ₊₁)are homotopy equivalences fitting into the incidence diagrams (2.5), which commute up to homotopy, and natural in the sense of (2.6). Here the homotopy equivalences arevertexHomotopyEquivandregularHomotopyEquiv, for arbitrary pieces. The incidence diagrams are proved on path components (map_K_le_J_castSucc_edgeComponentsEquiv,map_K_le_J_succ_edgeComponentsEquiv), and the naturality as exact squares of the fiber inclusions (vertexFiberInclusion_naturality,regularFiberInclusion_naturality). The parenthesis of the lemma indexes the absent edge sets so that the first genuine edge set would be empty. Here the incident edges of leveliare theewithe.castSucc = iore.succ = i, andn = 0has no edge. - §3.4, Proposition 3.16: the path-component cosheaf of a constructible ℝ-space is constructible
with the same critical set. Here this is
intervalComponents_isConstructibleAt, with finite piece component sets in place of compact locally path-connected pieces. As in the source proof, the nested inclusion with the same critical points is a homotopy equivalence (nestedHomotopyEquiv).
Not claimed here: naturality for height-preserving maps between realizations over different
critical lists, which needs a re-presentation over a common refinement; naturality of the chosen
retractions; pointwise height independence of regularFiberMap for general pieces; a deformation
retraction onto an open inverse image; the incidence diagrams up to homotopy at the level of
spaces.
Source: de Silva, Munch and Patel, Categorified Reeb Graphs.