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

Hilbert transform is not strong type (1,1)

Statement refuted

The claim that the Schwartz-core Hilbert transform has a bounded C-linear extension T:L1(R;C)→L1(R;C) agreeing with the L2 Hilbert transform on L1(R)∩L2(R) — equivalently, that the Hilbert transform is of strong type (1,1) — is false. The interval indicator supplies the witness: it lies in L1, while its L2 transform q(x)=1πlog⁡∣x∣∣x−1∣ has a nonintegrable 1∣x∣ tail and therefore is not an L1 class.

This refutes only strong type (1,1). No weak-type (1,1) estimate is refuted or asserted here.

Facts & Assumptions

Given: Countable Choice, the indicator f=1(0,1), and the function q(x)=1πlog⁡∣x∣∣x−1∣ for x∉{0,1}, with the Lp conventions of Complex Lp classes and Euclidean test-function conventions.

[F1]

f∈L1(R)∩L2(R) with 0≤f≤1; the symmetric principal value of 1π∫f(y)x−ydy exists at every x∉{0,1} and equals q(x); and q=Hf in L2(R;C) for the L2 Hilbert transform. Hilbert transform of an interval indicator

[F2]

H is complex-linear on L2(R;C) and ∥Hg∥2=∥g∥2 for every g∈L2. The Hilbert transform is an L2 isometry and squares to minus the identity

[F3]

For 0<a<b one has ∫abdtt=log⁡b−log⁡a, and log⁡(1+u)=∫11+udtt for u≥0; log⁡ is strictly increasing on (0,∞). The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm

[F4]

The nonnegative integral is monotone and positively homogeneous, and monotone convergence passes to the limit of an increasing sequence of truncations. Monotonicity and nonnegative homogeneity of the nonnegative integral Monotone convergence for the integral

[F5]

There is χ∈Cc∞(R) with 0≤χ≤1, χ=1 on [−1,1] and χ=0 off (−2,2); φ:=χ/∫χ is a nonnegative Cc∞ function of integral one; and its mollifiers φε(x)=ε−1φ(x/ε) satisfy: g∗φε is smooth, supp⁡(g∗φε)⊆supp⁡g+supp⁡φε‾, and ∥g∗φε−g∥p→0 for g∈Lp(R) and 1≤p<∞. Every Cc∞(R) function is a Schwartz function. Explicit compactly supported smooth cutoffs The mollifier family generated by a unit-mass smooth bump A unit-mass smooth bump generates an L1 approximate identity Every L1 approximate identity converges to the identity in Lp for 1≤p<∞ Convolution with a mollifier is smooth, and derivatives pass under the integral sign The support of a convolution lies in the closure of the support sumset Schwartz space and its seminorms

[F6]

Holder: ∣∫uv dx∣≤∥u∥1∥v∥∞ and ∣∫uv dx∣≤∥u∥2∥v∥2. Complex Holder, Minkowski, and the quotient norm

[F7]

Dominated convergence: if ∣hR∣≤G with G∈L1 and hR→h almost everywhere, then ∫hR→∫h. Dominated convergence

Counterexample

technique · direct
1.1F1F8givenalgebra

The indicator f is measurable with 0≤f≤1 and {f≠0}=(0,1) of measure one, so ∣f∣p≤1 on a set of measure one and vanishes elsewhere; hence f∈Lp(R;C) for every 1≤p≤∞, with ∥f∥p≤1.

1.2F1F3givenalgebra

On (1,∞) one has q(x)=1πlog⁡xx−1=1πlog⁡(1+1x−1)>0 because log⁡ is strictly increasing and log⁡1=0 by [F3].

1.3F3F4algebra

For 0≤u≤1 one has log⁡(1+u)=∫11+udtt≥∫11+udt1+u=u1+u≥u2, using monotonicity of the integral and 1+u≤2.

2.1F3F4F8step 1.2step 1.3algebra

q∉L1(R): for x≥2 put u=1x−1∈(0,1]; steps 1.2 and 1.3 give q(x)≥12π⋅1x−1≥12πx≥0. Hence for every R>2, using additivity over the interval and [F8] with the antiderivative of [F3], ∫(2,R)q≥12π∫(2,R)dxx=12π(log⁡R−log⁡2), which tends to +∞; monotone convergence [F4] gives ∫(2,∞)q=+∞, and monotonicity in the domain gives ∫R∣q∣≥∫(2,∞)q=+∞. So q is not an L1 class.

2.2F5step 1.1algebra

Let φ be the unit-mass bump of [F5] and for j∈N put fj:=f∗φ1/(j+1). Each fj is smooth with supp⁡fj⊆[−2/(j+1),1+2/(j+1)], so fj∈Cc∞(R)⊆S(R); and 0≤fj≤1 because 0≤f≤1 and φ1/(j+1)≥0 has integral one. Since ∥fj−f∥p→0 for p=1 and p=2, each fj lies in L1∩L2 and the sequence converges to f in both norms.

3.1F1F2step 2.2algebra

∥Hfj−q∥2→0: by [F1] q=Hf, and by [F2] H is a linear isometry, so ∥Hfj−q∥2=∥H(fj−f)∥2=∥fj−f∥2→0 by step 2.2.

4.1step 2.2step 3.1F6given

Suppose, for contradiction, that T:L1(R;C)→L1(R;C) is bounded and linear with Tg=Hg for every g∈S(R). Since fj∈S, one has Tfj=Hfj as L1 classes, and ∥Tfj−Tf∥1≤∥T∥ ∥fj−f∥1→0 by step 2.2. Fix ψ∈Cc∞(R). Then ∣∫(Tfj−Tf)ψ∣≤∥Tfj−Tf∥1∥ψ∥∞→0 and, by step 3.1, ∣∫(Hfj−q)ψ∣≤∥Hfj−q∥2∥ψ∥2→0; since the j-th integrals of Tfj and Hfj agree, it follows that ∫(Tf)ψ=∫qψ, i.e. ∫(Tf−q)ψ=0 for every ψ∈Cc∞(R).

5.1step 2.1step 4.1F5F7algebra

For R>8 set ψR:=1[4,R]∗φ1 with φ1 as in [F5]. Then ψR∈Cc∞(R), its support is contained in [2,R+2], where q≥0 by step 1.2, 0≤ψR≤1, and ψR=1 on [6,R−2]: indeed ψR(x)=∫x−Rx−4φ1(y)dy, and for x∈[6,R−2] the interval [x−R,x−4] contains the support of φ1, which is contained in [−2,2]. Step 4.1 gives ∫(Tf)ψR=∫qψR for every R>8. As R→∞ the functions ψR converge pointwise to the bounded function x↦∫−∞x−4φ1, so dominated convergence [F7] with majorant ∣Tf∣∈L1 shows that the left-hand sides converge to a finite limit; but step 2.1 and ψR=1 on [6,R−2] give ∫qψR≥∫[6,R−2]q≥12π(log⁡(R−2)−log⁡6)→∞. A sequence cannot converge to a finite limit while equalling terms that tend to +∞, so no such T exists.

6.1step 5.1∎

The compatibility hypothesis in step 4.1 was imposed only on Schwartz functions, which lie in L1∩L2; hence there is no bounded linear L1→L1 operator agreeing with the L2 Hilbert transform on L1∩L2 either. The witness f∈L1 with transform q∉L1 therefore refutes strong type (1,1). Nothing here addresses weak type (1,1), which is a different assertion.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

105 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