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.

Zero information is exactly independence

Statement

Assume AC. Let X,Y,Z be standard-Borel random elements. Then I(X;Y)=0 if and only if PXY=PX⊗PY (independence). Also I(X;Y∣Z)=0 if and only if X and Y are conditionally independent given σ(Z) in the sense of Conditional independence given a sigma-algebra.

Facts & Assumptions

Given: AC and standard-Borel random elements X,Y,Z with their joint law.

[A1]

AC is inherited from KL, standard-Borel regular conditional laws, and the conditional-independence convention. The Axiom of Choice

[F1]

KL divergence is nonnegative and equals zero exactly when the two probability laws agree. Kullback–Leibler divergence is nonnegative

[F2]

I(X;Y)=D(PXY∥PX⊗PY). Measure-theoretic mutual information

[F3]

I(X;Y∣Z) is the KL divergence of the joint law from its same-Z-marginal conditional-product law R. Conditional mutual information by a same-marginal product law

[F4]

Conditional independence given G means E[f(X)g(Y)∣G]=E[f(X)∣G]E[g(Y)∣G] almost surely for all bounded measurable real f,g. Conditional independence given a sigma-algebra

[F5]

Equality of conditional-expectation versions is characterized by their integrals on every conditioning event. Conditional expectation given a sigma algebra

[F6]

Conditional dominated convergence passes bounded pointwise limits through conditional expectations. Conditional fatou and dominated convergence

[F7]

Measurable rectangles generate the finite product sigma-algebra and determine probability measures by pi-lambda. The product sigma-algebra and its finite iterates Dynkin's pi-lambda theorem

Proof

Given: The hypotheses in the Statement.

1.1A1F1F2given

By [F2] and [F1], I(X;Y)=0 exactly when PXY=PX⊗PY, which is the stated independence condition.

1.2A1F1F3given

By [F3] and [F1], I(X;Y∣Z)=0 exactly when the joint law PZXY of (Z,X,Y) equals the conditional-product reference law R.

2.1F3F4F5F6F7givenstep 1.2∎

Suppose PZXY=R, using the coordinate order (Z,X,Y) of [F3]. For all measurable A,B,C the rectangle formula for R gives P(X∈A,Y∈B,Z∈C)=∫CK(z,A)L(z,B)PZ(dz). By the regular conditional law identities, K(Z,A) and L(Z,B) are versions of the two conditional expectations in [F4]. The displayed identity says their product is the conditional-expectation version of 1{X∈A,Y∈B} by [F5]. Thus [F4] holds for indicators. Linearity gives it for bounded simple functions; bounded measurable functions follow by bounded simple approximation and [F6]. Conversely, [F4] applied to indicators gives the same rectangle identity, so PZXY and R agree on every rectangle C×A×B. These rectangles determine the probability law by [F7], hence PZXY=R.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

63 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