Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Calderon-Zygmund operators map L-infinity to BMO

Statement

Assume Countable Choice. Let T be a Calderon-Zygmund operator with kernel k in the sense of Calderón–Zygmund kernels and their associated operators: k satisfies the annular size bound with constant A1 and Hormander's condition with constant A2, T is L2-bounded with norm B and satisfies the off-support representation (3) of that definition. Assume moreover that k is standard δ-Holder with constant A2′ for some 0<δ≤1 (Standard (Hölder) Calderón–Zygmund kernels). Fix λn:=1+4n, chosen so that ∣a−y∣≥2n ℓ(Q)≥2∣x−a∣ whenever x,a∈Q and y∉λnQ. For a cube Q and a point a∈Q put, for x∈Q, (Tb)Q(x):=T(b1λnQ)(x)+∫Rn∖λnQ[k(x−y)−k(a−y)]b(y) dy, where λnQ is the concentric cube with side length λnℓ(Q) and b∈L∞(Rn). Then: (i) the tail integral converges absolutely for every x∈Q; (ii) for nested cubes Q⊆R the difference (Tb)Q−(Tb)R is almost everywhere constant on Q, so the localisations define a class Tb∈BMO(Rn)/C; (iii) ∥Tb∥BMO≤Cn,δ(A2′+B)∥b∥L∞; and (iv) if in addition b∈L2(Rn), then the class Tb is the class of the L2 function Tb defined by the operator, modulo constants.

Facts & Assumptions

Given: Countable Choice, a Calderon-Zygmund operator T with kernel k and constants A1,A2,B, standard δ-Holder with constant A2′, a bounded function b∈L∞(Rn), cubes Q⊆R and points x,a∈Q.

[F1]

The kernel satisfies sup⁡R>0∫R≤∣x∣≤2R∣k(x)∣ dx≤A1 and sup⁡v≠0∫∣z∣≥2∣v∣∣k(z−v)−k(z)∣ dz≤A2; T is L2-bounded with norm B and, for every compactly supported f∈L2, Tf(x)=∫Rnk(x−y)f(y) dy for almost every x∉supp⁡f, the integral converging absolutely (Calderón–Zygmund kernels and their associated operators).

[F2]

The kernel is standard δ-Holder with constant A2′: ∣k(z−v)−k(z)∣≤A2′∣v∣δ∣z∣−n−δ whenever ∣z∣≥2∣v∣>0 (Standard (Hölder) Calderón–Zygmund kernels).

[F3]

A cube of side length ℓ has diameter at most n ℓ: its points lie in an axis-parallel box with side lengths ℓ, so coordinatewise ∣xi−ai∣≤ℓ and ∣x−a∣≤n ℓ; the concentric cube of side λℓ has volume λn times the volume, and containment of cubes is preserved under concentric dilation (Axis-parallel rectangles in Rm and their volume).

[F4]

The Cauchy-Schwarz inequality gives ∫E∣fg∣≤∥f∥L2(E)∥g∥L2(E) on a finite-measure set E, and L2 is the quotient of measurable functions modulo almost-everywhere equality, with ∥f∥2=(∫∣f∣2)1/2 (Cauchy-Schwarz inequality for L2, The space Lp(μ) as the quotient by null functions).

[F5]

Polar coordinates: for Borel measurable F≥0, ∫RnF dx=∫0∞∫Sn−1F(rω)rn−1 dσ(ω) dr, with σ the finite Borel surface measure on Sn−1 (Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma, The polar surface set function on the unit sphere).

[F6]

Fubini applies to L1 functions on products of σ-finite measure spaces, and dominated convergence applies to pointwise convergent measurable functions dominated by one integrable function (Fubini's theorem for L^1 functions on a sigma-finite product, Dominated convergence).

[F7]

Countable unions of Lebesgue-null sets are Lebesgue-null, and Countable Choice permits the countably many selections made below (Subsets and countable unions of null subsets of Rm are null, The Axiom of Countable Choice (ACω)).

[F8]

The seminorm is ∥u∥BMO=sup⁡Q∣Q∣−1∫Q∣u−uQ∣, and the quotient BMO(Rn)/C identifies functions differing by an almost-everywhere constant (BMO seminorm and the quotient by constants).

[F9]

If a sequence converges in L2, it has a subsequence of measurable representatives converging almost everywhere to a representative of the limit under Countable Choice (Assuming Countable Choice, Lp-convergent sequences have almost-everywhere convergent subsequences).

Proof

technique · direct
1.1F1F3F4

The local term obeys ∣Q∣−1∫Q∣T(b1λnQ)∣≤∣Q∣−1/2∥T(b1λnQ)∥2≤∣Q∣−1/2B∥b1λnQ∥2≤∣Q∣−1/2B∥b∥L∞∣λnQ∣1/2=λnn/2B∥b∥L∞, by Cauchy-Schwarz [F4], the L2 bound [F1] and ∣λnQ∣=λnn∣Q∣ [F3].

1.2F3

For x,a∈Q one has ∣x−a∣≤n ℓ(Q); for y∉λnQ the coordinatewise distance from a to the complement of the concentric cube λnQ is at least λn−12ℓ(Q)=2n ℓ(Q), so ∣a−y∣≥2n ℓ(Q)≥2∣x−a∣; and if Q⊆R, a∈Q⊆R and y∉λnR, the same computation with ℓ(R) gives ∣a−y∣≥2n ℓ(R)≥2∣x−a∣.

2.1F2F5step 1.2algebra

The tail integral converges absolutely for every x∈Q. If x=a, its integrand is zero. Otherwise, by [F2] and step 1.2, ∣k(x−y)−k(a−y)∣≤A2′∣x−a∣δ∣a−y∣−n−δ≤A2′(n ℓ(Q))δ∣a−y∣−n−δ for y∉λnQ, and by [F5] the tail power integral is ∫Rn∖λnQ∣a−y∣−n−δdy≤∫∣z∣≥2nℓ(Q)∣z∣−n−δdz=σ(Sn−1)δ−1(2n ℓ(Q))−δ. Hence ∣∫Rn∖λnQ[k(x−y)−k(a−y)]b(y) dy∣≤A2′σ(Sn−1)δ−12−δ∥b∥L∞, a bound independent of x and Q; this is (i), and the tail is a bounded measurable function of x: [F2] implies continuity of k away from zero, while its displayed bound gives an integrable majorant uniformly on Q, so dominated convergence gives continuity of the tail there.

2.2F1step 1.2algebra

Nested consistency. Let Q⊆R be cubes with points aQ∈Q and aR∈R, and let x∈Q. Since λnQ⊆λnR, splitting the complement of λnQ into λnR∖λnQ and Rn∖λnR and using linearity of T gives (Tb)Q(x)−(Tb)R(x)=−T(b1λnR∖λnQ)(x)+∫λnR∖λnQ[k(x−y)−k(aQ−y)]b(y) dy+∫Rn∖λnR[k(aR−y)−k(aQ−y)]b(y) dy. The function b1λnR∖λnQ is compactly supported L2 with support disjoint from Q, so the off-support representation [F1] gives T(b1λnR∖λnQ)(x)=∫λnR∖λnQk(x−y)b(y) dy for almost every x∈Q; the first integral over λnR∖λnQ converges absolutely because that region lies in a bounded annulus about aQ on which the annular bound of [F1] controls k. If aR=aQ, the last integral is zero; otherwise it converges absolutely by Hormander's condition [F1] applied at centre aR with nonzero translation v=aR−aQ, since ∣aR−y∣≥2n ℓ(R)≥2∣aR−aQ∣ for y∉λnR by step 1.2. The resulting expression is independent of x, so (Tb)Q−(Tb)R is almost everywhere constant on Q, which is (ii).

3.1step 1.1step 2.1F8algebra

Combining steps 1.1 and 2.1, ∣Q∣−1∫Q∣(Tb)Q∣≤(λnn/2B+A2′σ(Sn−1)δ−12−δ)∥b∥L∞ for every cube Q, hence by the optimal-constant bound of [F8] with c=0 the mean oscillation of (Tb)Q over Q is at most 2(λnn/2B+A2′σ(Sn−1)δ−12−δ)∥b∥L∞.

3.2step 2.2F7

Coherence and gluing. If Q1,Q2 are cubes, choose a cube R containing both; step 2.2 shows that each (Tb)Qi−(Tb)R is constant almost everywhere on Qi, so (Tb)Q1−(Tb)Q2 is constant almost everywhere on Q1∩Q2. Let Qk=[−k,k]n for k≥1 and choose representatives of the countably many localisations, which Countable Choice permits [F7]. Define constants ck inductively by c1=0 and ck+1=ck−[(Tb)Qk+1−(Tb)Qk], the bracket being the constant of step 2.2 on Qk; then uk:=(Tb)Qk+ck satisfies uk+1=uk almost everywhere on Qk. Removing the countable union of the exceptional null sets, which is null by [F7], define u(x):=uk(x) for x∈Qk outside that null set, and set u=0 on the null set; this is well defined and locally integrable, and for every cube Q, choosing k with Q⊆Qk, the function u−(Tb)Q=[u−(Tb)Qk]+[(Tb)Qk−(Tb)Q] is almost everywhere constant on Q by the construction and step 2.2. Two such global representatives differ by constants on the nested Qk; these constants agree on their positive-measure overlaps, so the global class is unique. Linearity follows from linearity of each localisation and this uniqueness.

4.1step 3.1step 3.2F8algebra

By step 3.2, u−(Tb)Q is constant almost everywhere on every cube Q, so the mean oscillation of u over Q equals that of (Tb)Q; by step 3.1, ∣Q∣−1∫Q∣u−uQ∣≤2(λnn/2B+A2′σ(Sn−1)δ−12−δ)∥b∥L∞ for every cube. Hence u∈BMO(Rn) with ∥u∥BMO≤Cn,δ(A2′+B)∥b∥L∞ for Cn,δ:=2max⁡(λnn/2,σ(Sn−1)δ−12−δ), and its class modulo constants is the class Tb of the statement, which is (iii).

4.2F1F2F4F5F6F7F9step 1.2step 3.2

Suppose b∈L2(Rn); fix a cube Q and a∈Q and write c:=Rn∖λnQ and Ψ(x):=∫c[k(x−y)−k(a−y)]b(y) dy for the tail of the localisation. Let bN:=b1c∩B(0,N) for N≥1. Each bN is compactly supported L2 with support disjoint from Q, so [F1] gives TbN(x)=∫ck(x−y)bN(y) dy for almost every x∈Q; since bN→b1c in L2, boundedness of T gives TbN→T(b1c) in L2. By [F9] choose a subsequence whose representatives converge almost everywhere to a representative of T(b1c), and intersect this full-measure set with the full-measure set where the countably many off-support identities hold. For x=x′ the kernel difference below is zero. For distinct x,x′∈Q outside the exceptional null set and y∈c, one has ∣x′−y∣≥2n ℓ(Q)≥2∣x−x′∣ by step 1.2, so ∣k(x−y)−k(x′−y)∣≤A2′∣x−x′∣δ∣x′−y∣−n−δ by [F2]; the function y↦A2′∣x−x′∣δ∣x′−y∣−n−δ∣b(y)∣ is integrable on c by Cauchy-Schwarz [F4] and [F5], so dominated convergence [F6] gives along that subsequence lim⁡j[TbNj(x)−TbNj(x′)]=∫c[k(x−y)−k(x′−y)]b(y) dy=Ψ(x)−Ψ(x′). Hence T(b1c)−Ψ has equal values at almost every pair of points of Q, so by Fubini [F6] it is almost everywhere constant on Q. Since Tb=T(b1λnQ)+T(b1c) in L2 and (Tb)Q=T(b1λnQ)+Ψ, the difference Tb−(Tb)Q is almost everywhere constant on Q; that is (iv), and it identifies the L2 class of Tb with the localisation class of step 3.2 modulo constants.

5.1step 2.1step 2.2step 3.1step 3.2step 4.1step 4.2F9∎

Steps 2.1, 2.2, 4.1 and 4.2 prove (i), (ii), (iii) and (iv) respectively, and steps 3.1 and 3.2 supply the global representative u used in (iii). The argument uses Countable Choice exactly in the countably many applications of the off-support representation and in the selection of the representatives and subsequence in steps 3.2 and 4.2, and it uses no other choice principle.

Depends on

Used by

Dependency tree · two levels

73 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