Entropy / CONCEPT
Classical Markov monogamy for every permutation
The diagonal sum of mutual informations dominates every permuted sum along a finite classical Markov chain.
Closed
DIRECT PREREQUISITES3
DIRECT CONSEQUENCES0
PROOF DEPTH6
DOCUMENT LINKS0
The diagonal pairing maximizes the information sum
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- A finite counterexample to improved thermal recall convergencestructural-affinity · Closed
- Author Information Decompositionstructural-affinity · Closed
- Conditional Mutual Informationstructural-affinity · Closed
- Equality in the Upper Mixture-Entropy Boundstructural-affinity · Closed
- Four-coordinate finite common-marginal comparisonstructural-affinity · Closed
- Markov Data Processingstructural-affinity · Closed
- The entropic Glibichuk–Konyagin conjecturestructural-affinity · Closed
- The Finite Mixture Entropy Bracketstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance