Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (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.

Power decay for oscillatory complex-linear Beltrami phases

Statement

Assume the Axiom of Choice and Countable Choice. Fix 0<κ<1, R,A>0, q>2 and 0<θ≤1. Let μ be measurable, supported in DR, with ∥μ∥∞≤κ and ωq(μ,t)≤Atθ for 0<t≤1. For v∈R2∖{0} and ∣cv∣=1, let Ψv be the principal quasiconformal solution of ∂ˉΨv(z)=cveiv⋅zμ(z)∂Ψv(z). There exist C>0 and b>0, depending only on κ,R,A,q,θ, such that sup⁡z∈C∣Ψv(z)−z∣≤C∣v∣−b(∣v∣≥1). Both constants are uniform in μ, the direction of v and its unimodular factor cv.

Facts & Assumptions

Given: The Axiom of Choice and Countable Choice and the coefficient and parameters in the statement.

[F1]

The Beurling transform has norm 1 on L2, is bounded on every strict Lp, and commutes with translations. One can choose r>2 so that c:=κ∥B∥r→r<1. The Cauchy transform and near-two inverse identify the principal solution as Ψv−z=Chv, where hv=(I−cveiv⋅zμB)−1(cveiv⋅zμ) is supported in D‾R. (Planar Cauchy and Beurling transforms and near-two Beltrami inversion, Principal Beltrami solutions and uniform inverse-gradient integrability)

[F2]

Plancherel and Fourier inversion hold; convolution becomes a Fourier product. Young's convolution inequality holds, including Lr′∗Lr→L∞. (Plancherel theorem, Fourier transform turns L1 convolution into multiplication, L1 Fourier inversion with an integrable transform, Young's convolution inequality under Countable Choice)

[F3]

A holomorphic function on an exterior disk, continuous to its boundary and tending to zero at infinity, has supremum bounded by its boundary supremum. (Maximum modulus principle with boundary and infinity control)

[A1]

The Axiom of Choice and Countable Choice are used at [F1]–[F3]. (The Axiom of Choice, The Axiom of Countable Choice (ACω))

Proof

Given: The data in the statement.

1.1A1F1givenalgebra

Write K=∣v∣, ν=cveiv⋅zμ, and hn=(νB)nν. The Neumann series hv=∑n≥0hn converges in Lr by [F1]. For gN=∑n=0Nhn and bN=hv−gN, one has ∥bN∥r≤CcN+1 and ∥gN∥r≤C. Also ∥gN∥2≤C, because ∥νB∥2→2≤κ<1. All these functions have support in D‾R. Define fn=cv−(n+1)e−i(n+1)v⋅zhn. Then f0=μ and fn=μTnfn−1, where Tnu=e−inv⋅zB(einv⋅zu). This is a translation-invariant Fourier multiplier, and ∥Tn∥p→p=∥B∥p→p, since the two modulation factors have modulus one.

2.1F1step 1.1algebra

Put ℓ=2q/(q−2), so 1/2=1/q+1/ℓ, and M=2+∥B∥ℓ→ℓ. Iteration of the product norm gives ∥fn∥ℓ≤CRκn+1∥B∥ℓ→ℓn. The translation product identity and Hölder give ω2(fn,t)≤ωq(μ,t)∥Tnfn−1∥ℓ+κω2(Tnfn−1,t). By translation commutation and the L2 norm one, the second term is at most κω2(fn−1,t). For n=0, bounded support gives ω2(f0,t)≤CRωq(μ,t). Induction therefore yields ω2(fn,t)≤CRAκnMntθ for 0<t≤1: the two induction contributions are bounded by Mn−1 and ∥B∥ℓ→ℓn, whose sum is at most Mn after increasing the fixed constant.

3.1F2step 1.1step 2.1algebra

For any L2 function f and T>0, averaging ∥f(⋅−y)−f∥22 over [−2/T,2/T]2 and using Plancherel gives the multiplier 2[1−sinc⁡(2ξ1/T)sinc⁡(2ξ2/T)]. On ∣ξ∣≥T, one sinc factor has absolute value at most 1/2; the multiplier is bounded below by a positive absolute constant. Hence ∥1{∣ξ∣≥T}f^∥2≤Cω2(f,3/T). Since h^n is the shifted transform of fn by (n+1)v, the disk ∣ξ∣≤K/2 samples f^n only at frequencies at least K/2. Step 2.1 therefore gives, when K≥6, ∥g^N∥L2(DK/2)≤CAMN+1K−θ, by summing the geometric upper bounds and discarding the beneficial factors κn.

4.1F1F2F3step 1.1step 3.1algebra

Choose χ∈Cc∞(C) equal to one on ∣z∣≤2R+1, and set P(z)=χ(z)/(πz) for z≠0, with arbitrary value at zero. Thus P is compactly supported and belongs to L1∩Lr′ for every 1<r′<2, although it is singular at zero. On DR, convolution P∗hv equals Chv. The latter is holomorphic outside D‾R, continuous everywhere and tends to zero at infinity, so [F3] shows that a supremum estimate on DR controls its global supremum. Let r′=r/(r−1)∈(1,2), θ0=1−2/r>0, and Pδ=ρδ∗P for a fixed smooth nonnegative mollifier. Then ∥P−Pδ∥r′≤Cδθ0, ∥Pδ∥2≤Cδ−1, and ∥∇Pδ∥2≤Cδ−2. For the first assertion, split a translation difference of P into disks of radius 3∣y∣ at its two singularities and their complement. Hölder integration of ∣z∣−r′ on the disks gives the power ∣y∣2/r′−1; off them use the derivative bound C∣y∣∣z∣−2 and integrate its r′-power from ∣y∣ to the fixed cutoff radius, giving the same power. Integrating this estimate against ρδ(y) proves the first bound. The other two follow from Young applied to P∈L1 and the scaled L2 norms of ρδ and its derivative.

5.1F2step 1.1step 3.1step 4.1algebra

The tail P∗bN has supremum at most C∥bN∥r≤CcN+1, and (P−Pδ)∗gN has supremum at most Cδθ0, by step 4.1 and the Lr bounds of step 1.1. Fourier inversion and Cauchy–Schwarz bound the remaining term by C∥P^δg^N∥1. Below frequency K/2, steps 3.1–4.1 bound it by Cδ−1AMN+1K−θ. Above that frequency, Plancherel gives ∥P^δ∥L2({∣ξ∣>K/2})≤CK−1∥∇Pδ∥2≤CK−1δ−2; combine this with ∥gN∥2≤C. We have proved ∥Ψv−z∥∞≤C[cN+δθ0+δ−1MN+1K−θ+K−1δ−2].

6.1F1step 5.1algebra∎

Choose a=θ/(4log⁡M), N=⌊alog⁡K⌋ and δ=K−θ/4. For sufficiently large K, cN≤CKalog⁡c, MN+1≤MKθ/4, and the four terms in step 5.1 are bounded by CK−b with b=min⁡{−alog⁡c,θθ0/4,θ/2,1/2}>0. Indeed, the third term has exponent at most −θ/2 and the fourth at most −1/2 because θ≤1. The remaining bounded interval of 1≤K is absorbed by increasing C, using the uniform principal deformation bound in [F1]. This proves the result uniformly in all stated parameters and phase directions.

Depends on

Used by

Dependency tree · two levels

62 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