Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Finite Rényi divergence

Definition

Let P=(px) and Q=(qx) be probability vectors on the same finite nonempty alphabet. For order α∈(0,∞) with α≠1, put Sα(P,Q):=∑x:qx>0pxαqx1−α. If α>1 and px>0=qx for some x, define Sα(P,Q)=+∞; if 0<α<1, such coordinates contribute zero. In the displayed sum, px=0<qx contributes zero. If the sum is zero, then necessarily α<1 and the logarithmic expression below is defined as +∞. The Rényi divergence of order α from P to Q is Dα(P∥Q):=log⁡Sα(P,Q)α−1. At order one define D1(P∥Q):=D(P∥Q), using Finite Kullback–Leibler divergence. All divergences are extended-real-valued; the direction is always first argument to second.

For 0<α<1, a point with px>0=qx contributes zero to the affinity Sα rather than infinity. For α>1, the same support mismatch makes Dα(P∥Q)=+∞. The sign of α−1 is part of the definition and reverses inequalities when 0<α<1.

Depends on

Used by

Dependency tree · two levels

8 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