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.

Logarithmic zero separation for perturbed scattering phase equations

Statement

Assume the Axiom of Choice and Countable Choice. Fix B,C>0, 0<b<1, and a parameter 0<δ≤1/2. Let g∈C1(C;C) and ℓ∈C∖{0}, and suppose g(0)=0 and ∣g(k)−ℓk∣≤C∣k∣1−b(∣k∣≥1). Suppose distributionally ∂ˉg=σg+E, where σ is measurable, ∥σ∥∞≤B and E∈C1, and for every k∈C, ∣E(k)∣≤CδeC∣k∣,∣∇E(k)∣≤CeC(1+∣k∣). There exist D>0 and δ0∈(0,1/2), depending only on B,C,b, such that ∣ℓ∣≥D[log⁡(1/δ)]−b,0<δ<δ0⟹g(k)≠0 for every k≠0. If E=0, the same conclusion holds for every ℓ≠0, without a threshold condition.

Facts & Assumptions

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

[F1]

A compactly supported bounded coefficient has a Cauchy transform with the stated distributional derivative and one-half Hölder regularity; the transform of compactly supported one-half Hölder data has bounded first derivatives. The constants for a support disk of radius R≥1 grow at most as a fixed power of R, by dilation to a fixed disk. (Planar Cauchy and Beurling transforms and near-two Beltrami inversion, The fixed-support Cauchy transform and its Hölder bounds)

[F2]

A distribution with zero ∂ˉ derivative is holomorphic: applying ∂ makes it harmonic, so Weyl regularity applies and the Cauchy–Riemann equation concludes. A holomorphic function's boundary winding counts its zeros with multiplicity; winding is invariant under nonvanishing homotopy. A nonvanishing holomorphic function satisfies the minimum-modulus principle. (Weyl's lemma for the Laplacian, The argument-principle integral is the winding number of the image cycle, Winding number identifies the fundamental group of C times with the integers, Minimum modulus principle for a nowhere-zero holomorphic function)

[A1]

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

Proof

Given: The data in the statement.

1.1A1F1F2givenalgebra

Set λ=∣ℓ∣ and choose R=max⁡{1,(8C/λ)1/b}. Then for ∣k∣≥R, ∣g(k)−ℓk∣≤(λ/8)∣k∣, so g is nonzero there and its restriction to ∣k∣=R has winding one, by the straight homotopy to ℓk. Choose a smooth real cutoff χR equal to 1 on DR, supported in D2R, with derivative bounded by C/R, and set s=C(σχR). Direct integration of its kernel gives ∥s∥∞≤CBR. The L4 Cauchy estimate in [F1] gives a one-half Hölder bound at most CBR1/2. These estimates hold independently of the regularity of σ.

2.1F1step 1.1algebra

Put H=e−sEχR and S=CH−CH(0). On D2R the hypotheses give ∥E∥∞≤Cδe2CR and Lip⁡(E)≤CeC(1+2R). The elementary estimate ∣E(x)−E(y)∣≤min⁡{2∥E∥∞,Lip⁡(E)∣x−y∣} implies [E]C0,1/2≤Cδ1/2eC′R on that disk. Combine this with step 1.1 and the cutoff product estimate to get ∥H∥C0,1/2(C)≤Cδ1/2eC′R; the smooth cutoff vanishes before leaving D2R, so extension by zero retains this bound after increasing the constant. By [F1] and dilation, ∥∇S∥∞≤Cδ1/2eC1R, absorbing polynomial powers of R into the exponential. Also S(0)=0, so ∣S(k)∣≤Cδ1/2eC1R∣k∣. If E=0, take S=0 and these bounds hold with zero right side.

3.1F1F2step 1.1step 2.1algebra

Define F=e−sg−S. The distributional product rule, justified by the locally Sobolev Cauchy gauge and smooth approximation, gives ∂ˉF=e−s(1−χR)(σg+E), hence F is holomorphic on DR by [F2], and F(0)=0. Suppose Cδ1/2e(C1+CB)R≤λ/8. On ∣k∣=R, step 1.1 gives ∣e−sg∣≥(7/8)λRe−CBR and step 2.1 makes ∣S∣≤(1/8)λRe−CBR. Thus F is nonzero on that boundary, has ∣F∣≥(3/4)λRe−CBR there, and is homotopic there to e−sg, whose winding is one: e−s has a continuous logarithm on the disk, so contributes winding zero. Since F is continuous on D‾R, this positive boundary lower bound and compactness of the circle give a zero-free inner collar: choose ρ<R so F is nonzero on {ρ≤∣k∣≤R}. The circles ∂Dρ and ∂DR are homotopic through this collar in C∖{0}, so F∣∂Dρ also has winding one. The function F is holomorphic on a neighborhood of D‾ρ, and [F2] applied to this inner circle gives exactly one zero counted with multiplicity in Dρ. The collar has no zeros, so this is the full zero count in DR. Since F(0)=0, it is simple and there are no others. Consequently H(k):=F(k)/k, with its holomorphic value at 0, is nonvanishing on DR and continuous and nonvanishing on D‾R. Its modulus attains a minimum on the compact closed disk. If that minimum occurs in the interior, the minimum-modulus principle [F2] makes H constant; otherwise it occurs on the boundary. In either case the boundary lower bound gives ∣H(k)∣≥(3/4)λe−CBR throughout DR. Step 2.1 now yields ∣F(k)+S(k)∣≥(5/8)λe−CBR∣k∣ for 0<∣k∣<R. Hence g=es(F+S) has no zero except zero inside this disk, and step 1.1 excludes all the exterior zeros. If E=0, the same proof works for every λ>0.

4.1step 3.1algebra∎

It remains to ensure the displayed smallness condition. Write L=log⁡(1/δ). If λ≥DL−b, then R≤1+(8C/D)1/bL. Choose D large enough that (C1+CB)(8C/D)1/b≤1/4. For large L, the left side of the smallness condition is at most C′e−L/4, while its right side is at least (D/8)L−b. Since e−L/4Lb→0, there is a fixed L0 for which the condition holds whenever L≥L0. Put δ0=min⁡{1/4,e−L0}. Step 3.1 then proves the asserted implication and its zero-error version.

Depends on

Used by

Dependency tree · two levels

60 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