Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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.

Fourier inversion on Schwartz space

Statement

Assume countable choice. For every fS(Rn) and every xRn, f(x)=Rnf^(ξ)e2πixξdξ. The integral is absolutely convergent.

Facts & Assumptions

[F1]

The Fourier transform preserves Schwartz space (Fourier transform acts continuously on Schwartz space).

[F2]

Schwartz functions are integrable (Schwartz derivatives are integrable).

[F3]

If f,f^L1, inversion gives its value at every Lebesgue point (L1 Fourier inversion with an integrable transform).

Proof

technique · direct
1.1

By [F1] and [F2], both f and f^ are integrable, and the displayed integral is absolutely convergent since the exponential has modulus one. Fix x. Smoothness implies continuity, so for every ε>0 some δ>0 gives f(xy)f(x)<ε for y<δ. Averaging over any ball of radius 0<r<δ bounds its mean oscillation by ε. Thus x is a Lebesgue point with specified value f(x).

F1F2given
2.1

Apply [F3] at this arbitrary point. This proves the formula everywhere, inheriting exactly the countable-choice assumption of these three suppliers. The proof never exchanges an undamped double Fourier integral.

step 1.1F3

Depends on

Used by

Dependency tree · two levels

22 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