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.

Euclidean complex geometrical optics solvability with an H1 correction

Statement

Assume Countable Choice. Let n≥3, let Ω⊂Rn be a bounded smooth domain contained in a ball B(0,R), and let q∈L∞(Ω,C). There are constants C>0 and τ0≥1, depending only on n, R, and ∥q∥L∞, such that for every ζ∈Cn satisfying ζ⋅ζ=0 and ∣ζ∣≥τ0, there is rζ∈H1(Ω,C) for which uζ(x)=eiζ⋅x(1+rζ(x)) solves (−Δ+q)uζ=0 distributionally in Ω, and ∥rζ∥L2(Ω)≤C∣ζ∣−1∥q∥L2(Ω),∥∇rζ∥L2(Ω)≤C∥q∥L2(Ω). The dot product in the null-phase condition is complex bilinear, and ∣ζ∣=(∑j=1n∣ζj∣2)1/2.

Facts & Assumptions

Given: Countable Choice; a bounded smooth domain Ω⊂Rn; q∈L∞(Ω,C); and a null vector ζ above the stated size threshold.

[A1]

The Axiom of Countable Choice (ACω) is assumed by the Fourier-basis supplier [F1].

[F1]

The Fourier basis and Parseval's identity on the finite torus: on a normalized n-torus, the coordinate characters form a complete orthonormal basis of L2 and satisfy Parseval's identity. Rescaling the fundamental cube and multiplying by a unit-modulus exponential preserve completeness and orthonormality.

[F2]

Integer-order Sobolev spaces and their norms, Riemannian gradient, and Laplace–Beltrami operator as the trace of the Hessian: H1 consists of L2 functions with L2 weak first derivatives, D=−i∇ has the same norm as ∇, and D2=−Δ.

Proof

Given: the data in the Statement.

1.1A1F1F2givenalgebraconstruct

Write ζ=a+ib. The null condition gives ∣a∣=∣b∣=:s=∣ζ∣/2 and a⋅b=0. Choose an orthogonal map U with Ua=se1 and Ub=se2. Work temporarily with UΩ, q∘U−1, and the phase Uζ, relabeling them Ω, q, and ζ for the construction; the Euclidean Laplacian, Lebesgue norms, and null phase are invariant under this change, and the constructed remainder is pulled back by U at the end. As Ω⊂B(0,R), choose L>max⁡{1,(R+1)/π}; then Ω⊂QL=(−πL,πL)n. Put ηk=(k+12e2)/L and wk(x)=(2πL)−n/2eiηk⋅x for k∈Zn. By [F1], these form an orthonormal basis on QL: they are the rescaled standard Fourier characters multiplied by the unitary factor eix2/(2L). For Aζ=D2+2ζ⋅D, one has Aζwk=pkwk, where pk=∣ηk∣2+2ζ⋅ηk and ∣Im⁡pk∣=2s∣k2+12∣/L≥s/L. If ∣ηk∣≤4s, then ∣pk∣≥s/L and ∣ηk/pk∣≤4L. If ∣ηk∣>4s, then ∣Re⁡pk∣≥∣ηk∣2−2s∣ηk∣≥∣ηk∣2/2, so ∣pk∣−1<1/(8s2)≤L/s and ∣ηk/pk∣<1/(2s). Thus sup⁡k∣pk∣−1≤L/s and sup⁡k∣ηk/pk∣≤CL. Define Gζf=∑kpk−1(f,wk)wk. Parseval [F1] gives ∥Gζf∥2≤(L/s)∥f∥2 and ∥∇Gζf∥2≤CL∥f∥2. For finite Fourier sums fN, the corresponding partial sums GζfN satisfy AζGζfN=fN termwise. Parseval and the multiplier bounds give fN→f in L2(QL) and GζfN→Gζf in H1(QL). Since Aζ:H1(QL)→Hloc−1(QL) continuously, passage to distributions yields AζGζf=f.

2.1F1givenstep 1.1algebraconstruct

Extend q and F:=−q by zero from Ω to QL. Multiplication by q is bounded on L2(QL), and ∥qGζ∥L2→L2≤∥q∥∞L/s. Choose τ0 large enough that s≥2L∥q∥∞ and s≥1 whenever ∣ζ∣≥τ0. Then the series F~=∑m=0∞(−qGζ)mF converges in L2(QL), satisfies (I+qGζ)F~=F, and has norm at most 2∥q∥L2(Ω). Set rζ=GζF~ and restrict it to Ω. Step 1.1 gives Aζrζ+qrζ=F=−q on Ω, as well as ∥rζ∥2≤(2L/s)∥q∥2 and ∥∇rζ∥2≤2CL∥q∥2.

3.1F2givenstep 2.1algebra∎

Since D=−i∇, conjugation gives e−iζ⋅x(−Δ+q)eiζ⋅x(1+rζ)=(D2+2ζ⋅D+ζ⋅ζ+q)(1+rζ). The null condition removes ζ⋅ζ, the constant amplitude has zero derivatives, and step 2.1 makes the remaining expression q+Aζrζ+qrζ=0. Multiplication by the smooth exponential preserves H1(Ω) for this fixed ζ, so uζ∈H1(Ω) and solves the equation distributionally. The estimates in step 2.1 have s=∣ζ∣/2, giving the asserted bounds after changing the constant.

Depends on

Used by

Dependency tree · two levels

33 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