Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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 and Riesz transforms map L-infinity to BMO

Statement

Assume Countable Choice. The Hilbert transform H on R and the Riesz transforms R1,…,Rn on Rn extend to bounded maps L∞(Rd)→BMO(Rd)/C, where d=1 for T=H and d=n for T=Rj: for every b∈L∞(Rd) the class of Tb is well defined modulo constants, agrees with the L2 action of T when b∈L2, and satisfies ∥Tb∥BMO≤Cd∥b∥L∞ with a dimensional constant.

Facts & Assumptions

Given: Countable Choice, the Hilbert transform H and the Riesz transforms R1,…,Rn, and a bounded function b∈L∞(Rd), with d=1 for H and d=n for Rj.

[F1]

The Hilbert transform and each Riesz transform are Calderon-Zygmund operators whose kernels are standard 1-Holder, with L2 operator norm at most 1; the Hilbert transform is the case n=1 with kernel 1/(πx) and the Riesz transforms have kernels cnxj/∣x∣n+1 (The Hilbert and Riesz transforms are Calderon-Zygmund operators).

[F2]

Every Calderon-Zygmund operator with a standard δ-Holder kernel and L2 norm at most 1 maps L∞ into BMO(Rn)/C: the class of Tb is well defined modulo constants, agrees with the L2 action when b∈L2, and has ∥Tb∥BMO≤Cn,δ(A2′+1)∥b∥L∞ (Calderon-Zygmund operators map L-infinity to BMO).

Proof

technique · direct
1.1F1

The hypotheses of [F2] are satisfied with δ=1: [F1] supplies the Calderon-Zygmund operator, the standard 1-Holder kernel with its constant, and the L2 bound by 1; for the Hilbert transform this is the case n=1 and for each Riesz transform the case of the corresponding kernel cnxj/∣x∣n+1.

2.1step 1.1F2

Applying [F2] to the Hilbert transform and to each Riesz transform gives, for every b∈L∞(Rd) in the corresponding dimension, a well-defined class Tb modulo constants with ∥Tb∥BMO≤Cd,1(A2′+1)∥b∥L∞, and when b∈L2 that class is the class of the L2 function Tb; the constants A2′ and hence Cd,1(A2′+1) depend only on d.

3.1step 2.1∎

The assertions of the statement are exactly those of step 2.1 for T=H and T=Rj, with Cd:=Cd,1(A2′+1). Countable Choice is inherited from both [F1] and [F2], including the endpoint gluing and L2 consistency argument.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

33 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