Polynomial Functors and Shannon Entropy
From MaRDI portal
Publication:6150165
DOI10.4204/EPTCS.380.19arXiv2201.12878OpenAlexW4385342820MaRDI QIDQ6150165FDOQ6150165
Authors: David I. Spivak
Publication date: 5 March 2024
Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)
Abstract: Past work shows that one can associate a notion of Shannon entropy to a Dirichlet polynomial, regarded as an empirical distribution. Indeed, entropy can be extracted from any by a two-step process, where the first step is a rig homomorphism out of , the emph{set} of Dirichlet polynomials, with rig structure given by standard addition and multiplication. In this short note, we show that this rig homomorphism can be upgraded to a rig emph{functor}, when we replace the set of Dirichlet polynomials by the emph{category} of ordinary (Cartesian) polynomials. In the Cartesian case, the process has three steps. The first step is a rig functor sending a polynomial to , where is the derivative of . The second is a rig functor , sending a polynomial to the pair , where can be interpreted as the global sections of viewed as a bundle, and as its base. To make this precise we define what appears to be a new distributive monoidal structure on , which can be understood geometrically in terms of rectangles. The last step, as for Dirichlet polynomials, is simply to extract the entropy as a real number from a pair of sets ; it is given by and can be thought of as the log aspect ratio of the rectangle.
Full work available at URL: https://arxiv.org/abs/2201.12878
Cites Work
This page was built for publication: Polynomial Functors and Shannon Entropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6150165)