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 , , and . Let be measurable, supported in , with and for . For and , let be the principal quasiconformal solution of There exist and , depending only on , such that Both constants are uniform in , the direction of and its unimodular factor .
Statement references
Facts & Assumptions
Given: The Axiom of Choice and Countable Choice and the coefficient and parameters in the statement.
The Beurling transform has norm on , is bounded on every strict , and commutes with translations. One can choose so that . The Cauchy transform and near-two inverse identify the principal solution as , where is supported in . (Planar Cauchy and Beurling transforms and near-two Beltrami inversion, Principal Beltrami solutions and uniform inverse-gradient integrability)
Plancherel and Fourier inversion hold; convolution becomes a Fourier product. Young's convolution inequality holds, including . (Plancherel theorem, Fourier transform turns L1 convolution into multiplication, L1 Fourier inversion with an integrable transform, Young's convolution inequality under Countable Choice)
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)
The Axiom of Choice and Countable Choice are used at [F1]–[F3]. (The Axiom of Choice, The Axiom of Countable Choice ())
Proof
Given: The data in the statement.
Write , , and . The Neumann series converges in by [F1]. For and , one has and . Also , because . All these functions have support in . Define . Then and , where . This is a translation-invariant Fourier multiplier, and , since the two modulation factors have modulus one.
Put , so , and . Iteration of the product norm gives . The translation product identity and Hölder give . By translation commutation and the norm one, the second term is at most . For , bounded support gives . Induction therefore yields for : the two induction contributions are bounded by and , whose sum is at most after increasing the fixed constant.
For any function and , averaging over and using Plancherel gives the multiplier . On , one sinc factor has absolute value at most ; the multiplier is bounded below by a positive absolute constant. Hence . Since is the shifted transform of by , the disk samples only at frequencies at least . Step 2.1 therefore gives, when , , by summing the geometric upper bounds and discarding the beneficial factors .
Choose equal to one on , and set for , with arbitrary value at zero. Thus is compactly supported and belongs to for every , although it is singular at zero. On , convolution equals . The latter is holomorphic outside , continuous everywhere and tends to zero at infinity, so [F3] shows that a supremum estimate on controls its global supremum. Let , , and for a fixed smooth nonnegative mollifier. Then , , and . For the first assertion, split a translation difference of into disks of radius at its two singularities and their complement. Hölder integration of on the disks gives the power ; off them use the derivative bound and integrate its -power from to the fixed cutoff radius, giving the same power. Integrating this estimate against proves the first bound. The other two follow from Young applied to and the scaled norms of and its derivative.
The tail has supremum at most , and has supremum at most , by step 4.1 and the bounds of step 1.1. Fourier inversion and Cauchy–Schwarz bound the remaining term by . Below frequency , steps 3.1–4.1 bound it by . Above that frequency, Plancherel gives ; combine this with . We have proved .
Choose , and . For sufficiently large , , , and the four terms in step 5.1 are bounded by with . Indeed, the third term has exponent at most and the fourth at most because . The remaining bounded interval of is absorbed by increasing , using the uniform principal deformation bound in [F1]. This proves the result uniformly in all stated parameters and phase directions.
Depends on
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Planar Cauchy and Beurling transforms and near-two Beltrami inversion
- Principal Beltrami solutions and uniform inverse-gradient integrability
- Plancherel theorem
- Young's convolution inequality under Countable Choice
- Fourier transform turns L1 convolution into multiplication
- L1 Fourier inversion with an integrable transform
- Maximum modulus principle with boundary and infinity control
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
- Faraco and Prats, Characterization for stability in planar conductivities (standard reference, not scraped)