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.

Quantitative forced similarity estimate for real-linear Beltrami equations

Statement

Assume the Axiom of Choice and Countable Choice. Fix 0≤κ<1 and 2<r≤pκ. Let ν,α,E be measurable and supported in D1, with ∥ν∥∞≤κ, ∥α∥∞≤B and E∈Lr. If F∈W1,r(C) is continuous, tends to zero at infinity, and satisfies ∂ˉF=ν∂F‾+αF‾+E, then ∥F∥W1,r(C)+∥F∥∞≤Cκ,reCκ,r(1+B)∥E∥r. The constants do not depend on the measurable coefficients or on the particular solution.

Facts & Assumptions

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

[F1]

The complex-linear equation ∂ˉa−η∂a=h with ∣η∣≤κ and both data supported in D1 has the solution a=C(I−ηB)−1h, with ∥a∥W1,r+∥a∥∞≤Cκ,r∥h∥r and a→0 at infinity. (Planar Cauchy and Beurling transforms and near-two Beltrami inversion)

[F2]

A continuous locally H1 solution of ∂ˉG=η∂G, with ∣η∣≤κ and compact support of η, factors through the principal quasiconformal coordinate as an entire holomorphic function; hence a bounded solution tending to zero is zero. This factorization is proved locally in the CGO construction. (Measurable-coefficient Beltrami CGO solutions and principal phases)

[A1]

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

Proof

Given: The data in the statement.

1.1A1F1givenalgebra

Define a=ν∂F‾/∂F where ∂F≠0 and a=0 otherwise, and define b=αF‾/F where F≠0 and b=0 otherwise. Then a,b are measurable, supported in D1, satisfy ∣a∣≤κ, ∣b∣≤B, and the equation becomes ∂ˉF=a∂F+bF+E. The identities also hold on the zero denominator sets, because the corresponding original terms are zero there. Let s=C(I−aB)−1b. By [F1], ∂ˉs−a∂s=b, s→0 at infinity, and ∥s∥W1,r+∥s∥∞≤CB.

2.1F1F2step 1.1algebra∎

Put G=e−sF. The weak product and composition rules follow by local smooth approximation, since both factors are continuous and bounded on compact sets and their derivatives are in Lr. The equation in step 1.1 gives ∂ˉG−a∂G=e−sE. The particular solution G0=C(I−aB)−1(e−sE) obeys ∥G0∥W1,r+∥G0∥∞≤CeCB∥E∥r, by [F1]. Both G and G0 are continuous and tend to zero at infinity; their difference is bounded and solves the homogeneous equation. By [F2], G=G0. Finally F=esG0, so the product rule gives ∥F∥W1,r+∥F∥∞≤CeCB(1+∥∇s∥r)(∥G0∥W1,r+∥G0∥∞)≤CeC(1+B)∥E∥r. This proves the estimate.

Depends on

Used by

Dependency tree · two levels

26 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