Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 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.

Continuity alone does not satisfy a Dini modulus

Statement refuted

Assume the Axiom of Countable Choice.

Every continuous one-periodic function automatically satisfies the Dini integrability condition at each point.

Facts & Assumptions

Given: The Axiom of Countable Choice and the Dini criterion on the Fourier page (Dini pointwise convergence criterion for Fourier series).

[L1]

Assuming the Axiom of Countable Choice, if 0δf(x+t)+f(xt)2stdt<, then the Fourier partial sums converge to s at x (Dini pointwise convergence criterion for Fourier series).

Counterexample

technique · direct
1.1

Let d(x,Z):=minmZxm and define the one-periodic function f(x):={0,d(x,Z)=0,1log(e/d(x,Z)),d(x,Z)>0. Because d(x,Z)0 exactly when x approaches an integer and 1/log(e/r)0 as r0, the function f is continuous on T.

givenalgebra
2.1

At x=0 one has f(0)=0 and, for 0<t1/4, d(t,Z)=d(t,Z)=t. Hence f(t)+f(t)2f(0)=2log(e/t). Therefore 01/4f(t)+f(t)2f(0)tdt=201/4dttlog(e/t)=, because the change of variables u=log(e/t) turns the integral into log(4e)du/u. So the hypothesis in [L1] fails at x=0: f is continuous but does not satisfy the Dini condition there.

L1step 1.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

5 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