Diagrams of finite sublevel homology
Consulted manifestations, attribution and rights: CCDS14-v1, CSEH07.
For a filter function f : FilterFunction K α on a finite collection of faces, dgm k f n labels the bars of gradeHomologyBarcode k f n by the distinct
attained values f.criticalValue. It is exactly
ofIndexBars f.criticalValue f.criticalValue.strictMono (gradeHomologyBarcode k f n).
The vertex and field types share a universe; the ordered value type has an
independent universe. The value order needs no density, nonemptiness or
unboundedness assumption. The bottom filter also works with Empty as its
value type, without choosing a threshold.
dgm_isPositive proves strict birth-before-death for every point.
rank_sublevelHomologyMap gives, for every r ≤ s,
finrank k (range (Hₙ(f.sublevel r) → Hₙ(f.sublevel s)))
= #{(b,d) in dgm k f n | b ≤ r and s < d}.
The map is simplicialHomologyIncl for the sublevel inclusion. Birth is
inclusive and death is strict, including critical endpoints and self maps.
The count is a multiset count, so repeated points retain their multiplicities.
dgm_eq_ofIndexBars_of_iso identifies the diagram with a specified barcode
when the caller supplies a natural isomorphism from the critical-grade
homology module to that barcode module. That theorem retains the supplied-isomorphism interface. Independently,
nonempty_rankBarcodeIso in FiniteDecomposition constructs a natural interval
decomposition for every pointwise finite-dimensional module on a finite
chain, including this critical-grade homology module. The proof uses
classical choices; neither the isomorphism nor dgm is an executable
arbitrary-field barcode algorithm.
The proof uses attained faces to reflect each threshold cut. Every sublevel is
bottom or a critical stage, and a stage equality identifies precisely
which attained values lie below the threshold. Equality-induced homology maps
form a commuting inclusion square. That square identifies the map's
range rank with the critical-grade map rank. The same cut facts transport the
birth/death predicate on every diagram point. Bottom homology vanishes
in every degree through the empty chains, cycles, boundary quotient and
homologyKernelQuotient.
In a gap, equality transport identifies the inclusion with the identity
of the stage homology. Above the final attained value, both sublevels are K
and the transported inclusion is the identity of Hₙ(K;k). Thus the
tail map rank and the number of essential points both equal the terminal homology dimension. Death N of an index bar is labelled ⊤ in
WithTop α. The zero algebraic rank at the index sentinel N is not a tail
homology fiber. The equality squares respect two-step inclusion
composition.
The private examples include all-degree bottom and Empty-value filters, a
nonzero singleton with diagram {(a,⊤)}, finite and essential integer
multiplicity consumers of moduleMultiplicityInteger, diagonal and reversed
grade counts of zero, and both supplied-iso and genuine empty-index iso
consumers.
For the full complex on Fin 2, the filter assigns values 2, 5, 9 to
{0}, {1}, {0,1}. Over ZMod 2, degree-zero homology at the three
nonbottom stages has dimensions 1, 2, 1. Its coordinates are the vertex
coefficient, the pair of vertex coefficients, and the coefficient sum. The
edge boundary is e₁−e₀. For every zero chain c,
c − (c₀+c₁)e₀ = ∂(c₁·{0,1}).
This identity normalizes every quotient class to a multiple of e₀.
It proves that the inverse of the descended coefficient-sum equivalence
sends each scalar a to the class of a e₀. Under these coordinates,
the inclusions are a ↦ (a,0), (a,b) ↦ a+b, and a ↦ a. Their ranks
give index bars [0,3), [1,2) and diagram {(2,⊤),(5,9)}.
The examples state both map rank and diagram slice count for each row:
Thresholds (r,s) |
Rank and count |
|---|---|
(1,1), (1,3), (1,10) |
0 |
(2,2), (3,4), (3,6) |
1 |
(5,5), (6,8) |
2 |
(6,9), (9,9), (6,10), (10,11) |
1 |
The target at 6 has dimension 2 while the map from 3 has rank 1.
The finite point survives at 8 and dies at 9; birth 5 contributes at
the self threshold. Same-stage and tail identities, and the transported
3→6→10 composition, concern the inclusion maps.
These results apply to finite simplicial sublevels with closed birth and half-open lifetime conventions. They extend the finite rank construction to all ordered thresholds; they do not identify it with the full tame real function or singular homology theory. The source convention and finite translation are described in references.md. The separate ordering/reparameterization and geometric obligations of Issue #44 and the acceptance assessment of Issue #43 remain outside this unit.
Finite-filter stability and its source scope
bottleneck_dgm_le_faceSupDifference in FiniteFilterStability bounds the
bottleneck distance by the maximum absolute change over faces, with
empty maximum zero. Its field is arbitrary; its complex has finitely many
faces. The proof linearly interpolates filters, divides at finitely
many isolated face-value crossings, and chooses a compatible order inside
each gap. Continuity preserves its weak inequalities at both closed
endpoints. A fixed template therefore bounds the distance across each
closed piece, even when the orders and pairings on adjacent pieces differ.
The triangle inequality sums these bounds to the full face-value change.
The crossing fixtures exercise changed pairings rather than merely changed
coordinates within one fixed order.
The matching acts on occurrences, so equal points remain separate. Unmatched
finite points cost |d-b|/2; essential points require a total bijection and
cost the absolute birth difference. Equal essential counts permit a finite
optimal matching, while unequal counts give infinite distance. The distance
API also admits reversed finite pairs. dgm points are positive, so
this larger domain does not change the finite-filter stability statement.
Exact constant-shift cost |c| uses a nonempty essential part; a finite-only
diagram can instead delete all its points to the diagonal.
The Cohen–Steiner–Edelsbrunner–Harer source, Main Theorem and §3.3 states stability for continuous tame functions on a triangulable space, using F₂ singular homology and linear interpolation for its piecewise linear step. The library's arbitrary-field coefficient scope is an extension proved by its finite algebraic argument. The library proves the finite face-filter counterpart with simplicial homology and the same maximum-norm cost. It does not supply a singular-homology comparison for arbitrary continuous tame functions, so it does not formalize that full Main Theorem. Its subdivision by face crossings is a finite proof route, not the source's general topological argument.
The constructibility bridge identifies this diagram with the module diagram of the real sublevel module on the critical grid. Through the finite-constructible isometry it gives a second, algebraic proof of the stability bound.