Entropy / CONCEPT
Equality in the Green-Class Window Entropy Bound
A naming window reaches its entropy bound exactly when every pinned coordinate law is uniform on the full alphabet.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES0
PROOF DEPTH5
DOCUMENT LINKS1
Maximum window entropy characterizes uniform coordinates
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
- Equality at the Lower Endpoint of Conditional Entropystructural-affinity · Closed
- Equality Cases for Finite Shannon Entropystructural-affinity · Closed
- Estimator-Error Lower Bounds from Finite Fano Inequalitiesstructural-affinity · Closed
- Green-Class Window Divergencestructural-affinity · Closed
- Green-Class Window Entropystructural-affinity · Closed
- Green-Class Window Hellinger Structurestructural-affinity · Closed
- Green-Class Window Total Variationstructural-affinity · Closed
- Varying-Marginal Green-Class Measurestructural-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