Alphabeta Math
TheoremStatement: 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 entropy and mutual-information chain rules

Statement

For finite X,Y,Z with a joint pmf,

H(X,Y∣Z)=H(X∣Z)+H(Y∣X,Z),

and

I(X;Y,Z)=I(X;Z)+I(X;Y∣Z).

In particular, I(X;Y)=H(X)−H(X∣Y)=H(Y)−H(Y∣X). All terms are finite.

Facts & Assumptions

Given: A joint probability vector pXYZ on finite alphabets.

[F1]

Finite conditional entropy: H(U∣V)=∑v:pV(v)>0pV(v)H(pU∣v), with zero-mass conditioning values omitted.

[F2]

Finite mutual information: I(U;V)=∑pUV(u,v)>0pUV(u,v)ln⁡[pUV(u,v)/(pU(u)pV(v))].

[F3]

Finite conditional mutual information identities and equality: I(X;Y∣Z)=H(X∣Z)+H(Y∣Z)−H(X,Y∣Z).

[F4]

Marginals and positive-mass conditionals of a finite joint law are probability vectors: conditional pmfs are formed by division by positive marginal mass and are probability vectors.

[F5]

Finite distributions, entropy, divergence, and stochastic matrices: H(p)=−∑pi>0piln⁡pi, with 0ln⁡0=0.

[F6]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: for positive x,y, ln⁡(xy)=ln⁡x+ln⁡y and ln⁡(x/y)=ln⁡x−ln⁡y.

Proof

1.1F1F4F5F6givenalgebra

Fix z with pZ(z)>0 and write qxy=pXY∣z(x,y), qx=∑yqxy; for qx>0 define qy∣x=qxy/qx. By [F4], these are pmfs and qxy=qxqy∣x on positive support. On that support both factors are positive, so the product law [F6] gives −∑qxy>0qxyln⁡qxy=−∑qx>0∑y:qy∣x>0qxqy∣x(ln⁡qx+ln⁡qy∣x). For every qx>0, ∑y:qy∣x>0qy∣x=1. Thus the terms involving ln⁡qx sum to −∑qx>0qxln⁡qx, and the remaining terms are ∑qx>0qx(−∑qy∣x>0qy∣xln⁡qy∣x), exactly H(qX)+∑xqxH(qY∣x) by [F5]. Weighting this equality by pZ(z) and summing over positive-mass z using [F1] proves H(X,Y∣Z)=H(X∣Z)+H(Y∣X,Z). Zero atoms are omitted from the displayed logarithmic sums.

1.2F1F2F4F5F6algebra

Every positive joint atom has positive marginals by [F4]; applying the quotient and product laws [F6] to [F2] gives I(U;V)=∑puv>0puv(ln⁡puv−ln⁡pU(u)−ln⁡pV(v)). Grouping the finite sums by u,v, using [F4] to know the marginals, and applying [F5] yields I(U;V)=H(U)+H(V)−H(U,V). Also, [F1] and pU∣v=pUV/pV on positive support give H(U∣V)=−∑puv>0puvln⁡(puv/pV(v))=H(U,V)−H(V). Thus I(U;V)=H(U)−H(U∣V), and exchanging U,V gives the other form. All sums are finite.

2.1F1F2F3step 1.1step 1.2algebra∎

Apply step 1.1 and [F3] to get I(X;Y∣Z)=H(Y∣Z)−H(Y∣X,Z). By step 1.2, H(Y,Z)=H(Z)+H(Y∣Z) and H(X,Y,Z)=H(Z)+H(X,Y∣Z)=H(X,Z)+H(Y∣X,Z). Therefore I(X;Y,Z)=H(X)+H(Y,Z)−H(X,Y,Z)=I(X;Z)+I(X;Y∣Z). Every entropy is a finite sum, so no extended-real subtraction occurs.

Depends on

Used by

…and 13 more results.

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