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

Poisson nontangential maximal function is controlled by circle maximal averages

Statement

Assume countable choice. For every finite regular complex Borel measure μ on T, every A>1 and every ζ∈T, NA(P[μ])(ζ)≤(A+1)2 MTμ(ζ). In particular NA(P[f])(ζ)≤(A+1)2MTf(ζ) for every f∈L1(T,m), where P[f]=P[fm] and MTf=MT(fm).

Facts & Assumptions

Given: Countable choice, a finite regular complex Borel measure μ on T, a real A>1, and a point ζ∈T.

[L1]

The sets ΓA(ζ)={z∈D:∣z−ζ∣<A(1−∣z∣)} and NAv(ζ)=sup⁡z∈ΓA(ζ)∣v(z)∣ are the nontangential regions and maximal functions, and MTμ(ζ)=sup⁡0<h≤1/2∣μ∣(Ih(ζ))/m(Ih(ζ)) takes values in [0,+∞]; moreover MTf=MT(fm) and P[f]=P[fm] (The circle maximal function and nontangential approach regions, The Poisson integral of a finite complex boundary measure).

[L2]

For z∈D and η∈T the kernel is P(z,η)=(1−∣z∣2)/∣η−z∣2>0; for z=rζ and η=ζe2πiε with ∣ε∣≤12 one has ∣η−rζ∣=∣e2πiε−r∣, so ∣η−rζ∣2=1−2rcos⁡(2πε)+r2 (The Poisson kernel on the unit disc).

[L3]

Cosine is strictly decreasing on [0,π], and sine and cosine are continuous (indeed 1-Lipschitz) (Signs, monotonicity intervals, and ranges of sine and cosine, Sine and cosine are 1-Lipschitz on R).

[L4]

For every f∈L1(μ) the bound ∣∫f dμ∣≤∫∣f∣ d∣μ∣ holds, where ∣μ∣ is a measure with ∣μ∣(E)≤∣μ∣(T)<+∞ (Integrals against signed or complex measures are bounded by total variation, The total variation of a signed or complex measure is a positive measure).

[L5]

The normalized Haar measure m is a probability measure with m(Ih(ζ))=2h for 0<h≤12, and ∫TP(z,η) dm(η)=1 for every z∈D; equality in the second display of [L1] holds for every arc radius (The one-dimensional torus and its normalized Haar integral, The Poisson kernel is positive, has total mass one, and concentrates at a boundary point, The Poisson integral of a finite complex boundary measure).

Proof

technique · direct
1.1givenL1L2algebra

Let z∈ΓA(ζ), r=∣z∣, and η∈T. Put u:=Re⁡(ζ‾z)≤r. Since ∣rζ−z∣2=2r2−2ru and ∣ζ−z∣2=1+r2−2u, the identity 2r2−2ru≤1+r2−2u is equivalent to (1−r)(1+r−2u)≥0, which holds because 1−r>0 and 2u≤2r≤1+r; hence ∣rζ−z∣≤∣ζ−z∣. Therefore ∣rζ−η∣≤∣rζ−z∣+∣z−η∣≤∣ζ−z∣+∣z−η∣≤A(1−r)+∣z−η∣≤(A+1)∣z−η∣, where the cone condition gives ∣ζ−z∣<A(1−r) and the reverse triangle inequality gives ∣z−η∣≥1−∣z∣=1−r. The case z=0 is included: then r=0, u=0 and ∣rζ−η∣=1≤A+1=(A+1)∣z−η∣.

1.2givenL2L3L5choosealgebra

Fix z=rζ with 0<r<1 and put g(δ):=(1−r2)/(1−2rcos⁡(2πδ)+r2) for δ∈[0,12]. By [L2], P(z,η)=g(d(ζ,η)) for every η∈T, and by [L3] the function g is continuous and strictly decreasing on [0,12]. Given ε>0, choose 0=δ0<δ1<⋯<δm=12 with g(δj−1)−g(δj)≤ε for all j (continuity on a compact interval); put c0:=g(12) and cj:=g(δj−1)−g(δj)≥0. Then for every δ∈[0,12] one has g(δ)≤ϕ(δ):=c0+∑j=1mcj1[0,δj)(δ)≤g(δ)+ε, because on [δk−1,δk) the function ϕ equals g(δk−1) while g(δk)≤g(δ)≤g(δk−1) and g(δk−1)−g(δk)=ck≤ε; on the single point δ=12 both sides equal g(12). Consequently P(z,η)≤c0+∑jcj1{d(ζ,η)<δj}(η) for every η, while integrating the two-sided bound against m and using m(T)=1 together with ∫Tg(d(ζ,η)) dm(η)=∫TP(z,η) dm(η)=1 gives c0+∑j=1mcj m({d(ζ,⋅)<δj})≤1+ε.

1.3givenL1L4L5algebra

By definition of MTμ as a supremum over h∈(0,12], every arc satisfies ∣μ∣(Ih(ζ))≤MTμ(ζ) m(Ih(ζ))=2h MTμ(ζ); in particular ∣μ∣(T)=∣μ∣(I1/2(ζ))≤MTμ(ζ). Moreover each set {d(ζ,⋅)<δ} with δ∈(0,12] satisfies m({d<δ})=2δ and ∣μ∣({d<δ})≤MTμ(ζ) m({d<δ}): for δ<12 the set is the arc Iδ(ζ), and for δ=12 it is T minus the antipode, whose m-measure is 1 and whose ∣μ∣-measure is at most ∣μ∣(T)≤MTμ(ζ).

2.1step 1.2step 1.3L1L4algebra

Put M:=MTμ(ζ). If M=+∞, the desired bound is automatic. Assume M<+∞. For 0<r<1 the pointwise bound of step 1.2 and the estimates of step 1.3 give ∣P[μ](rζ)∣≤∫TP(rζ,η) d∣μ∣(η)≤c0 ∣μ∣(T)+∑j=1mcj ∣μ∣({d(ζ,⋅)<δj})≤M(c0+∑j=1mcj m({d(ζ,⋅)<δj}))≤(1+ε)M, where [L4] supplies the first inequality. Since ε>0 was arbitrary, ∫TP(rζ,η) d∣μ∣(η)≤M and hence ∣P[μ](rζ)∣≤M. For r=0, P(0,η)=1 and step 1.3 give ∫TP(0,η) d∣μ∣(η)=∣μ∣(T)≤M, while [L4] gives ∣P[μ](0)∣=∣μ(T)∣≤∣μ∣(T).

2.2step 1.1L2algebra

For z∈ΓA(ζ) with ∣z∣=r and every η∈T, step 1.1 gives ∣η−rζ∣≤(A+1)∣η−z∣, hence P(z,η)=1−r2∣η−z∣2≤(A+1)2 1−r2∣η−rζ∣2=(A+1)2P(rζ,η).

3.1step 2.1step 2.2L1L4algebra∎

Combining steps 2.1 and 2.2, for every z∈ΓA(ζ) with ∣z∣=r, ∣P[μ](z)∣≤∫TP(z,η) d∣μ∣(η)≤(A+1)2∫TP(rζ,η) d∣μ∣(η)≤(A+1)2MTμ(ζ), the first inequality by [L4]. Taking the supremum over z∈ΓA(ζ) gives NA(P[μ])(ζ)≤(A+1)2MTμ(ζ). For f∈L1(T,m) the identities P[f]=P[fm] and MTf=MT(fm) of [L1] give NA(P[f])(ζ)≤(A+1)2MTf(ζ), completing the proof.

Depends on

Used by

Dependency tree · two levels

79 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