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.
Scalar conductivity and Schrödinger Dirichlet-to-Neumann maps
Definition
Assume the Axiom of Choice and Countable Choice. For complex boundary data, the duality pairing is linear in the dual element and conjugate-linear in its boundary test.
Let be a nonempty compact connected smooth Riemannian domain with nonempty smooth boundary. For a real-valued with at every , let be the unique weak solution of with trace , whose existence is supplied by the positive-conductivity solvability lemma. Define the full-data physical conductivity Dirichlet-to-Neumann map by where is any extension of . The weak equation makes this value independent of the extension. For smooth data, under the boundary-density identification of the conjugate-linear dual, ; this is the full physical flux convention. When with the Euclidean metric, this is the scalar Euclidean conductivity DN map.
For a real such that the only satisfying weakly is , let be the unique weak solution of with trace , whose existence follows from the nonresonant regularity lemma. Define the Schrödinger DN map by For smooth data, under the boundary-density identification of the conjugate-linear dual, this is . Equality of these operators means equality on all of , not equality for a restricted set of boundary inputs.
Definition references
Facts & Assumptions
Given: AC and Countable Choice; the compact smooth Riemannian domain; positive smooth ; a real smooth nonresonant ; and the weak solutions in the Definition.
The Axiom of Choice is assumed by the Euclidean trace-kernel and Gauss-Green suppliers [F2, F5].
The Axiom of Countable Choice () is assumed by the local weak-solution, trace-lift, and collar suppliers [F3, F4, F6, F8].
Sobolev spaces on a compact Riemannian domain with boundary: is the closure of interior compactly supported smooth functions in a fixed finite chartwise norm; the trace is defined chartwise and the fixed finite atlas admits a smooth partition of unity.
The kernel of the trace is the closure of the test functions: on a bounded Euclidean domain, an function has zero trace if and only if it belongs to the closure of compactly supported interior smooth functions.
Weak solvability of the positive scalar conductivity equation: for each boundary value, the positive-conductivity weak solution exists uniquely, its weak equation vanishes on every test, and smooth boundary data with smooth forcing give a solution smooth up to the boundary.
Smooth-manifold elliptic nonresonant solvability and regularity: under the stated trivial Dirichlet-kernel condition, the Schrödinger weak solution is unique and smooth for smooth boundary data.
The Gauss-Green integration-by-parts formula with Sobolev traces: for smooth functions on a bounded Euclidean domain, integration by parts produces the outward-normal boundary term.
A bounded right inverse of the trace, supported in a prescribed collar: each boundary datum has an extension in a smooth Euclidean chart; finite chart localization supplies such extensions on .
The trace commutes with smooth cutoffs and is chart local: multiplying by a smooth cutoff multiplies the trace by its boundary restriction, and flattening charts transport the trace to the Euclidean chart trace.
Collar neighborhood theorem: smooth boundary data extend smoothly into a collar by constant normal extension and a cutoff.
The trace operator on a bounded domain: the trace is a bounded map on and agrees with restriction for smooth functions.
The sharp trace theorem: boundedness and range in the fractional space: in the fixed boundary charts the trace is bounded from into , and the chartwise maps patch to the trace used in the Definition.
Verification
Given: the data in the Definition and two extensions of the same boundary datum .
In dimension one the trace and lift conclusions follow from the endpoint argument in [F3], and integration by parts is the fundamental theorem of calculus with counting boundary density. In higher dimensions use the Euclidean suppliers as follows. Their difference has zero trace. For dimension one, [F3] gives directly; for dimension at least two, localize by the fixed finite partition in [F1]. On each boundary chart, [F7] shows that the localized function has zero Euclidean trace after flattening; [F2] then approximates it in by compactly supported interior smooth functions. On interior charts, ordinary compactly supported mollification gives the same approximation. Pulling back and summing the finitely many approximations shows .
For the conductivity pairing, [F3] gives , since . Therefore replacing by changes the displayed pairing by zero. For the Schrödinger pairing, the same argument with the weak equation in [F4] gives . Thus both definitions are independent of the chosen extension. For each , choose a bounded lift by [F6]; Cauchy--Schwarz gives and . Hence each pairing is a continuous conjugate-linear functional of , as required for the anti-dual in [F1].
By [F3] and [F4], smooth boundary data yield solutions smooth up to . For smooth test data , choose a smooth collar extension by [F8]. In a boundary chart, write and . Apply the Euclidean Gauss-Green identity [F5] to the coordinate fluxes; summing over the finite partition gives the Riemannian boundary flux, while artificial chart boundaries cancel and the density transforms to . For the conductivity equation it yields since . For the Schrödinger equation it yields since . The extensions required for the weak pairings exist by [F6], and smooth test extensions exist by [F8].
Depends on
- Sobolev spaces on a compact Riemannian domain with boundary
- Riemannian metric and riemannian manifold
- Smooth charts, atlases, and structures with boundary
- Bounded C1 domains and their outward normals
- Classical normal derivative
- Riemannian gradient
- Laplace–Beltrami operator as the trace of the Hessian
- Riemannian volume density
- Weak solvability of the positive scalar conductivity equation
- Smooth-manifold elliptic nonresonant solvability and regularity
- The $L^p$ trace operator on a bounded $C^1$ domain
- The sharp trace theorem: boundedness and range in the fractional space
- The kernel of the trace is the closure of the test functions
- A bounded right inverse of the trace, supported in a prescribed collar
- The trace commutes with smooth cutoffs and is chart local
- Collar neighborhood theorem
- The Gauss-Green integration-by-parts formula with Sobolev traces
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- Conductivity uniqueness on a Euclidean CTA domain with simple transversal Corollary
- Anisotropic conductivity and weak Dirichlet-to-Neumann map Definition
- A partial-data configuration outside the full-data theorem Example
- Matching boundary jets without interior equality Example
- Alessandrini identities for scalar conductivity and Schrödinger DN maps Lemma
- Liouville transform and conductivity DN conjugacy Lemma
- Third linearization identity for the cubic Dirichlet-to-Neumann map Lemma
- Smooth anisotropic Calderón uniqueness from one boundary patch Open problem
- Boundary determination of all scalar conductivity jets Theorem
- Conditional uniqueness in the transversely anisotropic Calderon problem Theorem
- Full-data uniqueness for the Euclidean Schrödinger Calderón problem Theorem
Dependency tree · two levels
84 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)
- Feizmohammadi and Oksanen, An inverse problem for a semilinear elliptic equation in Riemannian geometries (2019) (standard reference, not scraped)