Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

Finite sum of Riesz squares in L2

Statement

Assume Countable Choice and let n≥1. Let R1,…,Rn be the Riesz transforms of Riesz transforms on Euclidean space, the L2(Rn;C) operators Rj=F2−1MmjF2 with symbols

mj(ξ)={−i ξj/∣ξ∣,ξ≠0,0,ξ=0.

Then:

  1. ∑j=1nRj2f=−f for every f∈L2(Rn;C), the identity holding as L2 classes, with the explicit finite symbol computation ∑j=1nmj(ξ)2=−1 for every ξ≠0;
  2. at n=1 the operator R1 is the line Hilbert transform H of The Hilbert transform is an L2 isometry and squares to minus the identity, so the n=1 case of assertion 1 is exactly H2=−I;
  3. the assigned value mj(0)=0 is immaterial: it is a value on the Lebesgue-null singleton {0}, and the multiplier operator depends only on the almost-everywhere class of its symbol. Unlike the periodic conjugate operator, no zero-mode exception arises here.

This is an L2 statement only; no Lp bound for p≠2 is asserted.

Facts & Assumptions

Given: Countable Choice, the dimension n≥1, and the Euclidean L2 conventions of Complex Lp classes and Euclidean test-function conventions.

[F1]

For 1≤j≤n the j-th Riesz transform is Rj=F2−1MmjF2 with mj(ξ)=−iξj/∣ξ∣ for ξ≠0 and mj(0)=0; the symbol is measurable with ∣mj(ξ)∣≤1 everywhere, Rj is well-defined and bounded on L2 with ∥Rj∥≤1, the assigned value at the origin has no effect on the operator, and the definition asserts only the multiplier description. Riesz transforms on Euclidean space

[F2]

A measurable symbol m with finite essential supremum defines Tm=F2−1MmF2, a bounded operator with ∥Tm∥=∥m∥∞, and the operator depends only on the almost-everywhere class of m: values on Lebesgue-null sets, including the single point {0}, do not affect the operator or its norm. Exact L2 Fourier multiplier norm

[F3]

For these Riesz transforms ∥Rjf∥2≤∥f∥2 and ∑j=1nRj2f=−f for every f∈L2(Rn;C), as L2 statements only. Riesz transforms are L2 contractions and square to minus the identity in sum

[F4]

The line Hilbert transform has Schwartz-core symbol −isgn⁡(ξ), extends uniquely to a bounded operator H on L2(R;C) with ∥Hf∥2=∥f∥2 and H2f=−f; the point ξ=0, where the symbol vanishes, is Lebesgue null and creates no zero-mode exception. The Hilbert transform is an L2 isometry and squares to minus the identity

[F5]

Plancherel: F2 is a surjective complex-linear isometry of L2(Rn;C), so F2−1 is complex-linear and F2−1(−g)=−F2−1g, while F2−1(−F2g)=−g for every class g. Plancherel theorem

Proof

technique · direct
1.1F1algebra

For ξ≠0 and every j one has mj(ξ)2=(−iξj/∣ξ∣)2=−ξj2/∣ξ∣2, so the finite sum is s(ξ):=∑j=1nmj(ξ)2=−∑j=1nξj2/∣ξ∣2=−1, while s(0)=∑jmj(0)2=0. Also each mj is measurable, and ∣mj(ξ)∣=∣ξj∣/∣ξ∣≤1 for ξ≠0 while mj(0)=0, so ∣mj∣≤1 everywhere.

2.1step 1.1F2

The symbol s=∑j=1nmj2 of step 1.1 is measurable and satisfies ∣s(ξ)∣=1 for ξ≠0 and s(0)=0, hence ∣s∣≤1 everywhere; since s agrees with the constant function −1 on the complement of the singleton {0}, which is Lebesgue null, s and −1 have the same almost-everywhere class.

2.2step 1.1F1F2F5

Since Rj=F2−1MmjF2 by [F1], the composition of the two bounded operators F2 and F2−1 gives Rj2=F2−1MmjMmjF2=F2−1Mmj2F2=Tmj2 in the notation of [F2], and summing the finitely many bounded operators gives ∑j=1nRj2=F2−1MsF2=Ts by the complex-linearity of F2 and F2−1 in [F1] and [F5].

2.3step 1.1F1F2F4

At n=1 one has ∣ξ∣=ξ2=∣ξ1∣, so for ξ≠0 the symbol of [F1] is m1(ξ)=−iξ/∣ξ∣=−isgn⁡(ξ), while m1(0)=0=−isgn⁡(0) as well; hence m1 is exactly the signum symbol of [F4] at every point, and by [F2] the operators agree: R1=Tm1=T−isgn⁡=H.

3.1step 2.1step 2.2F2F3F5

By [F2] the operator Ts depends only on the almost-everywhere class of s, which by step 2.1 is the class of the constant −1; so Ts=T−1, and for f∈L2(Rn;C) the isometry and linearity of [F5] give T−1f=F2−1(−F2f)=−F2−1F2f=−f. Combined with step 2.2 this gives ∑j=1nRj2f=−f for every f∈L2(Rn;C), which is assertion 1 and agrees with the identity recorded in [F3].

4.1step 2.3step 3.1F4

For n=1, step 2.3 identifies R1 with H, so R12=H2=−I on L2(R;C) by [F4]; this is exactly the case n=1 of the sum identity proved in step 3.1, and it exhibits assertion 2.

5.1step 2.1step 4.1F2F3∎

Finally, the assignment mj(0)=0 is a value on the Lebesgue-null singleton {0}, and the multiplier operator depends only on the almost-everywhere class of its symbol by [F2]; changing that single value therefore changes neither Rj nor any identity above. This is the announced contrast with the periodic conjugate operator, whose multiplier is defined on the frequency-zero mode of a finite-measure circle: on Euclidean L2 there is no exceptional constant mode attached to the null set {0}, so assertion 3 holds.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

44 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