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 be a finite-alphabet IID -source with joint letter law on . For every , its jointly typical set from Jointly typical blocks for a finite IID multisource satisfies
Facts & Assumptions
Given: The finite alphabets, the IID vector source, and .
Finite-alphabet IID multisource: are IID with law , and every -block has law .
Jointly typical blocks for a finite IID multisource: membership requires support, empirical-coordinate, full-information, and every nonempty-subset conditional-information bounds.
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.
Finite-alphabet IID information AEP with a variance bound: for the vector source, , with finite surprisal variance .
Conditional block law factors across IID coordinates: for a supported block, .
Finite distributions, entropy, divergence, and stochastic matrices: finite entropy is .
Proof
Fix and put . For any distinct and sets , , where . Mutual independence in [F1, F4] factors the probability of this intersection, and the common law gives every the same distribution; hence are IID. Their mean is and variance is . Their sample mean is by [F3]. Independence gives ; since a square is at least on the event of deviation at least , that event has probability at most . If , the probability that occurs at any of the first 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 .
By [F5], the full-information requirement in [F2] fails with probability at most .
Fix a nonempty and write . On the support of , define , and set it to off the support. This is a finite-valued function . For distinct and Borel sets , ; [F1, F4] therefore give mutual independence and a common law, so are IID. Its mean is by the finite sum in [F6] and the zero-term convention in [F8], and its variance is finite because its range is finite. By [F7], almost surely. Independence gives , so the same squared-deviation argument bounds failure of this conditional requirement by .
There are finitely many symbols and finitely many nonempty subsets . The union bound over the failure events in steps 1.1, 1.2, and 1.3 is at most , which tends to zero. Its complement is exactly the event in the Statement, proving the claimed limit.
Depends on
- Finite-alphabet IID multisource
- Jointly typical blocks for a finite IID multisource
- Conditional block law factors across IID coordinates
- Empirical types, n-types, and type classes
- Finite conditional entropy
- Finite-alphabet IID source
- Identical distribution and IID families
- Finite-alphabet IID information AEP with a variance bound
- Finite distributions, entropy, divergence, and stochastic matrices
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
- Thomas M. Cover and Joy A. Thomas, Elements of Information Theory, second edition, Chapter 15 (standard reference, not scraped)
- Yury Polyanskiy and Yihong Wu, Information Theory: From Coding to Learning, author-hosted book draft (standard reference, not scraped)