Finite descriptions and parameter queries
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?
- Finite encodings: recovering a module from finite data — Mathematical lesson. How can finite data recover a module over an infinite parameter domain?
- 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?
- Tameness and scope: when finite descriptions exist — Mathematical lesson. When do constant subdivisions, finite encodings and finite fringe presentations exist?
- Why finite computations stay tame — Mathematical lesson. Why do finite constructions and compatible maps preserve tame descriptions?
- Why two parameters change the problem — Mathematical lesson. Why do two parameters require spaces and maps beyond a barcode?
- Choosing and inspecting resolutions — Library guide. Which resolution or Betti computation answers my question without computing unnecessary terms?
- Choosing views and inspecting intervals — Library guide. Which view lets me investigate the mathematical object I have computed?
- Computing Ext, Tor and their products — Library guide. How can I request the derived information I need in the right category and degree range?
- Constructing modules without a filtration — Library guide. How do I choose and validate a finite diagram, lattice presentation or geometric-region presentation?
- Exact coverage-depth windows — Library guide. How can I restrict coverage depth while preserving the required module?
- Exact matching distance in a finite window — Library guide. Which finite-window matching question can I compute, and what does the result establish?
- Exploring radius, depth and the finite model — Library guide. How do radius, depth and geometric construction choices relate to the finite model and its invariants?
- Exploring slices, intervals and signed contributions — Library guide. How do I interpret slice intervals, matching witnesses and signed contributions of an encoding?
- 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?
- Ingestion options and their mathematical effects — Library guide. Which input and construction choices change the represented module?
- 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?
- Keeping a selected mathematical view — Library guide. How do I create, query and close a linked session without losing the meaning of a selection?
- 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?
- Refining and transporting encoded modules — Library guide. How do restriction, refinement and pushforward change a description or its parameter base?
- 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?
- 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?
- Finite modules, selected vectors and submodules — API reference. What are the exact contracts for finite posets, modules, morphisms and presentations?
- Options must affect the requested computation — API reference. Which options change mathematical meaning, computation, or storage?
- Axis-aligned box encoding — Implementation account. Which representations and algorithms underlie axis-aligned box encoding, and why?
- Change of poset, refinement and Kan extensions — Implementation account. Which representations and algorithms underlie change of poset, refinement and Kan extensions, and why?
- From selected images to submodules and quotients — Implementation account. Which representations and algorithms underlie kernels, quotients and universal constructions, and why?
- Serialization, interchange and mathematical provenance — Implementation account. Which representations and algorithms underlie serialization, interchange and mathematical provenance, and why?