Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 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 of an interval indicator

Statement

Assume Countable Choice and let f:=1(0,1) be the indicator of the open unit interval, with the Lp conventions of Complex Lp classes and Euclidean test-function conventions. Write

q(x):=1πlog⁡∣x∣∣x−1∣(x∉{0,1}).

Then:

  1. for every x∉{0,1} the symmetric principal value lim⁡ε↓0Hεf(x) exists and equals q(x), the logarithm being taken at the positive argument ∣x∣/∣x−1∣;
  2. the function q represents the L2 Hilbert transform of f almost everywhere, that is, q=Hf in L2(R;C).

The values at the two endpoints are immaterial: every assertion is about the complement of the Lebesgue-null set {0,1}, and no claim is made about Hεf at x∈{0,1}.

Facts & Assumptions

Given: Countable Choice, the indicator f=1(0,1)∈L1(R)∩L2(R) with 0≤f≤1, and the truncated Hilbert transform of Truncated Hilbert transform and principal value.

[F1]

For ε>0 and x∈R, Hεf(x)=1π∫∣t∣>εf(x−t)t dt, absolutely convergent for f∈Lp, 1≤p<∞; Hpvf(x) is the ε↓0 limit where it exists. Truncated Hilbert transform and principal value

[F2]

For Schwartz g the principal value exists at every x and equals (W∗g)(x) for the tempered convolution with pv⁡1πx, and the L2 extension H has symbol m(ξ)=−isgn⁡(ξ) and satisfies ∥Hg∥2=∥g∥2. The Hilbert transform is the tempered convolution with pv(1/(pi x)) and has signum Fourier multiplier The Hilbert transform is an L2 isometry and squares to minus the identity

[F3]

There is χ∈Cc∞(R) with 0≤χ≤1, χ=1 on [−1,1] and χ=0 off (−2,2). Explicit compactly supported smooth cutoffs

[F4]

For real a≤b the interval [a,b] is Lebesgue measurable with λ1([a,b])=b−a; and if 0≤u≤v are measurable then ∫u≤∫v. A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included Monotonicity and nonnegative homogeneity of the nonnegative integral

[F5]

A function φ∈Cc∞(R) with ∫φ=1 generates the mollifier family φε(x)=ε−1φ(x/ε), and (φε)ε>0 is an L1 approximate identity. The mollifier family generated by a unit-mass smooth bump A unit-mass smooth bump generates an L1 approximate identity

[F6]

If 1≤p<∞ and g∈Lp(R), then ∥g∗φε−g∥p→0; in particular g∗φε→g in Lp. Every L1 approximate identity converges to the identity in Lp for 1≤p<∞

[F7]

For locally integrable g the convolution g∗φε is smooth; and supp⁡(g∗φε)⊆supp⁡(g)+supp⁡(φε)‾. 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

[F8]

On (0,∞): log⁡ is differentiable with log⁡′=1/x, log⁡x=∫1xdt/t, and log⁡(x/y)=log⁡x−log⁡y; log⁡ is strictly increasing. With the chain rule this gives ddtlog⁡∣t∣=1t for t∈R∖{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 The chain rule, in one line from Carathéodory: if g is differentiable at c and f is differentiable at g(c), then f∘g is differentiable at c with (f∘g)′(c)=f′(g(c)) g′(c)

[F9]

Oriented additivity over subintervals and the second fundamental theorem: on a compact interval on which the integrand is continuous with the displayed antiderivative, the integral is the antiderivative difference, and ∫uvf+∫vwf=∫uwf. For a<c<b: f is integrable on [a,b] if and only if it is integrable on [a,c] and on [c,b], and then ∫abf=∫acf+∫cbf; with the oriented form for arbitrary a,b,c The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a)

[F10]

Norm-convergent sequences in L2 have subsequences converging almost everywhere to a representative of the limit. Complex Lp completeness and almost-everywhere subsequences

Proof

technique · direct
1.1F1

Let x∉{0,1} and ε>0. Substituting t=x−y in [F1] and using 1(0,1)(x−t)=1 exactly for t∈(x−1,x) gives Hεf(x)=1π∫(x−1,x)∩{∣t∣>ε}dtt, the integrand being continuous on each piece because t=0 is either excluded by the truncation or avoided.

1.2F3F4F5F7

Construction of approximants. Put φ:=χ/∫χ with χ as in [F3]. The bounds 0≤χ≤1 and [F4] give 2=λ1([−1,1])≤∫χ≤λ1([−2,2])=4, so 0<∫χ<∞ and φ∈Cc∞(R) is nonnegative with ∫φ=1. Let (φε) be its mollifier family and put fj:=f∗φ1/j for j≥1. By [F7] each fj is smooth, and since supp⁡(f)⊆[0,1] and supp⁡(φ1/j)⊆[−2/j,2/j], the support inclusion gives supp⁡(fj)⊆[−2/j,1+2/j]. Also, if dist⁡(y,{0,1})>2/j, the bump samples only where f is constant, so fj(y)=f(y); hence gj=fj−f is supported within distance 2/j of the endpoints, and fj∈Cc∞(R). Since 0≤φ and ∫φ1/j=1, moreover 0≤fj≤1 pointwise: fj(x)=∫f(x−y)φ1/j(y) dy∈[0,1].

2.1step 1.1F8F9

Case x>1. For 0<ε<x−1 one has (x−1,x)⊆(ε,∞), so Hεf(x)=1π∫x−1xdtt=1π(log⁡x−log⁡(x−1))=1πlog⁡xx−1 by [F8] and [F9].

2.2step 1.1F8F9

Case x<0. For 0<ε<−x one has (x−1,x)⊆(−∞,−ε), so Hεf(x)=1π∫x−1xdtt=1π(log⁡∣x∣−log⁡∣x−1∣)=1πlog⁡∣x∣∣x−1∣ by [F8], the antiderivative of 1/t on the negative axis being log⁡∣t∣.

2.3step 1.1F8F9

Case 0<x<1. For 0<ε<min⁡(x,1−x) the set (x−1,x)∩{∣t∣>ε} is (x−1,−ε)∪(ε,x), so by [F9] Hεf(x)=1π[log⁡∣−ε∣−log⁡∣x−1∣+log⁡x−log⁡ε]=1π[log⁡x−log⁡(1−x)]=1πlog⁡x1−x, the two log⁡ε terms cancelling exactly because log⁡∣−ε∣=log⁡ε; since ∣x−1∣=1−x>0 this is 1πlog⁡∣x∣∣x−1∣.

2.4step 1.2F2F6

By [F6] applied with p=1 and p=2, the sequence of 1.2 satisfies ∥fj−f∥1→0 and ∥fj−f∥2→0; consequently fj→f in L2, and the L2 boundedness of [F2] gives ∥Hfj−Hf∥2→0, where Hfj is both the L2 transform of fj and the pointwise principal value of [F2].

2.5step 1.2F2algebra

Fix x∉{0,1} and put δ:=12dist⁡(x,{0,1})>0; let c∈{0,1} be the constant value of f on (x−δ,x+δ) and set r:=δ/4. The mollifier is supported in [−2/j,2/j], so for j>4/δ its convolution samples only points of (x−δ,x+δ) when the argument lies in (x−δ/2,x+δ/2); hence 1.2 gives fj=c there. Thus for 0<η<r the part of Hηfj(x) over η<∣x−y∣<r is the integral of c/(π(x−y)) over a symmetric annulus, hence is zero. The remaining integral is absolutely convergent because fj has compact support and ∣x−y∣≥r there. Letting η↓0 in [F2] gives Hfj(x)=1π∫∣x−y∣>rfj(y)x−y dy.

3.1step 2.1step 2.2step 2.3

By 2.1, 2.2 and 2.3, for every x∉{0,1} and every 0<ε<r(x), where r(x):=x−1 for x>1, r(x):=−x for x<0 and r(x):=min⁡(x,1−x) for 0<x<1, one has Hεf(x)=q(x)=1πlog⁡∣x∣∣x−1∣. Since r(x)>0, the symmetric principal value exists at every x∉{0,1} and equals q(x); this proves assertion 1.

3.2step 1.2step 2.4step 2.5

The function gj=fj−f is supported in {y:dist⁡(y,{0,1})≤2/j} by 1.2, so for j>4/δ and y∈supp⁡(gj) one has ∣x−y∣≥2δ−2j≥δ2; hence ∣1π∫Rgj(y)x−y dy∣≤∥gj∥1π⋅2δ→0 as j→∞ by 2.4.

4.1step 3.1algebra

Since f=c on ∣x−y∣<r, the same symmetric cancellation shows that for every 0<η<r, Hηf(x)=1π∫∣x−y∣>rf(y)x−y dy. This outer integral is absolutely convergent because f has compact support and its denominator is bounded away from zero. By 3.1 its value is q(x).

5.1step 2.5step 3.2step 4.1

Combining 2.5, 3.2 and 4.1, Hfj(x)→q(x) for every fixed x∉{0,1}.

6.1step 2.4step 5.1F10∎

By 2.4, Hfj→Hf in L2; by [F10] a subsequence converges almost everywhere to a representative of the class Hf, while 5.1 makes that same subsequence converge to q at every point of the full-measure set R∖{0,1}. Therefore q=Hf almost everywhere: q represents the L2 multiplier extension of f, which is assertion 2.

Depends on

Used by

Dependency tree · two levels

110 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