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.
Information density and typical sets for a finite source
Definition
For the finite-alphabet IID source in Finite-alphabet IID source, with one-letter law and block law from Self-information and surprisal variance for a finite law, let have that law. Write for the finite entropy in Finite distributions, entropy, divergence, and stochastic matrices. On the positive-probability support , define normalized block information density using the natural-log/nats convention from Information units and logarithm-base convention For , its epsilon-typical set is Sequences of zero probability are excluded, so the definition never takes a logarithm of zero.
Depends on
Used by
- Typical-set probability and cardinality bounds Corollary
- Jointly typical blocks for a finite IID multisource Definition
- Bernoulli information density and exact typical-set counts Example
- Finite-alphabet IID information AEP with a variance bound Lemma
- Fixed-length lossless source coding at the entropy rate Theorem
Dependency tree · two levels
9 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–3.3 (standard reference, not scraped)
- MIT OpenCourseWare 6.441 Information Theory, Spring 2010, Lecture 3 (standard reference, not scraped)