Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Spectral measures and the known-mean periodogram

Definition

Assume Countable Choice (The Axiom of Countable Choice (ACω)) for the angular Lebesgue measure clause below; under it λ1 is a measure and intervals have their usual lengths (Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume, A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included).

Let T:={z∈C:∣z∣=1} be the multiplicative unit circle with its subspace topology from C (The multiplicative unit circle is a compact metrizable topological abelian group), identified with angular frequencies by z=eiλ. Write dλ for the finite angular Lebesgue Borel measure obtained from ordinary Lebesgue measure on [−π,π); thus dλ(T)=2π, and the endpoints −π and π denote the same point. The characters of discrete additive Z are h↦eihλ by The Pontryagin dual of the discrete integers is the circle.

For angular representatives λ,θ∈R, define their circular distance by dT(λ,θ):=min⁡k∈Z∣λ−θ+2πk∣. The minimum exists because the displayed absolute values tend to infinity with ∣k∣, and changing either representative by 2π leaves it unchanged.

Precisely, for Borel B⊆T put dλ(B):=λ1{θ∈[−π,π):eiθ∈B}. The map θ↦eiθ is continuous by The complex exponential is entire and its complex derivative is itself and Complex differentiability at a point implies continuity there, so the preimage is Borel by A continuous map has Borel preimages of Borel sets. Preimages preserve disjoint unions, so this is a finite Borel measure under the stated Countable Choice premise. Integrating a Borel function of the circle angle means integrating its periodic lift over this half-open interval.

Let X=(Xt)t∈Z be a real weakly stationary process with mean μ and autocovariance γ(h)=Cov⁡(Xt+h,Xt) (Strict and weak stationarity for integer-indexed time series, Autocovariance and sample autocovariance). A spectral measure for X is a finite positive Radon Borel measure F on T (Radon measure on an LCH space) satisfying γ(h)=∫Teihλ F(dλ)(h∈Z). Putting h=0 gives F(T)=γ(0). A spectral density is a nonnegative measurable function f with F(B)=∫Bf(λ) dλ for every Borel set B⊆T; it exists only when F is absolutely continuous with respect to dλ and is unique up to dλ-null sets.

For a known mean μ and integer n≥1, the known-mean periodogram is the random function In(λ):=12πn∣∑t=1n(Xt−μ)e−itλ∣2,λ∈T. The centering uses the population mean, not the sample mean. The finite sum is square-integrable, so In(λ) has finite expectation: for Yt=Xt−μ, the pointwise inequality ∣∑t=1nYte−itλ∣2≤n∑t=1n∣Yt∣2 bounds its expectation by n∑t=1nE[Yt2]<∞ (Moments, variance, and covariance on a probability space).

Define the normalized finite-sample Fejér kernel Φn(x):=12πn∣∑t=1ne−itx∣2,x∈T.

For smoothing, let K:R→[0,∞) be continuous with compact support, ∫RK(u) du=1, and K(0)>0. For bandwidth b>0, periodize it on the circle by Kb(x):=∑k∈Z1bK ⁣(x+2πkb). Compact support makes this a finite sum at each x, and changing variables over the intervals that tile R gives ∫TKb(x) dλ(x)=1. Fix a sequence of bandwidths (bn)n≥1 with bn>0. For the Fourier grid λj,n=2πj/n (0≤j<n) and target λ0∈T, when the denominator is positive define wn,j(λ0):=Kbn(λ0−λj,n)∑ℓ=0n−1Kbn(λ0−λℓ,n),f~n(λ0):=∑j=0n−1wn,j(λ0)In(λj,n). The weights are nonnegative and sum to one.

Remarks

The finite-sum bound used in the finite-expectation paragraph follows directly. Put Zt:=Yte−itλ. Since ∣e−itλ∣=1 by exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0, ∑t=1n∣Zt∣2=∑t=1n∣Yt∣2. Expanding the squares gives n∑t=1n∣Zt∣2−∣∑t=1nZt∣2=∑1≤s<t≤n∣Zs−Zt∣2≥0, so ∣∑t=1nYte−itλ∣2≤n∑t=1n∣Yt∣2.

Depends on

Used by

Dependency tree · two levels

108 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