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.
Disjoint supports and singular divergence values
Example
Let , , and . The two laws have disjoint supports.
Facts & Assumptions
Given: The displayed , the total-variation generator , and the KL and Rényi conventions.
Finite probability vectors: coordinates may be zero, and .
Finite f-divergence with support conventions: the generator must be finite and convex on and satisfy ; a coordinate with contributes , while one with contributes .
Finite Kullback–Leibler divergence: any coordinate with makes ; zero -mass contributes zero.
Finite Rényi divergence: below order one a coordinate contributes zero to the affinity; above order one it makes the affinity infinite.
Absolute value in an ordered field and Basic properties of the absolute value: absolute value is real-valued, for , and .
Convex and strictly convex functions on Euclidean convex sets: a function is convex when it lies below each two-point chord.
Verification
Given: and on .
Put for . It is finite-valued and . For and , , so [F5] and [F6] give Thus [F7] proves that is convex, so it is an admissible generator in [F2].
Since , [F3] gives . This records the singular direction; is also infinite by the same support calculation with exchanged.
For , , so . For , , so . The coordinate contributes by [F2], and coordinate contributes . Thus .
If , the only coordinate with is , where , so and by [F4] and the definition. If , coordinate gives infinite affinity by [F4]. At , KL is infinite by step 1.2.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
18 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 and 7.12 (standard reference, not scraped)
- Tim van Erven and Peter Harremoës, Rényi Divergence and Kullback-Leibler Divergence, §II-A (standard reference, not scraped)