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 f-divergence with support conventions
Definition
Let and be probability vectors on a finite nonempty alphabet (Finite probability vectors). A convex generator is a finite convex function with ; convexity uses the two-point inequality of Convex and strictly convex functions on Euclidean convex sets. Use its extended boundary values These limits exist in by Boundary limits of a normalized finite convex generator exist. Define the finite f-divergence from to by In the first sum, if , the term means . A coordinate with contributes zero and is omitted. The second term is defined as zero when its coefficient is zero, even if ; if that coefficient is positive and , the divergence is .
The boundary term is essential when . It is the recession contribution of the generator and is not the value .
Depends on
Used by
- Finite Kullback–Leibler divergence Definition
- Binary f-, KL-, and Rényi divergences Example
- Disjoint supports and singular divergence values Example
- The closed convex perspective is subadditive Lemma
- Finite data processing for f-divergences Theorem
- Finite data processing for Kullback–Leibler divergence Theorem
- Finite data processing for Rényi divergence Theorem
Dependency tree · two levels
9 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, Definition 7.1 (standard reference, not scraped)
- Igal Sason and Sergio Verdú, f-Divergence Inequalities, §II-B, Definition 3 and equations (35)–(39) (standard reference, not scraped)