Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 M be uniform on [N] with N≥2, and let an observation Y have conditional densities pm with respect to a common measure. Put q=N−1∑mpm and define the posterior πm(y)=pm(y)/(Nq(y)) wherever q(y)>0. For every measurable decoder g(Y) with error probability e=Pr⁡[g(Y)≠M], H(M∣Y)≤H(M∣g(Y))≤h2(e)+eln⁡(N−1)≤ln⁡2+eln⁡N, where h2(e)=−eln⁡e−(1−e)ln⁡(1−e) with 0ln⁡0=0.

Facts & Assumptions

Given: A uniform finite message, conditional observation densities, their mixture density, and a measurable finite-valued decoder.

[F1]

Finite distributions, entropy, divergence, and stochastic matrices: the entropy of a finite probability vector r is H(r)=−∑iriln⁡ri, with zero coordinates contributing zero.

[F2]

Finite KL divergence is nonnegative with equality exactly at equal laws: finite probability vectors satisfy D(r∥s)≥0 whenever the divergence is defined, with equality exactly at r=s.

[F3]

Finite-alphabet Fano inequality: for a finite message and a finite estimate with error probability e, H(M∣M^)≤h2(e)+eln⁡(N−1).

[F4]

The natural logarithm as the inverse of the exponential function: the logarithms are natural, so entropies are in nats.

[F5]

A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere: a nonnegative measurable function with zero integral is zero almost everywhere, on an arbitrary measure space.

[F6]

A nonnegative measurable function with finite integral is finite almost everywhere: a nonnegative measurable function with finite integral is finite almost everywhere.

[F7]

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

1.1F1F2F6F7givenalgebra

Since ∫q dν=N−1∑m∫pm dν=1, [F6] makes B={q=+∞} a measurable ν-null set. Replace every pm by zero on B and use their new mixture q; [F7] shows that all conditional and marginal laws are unchanged. These density versions are finite everywhere, since pm≤Nq off B. Define πm=pm/(Nq) where q>0 and πm=1/N where q=0. This is a measurable probability vector everywhere and a posterior version: for every measurable A, ∫Aqπm dν=N−1∫Apm dν=Pr⁡(M=m,Y∈A). Values on the zero-density set have no effect. Thus H(M∣Y)=∫H(π) dQ, where dQ=q dν is the observation probability law. By [F1] and comparison with the uniform vector in [F2], 0≤H(π)≤ln⁡N, so this conditional entropy is finite. All posterior formulas in the Statement are understood for these almost-everywhere density versions.

2.1F1F2F5step 1.1givenalgebracases

For each decoder value j with αj=Q(Aj)>0, let Aj=g−1(j) and r(j)=αj−1∫Ajπ dQ; this is the posterior probability vector given that estimate. If rm(j)=0, then ∫Ajπm dQ=0, so [F5], applied to the measure Q restricted to Aj, gives πm=0 almost everywhere there. Discard the union of these finitely many exceptional null sets. On the remainder, π is supported on the positive coordinates of r(j), so D(π∥r(j)) has no infinite term. The finitely many constants ln⁡rm(j) on that support and the bounded entropy in step 1.1 justify termwise integration. Expansion and [F2] give αj−1∫AjD(π∥r(j)) dQ=H(r(j))−αj−1∫AjH(π) dQ≥0. Decoder cells of zero Q-mass contribute zero; summing over the other cells proves H(M∣g(Y))≥H(M∣Y).

3.1F3F4step 2.1given∎

Apply [F3] to the finite pair (M,g(Y)). 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

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