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

Joint typicality probability tends to one for a finite IID multisource

Statement

Let (Zt)t≥1 be a finite-alphabet IID k-source with joint letter law P on X=∏i=1kXi. For every δ,ϵ>0, its jointly typical set from Jointly typical blocks for a finite IID multisource satisfies P⊗n(Tn(P,δ,ϵ))⟶1(n→∞).

Facts & Assumptions

Given: The finite alphabets, the IID vector source, and δ,ϵ>0.

[F1]

Finite-alphabet IID multisource: Zt are IID with law P, and every n-block has law P⊗n.

[F2]

Jointly typical blocks for a finite IID multisource: membership requires support, empirical-coordinate, full-information, and every nonempty-subset conditional-information bounds.

[F3]

Empirical types, n-types, and type classes: P^zn(a)=n−1∑t=1n1{Zt=a}.

[F4]

Identical distribution and IID families: an IID family is mutually independent and identically distributed; applying the same measurable finite-valued function to each coordinate preserves these properties by inverse images.

[F5]

Finite-alphabet IID information AEP with a variance bound: for the vector source, P(∣In(Zn)−H(P)∣≥ϵ)≤V(P)/(nϵ2), with finite surprisal variance V(P).

[F6]

Finite conditional entropy: HP(XS∣XSc)=∑c:PXSc(c)>0PXSc(c)H(PXS∣c).

[F7]

Conditional block law factors across IID coordinates: for a supported block, P⊗n(xSn∣xScn)=∏t=1nPXS∣XSc(xS,t∣xSc,t).

[F8]

Finite distributions, entropy, divergence, and stochastic matrices: finite entropy is H(r)=−∑a:r(a)>0r(a)ln⁡r(a).

Proof

1.1F1F2F3F4algebra

Fix a∈X and put Bt,a:=1{Zt=a}. For any distinct t1,…,tr and sets Ej⊆{0,1}, ⋂j{Btj,a∈Ej}=⋂j{Ztj∈ϕa−1(Ej)}, where ϕa(z)=1{z=a}. Mutual independence in [F1, F4] factors the probability of this intersection, and the common law P gives every Bt,a the same distribution; hence (Bt,a) are IID. Their mean is P(a) and variance is P(a)(1−P(a))≤1/4. Their sample mean is P^Zn(a) by [F3]. Independence gives E[(P^Zn(a)−P(a))2]=Var⁡(B1,a)/n≤1/(4n); since a square is at least δ2 on the event of deviation at least δ, that event has probability at most 1/(4nδ2). If P(a)=0, the probability that a occurs at any of the first n positions is zero. A union bound over the finite alphabet proves that the support and empirical-coordinate requirements in [F2] fail with probability at most ∣X∣/(4nδ2).

1.2F2F5

By [F5], the full-information requirement in [F2] fails with probability at most V(P)/(nϵ2).

1.3F1F4F6F7F8algebra

Fix a nonempty S⊆[k] and write C=Sc. On the support of P, define WtS:=−ln⁡PXS∣XC(XS,t∣XC,t), and set it to 0 off the support. This is a finite-valued function ψS(Zt). For distinct t1,…,tr and Borel sets B1,…,Br, ⋂j{WtjS∈Bj}=⋂j{Ztj∈ψS−1(Bj)}; [F1, F4] therefore give mutual independence and a common law, so (WtS) are IID. Its mean is HP(XS∣XC) by the finite sum in [F6] and the zero-term convention in [F8], and its variance σS2 is finite because its range is finite. By [F7], JS,n=n−1∑t=1nWtS almost surely. Independence gives E[(JS,n−HP(XS∣XC))2]=σS2/n, so the same squared-deviation argument bounds failure of this conditional requirement by σS2/(nϵ2).

2.1F2step 1.1step 1.2step 1.3algebra∎

There are finitely many symbols and finitely many nonempty subsets S. The union bound over the failure events in steps 1.1, 1.2, and 1.3 is at most ∣X∣4nδ2+V(P)+∑∅≠S⊆[k]σS2nϵ2, which tends to zero. Its complement is exactly the event in the Statement, proving the claimed limit.

Depends on

Used by

Dependency tree · two levels

19 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