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 be a finite-alphabet IID source with one-letter law , entropy , and surprisal variance as defined above. For , defined almost surely on , every and satisfy Consequently in probability.
Facts & Assumptions
Given: A finite nonempty alphabet , a probability law on , and an IID sequence with that law.
Finite-alphabet IID source: The finite vectors have law .
Information units and logarithm-base convention: An unmarked logarithm is , the natural logarithm, and information is measured in nats.
Finite distributions, entropy, divergence, and stochastic matrices: with zero terms set to zero, in natural units.
Identical distribution and IID families: IID means that the whole family is independent and identically distributed; independence is mutual independence.
IID finite-variance weak law: For IID square-integrable real variables with mean and variance , the sample mean converges in probability to and .
Convergence in probability: in probability when for every .
Proof
Given: The alphabet, law, and IID source in the Statement.
Define when and otherwise. This is the same finite-valued measurable function of every , so its range is finite. Take arbitrary distinct indices and Borel sets . Then ; mutual independence in [F6] gives probability , and the common law makes every have the same law. Thus the are IID.
Since , zero-mass symbols contribute nothing, and finite summation using [F4] gives ; the definition of in [F2] gives . Finite range gives square integrability.
For each fixed , each event has probability zero because its probability is ; the finite union also has probability zero. On its complement, [F1] and [F5] give . Applying [F7] with mean and variance proves the displayed tail bound. Its strict-tail version and [F8] give convergence in probability.
Depends on
- Finite-alphabet IID source
- Self-information and surprisal variance for a finite law
- Information density and typical sets for a finite source
- Information units and logarithm-base convention
- Finite distributions, entropy, divergence, and stochastic matrices
- Identical distribution and IID families
- IID finite-variance weak law
- Convergence in probability
Used by
- Typical-set probability and cardinality bounds Corollary
- A perfectly dependent Bernoulli source has zero block information rate Example
- Independent non-identical finite sources can have no information-rate limit Example
- Joint typicality probability tends to one for a finite IID multisource Lemma
- Typical-projector bounds for finite quantum sources and cq ensembles Lemma
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
- Thomas M. Cover and Joy A. Thomas, Elements of Information Theory, 2nd ed., Chapter 3, §3.1 (standard reference, not scraped)
- MIT OpenCourseWare 6.441 Information Theory, Spring 2010, Lecture 3: Convergence and Asymptotic Equipartition Property (standard reference, not scraped)