Modules, maps and derived algebra
These treatments share a subject; their labels distinguish the questions they answer.
- Categories, encodings, and derived computations — Mathematical lesson. In which category does a computation take place, and when can its result be transported?
- Indicator presentations: building a module from regions and a matrix — Mathematical lesson. How can regions and a matrix define spaces and their maps?
- Inspect spaces and maps — Mathematical lesson. How does the computed encoding recover the square and its spaces and maps?
- Persistence modules over posets — Mathematical lesson. How do vector spaces and compatible maps describe persistence?
- Tameness and scope: when finite descriptions exist — Mathematical lesson. When do constant subdivisions, finite encodings and finite fringe presentations exist?
- 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?
- Why finite computations stay tame — Mathematical lesson. Why do finite constructions and compatible maps preserve tame descriptions?
- Choosing and inspecting resolutions — Library guide. Which resolution or Betti computation answers my question without computing unnecessary terms?
- Comparing results through declared correspondences — Library guide. Which views can share selections or scales when fields, degrees, constructions or samples differ?
- Computing Ext, Tor and their products — Library guide. How can I request the derived information I need in the right category and degree range?
- Computing interval multiplicities and splittings — Library guide. Which decomposition question can I ask of my module, and what evidence comes back with the answer?
- Constructing modules without a filtration — Library guide. How do I choose and validate a finite diagram, lattice presentation or geometric-region presentation?
- Exploring spaces and maps — Library guide. How do I investigate a constructed object and request deeper information when needed?
- Following vectors and constructing generated submodules — Library guide. How can I propagate selected vectors or subspaces and recover the module they generate?
- From inputs to computed objects — Library guide. Which construction route should I choose, and what object will it return?
- From source cells to representative classes — Library guide. Which source cells explain a selected class, and how is that correspondence checked?
- Inspection and explicit computation — Library guide. What is already retained, what does a query compute, and what can I reuse across repeated queries or a batch?
- Numerical derived algebra — Library guide. How do tolerances affect derived algebra, and how should I assess the answer?
- Refining and transporting encoded modules — Library guide. How do restriction, refinement and pushforward change a description or its parameter base?
- Working with complexes and spectral pages — Library guide. How do I build a compatible complex and inspect its homology, connecting maps or successive pages?
- Build and validate a small module from spaces and maps — Task recipe. How do I enter a commuting diagram directly and obtain a checked module?
- Compute persistence relative to a boundary — Task recipe. How do I construct a checked filtered pair and read its relative interval?
- Measure what persists through a branching region — Task recipe. How do I compute and check generalized rank on a chosen connected convex domain?
- Change-of-poset reference — API reference. What do restriction, pushforward and common-refinement operations guarantee?
- Derived algebra reference — API reference. What are the contracts of Hom, Ext, Tor, products and spectral computations?
- Filtered pairs and relative persistence — API reference. What input, basis and map conventions define relative persistence?
- Finite modules, selected vectors and submodules — API reference. What are the exact contracts for finite posets, modules, morphisms and presentations?
- Interval decomposition contracts — API reference. Which multiplicities, summands, subquotients and witnesses are certified by a result?
- Options must affect the requested computation — API reference. Which options change mathematical meaning, computation, or storage?
- Source representatives — API reference. What is retained and verified when a chain or cocycle is traced to source cells?
- Change of poset, refinement and Kan extensions — Implementation account. Which representations and algorithms underlie change of poset, refinement and Kan extensions, and why?
- Computing generalized rank and GRIL — Implementation account. How do selected finite diagrams and continuous grid worms reduce to exact limit-to-colimit ranks?
- Exact rational coordinates — Implementation account. Which representations and algorithms underlie exact rational coordinates, and why?
- From selected images to submodules and quotients — Implementation account. Which representations and algorithms underlie kernels, quotients and universal constructions, and why?
- How a mathematical view becomes a figure — Implementation account. How does a prepared mathematical view retain its coefficients, coordinates and meaning while it is drawn or exported?
- Interval multiplicities and certified decomposition — Implementation account. Which representations and algorithms underlie interval multiplicities and certified decomposition, and why?
- Relative persistence of filtered pairs — Implementation account. How are quotient persistence and its connecting maps computed for a filtered pair?
- Retaining representatives and tracing them to source cells — Implementation account. Which representations and algorithms underlie retaining representatives and tracing them to source cells, and why?
- Yoneda products and validated Tor algebra — Implementation account. Which representations and algorithms underlie yoneda products and validated Tor algebra, and why?
- QPA: finite module algebra — Benchmark report. What does the scoped comparison with QPA establish?