Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generated
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 n≥1, constructs the conditional law of X0n−1 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 X=(Xi)i∈Z with bit entropy rate h, and F−:=σ(Xj:j<0).

[F1]

Convergence and integrable envelope for finite-past information, Proof steps 5.1–6.1: the finite-past one-symbol probabilities converge to p∞(a); the realized information g∞=−log⁡2p∞(X0) is nonnegative, integrable, and has mean h.

[F2]

The multiplication rule and finite chain rule for conditional probability: a finite joint probability factors into successive conditional probabilities on positive-probability prefixes.

[F3]

The monotone class generated by an algebra equals the sigma-algebra it generates: identities on the algebra of finite-past cylinders extend to F−.

[F4]

Monotone convergence for the integral: integrals of increasing nonnegative measurable functions converge to the integral of their pointwise limit.

[F5]

Dominated convergence: bounded almost-surely convergent functions on a probability space converge in integral when dominated by an integrable function.

[F6]

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.

1.1F4givenalgebra

For k≥0, n≥1 and each word w∈An, define qk,n(w) on each positive-probability atom of σ(X−k,…,X−1) as the conditional average of 1{X0n−1=w} there; on null atoms use the uniform vector on An. Refining the past partition shows that for fixed n,w, (qk,n(w))k≥0 is a martingale bounded in [0,1]. For rational 0≤u<v≤1, hold one unit after the martingale first falls to at most u, sell it when the martingale next reaches at least v, 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 v−u, and an unfinished holding loses at most one because the martingale stays in [0,1]. Thus the expected completed upcrossing count through any horizon is at most (v−u)−1. 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 q∞,n(w).

2.1F3F5step 1.1given

For each n, the limits are nonnegative and sum to one because there are finitely many words and every qk,n is a probability vector. They are F−-measurable. Every finite-past cylinder B belongs to the conditioning sigma-algebra for all sufficiently large k; [F5], with majorant one on the probability space, then gives ∫Bq∞,n(w) dP=P(B∩{X0n−1=w}). For fixed n,w, the finite measures B↦∫Bq∞,n(w) dP and B↦P(B∩{X0n−1=w}) 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 B∈F−. Thus q∞,n(w) is a conditional probability version of the block given the full past.

2.2F1F2step 1.1algebra

Fix a positive-probability atom B of the k-past partition. Applying [F2] to B and its successive intersections with the realized symbol events factors P(X0n−1=w∣B) into the one-symbol conditional probabilities on the refined atoms B∩{X0i−1=w0i−1}. By stationarity, the factor for Xi=wi is pk+i(wi)∘Ti, because the past X−(k+i)−1 at the shifted point Tix is exactly X−ki−1 at the original point x. Therefore, almost surely on the realized block, qk,n(X0n−1)=∏i=0n−1(pk+i(X0)∘Ti). For fixed n, each factor converges almost surely as k→∞ to p∞(X0)∘Ti, since the convergence in [F1] holds almost surely and each Ti preserves P. The left side converges to q∞,n(X0n−1) by step 1.1. The realized one-symbol limits are positive almost surely by [F1] and stationarity, so −log⁡2q∞,n(X0n−1)=∑i=0n−1g∞∘Tialmost surely.

3.1F1F6step 2.2given∎

Apply [F6] to g∞. By [F1] its integral is h, so the right side of step 2.2 divided by n converges almost surely to h. This proves the asserted conditional block-information rate and uses no choice axiom.

Depends on

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