Trace Reciprocity in Symmetric Monoidal Stable ∞-Categories
This paper develops the intrinsic categorical layer of the Trace Reciprocity Framework. Working in symmetric monoidal stable ∞-categories, the paper studies categorical traces of endomorphisms of dualizable objects and separates finite trace additivity from countable and measurable reconstruction. The principal rigorous result is a finite categorical Trace Reciprocity theorem for direct-sum and cofiber-additive decompositions of dualizable objects. Conditional countable reciprocity is then formulated under explicit summability, continuity, and trace-compatible colimit hypotheses. A parametrized form is developed relative to an explicitly supplied integration datum. The framework emphasizes that traces need not exist for non-dualizable objects, arbitrary colimits need not preserve dualizability, and intrinsic categorical traces cannot be identified with classical operator traces without a comparison theorem. Examples include perfect complexes and finite-dimensional graded vector spaces, with connections to bicategorical shadows, higher traces, and noncommutative motives. Trace Reciprocity Framework — Paper V.
Authors
- Anna Ivanova Paseva
- Ivan Petrov Pasev (ORCID: https://orcid.org/0009-0002-1902-9738)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-14
- DOI
- https://doi.org/10.5281/zenodo.24224530
- Primary Topic
- Homotopy and Cohomology in Algebraic Topology
- Type
- preprint