Entropy

Navigation page for Blueprint/D5/S3/Entropy/ at upstream snapshot 880384c42100f2d04436d97c4ac862e91b4bba85.

Contents

• AlternatingTwoDeletionCounts
• BinaryRunSupersequenceCounts
• An Ingleton counterexample for max multiflows
• Charge-sector normalization refutes majorization preservation
• Conditional Entropy and Its Chain Rule
• Equality at the Lower Endpoint of Conditional Entropy
• Conditioning Reduces Entropy
• Finite Deletion-Channel Entropy Ordering
• The Entropy-Divergence Consistency Identity
• Equality Cases for Finite Shannon Entropy
• Nonnegativity of Finite Entropy
• Feedback
• Forgetting
• Fusion
• Relative phases can change the Geiger–Kedem spin entropy
• GohGlibichukKonyagin
• Classical Markov monogamy for every permutation
• Maximum Entropy on a Finite Alphabet
• Mixing
• Nonnegativity of Finite Classical Mutual Information
• Mutual Information as an Entropy Balance
• Vanishing Mutual Information Characterizes Independence
• Mutual Information Vanishes on Product Laws
• Symmetry of Finite Mutual Information
• NamingWindow
• Observation
• PoissonBinomial
• The Product Absorption Logarithmic Kernel
• Relabeling
• RenyiCombining
• SinghviMaxInputEntropy
• Submodularity
• Thermodynamics
• TwoDeletionChannelEntropy
• TwoDeletionRunEntropyBounds
• A triangle inequality fails for unified-entropy correlations