Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck pass
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 X={a,b}, P=(1,0), and Q=(0,1). The two laws have disjoint supports.

Facts & Assumptions

Given: The displayed P,Q, the total-variation generator f(t)=12∣t−1∣, and the KL and Rényi conventions.

[F1]

Finite probability vectors: coordinates may be zero, and supp⁡P={x:px>0}.

[F2]

Finite f-divergence with support conventions: the generator must be finite and convex on (0,∞) and satisfy f(1)=0; a coordinate with qx>0=px contributes qxf(0), while one with px>0=qx contributes pxf∞.

[F3]

Finite Kullback–Leibler divergence: any coordinate with px>0=qx makes D(P∥Q)=+∞; zero P-mass contributes zero.

[F4]

Finite Rényi divergence: below order one a px>0=qx coordinate contributes zero to the affinity; above order one it makes the affinity infinite.

[F5]

Absolute value in an ordered field and Basic properties of the absolute value: absolute value is real-valued, ∣c∣=c for c≥0, and ∣cz∣=∣c∣∣z∣.

[F6]

The triangle inequality: ∣u+v∣≤∣u∣+∣v∣.

[F7]

Convex and strictly convex functions on Euclidean convex sets: a function is convex when it lies below each two-point chord.

Verification

Given: P=(1,0) and Q=(0,1) on {a,b}.

1.1F2F5F6F7algebra

Put f(t)=12∣t−1∣ for t>0. It is finite-valued and f(1)=0. For x,y>0 and s∈[0,1], (1−s)x+sy>0, so [F5] and [F6] give f((1−s)x+sy)=12∣(1−s)(x−1)+s(y−1)∣≤(1−s)f(x)+sf(y). Thus [F7] proves that f is convex, so it is an admissible generator in [F2].

1.2F3algebra

Since pa=1>0=qa, [F3] gives D(P∥Q)=+∞. This records the singular direction; D(Q∥P) is also infinite by the same support calculation with a,b exchanged.

2.1F1F2step 1.1algebra

For 0<t<1, f(t)=12(1−t), so f(0)=lim⁡t↓0f(t)=1/2. For t>1, f(t)/t=12(1−1/t), so f∞=lim⁡t→∞f(t)/t=1/2. The coordinate a contributes paf∞=1/2 by [F2], and coordinate b contributes qbf(0)=1/2. Thus Df(P∥Q)=1.

3.1F3F4step 1.2algebra∎

If 0<α<1, the only coordinate with qx>0 is b, where pb=0, so Sα(P,Q)=0 and Dα(P∥Q)=+∞ by [F4] and the definition. If α>1, coordinate a gives infinite affinity by [F4]. At α=1, 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