Invariants, slices and distances
These treatments share a subject; their labels distinguish the questions they answer.
- When does a module split into intervals? — Mathematical lesson. When does a collection of pieces describe the module itself, and when does it only summarize or approximate it?
- Analyzing ensembles of persistence results — Library guide. How do I align repeated outputs and distinguish descriptive variation from a supported inference?
- Comparing results through declared correspondences — Library guide. Which views can share selections or scales when fields, degrees, constructions or samples differ?
- Computing interval multiplicities and splittings — Library guide. Which decomposition question can I ask of my module, and what evidence comes back with the answer?
- Exact matching distance in a finite window — Library guide. Which finite-window matching question can I compute, and what does the result establish?
- Exploring slices, intervals and signed contributions — Library guide. How do I interpret slice intervals, matching witnesses and signed contributions of an encoding?
- Querying regions and building GRIL features — Library guide. When should I query finite-label generalized rank, a signed interval family, or continuous-worm GRIL, and how do I inspect the answer?
- Reading scalar fields in their original coordinates — Library guide. How do I interpret sampled features in original coordinates and compare their sections?
- Refining and transporting encoded modules — Library guide. How do restriction, refinement and pushforward change a description or its parameter base?
- Compose a scalar background and signed changes — Task recipe. How do I combine a scalar background, mathematical overlay and explanatory annotation without changing their meaning?
- Explain a distance through its matching — Task recipe. Which matched and unmatched intervals account for a computed diagram distance?
- Measure what persists through a branching region — Task recipe. How do I compute and check generalized rank on a chosen connected convex domain?
- Ensembles of persistence results — API reference. What alignment and statistical contracts do ensemble computations accept and guarantee?
- Interval decomposition contracts — API reference. Which multiplicities, summands, subquotients and witnesses are certified by a result?
- Aligned ensembles and statistical uncertainty computations — Implementation account. How are repeated outputs aligned and which computations support the reported uncertainty?
- Computing generalized rank and GRIL — Implementation account. How do selected finite diagrams and continuous grid worms reduce to exact limit-to-colimit ranks?
- From sampled landscapes to ambient queries — Implementation account. How are retained line landscapes placed on an ambient grid, with their sampling and error contracts intact?
- Interval multiplicities and certified decomposition — Implementation account. Which representations and algorithms underlie interval multiplicities and certified decomposition, and why?