A Characterization of Entropy as a Universal Monoidal Natural Transformation
Cheuk Ting Li
TL;DR
The paper develops a category-theoretic framework in which entropy emerges as a universal monoidal natural transformation between under-categories and codomain monoidal-idempotent-reflections. It shows that Shannon entropy arises as the universal transformation on $\mathsf{LProb}_{\rho}$ (with $0<\rho<1$), while the pairing of Hartley and Shannon entropies arises on $\mathsf{FinProb}$ via universal baseless entropy in $\mathsf{IcOrdCMon}$; these notions extend to a wide array of monoidal categories (sets, vector spaces, abelian groups, augmented simplex, Gaussians) through the universal entropy monad. A key technical achievement is a continuity-free, universal chain rule for conditional entropy, formulated within discretely-indexed MonSiMon categories, which yields the conditional Shannon entropy as a universal functor without requiring topology. The framework unifies disparate entropy concepts under a single reflection-based construction, enabling natural connections between entropies across domains and suggesting new directions for entropy inequalities and potential quantum extensions.
Abstract
We show that the essential properties of entropy (monotonicity, additivity and subadditivity) are consequences of entropy being a monoidal natural transformation from the under category functor $-/\mathsf{LProb}_ρ$ (where $\mathsf{LProb}_ρ$ is category of $ρ$-th-power-summable probability distributions, $0<ρ<1$) to $Δ_{\mathbb{R}}$. Moreover, the Shannon entropy can be characterized as the universal monoidal natural transformation from $-/\mathsf{LProb}_ρ$ to the category of integrally closed partially ordered abelian groups (a reflective subcategory of the lax-slice 2-category over $\mathsf{MonCat}_{\ell}$ in the 2-category of monoidal categories), providing a succinct characterization of Shannon entropy as a reflection arrow. We can likewise define entropy for every monoidal category with a monoidal structure on its under categories (e.g. the category of finite abelian groups, the category of finite inhabited sets, the category of finite dimensional vector spaces, and the augmented simplex category) via the reflection arrow. This implies that all these entropies over different categories are components of a single natural transformation (the unit of the idempotent monad), allowing us to connect these entropies in a natural manner. We also provide a universal characterization of the conditional Shannon entropy based on the chain rule which, unlike the characterization of information loss by Baez, Fritz and Leinster, does not require any continuity assumption.
