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.
Convergence and integrable envelope for finite-past information
Statement
Proves p_k(a) converges almost surely for each symbol, g_k converges on realized paths, and sup_k g_k is integrable with an explicit exponential tail bound.
Facts & Assumptions
Given: A stationary finite-alphabet source with alphabet , and the finite-past probabilities and information variables of Finite-past information densities.
Finite-alphabet stationary source: the shift preserves the path law.
Finite-past information densities: on finite atoms and almost surely.
Finite entropy chain rule and monotonicity under conditioning: block entropy is the sum of successive conditional entropies.
Entropy-rate limit for a stationary finite-alphabet source: converges to the entropy rate .
The monotone class generated by an algebra equals the sigma-algebra it generates: finite-past cylinder identities extend to the sigma-algebra they generate.
Dominated convergence: almost-sure convergence under an integrable envelope implies convergence of integrals.
Monotone convergence for the integral: integrals of increasing nonnegative functions converge to the integral of their pointwise limit.
Proof
Given: The source and definitions and supplier claims [F1]–[F7].
Choose the null-set versions allowed by [F2] to be zero where , so each is nonnegative without changing any almost-sure claim. For each , is a martingale in for , because the finite-atom conditional averages satisfy the tower identity when the partition is refined. It is bounded between zero and one.
For rationals , the buy-at-, sell-at- strategy applied to this bounded martingale has expected gain zero; each completed upcrossing earns at least , and an unfinished final holding loses at most one. Therefore the expected number of completed upcrossings by time is at most . By [F7], the total upcrossing count has finite expectation and is finite almost surely. Intersect over the countably many rational pairs and the finite alphabet: each then converges to some .
For every finite-past cylinder , the tower identity gives for all . Since and almost surely, [F6] gives the same identity with . 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 [F5] extends the identity to every . Thus is a conditional probability of given the full past.
The event belongs to . The conditional-probability identity from step 3.1 gives Summing over the finite alphabet shows almost surely, so almost surely.
For and , let be the first with . On each event , the tower identity gives Summing over and then yields for . For each integer , so [F7] and the tail bound give . Since and almost surely, [F6] also gives .
By stationarity [F1] and the chain rule [F3], Cesàro convergence and step 5.1 give ; [F4] identifies this limit as . This also covers zero-probability transitions, which are never observed.
Depends on
- Finite-alphabet stationary source
- Finite-block information and entropy in bits
- Finite-past information densities
- Finite entropy chain rule and monotonicity under conditioning
- Entropy-rate limit for a stationary finite-alphabet source
- The monotone class generated by an algebra equals the sigma-algebra it generates
- Dominated convergence
- Monotone convergence for the integral
Used by
Dependency tree · two levels
38 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
- Robert M. Gray, Entropy and Information Theory, corrected edition (standard reference, not scraped)