Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-09-23 (gpt-6-sol)
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.

Cesaro and Abel means of a Fourier series

Definition

The continuous kernel Pr below is defined by its uniformly convergent series without a choice premise. For the means of an arbitrary integrable function f, assume the Axiom of Countable Choice, as in Period-one Fourier coefficients, partial sums, and convolution on the torus, and let f be integrable on one period. For a Riemann-integrable one-periodic representative, the coefficient and kernel integrals in the formulas below may instead be ordinary Riemann integrals; these formulas then need no choice premise and agree with their Lebesgue versions when Countable Choice is assumed.

For N≥0, the Cesaro mean (or Fejer mean) of order N of the Fourier series of f is

σNf(x):=1N+1∑j=0NSjf(x).

Because Dirichlet and Fejer kernels defines FN(t)=1N+1∑j=0NDj(t), and Period-one Fourier coefficients, partial sums, and convolution on the torus defines convolution and partial sums, one has

σNf=f∗FN.

For 0≤r<1, the series

Pr(t):=∑k∈Zr∣k∣ek(t)

converges absolutely and uniformly on T, because ∑k∈Z∣r∣k∣ek(t)∣=∑k∈Zr∣k∣<∞. The Abel mean of the Fourier series of f is

Arf(x):=∑k∈Zr∣k∣f^(k)ek(x).

Because ∣f^(k)∣≤∫01∣f(t)∣ dt, this series also converges absolutely and uniformly in x. Therefore termwise integration against the absolutely convergent kernel series gives

Arf=f∗Pr.

Depends on

Used by

Dependency tree · two levels

9 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