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 tending to zero such that every satisfies as .
Facts & Assumptions
Given: The Axiom of Countable Choice () and any positive r tending to zero.
has mass one and transform (Euclidean Gaussian transform with the 2π normalization).
Modulation by translates the transform by b (Translation, modulation, linear dilation and reflection laws).
Dominated convergence applies under one integrable majorant (Dominated convergence).
Counterexample
Set . For let be the least positive integer greater than for which . Such integers exist by the assumed limit. This recursion is explicit and uses no choice selection. The series converges absolutely at each x with modulus at most g(x); its measurable limit belongs to by F1.
At each frequency, F3 applied to the partial sums times the unit-modulus Fourier factor, dominated by g, gives by F1 and F2. All summands are nonnegative. Thus and , while . 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
- Gerald Teschl, Topics in Real and Functional Analysis (2017) (standard reference, not scraped)