Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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.

Bounded-potential weak UCP

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let Ω⊆R3 be open and connected, let B∈Lloc∞(Ω;C), and let ψ∈Hloc2(Ω) satisfy Δψ=Bψ in the distributional sense on Ω (Integer-order Sobolev spaces and their norms). If ψ=0 almost everywhere on some nonempty open subset of Ω, then ψ=0 almost everywhere on Ω.

Facts & Assumptions

Given: Countable choice; a connected open set Ω⊆R3; B∈Lloc∞(Ω;C); ψ∈Hloc2(Ω) satisfying Δψ=Bψ distributionally and vanishing almost everywhere on a nonempty open subset.

[F1]

The space Hloc2(Ω) consists of functions whose weak derivatives through order two are square integrable on every relatively compact open subset. For χ∈Cc∞(Ω), u=χψ, extended by zero outside Ω, belongs to H2(R3) and Δu=χΔψ+2∇χ⋅∇ψ+(Δχ)ψ. These product identities follow by integration against test functions; the right-hand terms are in L2 on the cutoff support (Integer-order Sobolev spaces and their norms).

[F2]

For integer s≥1, τ=s+1, and compactly supported H2 functions u vanishing near 0, the Carleman estimate is ∥r−τu∥2≤(2/s)∥r−τ+2Δu∥2, r=∣x∣ (Radial Carleman estimate). Translation gives the same estimate about any center x0, with r=∣x−x0∣.

Proof

1.1givenF1F2construct

Let x0∈Ω have some neighborhood on which ψ=0 almost everywhere. Choose any R>0 with BR(x0)‾⊂Ω; no vanishing on this larger ball is assumed. Take a smooth cutoff χ supported in BR(x0), equal to one on BR/2(x0), and put u=χψ, e=2∇χ⋅∇ψ+(Δχ)ψ. By [F1], u is compactly supported H2, Δu=Bu+e, and e∈L2 has support in R/2≤r<R, where r=∣x−x0∣. The initial known zero neighborhood ensures that u vanishes near x0, exactly as required by [F2]. Local boundedness on the compact ball gives M=∥B∥L∞(BR(x0))<∞.

2.1F2step 1.1algebra

Set Xs=∥r−τu∥2, τ=s+1. All weighted norms are finite since u vanishes near the center. The estimate [F2] and the triangle inequality give Xs≤(2/s)(∥r−τ+2Bu∥2+∥r−τ+2e∥2). On the support of u one has r2∣B∣≤MR2, so the first norm is at most MR2Xs. For every integer s≥max⁡{1,4MR2} this term can be absorbed, giving Xs≤(4/s)∥r−τ+2e∥2. Since −τ+2=1−s≤0 and e is supported where r≥R/2, its norm is bounded by (R/2)−τ+2∥e∥2. This absorption uses only the modulus of the complex function B.

3.1step 1.1step 2.1algebra

Fix 0<ρ<R/2. On Bρ(x0) the cutoff is one and rτ≤ρτ, hence ∥ψ∥L2(Bρ(x0))≤ρτXs≤(4/s)(2ρ/R)s+1(R/2)2∥e∥2 for all integers s from step 2.1. The cutoff and e are fixed independently of s. Because 2ρ/R<1, the right-hand side tends to zero as s→∞, proving ψ=0 almost everywhere on Bρ(x0). Exhausting BR/2(x0) by a countable sequence of such balls proves vanishing almost everywhere on BR/2(x0). Thus any initially known zero neighborhood at a center expands to this ball for every admissible R, irrespective of the size of the initial neighborhood.

4.1step 3.1construct

Choose an initial point x0 in the given nonempty zero open subset, and let y∈Ω be arbitrary. There is a finite polygonal path γ:[0,1]→Ω from x0 to y: the subset reachable from x0 by such paths is relatively open, since a small ball around each reachable point permits an extra line segment; its complement is relatively open by the same ball argument, and connectedness forces the reachable subset to be all of Ω. The compact image K of γ has a positive distance from R3∖Ω when that complement is nonempty; if Ω=R3 choose any positive distance parameter. Choose a fixed R>0 smaller than this distance, so BR(z)‾⊂Ω for every z∈K. Uniform continuity of the finite polygonal path supplies a finite partition 0=t0<⋯<tn=1 with ∣γ(tj+1)−γ(tj)∣<R/4.

5.1step 3.1step 4.1algebra∎

Apply step 3.1 at γ(t0)=x0 to establish vanishing on BR/2(x0). Inductively, if vanishing is established on BR/2(γ(tj)), the next center γ(tj+1) lies strictly inside this ball and therefore has a zero neighborhood. Step 4.1 with the same radius R then establishes vanishing on BR/2(γ(tj+1)). Finitely many applications prove vanishing in a neighborhood of y. Thus the open union of zero neighborhoods is all of Ω. To conclude a single almost-everywhere assertion on Ω, use the countable base of rational balls: all rational balls contained in some such neighborhood cover Ω, and ψ vanishes almost everywhere on each of them. Their countable union has a null exceptional set. Only finite path constructions and countable approximation or null-set unions were used; no additional regularity, real-valuedness of B, or stronger choice hypothesis is required.

Depends on

Dependency tree · 2 levels

Sources