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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Trace Reciprocity in Symmetric Monoidal Stable ∞-Categories

Anna Ivanova Paseva, Ivan Petrov Pasev
Zenodo (CERN European Organization for Nuclear Research)
Homotopy and Cohomology in Algebraic Topology
preprint

Trace Reciprocity in Symmetric Monoidal Stable ∞-Categories

Anna Ivanova Paseva, Ivan Petrov Pasev
preprint en

Abstract

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.

Zenodo (CERN European Organization for Nuclear Research)
Homotopy and Cohomology in Algebraic Topology
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon