Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Self-mutual-information entropy on countable and non-atomic laws

Statement

Assume AC. Let X have a probability law P on a standard-Borel space. Let S={x:P({x})>0} be its set of atoms. Then S is countable. If P(S)=1 and its atom masses are (pi), the law entropy from Law entropy as self-mutual information is H(X)=∑ipiln⁡1pi, with value +∞ allowed. If P(S)<1, then H(X)=+∞.

Facts & Assumptions

Given: AC and a standard-Borel probability law P.

[A1]

AC is assumed for the Radon–Nikodym law-entropy interface, the countable determining algebra in [F2], and the countable union of finite atom sets in step 1.1. The Axiom of Choice

[F1]

Law entropy is the KL divergence of the diagonal joint law of (X,X) from P⊗P. Law entropy as self-mutual information Measure-theoretic mutual information

[F2]

A standard-Borel space has a countable algebra separating points, and each singleton is Borel because points are closed in its Polish presentation. The diagonal is the intersection, over the algebra, of measurable sets (A×A)∪(Ac×Ac). Standard Borel spaces Polish spaces are separable completely metrizable spaces Standard borel spaces have countable generating and measure determining algebras The product sigma-algebra and its finite iterates

[F4]

For a finite law, Shannon entropy is the sum −∑ipiln⁡pi with 0ln⁡0=0. Finite distributions, entropy, divergence, and stochastic matrices

[F5]

For every positive real t, there is an integer n≥1 with 1/n<t. For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε

[F6]

Increasing limits of nonnegative measurable functions pass through their integrals. Monotone convergence for the integral

Proof

Given: AC and the standard-Borel probability law P.

1.1A1F5givenchoose

For each positive integer n, there are at most n atoms with mass at least 1/n, since any n+1 distinct such atoms would have total mass greater than one. For each atom of mass p>0, choose n with 1/n<p by [F5]; thus S is a countable union of finite sets and is countable.

1.2A1F1F2F3F6givenconstruct

Suppose P(S)=1 and enumerate the distinct atoms as (xi) with masses pi>0. By [F2], each singleton (xi,xi) is measurable, so the function r that equals 1/pi at (xi,xi) and zero elsewhere is measurable. For each finite N, let rN=∑i≤Npi−11{(xi,xi)}; these functions increase to r. The rectangle formula gives (P⊗P){(xi,xi)}=pi2. Hence for every measurable C⊆E×E, [F6] gives ∫Cr d(P⊗P)=lim⁡N∑i≤N:(xi,xi)∈C1pipi2=∑i:(xi,xi)∈Cpi=PXX(C). Thus r is the Radon–Nikodym density. Since pi≤1, log⁡r≥0 on the PXX-full set of diagonal atoms; the partial sums gN=∑i≤Nln⁡(1/pi)1{(xi,xi)} increase to log⁡r there. Another application of [F6] gives the KL integral ∑ipiln⁡(1/pi), including an infinite sum.

2.1A1F1F2F3step 1.1

Suppose P(S)<1. The set C=Δ∖(S×S) is measurable, where Δ={(x,x):x∈E} by [F2]. The diagonal joint law assigns C mass P(E∖S)>0. Its product-measure section at x∈S is empty; at x∉S it is {x}, whose P-mass is zero. By [F3], (P⊗P)(C)=0. Hence PXX≪̸P⊗P and [F1] gives H(X)=+∞.

3.1F4step 1.2step 2.1∎

The two cases P(S)=1 and P(S)<1 exhaust all probability laws. Step 1.2 gives the nonnegative countable sum, which agrees on every finite subset with the finite Shannon formula [F4]; step 2.1 gives infinite divergence when there is positive non-atomic mass.

Depends on

Used by

Dependency tree · two levels

74 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