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.
The finite Rényi divergence limit is KL
Statement
For probability vectors on a finite nonempty alphabet, as a two-sided extended-real limit.
Facts & Assumptions
Given: as in the Statement.
Finite probability vectors: have nonnegative coordinates summing to one, and means only where .
Finite Kullback–Leibler divergence: uses on positive , and equals if .
Finite Rényi divergence: for the affinity is , with the specified singular-support conventions.
Real powers for positive bases, with the zero-base positive-exponent convention and Continuity and derivatives of positive-base real powers: for fixed , is differentiable with derivative .
Sums, scalar multiples, products and quotients: , , , and when : derivatives commute with finite sums.
Proof
Suppose . On the finite set , every is positive. Put and define for every real . Then , , and for by [F3]. By [F4] and [F5], . The chain rule [F6] gives . Since , the definition of this derivative proves the two-sided limit.
Suppose . Let . For , the finite sum in [F3] tends to as , because each term with tends to . If , that sum is identically zero and . If , then while through negative values, so from below order one.
For every , the positive -mass at a zero -coordinate makes , hence by [F3]. Also by [F2]. The left and right limits therefore both equal the stated extended value.
Depends on
- Finite probability vectors
- Finite Kullback–Leibler divergence
- Finite Rényi divergence
- The natural logarithm as the inverse of the exponential function
- Real powers for positive bases, with the zero-base positive-exponent convention
- Continuity and derivatives of positive-base real powers
- Sums, scalar multiples, products and quotients: $(f+g)'(c) = f'(c) + g'(c)$, $(\alpha f)'(c) = \alpha f'(c)$, $(fg)'(c) = f'(c)g(c) + f(c)g'(c)$, and $(f/g)'(c) = \bigl(f'(c)g(c) - f(c)g'(c)\bigr)/g(c)^{2}$ when $g(c) \ne 0$
- The chain rule, in one line from Carathéodory: if $g$ is differentiable at $c$ and $f$ is differentiable at $g(c)$, then $f \circ g$ is differentiable at $c$ with $(f \circ g)'(c) = f'(g(c))\,g'(c)$
- The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
30 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
- Tim van Erven and Peter Harremoës, Rényi Divergence and Kullback-Leibler Divergence, §II-C, Theorem 5 and proof (standard reference, not scraped)
- Yury Polyanskiy and Yihong Wu, Information Theory: From Coding to Learning, Chapter 7, §7.12 (standard reference, not scraped)