Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04
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.

Piecewise C^1 Fourier series converges to midpoint values

Statement

Assume the Axiom of Countable Choice.

Let f:R→R be one-periodic. Assume there is a partition 0=x0<x1<⋯<xm=1 such that, for each j, the restriction of f to (xj−1,xj) extends to a C1 function on [xj−1,xj]. Then for every x∈R,

SNf(x)→f(x+)+f(x−)2as N→∞.

Facts & Assumptions

Given: The Axiom of Countable Choice, a one-periodic real function f and a partition 0=x0<⋯<xm=1 such that each restriction f∣(xj−1,xj) extends to a C1 function on [xj−1,xj].

[L1]

Assuming the Axiom of Countable Choice, a one-periodic bounded-variation function satisfies the Dirichlet-Jordan convergence theorem (Dirichlet-Jordan pointwise convergence).

Proof

technique · direct
1.1L2givenalgebra

For each j, let fj denote the C1 extension of f∣(xj−1,xj) to [xj−1,xj]. By [L2], each fj has bounded variation on its interval. Summing those finitely many variations and adding the finitely many endpoint jumps shows that the one-period representative of f has bounded variation on [0,1], including the periodic seam between 1− and 0+.

2.1L1step 1.1∎

Apply [L1] to that one-period bounded-variation representative. It yields SNf(x)→f(x+)+f(x−)2 for every x∈R, which is the claimed midpoint-value convergence.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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