Skip to content

Categorical Trace

Close an endomorphism of a dualizable object in a symmetric monoidal category into an endomorphism of its unit.

Version
v1 · 2026-10-03 · History
Domain-specific #
13046
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomains
Category Theory, Symmetric Monoidal Categories → Mathematics

Core Idea

For an endomorphism \(f:M\to M\) of a dualizable object in a symmetric monoidal category, the canonical categorical trace is the typed composite \(I\xrightarrow{\eta}M\otimes M^\vee\xrightarrow{f\otimes\mathrm{id}}M\otimes M^\vee\xrightarrow{s}M^\vee\otimes M\xrightarrow{\varepsilon}I\). It uses coevaluation, the action of \(f\), symmetry, and evaluation. The result belongs to \(\operatorname{End}(I)\), not necessarily to the ordinary numbers.[^ref-37d4cf96e277]

Scope of Application

In finite-dimensional vector spaces the construction recovers the matrix trace, and the trace of the identity is dimension in the ground field. For finite-projective chain complexes, graded symmetry makes the answer an alternating sum of degreewise traces. In a cobordism category, tracing \(W:M\to M\) glues its matching boundaries to form a closed manifold; the identity cylinder traces to \(M\times S^1\). Stable-homotopy applications connect suitably dualizable objects to fixed-point and Lefschetz invariants under additional assumptions.[^ref-37d4cf96e277]

Clarity

State the category, unit, dual pair and triangle identities, endomorphism, tensor order, and output type. The symmetry must move \(M^\vee\) before \(M\) so evaluation can consume the pair. Cyclicity holds for composable cross-maps between two dualizable objects, not for arbitrary unrelated maps. The live Traced Monoidal Category entry is different: it concerns an axiomatic family of trace operations for a category, not this specific scalar-valued construction on one dualizable object.[ref-37d4cf96e277][ref-a76153d1c71c]

Manages Complexity

The same coevaluation–action–swap–evaluation pattern explains matrix diagonal sums, graded Lefschetz numbers, and topological boundary gluing without pretending that their values have one numerical type. Its compactness does not erase the dualizability requirement. Transfer through a functor also needs adequate symmetric monoidal coherence and preservation of the dual; not every ordinary functor preserves traces.[^ref-37d4cf96e277]

Abstract Reasoning

First verify a valid dual pair \(M,M^\vee\) with \(\eta\) and \(\varepsilon\). Then compose \(\varepsilon\circ s\circ(f\otimes\mathrm{id}_{M^\vee})\circ\eta\) and identify the resulting endomorphism of \(I\). A loop picture without the typed duality data is insufficient. If \(M\) is not dualizable, this canonical construction does not give every \(f:M\to M\) a trace.[^ref-37d4cf96e277]

Knowledge Transfer

Transfer the categorical roles, not the vector-space basis or numerical interpretation. A two-dimensional diagonal operator with entries $2,3$ yields the field element $5$; tracing an identity cobordism yields \(M\times S^1\) instead. Independent review remains pending.[ref-37d4cf96e277][ref-a76153d1c71c]

[^ref-37d4cf96e277]: Kate Ponto and Michael Shulman, “Traces in symmetric monoidal categories”, author-posted 2011 version, published in Expositiones Mathematicae 32(3) (2014), Definition 2.2/equation (2.3), Proposition 2.4, Examples 3.1, 3.3, 3.5 and §6. [^ref-a76153d1c71c]: André Joyal, Ross Street and Dominic Verity, “Traced monoidal categories”, Mathematical Proceedings of the Cambridge Philosophical Society 119 (1996), §§2–3.

Neighborhood in Abstraction Space

Categorical Trace sits in a moderately populated region (51st percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Categories, Sheaves & Homotopy (21 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08