Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-02
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.

The Hilbert transform is an L2 isometry and squares to minus the identity

Statement

Assume Countable Choice, use the e−2πixξ convention, and let m(ξ)=−isgn⁡(ξ) with sgn⁡(0)=0. The Hilbert transform of The Hilbert transform is the tempered convolution with pv(1/(pi x)) and has signum Fourier multiplier defines, on Schwartz functions, the operator Hf=(W∗f) with F(Hf)=mf^. Then H extends uniquely to a bounded operator on L2(R;C), still denoted H, and for every f∈L2(R;C),

∥Hf∥2=∥f∥2,H2f=−f.

In particular the single point ξ=0, where m vanishes, is a Lebesgue-null set and creates no zero-mode exception. Nonzero constant functions are not in L2(R), so there is no constant mode in the domain to transform.

Facts & Assumptions

Given: Countable Choice and the multiplier m(ξ)=−isgn⁡(ξ) of the Schwartz Hilbert transform.

[F1]

For Schwartz f the principal-value Hilbert transform Hf=W∗f satisfies F(Hf)=−isgn⁡(ξ)f^(ξ) as tempered distributions. The Hilbert transform is the tempered convolution with pv(1/(pi x)) and has signum Fourier multiplier

[F2]

A measurable multiplier m with finite essential supremum defines the bounded operator Tm=F2−1MmF2 on L2; its Schwartz-core action extends uniquely to L2, it depends only on the almost-everywhere class of m, and ∥Tm∥=∥m∥∞. Exact L2 Fourier multiplier norm

[F3]

Plancherel: F2 is a surjective linear isometry of L2, so ∥F2g∥2=∥g∥2 and F2−1(−g)=−F2−1g and F2−1(−F2g)=−g. Plancherel theorem

[F4]

Fourier transformation is injective on tempered distributions. Fourier transform is a topological automorphism of tempered distributions

Proof

technique · direct
1.1givenalgebra

The symbol satisfies ∣m(ξ)∣=1 for every ξ≠0, m(ξ)2=−1 for every ξ≠0, and the exceptional set is the Lebesgue-null singleton {0}.

2.1step 1.1F1F2F4

For Schwartz f, [F2] identifies Tmf with an L2 class whose regular tempered distribution has Fourier transform mf^. By [F1], the tempered distribution Hf has the same transform. Injectivity [F4] gives equality of these distributions, so Hf is represented by the L2 class Tmf. Thus no L2 membership of the principal value is assumed in this identification.

3.1step 1.1step 2.1F2F3

By [F2] the Schwartz-core action of Tm extends uniquely to a bounded operator on L2; by 2.1 the Schwartz action of H is that core action, so H=Tm on L2, and for g∈L2, ∥Hg∥2=∥m F2g∥2=∥F2g∥2=∥g∥2 because ∣m∣=1 almost everywhere by 1.1.

4.1step 1.1step 2.1F2F3∎

Likewise, on the Schwartz core H2f=Tm2f=F2−1(m2F2f)=F2−1(−F2f)=−f by 1.1 and [F3]; both H2 and −I are bounded on L2 and agree on the dense Schwartz core, so H2=−I on all of L2.

Depends on

Used by

Dependency tree · two levels

38 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