Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge 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-alphabet IID information AEP with a variance bound

Statement

Let (Xi)i≥1 be a finite-alphabet IID source with one-letter law p, entropy H(p), and surprisal variance V(p) as defined above. For In(Xn)=−n−1ln⁡pn(Xn), defined almost surely on A+n, every n≥1 and ε>0 satisfy P(∣In(Xn)−H(p)∣≥ε)≤V(p)nε2. Consequently In(Xn)→H(p) in probability.

Facts & Assumptions

Given: A finite nonempty alphabet A, a probability law p on A, and an IID sequence with that law.

[F1]

Finite-alphabet IID source: The finite vectors Xn have law pn(xn)=∏i=1np(xi).

[F2]

Self-information and surprisal variance for a finite law: On A+, ıp(a)=−ln⁡p(a) and V(p)=∑a∈A+p(a)(ıp(a)−H(p))2.

[F3]

Information units and logarithm-base convention: An unmarked logarithm is ln⁡, the natural logarithm, and information is measured in nats.

[F4]

Finite distributions, entropy, divergence, and stochastic matrices: H(p)=−∑a:p(a)>0p(a)ln⁡p(a) with zero terms set to zero, in natural units.

[F5]

Information density and typical sets for a finite source: In(xn)=−n−1ln⁡pn(xn) on A+n.

[F6]

Identical distribution and IID families: IID means that the whole family is independent and identically distributed; independence is mutual independence.

[F7]

IID finite-variance weak law: For IID square-integrable real variables with mean μ and variance σ2, the sample mean converges in probability to μ and P(∣Sn/n−μ∣≥ε)≤σ2/(nε2).

[F8]

Convergence in probability: Yn→Y in probability when P(∣Yn−Y∣>ε)→0 for every ε>0.

Proof

Given: The alphabet, law, and IID source in the Statement.

1.1givenF1F2F6construct

Define Yi=ıp(Xi) when Xi∈A+ and Yi=0 otherwise. This is the same finite-valued measurable function of every Xi, so its range is finite. Take arbitrary distinct indices i1,…,im and Borel sets B1,…,Bm. Then ⋂j=1m{Yij∈Bj}=⋂j=1m{Xij∈ıp−1(Bj)}; mutual independence in [F6] gives probability ∏j=1mP(Xij∈ıp−1(Bj)), and the common law p makes every Yi have the same law. Thus the Yi are IID.

2.1F2F3F4step 1.1algebra

Since P(Xi=a)=p(a), zero-mass symbols contribute nothing, and finite summation using [F4] gives E[Yi]=H(p); the definition of V(p) in [F2] gives Var⁡(Yi)=V(p). Finite range gives square integrability.

3.1F1F5F7F8step 1.1step 2.1algebra∎

For each fixed n, each event {Xi∉A+} has probability zero because its probability is ∑a∉A+p(a)=0; the finite union also has probability zero. On its complement, [F1] and [F5] give In(Xn)=n−1∑i=1nYi. Applying [F7] with mean H(p) and variance V(p) proves the displayed tail bound. Its strict-tail version and [F8] give convergence in probability.

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