Choose a reading path
You can begin by watching a hole appear and disappear in a small image, or by working through the definitions of a persistence module's spaces and maps. Both routes lead to finite encodings, which let us describe those spaces and maps using finite data.
To run the notebook: Install and reopen
From spaces and maps to summands
After inspecting the finite module, ask whether simpler pieces have compatible inclusions and projections. This is an optional algebraic investigation, independent of the route through tameness.
Read the map as a linked outline
- A hole appears and disappears (Site page · starting point)
Start with an example. When is the hole alive? Continue to: Why two parameters? Alternatively: Ordinary persistence.
- Persistence modules (Site page · starting point)
Start with definitions. What are spaces and maps? Continue to: Finite encodings.
- Install and reopen (Site page)
To run the notebook. How do I run a lesson? Continue to: A hole appears and disappears.
- Why two parameters? (Site page)
Which parameters can we compare? Continue to: Finite encodings. Optional: Explore the full definitions: Persistence modules.
- Finite encodings (Site page)
How can finite data recover a module? Continue to: Inspect spaces and maps. Alternatively: Indicator presentations.
- Inspect spaces and maps (Site page)
What does the square's encoding contain? Continue to: Tameness and scope. Alternatively: Visualization and export.
- Indicator presentations (Site page)
How do regions and a matrix define spaces? Continue to: Tameness and scope. Optional: Or inspect the result: Inspect spaces and maps.
- Tameness and scope (Site page)
When do finite descriptions exist? Continue to: Why computations stay tame.
- Why computations stay tame (Site page)
Why do finite computations stay finite? Continue to: Categories and derived computations.
- Ordinary persistence (Site page)
Supporting reference. Which conventions do intervals use? Continue to: Why two parameters?
- When does a module split into intervals? (Site page)
Further mathematical question. When is an interval a direct summand? Continue to: Computing interval multiplicities and splittings.
More questions to pursue
Bring in data
Choose how your data will determine a module. For computations with radius and coverage depth, the guides explain the multicover construction, exact grades and the part of the depth range being represented.
- Ingestion options (Site page)
- Multicover computation (Site page)
- Exact radius grades (Site page)
- Coverage depth windows (Site page)
Work with modules and maps
The category determines which objects and maps a calculation concerns. With that setting specified, choose the spaces and maps to compute; when using floating coefficients, examine how numerical rank decisions affect the answer.
- Computing interval multiplicities and splittings (Site page)
- Categories and derived computations (Site page)
- Exploring spaces and maps (Site page)
- Inspection and explicit computation (Site page)
- Numerical derived algebra (Site page)
Compare and show results
The visualization guide helps you choose a view of the spaces, maps or summaries you want to examine. To compare two compatible encodings, the matching distance guide develops the question over a finite window and explains the required hypotheses.
- Ordinary persistence (Site page)
- Visualization and export (Site page)
- Exact matching distance (Site page)
Choose tools and reproduce work
Add the integration your task needs, check what its options change, and use the benchmarking methodology when measuring computational cost.
- Optional integrations (Site page)
- Options and their effects (Site page)
- Benchmarking methodology (Site page)
If you begin with the example, “Why two parameters?” will help you see why we need that description; you can then continue to encodings or spend more time with the definitions first.
When you want to try the computations yourself, the installation guide explains how to open it. The arrows suggest where a question developed in one lesson can lead, so you can follow the route that fits what you want to understand. They do not make the earlier lessons prerequisites for opening a later one.
After finite encodings, you can inspect the square example in code or see how regions and a matrix describe its spaces and maps. Having a finite description in hand makes it natural to ask when such descriptions exist, which is the question developed in the lessons on tameness.
Lesson cards open pages on this site, including the ring and square inspection notebooks. On a narrow screen, scroll sideways or use the linked outline below the map. The focused summands diagram continues from the same inspected finite module into an optional algebraic question.
The groups below the lessons collect guides for further questions about data, algebra, figures and saving your work. Links that open repository documents are labelled so you can tell where they lead.
To find different kinds of treatment of the same subject, use the topic map. It groups documents by subject without prescribing a reading order.