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.
Finite Kullback–Leibler divergence
Definition
For probability vectors and on the same finite nonempty alphabet, their Kullback–Leibler divergence (or relative entropy) in the stated direction from to is The logarithm is natural. If and for at least one , set . If , its contribution is zero, including when ; equivalently, . When , all ratios in the sum are positive and finite.
The generator is admissible for Finite f-divergence with support conventions by The finite KL generator has the required convex boundary extension. Its boundary values and make that f-divergence exactly the displayed KL formula, including the singular-support case.
Depends on
Used by
- Finite Rényi divergence Definition
- Binary f-, KL-, and Rényi divergences Example
- Disjoint supports and singular divergence values Example
- Capacity-achieving output laws bound every row divergence Lemma
- Finite iid log-likelihood averages concentrate Lemma
- Finite Pinsker inequality in Euclidean norm Lemma
- Globally optimized constant-composition and Gallager functions agree Lemma
- Uniform concentration around the capacity output divergence bound Lemma
- Finite data processing for Kullback–Leibler divergence Theorem
- Finite-DMC information deficit controls squared distance to the CAID set Theorem
- KL is the iid type-II testing exponent Theorem
- Sphere-packing converse above the finite-divergence threshold Theorem
- The finite Rényi divergence limit is KL Theorem
Dependency tree · two levels
13 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 7, §7.1 (standard reference, not scraped)
- Tim van Erven and Peter Harremoës, Rényi Divergence and Kullback-Leibler Divergence, §I-A and Theorem 5 (standard reference, not scraped)