Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Expected periodogram and smoothed spectral-density bias

Statement

Let X=(Xt)t∈Z be a real weakly stationary process with known mean μ and autocovariance γ. For every n≥1 and λ∈T, its known-mean periodogram from Spectral measures and the known-mean periodogram satisfies E[In(λ)]=12π∑∣h∣<n(1−∣h∣n)γ(h)e−ihλ. If F is any spectral measure for X, this is equivalently the finite-sample Fejér convolution E[In(λ)]=∫TΦn(λ−θ) F(dθ). If F(dθ)=f(θ) dθ, the right side is ∫TΦn(λ−θ)f(θ) dθ.

The finite expectation identity and the convolution identity for a supplied spectral measure use no choice principle. Assume Countable Choice for the angular Lebesgue measure and the smoothing conclusion below, as required by the measure convention in Spectral measures and the known-mean periodogram.

For the smoothing definition in Spectral measures and the known-mean periodogram, suppose F(dθ)=f(θ) dθ, where f∈L1(T,dλ) is continuous at λ0. Let K be as defined there and let bn>0 satisfy bn→0 and nbn→∞. Then the weights are defined for all sufficiently large n, and E[f~n(λ0)]⟶f(λ0). This is a bias limit for the smoothed estimator; it asserts no variance consistency, raw-periodogram consistency, central limit theorem, or interval coverage.

Facts & Assumptions

Given: A real weakly stationary process X=(Xt)t∈Z with known mean μ and autocovariance γ. For the spectral-measure identity assume a finite positive Radon measure F satisfies γ(h)=∫TeihθF(dθ). For the smoothing conclusion also assume Countable Choice, F(dθ)=f(θ)dθ, with f integrable and continuous at λ0, and bn>0, bn→0, nbn→∞.

[F1]

Spectral measures and the known-mean periodogram: the known-mean periodogram is In(λ)=(2πn)−1∣∑t=1n(Xt−μ)e−itλ∣2.

[F2]

Strict and weak stationarity for integer-indexed time series and Autocovariance and sample autocovariance: each Xt has finite second moment, the mean is μ, and covariance depends only on the lag with γ(h)=Cov⁡(Xt+h,Xt).

[F3]

Moments, variance, and covariance on a probability space: covariance of square-integrable real variables is the expectation of their centered product.

[F4]

Spectral measures and the known-mean periodogram: a supplied spectral measure has Fourier coefficients γ(h), and F=f dλ means f is a spectral density.

[F5]

Spectral measures and the known-mean periodogram: the normalized finite-sample Fejér kernel is Φn(x)=(2πn)−1∣∑t=1ne−itx∣2.

[F6]

Spectral measures and the known-mean periodogram: the periodized kernel and the finite normalized Fourier-grid weights define f~n(λ0) when their denominator is positive.

[F7]

Integer exponentials are orthogonal for angular Lebesgue measure: under the unnormalized angular measure, ∫Teikx dx=2π for k=0 and 0 for nonzero integer k.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice supplies the angular Lebesgue measure and orthogonality fact [F7], and is used only in the density/smoothing branch.

[F8]

Linearity, monotonicity, and the modulus bound for expectation: expectation is linear for finite sums of integrable random variables and deterministic weights.

[F10]

Signs, monotonicity intervals, and ranges of sine and cosine and The derivatives of sine and cosine are cosine and minus sine: for 0<δ<π and δ≤∣x∣≤π, ∣sin⁡(x/2)∣≥sin⁡(δ/2)>0.

[F11]

Spectral measures and the known-mean periodogram: circular angular distance is dT(λ,θ)=min⁡k∈Z∣λ−θ+2πk∣.

Proof

Proof technique: Expand the finite square exactly, then use the nonnegative Fejér kernels as an approximate identity on the circle.

1.1F1F2F3givenalgebra

Expand the finite squared modulus in In(λ). By [F2] and [F3], E[(Xt−μ)(Xs−μ)]=γ(t−s), so E[In(λ)]=12πn∑t=1n∑s=1nγ(t−s)e−i(t−s)λ. All sums are finite and all terms integrable.

1.2F6givenchoose

Since K is continuous and K(0)>0, it is positive on some interval [−r,r] with r>0. The nearest point of the Fourier grid is within π/n of λ0; because nbn→∞, eventually π/(nbn)<r, so the denominator defining the weights is positive. Every positive weight is supported at a grid point within circular distance Rbn of λ0, where [−R,R] contains the support of K; this distance tends to zero.

2.1step 1.1algebra

For each h with ∣h∣<n, exactly n−∣h∣ ordered pairs (t,s)∈{1,…,n}2 have t−s=h. Grouping the sum in step 1.1 by h gives the asserted finite Fourier sum.

2.2F4F5step 1.1algebra

If a spectral measure F is supplied, substitute γ(t−s)=∫Tei(t−s)θF(dθ) into the finite double sum and interchange the finite sum and integral. The resulting integrand is 12πn∣∑t=1ne−it(λ−θ)∣2=Φn(λ−θ), which proves the Fejér convolution formula. When F=f dθ, substitute that density in the same integral.

3.1A1F4F5F7step 2.2algebra

The kernel Φn is nonnegative. Expanding its finite square and applying [F7] to each term gives ∫TΦn(x) dx=1. When F=f dλ, steps 2.2 and [F4] also give gn(ω):=E[In(ω)]=∫TΦn(ω−θ)f(θ) dθ as a normalized Fejér average of f.

4.1A1F5F9F10F11givenstep 3.1algebra

For 0<δ<π, if dT(x,0)≥δ, choose its representative in [−π,π], so δ≤∣x∣≤π by [F11]. Put r=e−ix. Finite cancellation gives (1−r)∑t=1nrt=r(1−rn). By [F9], ∣1−r∣=2∣sin⁡(x/2)∣>0 by [F10], and ∣1−rn∣=2∣sin⁡(nx/2)∣≤2. Therefore Φn(x)=12πn∣sin⁡(nx/2)sin⁡(x/2)∣2≤12πnsin⁡2(δ/2). Given ε>0, continuity of f at λ0 gives a positive radius; shrink it so that 0<2δ<π and ∣f(θ)−f(λ0)∣<ε when dT(θ,λ0)<2δ. If dT(ω,λ0)<δ, split the integral for gn(ω)−f(λ0) into that neighborhood and its complement. The first part has modulus at most ε because Φn has integral one; on the complement dT(ω,θ)≥δ: choose minimizing integers k1,k2 for dT(θ,ω) and dT(ω,λ0). Then dT(θ,λ0)≤∣θ−λ0+2π(k1+k2)∣≤dT(θ,ω)+dT(ω,λ0), by [F11] and the real triangle inequality. Since the first term is at least 2δ and the last term is less than δ, the displayed kernel bound makes the second part at most ∥f∥1+2π∣f(λ0)∣2πnsin⁡2(δ/2), which tends to zero uniformly for all such ω. Hence gn(ω) tends uniformly to f(λ0) as ω ranges over any neighborhoods of λ0 whose radii tend to zero.

5.1F8step 4.1step 1.2givenalgebra∎

For all sufficiently large n, the weights are nonnegative and sum to one, and every grid point receiving positive weight lies in a shrinking neighborhood of λ0. Finite-sum linearity of expectation [F8] therefore gives E[f~n(λ0)]=∑j=0n−1wn,j(λ0)gn(λj,n)⟶f(λ0) by the uniform local convergence in step 4.1.

Depends on

Used by

Dependency tree · two levels

77 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