The comparison on constructible inputs
Setting
Levels are S : CriticalValues n with a 0 < ⋯ < a n, stars J i and gaps K e (see
reeb-constructible-cosheaf.md). A presentation P : CylinderPresentation n has vertex pieces
V i, edge pieces E e and continuous endpoint maps. Its realization is X = P.Realization S with
height h = P.height S (see reeb-constructible-space.md). The Reeb quotient is
Q = ReebQuotient h with projection q and descended height h̄. G is the finite realization of
the component data P.componentData, whose vertex and edge sets π₀ (V i) and π₀ (E e) carry
the discrete topology. The maps Φ = componentGraphMap : X → G and
θ = quotientComponentGraphMap : Q → G satisfy θ ∘ q = Φ by definition (see
reeb-constructible-quotient.md).
For f : C(Y, ℝ), C_f = intervalComponents f sends an open interval I to the path components
of f ⁻¹ I, with paths inside the inverse image. The comparison
η_f = ReebQuotient.componentComparison f of reeb-quotient-comparison.md is defined on all open
sets of ℝ.
The map on open intervals
ReebQuotient.intervalComponentComparison f : intervalComponents f ⟶ intervalComponents (height f)
is componentComparison f precomposed with OpenInterval.toOpensFunctor. It sends the path
component of x in f ⁻¹ I to the path component of q x in f̄ ⁻¹ I
(intervalComponentComparison_app_mk). Its identity with componentComparison f holds by rfl,
as transformations and at each interval (intervalComponentComparison_eq,
intervalComponentComparison_app), so no other bijection is introduced. It is surjective at every
interval (intervalComponentComparison_app_surjective).
intervalComponentNatTrans h comm : intervalComponents f ⟶ intervalComponents g is
componentNatTrans h comm precomposed with toOpensFunctor, for a continuous h with
g ∘ h = f. The interval component functor intervalComponentsOver of
reeb-rgraph-cosheaf-equivalence.md acts on a slice morphism φ by
intervalComponentNatTrans φ.left.hom _ (intervalComponentsOver_map_eq_intervalComponentNatTrans,
by rfl). Naturality in height-preserving maps is componentComparison_natural, precomposed:
intervalComponentNatTrans h comm ≫ η_g = η_f ≫ intervalComponentNatTrans (ReebQuotient.map h comm) _
(intervalComponentComparison_natural). When both comparisons are isomorphisms, the inverses
satisfy the reversed square (inv_intervalComponentComparison_natural).
On the real slice, the comparison at A is the path-component map of the projection ρ_A
(componentComparisonOver_app_eq_map, the source's η = 𝒞ρ). Precomposed with toOpensFunctor,
ReebQuotient.intervalComponentComparisonOver :
intervalComponentsOver ⟶ quotientFunctor ℝ ⋙ intervalComponentsOver
has as component at A the comparison of the structure map of A
(intervalComponentComparisonOver_app).
Presentations
Assume that every piece of P is locally path-connected and has finitely many path components.
Compactness is not assumed. Nothing is assumed of Hausdorffness or of the endpoint maps.
- Factorization. From
θ ∘ q = Φ,π₀(θ) ∘ η = π₀(Φ)at every interval (intervalComponentComparison_comp,intervalComponentComparison_comp_apply). π₀(Φ)is a natural isomorphism. BothC_hand the path-component cosheaf ofGare constructible atSand interval cosheaves. At a star,π₀(Φ)carries the component bijection ofPto that ofG, precomposed withc ↦ [c]on the discrete vertex set ofG(componentGraphMap_star), and likewise at a gap (componentGraphMap_gap). All three maps are bijections, so every star and gap component ofπ₀(Φ)is bijective. The short-interval testCriticalValues.isIso_iff_shortIntervalsthen gives an isomorphism on all intervals (isIso_intervalComponentNatTrans_componentGraphMap).- Bijectivity. At every open interval, including
⊥, rays and⊤,η_his injective becauseπ₀(θ) ∘ η_h = π₀(Φ)is injective, and surjective byintervalComponentComparison_app_surjective(bijective_intervalComponentComparison_app). - Isomorphism.
η_his a natural isomorphism (the instanceCylinderPresentation.isIso_intervalComponentComparison, andintervalComponentComparisonIsowith hom the comparison byintervalComponentComparisonIso_hom).
Consequences: C_{h̄} is constructible at the same S
(isConstructibleAt_intervalComponents_reebQuotient), and π₀(θ) is a natural isomorphism
(isIso_intervalComponentNatTrans_quotientComponentGraphMap). At stars and gaps, π₀(θ) ∘ η is
the map taking each piece to its set of path components, read through the component bijections of
P and of G (intervalComponentComparison_star, intervalComponentComparison_gap). No lifting
of paths along general quotient maps is used.
Constructible ℝ-spaces
IsConstructibleSpace A holds when A is isomorphic in the real slice to a realization with
compact locally path-connected pieces, and ConstructibleSpaceCat is the full subcategory on these
objects, with all continuous height-preserving maps (see reeb-constructible-quotient.md).
- Objectwise. For constructible
A, the comparison of the structure map ofAis an isomorphism (isIso_intervalComponentComparison_of_constructible). The presentation result is transported alongA ≅ (X, h)by naturality ofintervalComponentComparisonOver, not along a chosen bijection. Finiteness of the component sets follows from compactness and local path-connectedness. - Common levels. For constructible
A,Cof the structure map andCof its Reeb quotient are constructible at one common list of levels (exists_isConstructibleAt_of_isConstructibleSpace). - Graph objects. On a graph object the comparison is an isomorphism by the projection
isomorphism
RGraph.projNatIsoalone (isIso_intervalComponentComparison_of_isRGraph). -
Functor level.
constructibleComponentComparisonisintervalComponentComparisonOverrestricted toConstructibleSpaceCat. It is an isomorphism (the instanceisIso_constructibleComponentComparison), givingconstructibleComponentComparisonIso : ι ⋙ intervalComponentsOver ≅ ι ⋙ quotientFunctor ℝ ⋙ intervalComponentsOverwhose component at
Ais the comparison of the structure map ofA(constructibleComponentComparison_app,constructibleComponentComparisonIso_hom_app, byrfl). Its square for every morphismgiscomponentComparison_naturalprecomposed (constructibleComponentComparison_naturality). - Constructible cosheaves.constructibleCosheafFunctor : ConstructibleSpaceCat ⥤ ConstructibleCosheafCat.{0}liftsι ⋙ intervalComponentsOver. It lands in constructible cosheaves because the interval components of every space overℝform an interval cosheaf and those of a constructible ℝ-space are constructible. The comparison is a natural isomorphismconstructibleCosheafComparisonIso : constructibleCosheafFunctor ≅ quotientRGraphFunctor ⋙ RGraph.cosheafFunctor (constructibleCosheafComparisonIso.hom.app A).hom = ReebQuotient.intervalComponentComparison (overBaseMap A.obj)with
quotientRGraphFunctorofreeb-constructible-quotient.mdandRGraph.cosheafFunctorofreeb-rgraph-cosheaf-equivalence.md. The component identity holds byrfl(constructibleCosheafComparisonIso_hom_app_hom); withintervalComponentComparison_eq, every component iscomponentComparisonof the structure map, precomposed withtoOpensFunctor.
The graph case
For finite data D, the comparison at the realization of D is the path-component map of the
projection homeomorphism RGraph.projHomeomorph of reeb-rgraph.md, by rfl
(intervalComponentComparison_ofFiniteData). Its inverse is the path-component map of the inverse
projection RGraph.projInv (inv_intervalComponentComparison_ofFiniteData, with
height_projInv). At a graph object, the component of constructibleComponentComparisonIso is the
image of RGraph.projNatIso under intervalComponentsOver
(constructibleComponentComparisonIso_app_of_isRGraph). At the thickening of a graph object, the
inverse of the comparison is the first factor of the comparison of geometric smoothing with cosheaf
smoothing (see reeb-rgraph-smoothing.md).
Hypotheses and their limits
Every isomorphism statement carries the presentation hypotheses, IsConstructibleSpace, or a
graph-object or finite-data hypothesis, under which the presentation hypotheses hold.
The instances are keyed on the height of a presentation and on the functor-level transformation; no
instance gives IsIso of the comparison for an arbitrary map. For arbitrary maps only the defining
identities, surjectivity and naturality are stated.
Constructibility of the source cosheaf does not suffice, nor constructibility of both cosheaves at a
common list. Take the closed topologist's sine curve as the single compact vertex piece at the one
level of a one-level list. It has two path components, so its path-component cosheaf is
constructible at that list. With constant height, the Reeb quotient is the set of its two path
components with the quotient topology. The graph part is open and the limit segment is not, so the
quotient is the Sierpiński space, which is path-connected. The quotient cosheaf therefore has one
element on every interval containing the level and is constructible at the same list, while the
comparison over ℝ sends two elements to one. The piece is compact but not locally
path-connected. This variant of the source's Example 3.21 is not machine-checked.
The source's Example 3.21, the topologist's sine curve with the first-coordinate projection, is the
nonconstructible obstruction: there 𝒞(𝕊, x) and 𝒞ℛ(𝕊, x) are not isomorphic. The fixture
Examples.TopologistsSineCurve.intervalComponentComparison_not_injective proves that the
comparison is not injective at the interval ℝ; see reeb-quotient-comparison.md. That no
isomorphism exists between the two cosheaves is not formalized.
Universes
intervalComponentNatTrans, the comparison on open intervals with its formulas, surjectivity and
naturality, and all presentation results hold in every carrier universe. The slice, the full
subcategory of constructible ℝ-spaces and the functor-level isomorphisms are in universe 0,
matching Over (TopCat.of ℝ); the constructible-cosheaf form is at value universe 0.
Fixtures
TDA.Reeb.ConstructibleComparisonExamples works with the comparison on presentations, built from the constructible-space, cylinder, finite-graph and quotient fixtures:
- Constant-height interval. For
[0, 1]at one level,qis not injective (interval_proj_not_injective), while the comparison is an isomorphism (interval_isIso) with one element on each side overℝ. ∅, rays andℝ. For two unattached pieces at level0, the quotient cosheaf has two elements overℝand over the rays(-∞, 1)and(-1, ∞), and is empty over(-∞, 0)and(0, ∞). At⊥both values are empty and the comparison is bijective (twoPieces_bot).- Empty space. For the thickening of empty data, the comparison is an isomorphism and every quotient value is empty.
- Branch and merge. The thickened cycle over
0 < 1 < 2is a constructible ℝ-space with one vertex at0, two at1, one at2and two edges per gap. Its end stars are the rays(-∞, 1)and(1, ∞). The quotient counts are1, 2, 1on the stars and2on each gap, and the quotient's incidence maps into the bottom and top stars are not injective. - Branching at equal cardinality. For the thickened pinch, the counts at the bottom star and the
gap are both
2, and the gap-to-star map is not injective in the source, through the bottom gluing, and in the quotient, through the comparison. - Graph case. For parallel edges over
0 < 1, the comparison and its inverse are the path-component maps ofRGraph.projHomeomorphandRGraph.projInv, the functor-level component is the image ofRGraph.projNatIso, and the two edges stay two components of the quotient over the gap. - Transport. The single edge refined over
0 < 1/2 < 1is constructible through the refinement isomorphism to the single edge over0 < 1, and the comparison there is an isomorphism. - Height-dependent map. The twist of the thickened parallel edges swaps the two edge components
over the gap in the source and, through the comparison, in the quotient. The naturality squares
hold for the comparison, its inverse and, as a morphism of
ConstructibleSpaceCat, the functor-level isomorphism.
The helpers natCard_quotient and quotient_map_injective_iff transfer cardinalities and
injectivity of structure maps between the source and quotient cosheaves of a presentation.
Source correspondence
de Silva, Munch and Patel, Categorified Reeb Graphs:
- §3.4:
𝒞(f)(I) = π₀ f⁻¹(I), with𝒞'its restriction to ℝ-Topᶜ and𝒞''its restriction to Reeb. Here𝒞isintervalComponentsOver,𝒞'isconstructibleCosheafFunctorand𝒞''isRGraph.cosheafFunctor. The Reeb functorℛon ℝ-Topᶜ isquotientRGraphFunctor. - Theorem 3.17: the functors
𝒞'and𝒞''ℛfrom ℝ-Topᶜ to Cshᶜ are naturally isomorphic. Here this isconstructibleCosheafComparisonIso, natural on all morphisms ofConstructibleSpaceCat.constructibleComponentComparisonIsois the same isomorphism between functors to precosheaves on open intervals. - Proof of Theorem 3.17: the source defines
η = 𝒞ρon all of ℝ-Top (componentComparisonOver_app_eq_mapon open sets; on open intervals it follows by precomposition withtoOpensFunctor), notes that𝒞(f)and𝒞ℛ(f)are constructible with the same critical set, and checks short intervals by Corollary 3.14. At stars and gaps it appliesπ₀to the homotopy equivalences of the cylinder principle (Lemma 2.4) in the diagrams (2.6) forρ.- Here Corollary 3.14 is applied to
π₀(Φ)forΦ = θ ∘ ρ, whose source and target are realizations overS. A presentation of the quotient overSwould need the homeomorphism ofreeb-constructible-quotient.md, hence compactness, beforeC_{h̄}is known to be constructible. - Injectivity of
ηfollows from the factorization throughπ₀(θ), and surjectivity fromcomponentComparison_app_surjective. - The isomorphism is proved, and so is the proof's intermediate claim that both cosheaves are
constructible at a common list (
isConstructibleAt_intervalComponents_reebQuotient,exists_isConstructibleAt_of_isConstructibleSpace). The star and gap formulasintervalComponentComparison_starandintervalComponentComparison_gapare the source's two diagrams composed withπ₀(θ).
- Here Corollary 3.14 is applied to
- The presentation-level theorem assumes finitely many path components and local path-connectedness of every piece, without compactness. The source's class, compact and locally path-connected pieces, implies these hypotheses, and the slice-level theorems use exactly that class.
- Example 3.21: the topologist's sine curve, where
𝒞(𝕊, x)and𝒞ℛ(𝕊, x)are not isomorphic. The comparison is not injective atℝ(Examples.TopologistsSineCurve.intervalComponentComparison_not_injective).
Not claimed here: an isomorphism of componentComparison on all open sets of ℝ; invertibility of
the comparison for arbitrary maps or for nonconstructible spaces; the non-isomorphism of the two
cosheaves in Example 3.21 (only non-injectivity of the comparison at ℝ is proved) or the
constant-height sine-curve variant; the functor-level statements in universes other than
0.
Source: de Silva, Munch and Patel, Categorified Reeb Graphs, §3.4, Theorem 3.17 and Example 3.21.