Entropy / CONCEPT
Future-Word Information Chain
A recursively nested future word obeys the finite Shannon chain rule: its entropy is the first-readout entropy plus one full-prefix conditional entropy for every later readout.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH4
DOCUMENT LINKS1
Marginalization preserves nonnegativity
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Conditional Entropy and Its Chain Rulestructural-affinity · Closed
- Conditioning Reduces Entropystructural-affinity · Closed
- Entropy and Capacity under Carrier Forgettingstructural-affinity · Closed
- Expected Posterior Entropy Reductionstructural-affinity · Closed
- Multi-Target Information Chainstructural-affinity · Closed
- Nonnegativity of Finite Entropystructural-affinity · Closed
- Shannon Entropy Is Invariant Under Injective Relabelingstructural-affinity · Closed
- Weak Finite Fano Inequality in Natsstructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance