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 , let be a bounded smooth domain contained in a ball , and let . There are constants and , depending only on , , and , such that for every satisfying and , there is for which solves distributionally in , and The dot product in the null-phase condition is complex bilinear, and .
Statement references
Facts & Assumptions
Given: Countable Choice; a bounded smooth domain ; ; and a null vector above the stated size threshold.
The Axiom of Countable Choice () is assumed by the Fourier-basis supplier [F1].
The Fourier basis and Parseval's identity on the finite torus: on a normalized -torus, the coordinate characters form a complete orthonormal basis of and satisfy Parseval's identity. Rescaling the fundamental cube and multiplying by a unit-modulus exponential preserve completeness and orthonormality.
Integer-order Sobolev spaces and their norms, Riemannian gradient, and Laplace–Beltrami operator as the trace of the Hessian: consists of functions with weak first derivatives, has the same norm as , and .
Proof
Given: the data in the Statement.
Write . The null condition gives and . Choose an orthogonal map with and . Work temporarily with , , and the phase , relabeling them , , 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 at the end. As , choose ; then . Put and for . By [F1], these form an orthonormal basis on : they are the rescaled standard Fourier characters multiplied by the unitary factor . For , one has , where and . If , then and . If , then , so and . Thus and . Define . Parseval [F1] gives and . For finite Fourier sums , the corresponding partial sums satisfy termwise. Parseval and the multiplier bounds give in and in . Since continuously, passage to distributions yields .
Extend and by zero from to . Multiplication by is bounded on , and Choose large enough that and whenever . Then the series converges in , satisfies , and has norm at most . Set and restrict it to . Step 1.1 gives on , as well as and .
Since , conjugation gives The null condition removes , the constant amplitude has zero derivatives, and step 2.1 makes the remaining expression . Multiplication by the smooth exponential preserves for this fixed , so and solves the equation distributionally. The estimates in step 2.1 have , 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
- Mikko Salo, Calderon problem, full lecture notes (2008) (standard reference, not scraped)