Canonical barcodes of critical-grade homology
For a filter function on a finite collection of faces, gradeFiltration samples the sublevel complexes at the distinct attained face values. At every sampled grade, simplicialHomologyPModule uses the existing simplicial chain complex and the inclusion-induced homology maps. The number of grades is N = f.criticalValues.card; there is no artificial grade when the complex is empty.
The reusable simplicialHomology_finiteDimensional instance needs only finiteness of the degree-n faces. Its vertex and coefficient field universes are independent. Degree-n chains are finite-dimensional Finsupps; their cycle submodule and boundary quotient are finite-dimensional, and the existing homology-to-quotient linear equivalence transfers this to homology. No finiteness of degree-n+1 faces is needed. At a critical grade, face inclusion into the ambient finite face set supplies the required local finiteness.
gradeHomologyBarcode k f n applies the finite rank barcode to that homology persistence module. It requires vertex and field types in the same universe because the existing rankBarcode API requires its carrier universe to equal the field universe. The grade-value universe is independent. For i ≤ j, rank_gradeHomologyMap equates the rank of the inclusion-induced homology map to the count of intervals with birth at or before i and death after j. The equality follows from canonical rank recovery and the rank formula for a realized barcode; it is not inferred from the dimensions of the two endpoint spaces.
The examples use empty, singleton, and two-disconnected-vertex filters. The empty filter has zero grades and an empty barcode. A singleton has ordinary, unreduced one-dimensional H₀, zero H₁, and one [0,1) bar. For two vertices entering at separate grades, the H₀ dimensions are one and two; the inclusion has rank one by tracking a nonzero vertex class through the quotient naturality map, and the barcode is {[0,2), [1,2)}. The singleton and two-vertex facts are checked over both ℚ and ZMod 2. Death N is the last observed grade sentinel, not infinity.
This module constructs a finite-index rank barcode of homology; it does not itself construct a value-labelled diagram or an executable reducer, or interpret essential death as infinity. The later finite interval decomposition proves nonempty_rankBarcodeIso for every pointwise finite-dimensional PModule.{u,0,u} on Fin N, including this sampled homology module, giving a genuine natural isomorphism to the realization of its canonical barcode. The isomorphism is generally noncanonical and proof-only.