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.

Fejer completeness: a continuous one-periodic function with all integrals against the characters vanishing is zero

Statement

Let h:R→C be one-periodic, meaning h(t+1)=h(t) for all real t, and continuous, meaning that both real functions Re⁡h,Im⁡h:R→R satisfy Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) at a limit point, and continuity at an isolated point and suppose that

∫01h(t) ek(−t) dt=0for every k∈Z,

All integrals here are componentwise Riemann integrals: for continuous p=p1+ip2, ∫abp:=∫abp1+i∫abp2, with the real oriented convention of The integral with oriented limits: ∫aaf:=0 and ∫baf:=−∫abf; both integrals exist by A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion. Here ek(t):=e2πikt (The complex exponential by its power series). Then h=0 on R.

Facts & Assumptions

Given: The continuous one-periodic h and the vanishing of all the displayed integrals.

[F1]

The Fejer kernel is FN(t)=1N+1∣∑j=0Nej(t)∣2 and equals ∑∣k∣≤N(1−∣k∣N+1)ek(t); it is nonnegative with ∫01FN=1 (The Fejer kernel is a positive approximate identity, Cesaro and Abel means of a Fourier series).

[F2]

The Fejer means σNh=h∗FN converge to h uniformly: sup⁡x∣σNh(x)−h(x)∣→0 (Cesaro and Abel means of a Fourier series, Fejer means converge uniformly for continuous periodic functions).

[F3]

For continuous one-periodic complex φ, affine substitution applied to each real component gives ∫01φ(x−t) dt=∫x−1xφ(u) du=∫01φ(u) du. For the second equality, write x=m+r with m∈Z, 0≤r<1; translate by m, split [r−1,r] at 0, and translate [r−1,0] by 1 to [r,1], using periodicity and additivity (Substitution: if φ is differentiable on [c,d] with φ′ integrable and f is continuous on an interval containing φ([c,d]), then ∫φ(c)φ(d)f=∫cd(f∘φ) φ′, The integral with oriented limits: ∫aaf:=0 and ∫baf:=−∫abf, For a<c<b: f is integrable on [a,b] if and only if it is integrable on [a,c] and on [c,b], and then ∫abf=∫acf+∫cbf; with the oriented form for arbitrary a,b,c).

[F4]

Character periodicity: exp⁡(iπ)=−1 by exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0, hence exp⁡(2πi)=1 by exponential addition. Iteration gives exp⁡(2πik)=1 for k≥0; for k<0, exp⁡(2πik)exp⁡(−2πik)=exp⁡(0)=1 gives the same conclusion. Thus ek(t+1)=ek(t). Exponential addition: ek(x−t)=ek(x)ek(−t)=ek(x)e−k(t) (exp⁡(z+w)=exp⁡z exp⁡w, and the complex exponential extends the real exponential, The complex exponential by its power series).

Proof

technique · direct; expand the Fejer convolution with the finite trigonometric polynomial kernel and use the vanishing integrals
1.1givenF1F5algebra

Fix N≥0. Since σNh=h∗FN=∫01h(x−t)FN(t)dt and FN is the finite sum of [F1], [F5] gives σNh(x)=∑∣k∣≤N(1−∣k∣N+1)∫01h(x−t)ek(t) dt.

1.2givenF3F4algebra

For each k, substitute t=x−u (the integrand h(x−t)ek(t) is one-periodic in t): by [F3] and [F4], ∫01h(x−t)ek(t) dt=∫01h(u)ek(x−u) du=ek(x)∫01h(u)e−k(u) du=0, the last equality by the hypothesis of the lemma.

2.1step 1.1step 1.2F2algebra∎

Steps 1.1 and 1.2 give σNh(x)=0 for every x∈R and every N≥0. By [F2], h(x)=lim⁡NσNh(x)=0 for every x. This proves the lemma.

Remarks

  • All functions here are continuous on the compact torus, so every integral displayed is an ordinary integral of a continuous periodic function, and the instances of the Fourier-mean machinery used are the choice-free ones noted in Cesaro and Abel means of a Fourier series; no selection principle is invoked in the argument as applied to continuous h.

Depends on

Dependency tree · 2 levels

Sources