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.
Time-dependent Dirichlet-to-Neumann map for the wave equation
Definition
Assume Countable Choice. Let be a compact, connected, nonempty smooth Riemannian manifold with smooth boundary, let , and write and . Let be independent of time, and let . Write for smooth Dirichlet data compactly supported away from the temporal endpoints. Assume that for every the zero-initial-data Dirichlet problem , , has a unique solution . Define the full time-dependent Dirichlet-to-Neumann map by where is the outward unit normal. Also assume that for every the terminal-data Dirichlet problem , , has a unique solution , and define The Green boundary pairing is the bilinear pairing ; the classical normal trace is in for each stated solution class. Equality of two forward maps means equality on every over the whole time interval , with the analogous convention for terminal maps.
Definition references
Well-definedness
The energy theorem proves existence and uniqueness for the homogeneous-boundary lifted problem and, in its proof's final step, smoothness on the closed cylinder for every admitted smooth time-compact input. Adding the smooth lift therefore gives the asserted solution. Its energy uniqueness implies uniqueness among classical solutions. Time reversal gives the terminal solution. The Green-and-lifting lemma bounds its classical normal trace in . Thus both displayed maps are defined on every element of .
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
- Mikko Salo, On geometric inverse problems and microlocal analysis (full author lecture notes, arXiv:2312.08123v1) (standard reference, not scraped)
- Medet Nursultanov and Lauri Oksanen, Introduction to inverse problems for hyperbolic PDEs (full lecture notes, arXiv:2311.06020v2) (standard reference, not scraped)