Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Maximal truncated singular integrals

Definition

Assume Countable Choice (The Axiom of Countable Choice (ACω)).

Fix an integer n≥1 and let k:Rn∖{0}→C be a measurable function that is integrable on compact subsets of Rn∖{0} and satisfies the pointwise size bound ∣k(x)∣≤A1∣x∣−n(x≠0)(1) for some finite constant 0≤A1<∞. With the complex Lp conventions of Complex Lp classes and Euclidean test-function conventions, fix 1≤p<∞ and f∈Lp(Rn).

For 0<ε<∞ define the truncated singular integral Tεf(x):=∫∣y∣>εk(y)f(x−y) dy,x∈Rn, and for 0<ε<N<∞ define the doubly truncated singular integral T(ε,N)f(x):=∫ε<∣y∣<Nk(y)f(x−y) dy,x∈Rn. Both integrals converge absolutely for every x. Indeed, the truncated kernel kε:=k1{∣⋅∣>ε} satisfies ∥kε∥p′p′=∫∣y∣>ε∣k(y)∣p′ dy≤A1p′∫∣y∣>ε∣y∣−np′ dy=A1p′ ∣Sn−1∣ εn−np′np′−n<∞ by Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma for 1<p<∞ (the case p=1, p′=∞, uses ∥kε∥∞≤A1ε−n), and likewise ∥k1{ε<∣⋅∣<N}∥p′<∞; Hölder's inequality (Complex Holder, Minkowski, and the quotient norm) therefore gives ∣Tεf(x)∣≤∥f∥p∥kε∥p′<∞ and ∣T(ε,N)f(x)∣≤∥f∥p∥k1{ε<∣⋅∣<N}∥p′<∞ at every x. The maximal truncated singular integral and the doubly truncated maximal singular integral are T∗f(x):=sup⁡ε>0∣Tεf(x)∣,T∗∗f(x):=sup⁡0<ε<N<∞∣T(ε,N)f(x)∣, with values in [0,∞].

Under the size bound (1) the two maximal operators are pointwise comparable: T∗f≤T∗∗f≤2T∗fpointwise on Rn.(2) For the left inequality, fix ε>0 and x: dominated convergence (Dominated convergence) applied to the absolutely convergent integral defining Tεf(x) gives Tεf(x)=lim⁡N→∞T(ε,N)f(x), so ∣Tεf(x)∣≤T∗∗f(x); take the supremum in ε. For the right inequality, split the defining integral of T(ε,N) at N to get T(ε,N)f(x)=Tεf(x)−TNf(x) and hence ∣T(ε,N)f(x)∣≤∣Tεf(x)∣+∣TNf(x)∣≤2T∗f(x); take the supremum in ε<N. Thus T∗ and T∗∗ have the same finiteness set and the same boundedness properties. The definition itself asserts neither an upper truncation for T∗ nor the existence of a principal-value limit lim⁡ε↓0Tεf(x); the doubly truncated form is the primitive object, because it is defined from the kernel alone. Here the pointwise size bound (1) is a stronger hypothesis than the annular size condition of the Calderón–Zygmund kernel definition: (1) implies ∫R≤∣x∣≤2R∣k∣≤A1∣Sn−1∣log⁡2, while the annular condition does not by itself prevent pointwise spikes. Countable Choice is inherited from the polar-coordinate evaluation; the truncations themselves require no selection.

Depends on

Used by

Dependency tree · two levels

46 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