Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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 KL divergence agrees with measurable-space KL

Statement

Assume AC only for the interface to the published general definition Kullback–Leibler divergence. Let p,q be probability vectors on a finite set S, and let P(A)=∑i∈Api, Q(A)=∑i∈Aqi on P(S). Then the measurable-space divergence D(P∥Q) equals the finite KL sum ∑i:pi>0piln⁡(pi/qi), with value +∞ exactly when some pi>0=qi.

Facts & Assumptions

Given: AC, a finite set S, and probability vectors p,q on S.

[A1]

The Axiom of Choice: every family of nonempty sets has a choice function. Here AC is assumed only when invoking the current published measurable KL definition; no selection is used to construct the finite density below.

[F1]

Finite distributions, entropy, divergence, and stochastic matrices: a finite KL sum uses 0ln⁡0=0 and is +∞ if pi>0=qi for some coordinate.

[F2]

Finite probability spaces are exactly finite full-power-set probability spaces: on a finite set, nonnegative weights summing to one define a probability measure on the full power set by P(A)=∑i∈Api.

[F3]

Absolute continuity of a signed or complex measure with respect to a positive measure: P≪Q means every measurable Q-null set is P-null.

[F4]

The Radon-Nikodym derivative as an almost-everywhere equivalence class: for P≪Q, a Radon–Nikodym derivative is a measurable function class satisfying P(A)=∫Ar dQ for every measurable A.

[F5]

Expectation agrees with the published finite weighted sum: on a finite probability space, the expectation of a real function is the sum of its values weighted by the outcome probabilities.

[F6]

Kullback–Leibler divergence: if P≪̸Q, then D(P∥Q)=+∞.

[F7]

Kullback–Leibler divergence: in the absolutely continuous case, use an RN density r=dP/dQ, set ℓ=0 on {r=0} and ℓ=ln⁡r on {r>0}.

[F8]

Kullback–Leibler divergence: the measurable KL is D(P∥Q)=∫ℓ dP in the absolutely continuous case.

[F9]

Finite probability spaces, outcome weights, events, and event probabilities: a finite probability space has a finite outcome set with nonnegative weights summing to one, and every subset is an event.

Proof

1.1givenF1F2F3F6F9

By [F9], the finite vectors define probability spaces on (S,P(S)), with every singleton measurable; [F2] gives their event weights. If pi>0=qi, then P({i})>0=Q({i}), so [F3] gives P≪̸Q. The general definition [F6] and finite convention [F1] both give +∞.

1.2F2F3F4F5givenalgebra

Suppose pi=0 whenever qi=0. If Q(A)=0, the finite sum ∑i∈Aqi=0 and nonnegativity force qi=0 for every i∈A; hence pi=0 for those i and P(A)=0. Thus P≪Q by [F3]. Define ri=pi/qi when qi>0 and ri=0 when qi=0. Since every subset of S is measurable, this finite function is measurable. For every A⊆S, [F5] gives ∫Ar dQ=∑i∈Ariqi=∑i∈Api=P(A), so [F4] identifies r as a Radon–Nikodym derivative. It is explicitly constructed; no choice is used in this step.

2.1A1F1F5F7F8step 1.2algebra

Under the AC interface assumption [A1], substitute the density from step 1.2 into [F8], using the logarithm convention [F7]. Applying [F5] to ℓ(i)=ln⁡ri for ri>0 and ℓ(i)=0 for ri=0 gives D(P∥Q)=∑i:pi>0piln⁡ri=∑i:pi>0piln⁡(pi/qi); coordinates with pi=0 contribute 0 by [F1].

3.1givenstep 1.1step 2.1∎

Step 1.1 handles support failure, while step 2.1 proves equality with the finite sum when p is supported by q. These cases exhaust the finite vectors in the Statement.

Depends on

Used by

Dependency tree · two levels

42 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