Alphabeta Math
Pipeline-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.

✓ 2 results · all verified · 2 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 2 also cleared it.

Stationary means and sample autocovariance

1 · Prerequisites

2 · Summary

For an integer-indexed real process, strict stationarity concerns all finite-dimensional laws, while weak stationarity requires finite second moments, a constant mean and lag-dependent covariance. Under weak stationarity, the sample-mean variance is a triangularly weighted covariance sum; absolute covariance summability gives an O(n−1) variance bound and L2 consistency, without a mixing or central limit conclusion. The zero-extended biased sample ACVF has nonnegative Toeplitz quadratic forms; the pair-count-normalized rescaling need not. Ergodicity gives a separate almost-sure and L1 mean limit only with strict stationarity, integrability and the Axiom of Choice required by the Birkhoff supplier. These are consequences of the specified probability law; neither a model contract nor these theorems establish that a scientific model adequately describes its application.

Model contract for this pair

For horizon n≥1, the observed record is the finite coordinate tuple Dn=(X1,…,Xn) in Rn with the finite product Borel sigma-algebra; its law is the pushforward of the process law under the coordinate map (Stochastic processes and their finite-dimensional distributions, Law or distribution of a random element, The product sigma-algebra and its finite iterates, The Borel sigma-algebra of a topological space). One record is one real coordinate at an integer time index. The index set and origin for the displayed sample are fixed; a physical time scale, sampling frame and scientific unit are application fields, not supplied by this abstract pair. The coordinates are random and Dn is observed; no predictors, latent quantities, treatment assignment or missingness mechanism is specified. The target is the common law mean μ, and the analysis uses the joint process law without conditioning on a design. No support restriction beyond that law is imposed. This model-record convention is the observation/index/quantity-status/law context of Scientific statistical model contracts.

Stationarity and finite moments are empirically assessable assumptions: data can challenge their implications but cannot prove them. Absolute covariance summability and ergodicity are global law hypotheses that a finite record does not verify. Whether the specified law describes a scientific population requires application-level evidence and is not a consequence of the mathematics here.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Strict and weak stationarity for integer-indexed time series

Definition

Let X=(Xt)t∈Z be a real-valued stochastic process on one probability space, so each Xt is a real random variable and each finite tuple has its pushforward law (Stochastic processes and their finite-dimensional distributions, Random elements and real random variables, Law or distribution of a random element). We call X a time series here because its index set is Z.

The process is strictly stationary when for every integer r≥1, every t1,…,tr∈Z, and every shift m∈Z, L(Xt1+m,…,Xtr+m)=L(Xt1,…,Xtr). This condition concerns the full finite-dimensional laws and imposes no moment condition by itself.

The process is weakly stationary when E[∣Xt∣2]<∞ for every t∈Z, its mean μ:=E[Xt] is independent of t, and for every h∈Z the covariance γ(h):=Cov⁡(Xt+h,Xt) is independent of t. Expectation, variance, and covariance have the meanings in Expectation of a nonnegative or integrable random variable and Moments, variance, and covariance on a probability space. Strict stationarity alone therefore does not supply the moment hypotheses needed for covariance or sample-mean claims.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Autocovariance and sample autocovariance

Definition

For a weakly stationary real process X=(Xt)t∈Z, its autocovariance function (ACVF) is γ(h):=Cov⁡(Xt+h,Xt),h∈Z, which is independent of t by Strict and weak stationarity for integer-indexed time series.

For a finite data vector x1,…,xn∈R, where n≥1, let xˉn:=1n∑t=1nxt. Its biased sample ACVF is the zero-extended sequence on Z given by γ^n(h):=1n∑t=1n−∣h∣(xt+∣h∣−xˉn)(xt−xˉn),∣h∣<n, and γ^n(h):=0 for ∣h∣≥n. The absolute lag makes γ^n(−h)=γ^n(h).

For comparison, define the pair-count-normalized rescaling γ~n(h):=1n−∣h∣∑t=1n−∣h∣(xt+∣h∣−xˉn)(xt−xˉn),∣h∣<n, and set it to zero for ∣h∣≥n. Its denominator is positive on the stated domain. The names specify the denominator convention; they assert no unbiasedness formula.

CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Ergodic time-series sample means converge almost surely and in L1

Statement

Assume the Axiom of Choice. Let X=(Xt)t∈Z be a real strictly stationary process with E∣X0∣<∞. Put Yk:=Xk+1 for k≥0. If the canonical shift of the one-sided path law of Y is ergodic, then Xˉn:=1n∑t=1nXt⟶E[X0] almost surely and in L1. Here strict stationarity on Z means invariance of every finite-dimensional law under every common integer shift; the one-sided ergodicity convention is that of Stationary process and canonical path shift and Ergodicity relative to an invariant measure.

Facts & Assumptions

Given: AC, a real process X=(Xt)t∈Z whose finite-dimensional laws are invariant under all common integer shifts, E∣X0∣<∞, and ergodicity of the canonical shift on the path law of Yk=Xk+1, k≥0.

[A1]

The Axiom of Choice (AC) asserts that every family of nonempty sets has a choice function (The Axiom of Choice).

[F1]

Strict and weak stationarity for integer-indexed time series: strict stationarity on Z is invariance of all finite-dimensional laws under common integer shifts.

[F2]

Stationary process and canonical path shift: a one-sided strictly stationary process has a canonical path law and left shift.

[F3]

Ergodicity relative to an invariant measure: ergodicity means every strictly invariant event is null or conull for the invariant path law.

[F4]

Birkhoff limit for a stationary integrable process: assuming AC, a real strictly stationary integrable process has almost-sure and L1 convergence of its averages to the conditional-expectation limit; if its canonical shift is ergodic, that limit is its mean.

Proof

Proof technique: restrict the integer-indexed process to positive times and apply the established one-sided Birkhoff result.

1.1F1F2given

Define Yk=Xk+1 for k≥0. For any finite indices 0≤k1<⋯<kr and shift m≥0, [F1] applied to the times k1+1,…,kr+1 gives L(Yk1+m,…,Ykr+m)=L(Yk1,…,Ykr). Thus Y is strictly stationary in the one-sided convention of [F2]. Taking r=1 shows Y0=X1 has the same law as X0, so it is integrable; the canonical shift is ergodic by the given assumption.

2.1A1F3F4step 1.1given∎

By [F3] the assumed ergodicity is exactly ergodicity of the canonical path shift required by [F4]. AC [A1], integrability from step 1.1, strict stationarity from step 1.1, and that ergodic shift satisfy the hypotheses of [F4]. Hence n−1∑k=0n−1Yk converges almost surely and in L1 to E[Y0]=E[X0]. Since this average is exactly n−1∑t=1nXt=Xˉn, the asserted convergence follows. The choice assumption is inherited through [F4]'s conditional-expectation identification; this proof adds no other choice use.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Sample-mean variance and positive semidefinite sample ACVF

Statement

Let X=(Xt)t∈Z be weakly stationary, with mean μ and autocovariance γ, and define Xˉn:=n−1∑t=1nXt for n≥1. Then Var⁡(Xˉn)=1n2∑∣h∣<n(n−∣h∣)γ(h). If ∑h∈Z∣γ(h)∣<∞, then 0≤Var⁡(Xˉn)≤1n∑h∈Z∣γ(h)∣, so E[(Xˉn−μ)2]→0: the sample mean is consistent in L2. No mixing property or central limit theorem is asserted here. For every finite real data vector, the zero-extended biased sample ACVF γ^n of Autocovariance and sample autocovariance has nonnegative Toeplitz quadratic forms.

Facts & Assumptions

Given: A weakly stationary real process X=(Xt)t∈Z with mean μ and autocovariance γ, an integer n≥1, and (for the consistency conclusion) ∑h∈Z∣γ(h)∣<∞. The sample ACVF conclusion applies to every finite real data vector of length n.

[F1]

Strict and weak stationarity for integer-indexed time series: each Xt has finite second moment, E[Xt]=μ is constant, and γ(h)=Cov⁡(Xt+h,Xt) is independent of t.

[F2]

Moments, variance, and covariance on a probability space defines variance and covariance from centered squares and products; Variance and covariance identities for random variables gives covariance bilinearity on finite linear combinations.

[F3]

Linearity, monotonicity, and the modulus bound for expectation: expectation is linear on integrable random variables.

[F4]

Autocovariance and sample autocovariance: after centering a data vector by its sample mean, γ^n(h) is the 1/n lagged product sum, with zero extension for ∣h∣≥n.

Proof

Proof technique: count pairs by their lag, bound the resulting covariance sum, and write the sample Toeplitz form as a sum of squares.

1.1F1F2F3givenalgebra

Each Xt is integrable because 2∣Xt∣≤1+Xt2 and the probability space has total mass one. Repeated application of [F3] gives E[Xˉn]=μ. By [F2] and its cited covariance-bilinearity supplier, Var⁡(Xˉn)=n−2∑s=1n∑t=1nCov⁡(Xs,Xt).

1.2F4givenalgebra

Fix a data vector x1,…,xn, let yt=xt−xˉn for 1≤t≤n, and set yt=0 otherwise. By [F4], for every h∈Z, γ^n(h)=n−1∑t∈Zytyt+h. The sum is finite because y has finite support. Replacing t by t−h and commuting the real factors shows γ^n(−h)=γ^n(h).

2.1F1step 1.1algebra

For s,t∈{1,…,n}, [F1] gives Cov⁡(Xs,Xt)=γ(s−t). For each integer h with ∣h∣<n, exactly n−∣h∣ ordered pairs (s,t) satisfy s−t=h, and no ordered pair has ∣s−t∣≥n. Grouping the finite sum in step 1.1 by h=s−t proves the variance identity.

3.1step 2.1givenalgebra

Under absolute covariance summability, every weight n−∣h∣ in the identity is between 0 and n, so 0≤Var⁡(Xˉn)≤n−2∑∣h∣<n(n−∣h∣)∣γ(h)∣≤n−1∑h∈Z∣γ(h)∣.

4.1step 1.1step 3.1algebra

Step 1.1 gives E[Xˉn]=μ. Therefore E[(Xˉn−μ)2]=Var⁡(Xˉn), and the bound in step 3.1 tends to zero as n→∞. This is precisely L2 consistency for the mean.

5.1step 1.2givenalgebra∎

Let (aj)j∈J be any finitely supported real coefficient family indexed by integers. Expanding the finite sums and using the evenness from step 1.2 gives ∑j,k∈Jajakγ^n(j−k)=n−1∑u∈Z(∑j∈Jajyu+j)2≥0. Only finitely many terms on the right are nonzero, and every summand is a square. Thus every finite Toeplitz quadratic form of γ^n is nonnegative.

5 · Examples, counterexamples and false statements

None yet.

Sources