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.

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 X with alphabet A, and the finite-past probabilities and information variables pk,gk of Finite-past information densities.

[F1]

Finite-alphabet stationary source: the shift preserves the path law.

[F2]

Finite-past information densities: pk(a)=P(X0=a∣X−k−1) on finite atoms and gk=−log⁡2pk(X0) almost surely.

[F3]

Finite entropy chain rule and monotonicity under conditioning: block entropy is the sum of successive conditional entropies.

[F4]

Entropy-rate limit for a stationary finite-alphabet source: H(X0n−1)/n converges to the entropy rate h.

[F5]

The monotone class generated by an algebra equals the sigma-algebra it generates: finite-past cylinder identities extend to the sigma-algebra they generate.

[F6]

Dominated convergence: almost-sure convergence under an integrable envelope implies convergence of integrals.

[F7]

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].

1.1F2given

Choose the null-set versions allowed by [F2] to be zero where pk(X0)=0, so each gk is nonnegative without changing any almost-sure claim. For each a∈A, pk(a)=E[1{X0=a}∣Fk] is a martingale in k for Fk=σ(X−k,…,X−1), because the finite-atom conditional averages satisfy the tower identity when the partition is refined. It is bounded between zero and one.

2.1F7givenalgebrastep 1.1

For rationals 0≤u<v≤1, the buy-at-u, sell-at-v strategy applied to this bounded martingale has expected gain zero; each completed upcrossing earns at least v−u, and an unfinished final holding loses at most one. Therefore the expected number of completed upcrossings by time N is at most (v−u)−1. 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 pk(a) then converges to some p∞(a)∈[0,1].

3.1F5F6step 2.1given

For every finite-past cylinder B∈Fm, the tower identity gives ∫Bpk(a) dP=P(B∩{X0=a}) for all k≥m. Since 0≤pk(a)≤1 and pk(a)→p∞(a) almost surely, [F6] gives the same identity with p∞(a). For fixed a, the finite measures B↦∫Bp∞(a) dP and B↦P(B∩{X0=a}) 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 B∈F−. Thus p∞(a) is a conditional probability of X0=a given the full past.

4.1F2step 3.1algebra

The event {p∞(a)=0} belongs to F−. The conditional-probability identity from step 3.1 gives P(X0=a, p∞(a)=0)=∫1{p∞(a)=0}p∞(a) dP=0. Summing over the finite alphabet shows p∞(X0)>0 almost surely, so gk→g∞:=−log⁡2p∞(X0) almost surely.

5.1F2F6F7givenalgebrastep 4.1

For t≥0 and a∈A, let τa be the first k with pk(a)<2−t. On each event {τa=k}∈Fk, the tower identity gives P(X0=a,τa=k)=∫{τa=k}pk(a) dP≤2−tP(τa=k). Summing over k and then a yields P(G>t)≤∣A∣2−t for G=sup⁡kgk. For each integer M≥1, G∧M≤1+∑j=1M−11{G>j}, so [F7] and the tail bound give ∫G dP=lim⁡M∫(G∧M) dP≤1+∣A∣∑j≥12−j<∞. Since gk≤G and g∞≤G almost surely, [F6] also gives ∫gk dP→∫g∞ dP.

6.1F1F2F3F4step 5.1algebra∎

By stationarity [F1] and the chain rule [F3], Hn=∑k=0n−1H(Xk∣X0k−1)=∑k=0n−1H(X0∣X−k−1)=∑k=0n−1∫gk dP. Cesàro convergence and step 5.1 give lim⁡nHn/n=∫g∞ dP; [F4] identifies this limit as h. This also covers zero-probability transitions, which are never observed.

Depends on

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