Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05
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 means converge to midpoint values at jumps

Statement

Let f:RC be one-periodic with f[0,1]L1([0,1]). Assume the one-sided limits f(x) and f(x+) exist at some point x. Then

σNf(x)f(x)+f(x+)2(N).

Facts & Assumptions

Given: A one-periodic function f with f[0,1]L1([0,1]), a point xR, and existing one-sided limits f(x) and f(x+).

[L1]

The Cesaro means satisfy σNf=fFN (Cesaro and Abel means of a Fourier series).

[L2]

The Fejer kernels are nonnegative, have integral 1, and satisfy the tail estimate in The Fejer kernel is a positive approximate identity.

Proof

technique · direct
1.1

Put m:=(f(x)+f(x+))/2. Using [L1], split the integral over [0,1] at 1/2 and substitute u=1t on [1/2,1]. Because FN(1u)=FN(u), this gives σNf(x)m=01/2(f(xt)f(x)+f(x+t)f(x+))FN(t)dt. Also 201/2FN(t)dt=01FN(t)dt=1.

L1L2algebra
2.1

Let ε>0. Choose δ(0,1/2] so that f(xt)f(x)<ε,f(x+t)f(x+)<ε(0<t<δ). Then the interval (0,δ) contributes at most 2ε01/2FN(t)dt=ε by step 1.1. The interval [δ,1/2] contributes at most (01f(y)dy+01f(y)dy+f(x)+f(x+)2)supt[δ,1δ]FN(t), which tends to 0 by [L2].

L2step 1.1choosealgebra
3.1

Choose N0 so large that the far contribution in step 2.1 is <ε for NN0. Then σNf(x)m<2ε(NN0). Since ε was arbitrary, σNf(x)m.

L2step 2.1choosealgebra

Depends on

Used by

Dependency tree · two levels

4 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