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.
Conditional block information rate given the infinite past
Statement
For each , constructs the conditional law of given the full infinite past by finite-past martingale limits, then proves its realized information per symbol converges almost surely to the entropy rate for every stationary ergodic finite-alphabet source, without choice.
Facts & Assumptions
Given: A stationary ergodic finite-alphabet source with bit entropy rate , and .
Convergence and integrable envelope for finite-past information, Proof steps 5.1–6.1: the finite-past one-symbol probabilities converge to ; the realized information is nonnegative, integrable, and has mean .
The multiplication rule and finite chain rule for conditional probability: a finite joint probability factors into successive conditional probabilities on positive-probability prefixes.
The monotone class generated by an algebra equals the sigma-algebra it generates: identities on the algebra of finite-past cylinders extend to .
Monotone convergence for the integral: integrals of increasing nonnegative measurable functions converge to the integral of their pointwise limit.
Dominated convergence: bounded almost-surely convergent functions on a probability space converge in integral when dominated by an integrable function.
Birkhoff's theorem for an ergodic probability system: for an integrable function on an ergodic probability-preserving shift, its time averages converge almost surely to its integral.
Proof
Given: The source, entropy rate and sigma-algebra above.
For , and each word , define on each positive-probability atom of as the conditional average of there; on null atoms use the uniform vector on . Refining the past partition shows that for fixed , is a martingale bounded in . For rational , hold one unit after the martingale first falls to at most , sell it when the martingale next reaches at least , and repeat. Each finite-horizon gain is a sum of predictable holdings times martingale increments, so its expectation is zero by the martingale property. Every completed upcrossing earns at least , and an unfinished holding loses at most one because the martingale stays in . Thus the expected completed upcrossing count through any horizon is at most . The counts increase with the horizon, so [F4] gives finite expected total count and hence finitely many total upcrossings almost surely for each rational pair. A bounded real sequence that does not converge has distinct liminf and limsup, hence has infinitely many upcrossings of some rational interval strictly between them. A countable intersection over rational pairs, words and lengths therefore gives simultaneous almost-sure limits .
For each , the limits are nonnegative and sum to one because there are finitely many words and every is a probability vector. They are -measurable. Every finite-past cylinder belongs to the conditioning sigma-algebra for all sufficiently large ; [F5], with majorant one on the probability space, then gives . For fixed , the finite measures and agree on the algebra of finite-past cylinders. Their agreement class is a monotone class by continuity of finite measures, so [F3] extends the identity to every . Thus is a conditional probability version of the block given the full past.
Fix a positive-probability atom of the -past partition. Applying [F2] to and its successive intersections with the realized symbol events factors into the one-symbol conditional probabilities on the refined atoms . By stationarity, the factor for is , because the past at the shifted point is exactly at the original point . Therefore, almost surely on the realized block, For fixed , each factor converges almost surely as to , since the convergence in [F1] holds almost surely and each preserves . The left side converges to by step 1.1. The realized one-symbol limits are positive almost surely by [F1] and stationarity, so
Apply [F6] to . By [F1] its integral is , so the right side of step 2.2 divided by converges almost surely to . This proves the asserted conditional block-information rate and uses no choice axiom.
Depends on
- Finite-alphabet stationary source
- Convergence and integrable envelope for finite-past information
- The multiplication rule and finite chain rule for conditional probability
- The monotone class generated by an algebra equals the sigma-algebra it generates
- Birkhoff's theorem for an ergodic probability system
- Monotone convergence for the integral
- Dominated convergence
Used by
Dependency tree · two levels
42 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
- Ioannis Kontoyiannis, Recurrence and Waiting Times in Stationary Processes and Their Applications in Data Compression, Stanford University dissertation (standard reference, not scraped)
- Robert M. Gray, Entropy and Information Theory, corrected edition (standard reference, not scraped)