How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Fano's inequality for a finite message observed through a density
Statement
Let be uniform on with , and let an observation have conditional densities with respect to a common measure. Put and define the posterior wherever . For every measurable decoder with error probability , where with .
Facts & Assumptions
Given: A uniform finite message, conditional observation densities, their mixture density, and a measurable finite-valued decoder.
Finite distributions, entropy, divergence, and stochastic matrices: the entropy of a finite probability vector is , with zero coordinates contributing zero.
Finite KL divergence is nonnegative with equality exactly at equal laws: finite probability vectors satisfy whenever the divergence is defined, with equality exactly at .
Finite-alphabet Fano inequality: for a finite message and a finite estimate with error probability , .
The natural logarithm as the inverse of the exponential function: the logarithms are natural, so entropies are in nats.
A nonnegative measurable function has integral exactly when it vanishes almost everywhere: a nonnegative measurable function with zero integral is zero almost everywhere, on an arbitrary measure space.
A nonnegative measurable function with finite integral is finite almost everywhere: a nonnegative measurable function with finite integral is finite almost everywhere.
A nonnegative integral over a null set vanishes: the nonnegative integral over a measurable null set is zero, even for an extended-valued integrand.
Proof
Since , [F6] makes a measurable -null set. Replace every by zero on and use their new mixture ; [F7] shows that all conditional and marginal laws are unchanged. These density versions are finite everywhere, since off . Define where and where . This is a measurable probability vector everywhere and a posterior version: for every measurable , . Values on the zero-density set have no effect. Thus , where is the observation probability law. By [F1] and comparison with the uniform vector in [F2], , so this conditional entropy is finite. All posterior formulas in the Statement are understood for these almost-everywhere density versions.
For each decoder value with , let and ; this is the posterior probability vector given that estimate. If , then , so [F5], applied to the measure restricted to , gives almost everywhere there. Discard the union of these finitely many exceptional null sets. On the remainder, is supported on the positive coordinates of , so has no infinite term. The finitely many constants on that support and the bounded entropy in step 1.1 justify termwise integration. Expansion and [F2] give . Decoder cells of zero -mass contribute zero; summing over the other cells proves .
Apply [F3] to the finite pair . Its sharp and relaxed Fano bounds give both upper inequalities in the Statement; the entropy convention in [F4] makes them nats. Together with step 2.1 this proves the full chain.
Depends on
- The natural logarithm as the inverse of the exponential function
- Finite distributions, entropy, divergence, and stochastic matrices
- Finite-alphabet Fano inequality
- Finite KL divergence is nonnegative with equality exactly at equal laws
- A nonnegative measurable function has integral $0$ exactly when it vanishes almost everywhere
- A nonnegative measurable function with finite integral is finite almost everywhere
- A nonnegative integral over a null set vanishes
Used by
Dependency tree · two levels
23 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Yury Polyanskiy and Yihong Wu, Information Theory: From Coding to Learning, Chapter 20 §20.1 (standard reference, not scraped)
- Yury Polyanskiy, MIT 6.441 Information Theory, Chapter 21 §21.1 (standard reference, not scraped)