arXiv:1607.02259 [math-ph]AbstractReferencesReviewsResources
Maximum Entropy and Sufficiency
Published 2016-07-08Version 1
The notion of Bregman divergence and sufficiency will be defined on general convex state spaces. It is demonstrated that only spectral sets can have a Bregman divergence that satisfies a sufficiency condition. Positive elements with trace 1 in a Jordan algebra are examples of spectral sets, and the most important example is the set of density matrices with complex entries. It is conjectured that information theoretic considerations lead directly to the notion of Jordan algebra under some regularity conditions.
Related articles: Most relevant | Search more
arXiv:math-ph/0008017 (Published 2000-08-07)
Maximum entropy, fluctuations and priors
arXiv:math-ph/0212005 (Published 2002-12-02)
Why Maximum Entropy? A Non-axiomatic Approach
arXiv:1604.08739 [math-ph] (Published 2016-04-29)
Information Theory and Statistical Mechanics Revisited