Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: 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.

Size without cancellation does not give a principal value

Statement refuted

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

The positive kernel k(x)=∣x∣−n satisfies the pointwise size bound ∣k(x)∣=∣x∣−n, but its symmetric truncations diverge: for f=1B(0,1) one has Tεf(0)=∫ε<∣y∣<1∣y∣−n dy=∣Sn−1∣log⁡1ε→∞(ε↓0). Hence the pointwise size condition alone gives neither a principal-value distribution along this sequence nor a finite maximal truncated operator, and cancellation needed for principal values is not implied by size, even together with Hörmander smoothness.

Facts & Assumptions

Given: The kernel k(x)=∣x∣−n on Rn∖{0}, the indicator f=1B(0,1), the truncations Tε,T(ε,N) and the maximal operators T∗,T∗∗ of Maximal truncated singular integrals, and Countable Choice.

[F1]

The polar-coordinates formula identifies ∫Rng(x) dx=∫0∞∫Sn−1g(rθ) dσn−1(θ) rn−1dr for Borel g≥0, with σn−1(Sn−1)=∣Sn−1∣ the surface measure of the unit sphere (Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma).

[F2]

For f∈Lp, 1≤p<∞, and k with ∣k(x)∣≤A1∣x∣−n, the truncations Tεf(x) and T(ε,N)f(x) are absolutely convergent for every x, and the maximal operators are T∗f(x)=sup⁡ε>0∣Tεf(x)∣, T∗∗f(x)=sup⁡0<ε<N∣T(ε,N)f(x)∣ (Maximal truncated singular integrals).

[F3]

A principal-value distribution for k is a tempered distribution W agreeing with k on Rn∖{0} for which some sequence δj↓0 gives ⟨W,φ⟩=lim⁡j∫∣x∣≥δjk(x)φ(x) dx for every φ∈S(Rn) (Calderón–Zygmund kernels and their associated operators).

Counterexample

technique · direct
1.1F1F2givenalgebra

Since k obeys the size bound with A1=1 and f=1B(0,1)∈L1∩L2, [F2] applies, and polar coordinates [F1] give, for every 0<ε<1, Tεf(0)=∫ε<∣y∣<1∣y∣−n dy=∫ε1r−n∣Sn−1∣rn−1 dr=∣Sn−1∣∫ε1drr=∣Sn−1∣log⁡1ε, with ∣Sn−1∣>0; the doubly truncated integral likewise equals ∣Sn−1∣log⁡(min⁡{1,N}/ε) for 0<ε<min⁡{1,N}, and it vanishes if ε≥1; fixing N=2 and sending ε↓0 proves T∗∗f(0)=+∞.

2.1step 1.1algebra

Consequently lim⁡ε↓0Tεf(0)=+∞: the symmetric truncations do not converge at the origin, and the maximal truncated operator is infinite there, although every individual truncation is finite.

3.1F1F2F3step 2.1algebra∎

No principal-value distribution for k exists along any sequence δj↓0. Indeed, take the nonnegative Schwartz test φ(x)=e−∣x∣2, with φ(0)=1; by continuity of φ there is ρ>0 with φ≥φ(0)/2 on B(0,ρ), so for every δ∈(0,ρ) polar coordinates give ∫∣x∣≥δk(x)φ(x) dx≥∫δ<∣x∣<ρ∣x∣−nφ(0)2 dx=φ(0)2∣Sn−1∣log⁡ρδ, which tends to +∞ as δ↓0; hence the limit in [F3] fails for this φ and every sequence δj↓0. Together with step 2.1 and [F2] this shows that the pointwise size condition by itself yields neither a principal-value distribution nor a finite maximal truncated operator, so principal-value cancellation is an additional requirement. In fact k also satisfies Hörmander's condition: ∣∇k(z)∣=n∣z∣−n−1 gives ∣k(x−y)−k(x)∣≤n2n+1∣y∣∣x∣−n−1 on ∣x∣≥2∣y∣, whose integral is bounded uniformly in y by polar coordinates. Thus these kernel bounds alone do not assert a principal value or an associated L2-bounded operator.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

23 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