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.

Beltrami Caccioppoli translation and Fourier-tail estimates

Statement

Assume Countable Choice. Let Dj={z∈C:∣z∣<j}, let 0≤κ<1, and let 2<r≤pκ, where pκ is a near-two inverse exponent. Put q=2r/(r−2), so 1/2=1/q+1/r. Let μ,ν be measurable, supported in D3, and satisfy ∥∣μ∣+∣ν∣∥∞≤κ. Suppose f∈W1,r(D3;C) satisfies ∂ˉf=μ∂f+ν∂f‾ almost everywhere. Fix a real ϕ∈Cc∞(D2) and extend F=ϕf by zero. Then ∥∂ˉF∥r+∥∂F∥r≤Cκ,r∥f∇ϕ∥r. For ωp(g,t):=sup⁡∣h∣≤t∥g(⋅−h)−g∥p, G=∂ˉF, and U=∥f∥W1,r(D3), one has, when 0<t≤1/2, ω2(G,t)+ω2(ϕ∂ˉf,t)≤Cκ,r,ϕU(ωq(μ,t)+ωq(ν,t)+t). For the unitary angular Fourier transform and T≥6, this implies ∥1{∣ξ∣≥T}G^∥2≤Cκ,r,ϕU(ωq(μ,3/T)+ωq(ν,3/T)+T−1).

Facts & Assumptions

Given: Countable Choice and the coefficients, solution, cutoff and exponents in the statement.

[F1]

The Beurling transform is bounded on Lr, is isometric on L2, commutes with translations, and I−μB−νB‾ is invertible on L2 and Lr with controlled inverse norm. (Planar Cauchy and Beurling transforms and near-two Beltrami inversion)

[F2]

Fourier transformation is unitary, with the usual differentiation and translation multipliers. Hölder applies to exponents 2,q,r with 1/2=1/q+1/r. Compactly supported Sobolev functions can be approximated in Sobolev norm by compactly supported smooth functions. (Plancherel theorem, Holder's inequality for integrals, including the endpoint cases, Compactly supported smooth functions are dense in W^{k,p}(R^n))

[A1]

Countable Choice is inherited through [F1]–[F2]. (The Axiom of Countable Choice (ACω))

Proof

Given: The data in the statement.

1.1A1F1F2givenalgebra

Choose χ∈Cc∞(D3) equal to 1 on a neighborhood of D‾2. The function χf, extended by zero outside D3, belongs to W1,r(C): for each weak derivative, testing against a global compactly supported smooth function and using the local product rule gives the zero extension of χ∇f+f∇χ, with no boundary term because χ vanishes near ∂D3. By [F2], choose global gn∈Cc∞(C) converging to this extension in W1,r(C). On a neighborhood of supp⁡ϕ, gn→f in W1,r, so the ordinary smooth product rule for ϕgn passes to the limit and gives F=ϕf∈W1,r(C) with ∂ˉF=ϕ∂ˉf+f∂ˉϕ and ∂F=ϕ∂f+f∂ϕ. Since r>2 and F has bounded support, F∈H1(C). In Fourier variables the two Wirtinger multipliers give ∂F=B∂ˉF: this holds first in L2 and then in Lr by the compatible Beurling extension. Setting G=∂ˉF and H=f∂ˉϕ−μf∂ϕ−νf‾ ∂ϕ‾, the Beltrami equation becomes (I−μB−νB‾)G=H. Thus [F1] gives ∥G∥r≤Cκ,r∥H∥r≤Cκ,r∥f∇ϕ∥r and ∥∂F∥r≤∥B∥r→r∥G∥r. This is the first assertion.

2.1F1F2step 1.1algebra

Write τhg=g(⋅−h). Translating the equation in step 1.1, subtracting it, and using translation commutation gives (I−μB−νB‾)(τhG−G)=(τhμ−μ)BτhG+(τhν−ν)BτhG‾+τhH−H. Inverse boundedness on L2 and Hölder therefore yield ∥τhG−G∥2≤Cκ[(∥τhμ−μ∥q+∥τhν−ν∥q)∥BG∥r+∥τhH−H∥2]. All terms are in L2: the differentiated cutoff has compact support, G∈Lr, and the coefficient translation differences are in Lq because the coefficients are bounded with fixed bounded support.

3.1F1F2step 1.1step 2.1algebra

For any smooth cutoff derivative ψ supported in D2, extend fψ by zero. It belongs to H1(C) and ∥fψ∥H1≤Cr,ψU by Hölder on the bounded support. The fundamental theorem along line segments gives ∥τh(fψ)−fψ∥2≤∣h∣∥∇(fψ)∥2 for smooth inputs; smooth approximation in [F2] gives the same inequality for this Sobolev function. Expand each coefficient product in H by τh(μfψ)−μfψ=(τhμ−μ)τh(fψ)+μ(τh(fψ)−fψ), and the analogous expression with νf‾. Hölder gives ∥τhH−H∥2≤CU(∥τhμ−μ∥q+∥τhν−ν∥q+∣h∣). Step 1.1 also gives ∥BG∥r≤CU. Substitution in step 2.1, followed by the supremum over ∣h∣≤t, proves the desired bound for G. Finally ϕ∂ˉf=G−f∂ˉϕ, and the just-proved translation bound for fψ yields the second bound.

4.1F2step 3.1algebra∎

Average ∥τhG−G∥22 over the square [−2/T,2/T]2 with normalized Lebesgue measure. Plancherel identifies the resulting multiplier as 2[1−sinc⁡(2ξ1/T)sinc⁡(2ξ2/T)], where sinc⁡(x)=sin⁡(x)/x and its value at zero is 1. If ∣ξ∣≥T, one coordinate has magnitude at least T/2, so one sinc factor has absolute value at most 1/2, while the other is at most 1. The multiplier is therefore at least 2(1−1/2)>0 on this frequency set. Every shift in the square has norm at most 22/T<3/T. Hence ∥1{∣ξ∣≥T}G^∥2≤Cω2(G,3/T). Since 3/T≤1/2, step 3.1 applies and gives the claimed tail bound.

Depends on

Used by

Dependency tree · two levels

44 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