Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-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.

Geometric strong mixing gives an Lp Poisson solution

Statement

Assume AC. Let P be a probability kernel on an arbitrary measurable space (X,X) with invariant probability π. Let (Xk)k≥0 be its stationary Markov chain, and suppose its strong-mixing coefficients satisfy αX(n)≤Crn for n≥1, with 0≤C<∞ and 0<r<1. Let f:X→R be measurable with πf=0 and π∣f∣q<∞ for some finite q>2.

For every 2<p<q, put θ=1/p−1/q. The kernel operators are understood on π-almost-everywhere classes, with finite measurable versions obtained by setting divergent integrals to zero on their π-null exceptional sets. Then ∥Pnf∥Lp(π)≤4αX(n)θ∥f∥Lq(π)(n≥1), and the series g=∑n=0∞Pnf converges in Lp(π), with f=g−Pgπ-almost everywhere. Moreover, writing cn=Cov⁡π(f(X0),f(Xn)), one has ∣cn∣≤4αX(n)1−2/q∥f∥Lq(π)2(n≥1),∑n≥1∣cn∣<∞. The covariance sum v=π(f2)+2∑n≥1cn is finite and nonnegative, and 1nEπ(∑k=0n−1f(Xk))2⟶v.

Facts & Assumptions

Given: AC, the stationary kernel and invariant probability, the geometric strong-mixing bound, centered real f∈Lq(π), and 2<p<q.

[A1]

AC is assumed. The Axiom of Choice

[F1]

For square-integrable variables in sigma-algebras with event mixing coefficient a, ∣Cov⁡(U,V)∣≤4∫0aQUQV, and ∫01ψ(QU(u)) du=Eψ(∣U∣) for nonnegative Borel ψ. Separation by n bounds a by αX(n). Strong-mixing covariance bound in terms of tail quantiles, Strong, uniform, and maximal-correlation mixing coefficients

[F2]

The bounded Markov identity is E[h(Xj+n)∣Fj]=Pnh(Xj); its square-integrable extension identifies the conditional mean with the kernel integral on a full invariant-measure set. Chapman-Kolmogorov equations, Kernel conditional expectations for square-integrable Markov observables

[F3]

Conditional expectation is an Lp contraction, and on a probability space Lq⊂Lp⊂L2 when q>p>2. Conditional lp contraction, Finite-measure Lr includes into Lp for p<r

[F4]

Hölder and its product form bound products in the corresponding Ls spaces; Minkowski bounds the norm of a finite sum by the sum of norms. Holder's inequality for integrals, including the endpoint cases, Generalized Holder inequality puts products into Lr, Minkowski's inequality for integrals, including p=∞

[F5]

Under AC, Lp is complete, consists of almost-everywhere classes of measurable representatives, and norm-convergent sequences have almost-everywhere convergent representative subsequences. Riesz-Fischer completeness of Lp for 1≤p≤∞, The space Lp(μ) as the quotient by null functions

[F6]

Increasing nonnegative measurable functions pass through integration by monotone convergence. Monotone convergence for the integral

[F7]

Invariance means πP=π; the identity extends from indicators to nonnegative measurable functions by increasing simple approximations. Invariant and stationary distribution for a Markov kernel

[F8]

Centered second moments are variances, covariance is the centered product expectation, and covariance is bilinear and symmetric. Moments, variance, and covariance on a probability space, Covariance is symmetric and bilinear in finite linear combinations

Proof

1.1A1F2F3F6F7given

Invariance [F7], extended with [F6], gives πP∣h∣=π∣h∣ for integrable h, so the absolute kernel integral is finite off a measurable π-null set. A change of representative on a π-null set A does not change its image class, since πP1A=π(A)=0 implies P1A=0 almost everywhere. For h∈Lp, [F3] gives h∈L2, and [F2] identifies Ph(X0) with E[h(X1)∣X0]. Conditional contraction [F3] and stationarity give ∥Ph∥p≤∥h∥p. The bounded iteration identity in [F2] extends to these Lp classes by replacing h with its bounded clipped truncations: their Lp error tends to zero because the integrable tail ∣h∣p1{∣h∣>K} tends to zero, as follows from [F6] applied to its complementary truncations; conditional and kernel contractions pass this error to zero. Thus P is a well-defined linear contraction on Lp, its iterates agree with the kernel iterates, and Pnh(X0)=E[h(Xn)∣X0]. This also proves Pnf∈Lp before any covariance estimate is used.

2.1F1F3step 1.1givenconstructalgebra

Fix n≥1, put Z=Pnf, and let p′=p/(p−1) and WK(x)=sgn⁡(Z(x))∣Z(x)∣p−11{∣Z(x)∣≤K} for integers K≥1. This function is bounded, belongs to L2, and satisfies ∥WK∥p′≤∥Z∥pp−1. The centered f(Xn) is in L2 by [F3]. Step 1.1 and bounded conditional multiplication give E[WK(X0)f(Xn)]=π(WKPnf)=π(∣Z∣p1{∣Z∣≤K}); since πf=0, this expectation is the covariance of WK(X0) and f(Xn). Bounded conditional multiplication here follows directly from the defining conditional expectation event identity, first for simple WK and then by uniform bounded approximation. Thus [F1] is applied only to square-integrable variables, even though p′<2.

3.1F1F4F6step 2.1algebra

Put a=αX(n). The quantile identity in [F1] gives ∥QWK(X0)∥p′=∥WK∥p′ and ∥Qf(Xn)∥q=∥f∥q. Since 1/p′+1/q=1−θ, apply the product inequality [F4] to these two quantile functions in L1/(1−θ)(0,1), and then Hölder with 1(0,a), whose L1/θ norm is aθ. Therefore [F1] and step 2.1 give π(∣Z∣p1{∣Z∣≤K})≤4aθ∥Z∥pp−1∥f∥q. If a=0 the quantile integral and the right-hand side are zero. Let K→∞ using [F6]. If ∥Z∥p=0 the required bound is immediate; otherwise divide by ∥Z∥pp−1 to obtain ∥Pnf∥p≤4αX(n)θ∥f∥q. The restriction p<q ensures θ>0 and makes all Hölder exponents just used valid.

4.1A1F4F5step 1.1step 3.1constructalgebra

The geometric bound makes ∑n≥1αX(n)θ≤Cθ∑n≥1rnθ<∞, including C=0. By step 3.1, [F4] makes gm=∑n=0mPnf a Cauchy sequence in Lp. Completeness [F5] gives gm→g∈Lp. The contraction in step 1.1 gives Pgm→Pg, while gm−Pgm=f−Pm+1f→f in Lp by step 3.1. Thus g−Pg=f as almost-everywhere classes. Choose the finite measurable representative supplied by [F5], setting it to zero on its measurable null exceptional set if necessary, and use the version convention from step 1.1 for Pg. These choices make the asserted almost-everywhere identity precise on the original sigma-algebra without completing the measure.

4.2F1F3F4step 3.1givenalgebra

Apply [F1] directly to f(X0),f(Xn), both square-integrable. Their quantiles have common Lq(0,1) norm ∥f∥q. Two applications of [F4], with reciprocal exponents 1/q,1/q,1−2/q, yield ∣cn∣≤4αX(n)1−2/q∥f∥q2. The exponent is positive because q>2; the geometric bound therefore gives ∑n≥1∣cn∣<∞. At a zero mixing coefficient the quantile integral is zero, so no division by that coefficient is needed.

5.1A1F5F8step 4.1step 4.2givenalgebra∎

Centering, stationarity and [F8] give n−1Eπ(∑k=0n−1f(Xk))2=π(f2)+2∑h=1n−1(1−h/n)ch. To pass to its limit, choose any finite H; the terms h≤H converge individually to ch, while the absolute value of either remaining weighted or limiting tail is at most ∑h>H∣ch∣, which tends to zero as H→∞ by step 4.2. The limit is the claimed finite covariance sum v. Each left-hand side is nonnegative, hence v≥0. When f=0 almost everywhere all bounds and the choice g=0 hold directly; no claim of uniqueness of g is made. The strict exponent range and all zero-mixing cases were handled in steps 3.1, 4.1, 4.2. AC is used through the Markov/conditional and completeness suppliers, not as an imported covariance or Poisson theorem.

Source notes

The actual Doukhan–Massart–Rio full PDF was retrieved and its printed p. 66 inspected as a rendered page, including the finite-variance restriction of Lemma 1 and the covariance-sum conclusion of Proposition 1. The proof above consumes the fully proved local quantile lemma. Its test variable is bounded before that lemma is applied; the unbounded Lp′ dual variable, whose exponent is less than two, is never inserted into a result requiring square integrability. The Poisson-series construction, norm convergence and nonnegative variance limit are proved here, not replaced by a source citation.

Depends on

Used by

Dependency tree · two levels

69 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