Dirichlet Polynomials and Entropy

  title={Dirichlet Polynomials and Entropy},
  author={David I. Spivak and Timothy Hosgood},
A Dirichlet polynomial d in one variable y is a function of the form d(y)=anny+⋯+a22y+a11y+a00y for some n,a0,…,an∈N. We will show how to think of a Dirichlet polynomial as a set-theoretic bundle, and thus as an empirical distribution. We can then consider the Shannon entropy H(d) of the corresponding probability distribution, and we define its length (or, classically, its perplexity) by L(d)=2H(d). On the other hand, we will define a rig homomorphism h:Dir→Rect from the rig of Dirichlet… 
1 Citations

Figures from this paper

Polynomial functors and Shannon entropy

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 3 ∈ Dir by a two-step



A Bayesian Characterization of Relative Entropy

Any convex linear, lower semicontinuous functor from FinStat to the additive monoid $[0,\infty]$ which vanishes when s is optimal must be a scalar multiple of this relative entropy.

Dirichlet Polynomials form a Topos

One can think of power series or polynomials in one variable, such as $P(x)=2x^3+x+5$, as functors from the category $\mathsf{Set}$ of sets to itself; these are known as polynomial functors. Denote

A Characterization of Entropy in Terms of Information Loss

It is shown that Shannon entropy gives the only concept of information loss that is functorial, convex-linear and continuous and naturally generalizes to Tsallis entropy as well.

A Probability Monad as the Colimit of Spaces of Finite Samples

We define and study a probability monad on the category of complete metric spaces and short maps. It assigns to each space the space of Radon probability measures on it with finite first moment,

Higher-Dimensional Algebra VII: Groupoidification

Groupoidification is a form of categorification in which vector spaces are replaced by groupoids, and linear operators are replaced by spans of groupoids. We introduce this idea with a detailed

A mathematical theory of communication

In this final installment of the paper we consider the case where the signals or the messages or both are continuously variable, in contrast with the discrete nature assumed until now. To a

A method for the construction of minimum-redundancy codes

  • D. Huffman
  • Computer Science, Business
    Proceedings of the IRE
  • 1952
A minimum-redundancy code is one constructed in such a way that the average number of coding digits per message is minimized.

Basic category theory

Rectangle Facts for Kids

    KidzSearch Wiki . Rectangle Facts for Kids