Alphabeta Math
TheoremStatement: 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.

Full-data uniqueness for the Euclidean Schrödinger Calderón problem

Statement

Assume the Axiom of Choice and Countable Choice. Let n≥3, let Ω⊂Rn be a bounded, nonempty, connected smooth domain, and let q1,q2∈C∞(Ω‾,R). Suppose zero is not a Dirichlet eigenvalue of either −Δ+qj, and the full Schrödinger Dirichlet-to-Neumann maps satisfy Λq1=Λq2 on all of H1/2(∂Ω). Then q1=q2 on Ω.

Facts & Assumptions

Given: AC and Countable Choice; a bounded smooth Euclidean domain in dimension n≥3; real smooth nonresonant potentials q1,q2; and equality of their full boundary maps.

[A1]

The Axiom of Choice is assumed by the finite-measure Fourier uniqueness supplier [F3].

[A2]

The Axiom of Countable Choice (ACω) is assumed by the Euclidean CGO Fourier-basis construction [F2].

[F1]

Alessandrini identities for scalar conductivity and Schrödinger DN maps and Scalar conductivity and Schrödinger Dirichlet-to-Neumann maps: the Alessandrini Statement gives the Schrödinger identity for smooth boundary values, while the DN definition gives weak boundary forms on H1/2. The exact H1 solutions used below have only H1/2 traces, so step 1.1 derives the needed extension directly from those forms.

[F2]

Euclidean complex geometrical optics solvability with an H1 correction: for each large null ζ, the equation (−Δ+q)u=0 has an exact solution u=eiζ⋅x(1+r) with ∥r∥L2=O(∣ζ∣−1∥q∥2).

[F3]

Uniqueness of finite Borel measures from their Fourier transforms: finite complex Borel measures on Rn with the same Fourier transform are equal.

Proof

Given: the data in the Statement.

1.1F1givenalgebra

Set Q=q1−q2. For exact H1 solutions uj let fj=tr⁡uj∈H1/2(∂Ω) and define the Hermitian weak forms aj(v,w)=∫Ω(∇v⋅∇w‾+qjvw‾) dx. By the weak DN definition, ⟨Λq1f1,f2⟩=a1(u1,u2). Let u~1∈H1(Ω) be the q2 solution with trace f1, which exists by nonresonant weak solvability. Then ⟨Λq2f1,f2⟩=a2(u~1,u2). Since u1−u~1∈H01(Ω) and u2 solves the q2 weak equation, a2(u1−u~1,u2)=a2(u2,u1−u~1)‾=0, where the conjugation uses real-valuedness of q2. Subtracting the two weak pairings gives ⟨(Λq1−Λq2)f1,f2⟩=∫ΩQu1u2‾ dx. The maps agree on all of H1/2(∂Ω), so this integral vanishes. This establishes the weak-trace extension of [F1] used here.

2.1A2F2givenstep 1.1algebraconstruct

Fix ξ∈Rn. Since n≥3, choose orthonormal ω1,ω2∈Rn perpendicular to ξ; when ξ=0, choose any orthonormal pair. For τ≥1, set στ=(τ2+∣ξ∣2/4)1/2 and ζ1=τω1+iστω2+ξ/2,ζ2=−τω1−iστω2+ξ/2. The orthogonality gives ζj⋅ζj=τ2−στ2+∣ξ∣2/4=0, ζ1+ζ2=ξ, and ∣ζj∣→∞. Apply [F2] directly to q1 with phase ζ1 and to q2 with phase −ζ2‾, which is also null. This gives u1=eiζ1⋅x(1+r1),u2=e−iζ2‾⋅x(1+r2),∥rj∥L2(Ω)=O(τ−1). Substitute in step 1.1. Since Q∈L2(Ω)∩L∞(Ω), ∣∫ΩQeiξ⋅x(r1+r2‾+r1r2‾) dx∣≤∥Q∥2(∥r1∥2+∥r2∥2)+∥Q∥∞∥r1∥2∥r2∥2=O(τ−1). Taking τ→∞ proves ∫ΩQeiξ⋅x dx=0 for every ξ∈Rn.

3.1A1F3givenstep 2.1algebra∎

Define the finite complex Borel measure μ(E)=∫E∩ΩQ(x) dx on Rn. It has finite total variation because Ω is bounded and Q is bounded. The identity in step 2.1 gives μ^(η)=0 for every η∈Rn (take ξ=−2πη). By [F3], μ=0. Hence ∫ERe⁡Q dx=∫EIm⁡Q dx=0 for every Borel E; applying this to the sets {Re⁡Q≥1/m}, {Re⁡Q≤−1/m}, and their imaginary-part analogues shows Q=0 almost everywhere. Continuity of Q gives Q=0 throughout Ω.

Depends on

Used by

Dependency tree · two levels

37 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