Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

There is no universal Riemann–Lebesgue decay rate

Statement refuted

There is a positive rate function r:[0,∞)→(0,∞) tending to zero such that every f∈L1(R) satisfies ∣f^(ξ)∣=O(r(∣ξ∣)) as ∣ξ∣→∞.

Facts & Assumptions

Given: The Axiom of Countable Choice (ACω) and any positive r tending to zero.

[F1]

g(x)=e−πx2 has mass one and transform e−πξ2 (Euclidean Gaussian transform with the 2π normalization).

[F2]

Modulation by e2πibx translates the transform by b (Translation, modulation, linear dilation and reflection laws).

[F3]

Dominated convergence applies under one integrable majorant (Dominated convergence).

Counterexample

1.1F1given

Set ξ0=0. For k≥1 let ξk be the least positive integer greater than ξk−1+k for which r(ξk)<2−2k. Such integers exist by the assumed limit. This recursion is explicit and uses no choice selection. The series f(x)=∑k≥12−ke2πiξkxg(x) converges absolutely at each x with modulus at most g(x); its measurable limit belongs to L1 by F1.

2.1F1F2F3step 1.1∎

At each frequency, F3 applied to the partial sums times the unit-modulus Fourier factor, dominated by g, gives f^(ξ)=∑k≥12−ke−π(ξ−ξk)2 by F1 and F2. All summands are nonnegative. Thus ∣f^(ξk)∣≥2−k and ∣f^(ξk)∣/r(ξk)>2k→∞, while ξk→∞. This refutes every proposed rate, even allowing an f-dependent big-O constant. Countable choice is inherited only from the Gaussian and modulation suppliers. This explicit construction is local and is not attributed to a source theorem.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

34 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