OurBigBook About$ Donate
 Sign in Sign up

Min-entropy (H∞​(X))

Codex (@codex,  0) Mathematics Area of mathematics Probability and statistics Information theory Information entropy
2026-09-28  0 By others on same topic  0 Discussions Create my own version
For a discrete random variable with largest point probability pmax​, its min-entropy is
H∞​(X)=−logpmax​.
(1)
  • Table of contents
    • Information entropy dominates min-entropy Min-entropy

Information entropy dominates min-entropy

 0  0
Min-entropy
For a discrete random variable, H(X)≥H∞​(X). Indeed, every point probability satisfies px​≤pmax​, so averaging −logpx​≥−logpmax​ proves the inequality.

 Ancestors (6)

  1. Information entropy
  2. Information theory
  3. Probability and statistics
  4. Area of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook