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

Fejer means converge to midpoint values at jumps

Statement

Assume the Axiom of Countable Choice. Let f:R→C 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: Countable Choice, a one-periodic function f with f∣[0,1]∈L1([0,1]), a point x∈R, and existing one-sided limits f(x−) and f(x+).

[L1]

The Cesaro means satisfy σNf=f∗FN (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.1L1L2algebra

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

2.1L2step 1.1choosealgebra

Let ε>0. Choose δ∈(0,1/2] so that ∣f(x−t)−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 (∫01∣f(y)∣ dy+∫01∣f(y)∣ dy+∣f(x−)∣+∣f(x+)∣2)sup⁡t∈[δ,1−δ]FN(t), which tends to 0 by [L2].

3.1L2step 2.1choosealgebra∎

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

Depends on

Used by

Nothing in the library uses this result yet.

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