Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-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.

Locally constant invisible spaces are Laplacian invariant

PDF p. 11: Lemma 3.4 proof (ii)

Statement

Assume the Axiom of Choice and hypothesis (H): n≥2, the nonempty compact obstacle Θ⊂Rn has smooth boundary, its exterior Ω=Rn∖Θ is connected, and Θ is non-trapping in the generalized-ray sense. Choose R>0 with Θ⊂BR(0) and fix a real-valued φ∈C∞(Rn;[0,1]) such that φ(x)=0 for ∣x∣≤R, φ(x)>0 for ∣x∣>R, and φ(x)=1 for ∣x∣≥R+1. Let T0>0 and σ∈[−2,2). Let HDσ(Ω) be the Dirichlet spectral scale, W(t)=eitΔD its evolution, and NTσ the space of initial data whose observation φW(t)v vanishes in HDσ(Ω) for every t∈[0,T], using this fixed φ.

There exist T0/2≤a<b≤T0 such that NTσ is the same finite-dimensional space N for every T∈[a,b]. For every h∈[0,b−a], W(h)N⊆N. Identifying N with its image in HDσ−2(Ω) under the canonical injective scale embedding, one has ΔDN⊆N, where ΔD:HDσ→HDσ−2 is the bounded scale extension.

Facts & Assumptions

[F1]

For the fixed R and φ in the statement, choose an auxiliary real cutoff ψ∈Cc∞(Rn;[0,1]) equal to one on BR+2(0) and supported in BR+3(0), as supplied by Control region and nested real cutoffs. The pair φ,ψ satisfies the cutoff hypotheses of Finite dimensionality of invisible spaces. Thus under Choice and (H), every NTσ formed with this fixed φ is finite-dimensional for T>0 and σ∈[−2,2). For T′≥T, the definition gives NT′σ⊆NTσ. def-se-invisible-space

[F2]

The scale is the completed spectral scale of I−ΔD. Its canonical embedding HDσ→HDσ−2 is continuous and injective, and both levels are complex Hilbert spaces. Dirichlet spectral Sobolev scale and duality Spectral cutoff cores and unitary identifications of completed scales

[F3]

The operators W(t) form a group on HDσ. For every v∈HDσ, t↦W(t)v is continuously differentiable in HDσ−2 with derivative iΔDW(t)v; ΔD is the bounded scale extension specified in the statement. Scale isometries and free Schrödinger evolution

[F4]

A finite-dimensional complex linear subspace of a complex normed space is closed for the ambient norm. A finite-dimensional normed subspace is closed

[F5]

The geometry and non-trapping convention in (H) are those of Exterior and truncated obstacle domains and Non-trapping obstacle. Full Choice is retained as an assumption of the scale and finite-dimensionality suppliers. The Axiom of Choice

Proof

[F1] For the fixed R and φ in the statement, choose an auxiliary real cutoff ψ∈Cc∞(Rn;[0,1]) equal to one on BR+2(0) and supported in BR+3(0), as supplied by Control region and nested real cutoffs. The pair φ,ψ satisfies the cutoff hypotheses of Finite dimensionality of invisible spaces. Thus under Choice and (H), every NTσ formed with this fixed φ is finite-dimensional for T>0 and σ∈[−2,2). For T′≥T, the definition gives NT′σ⊆NTσ. def-se-invisible-space

[F2] The scale is the completed spectral scale of I−ΔD. Its canonical embedding HDσ→HDσ−2 is continuous and injective, and both levels are complex Hilbert spaces. Dirichlet spectral Sobolev scale and duality Spectral cutoff cores and unitary identifications of completed scales

[F3] The operators W(t) form a group on HDσ. For every v∈HDσ, t↦W(t)v is continuously differentiable in HDσ−2 with derivative iΔDW(t)v; ΔD is the bounded scale extension specified in the statement. Scale isometries and free Schrödinger evolution

[F4] A finite-dimensional complex linear subspace of a complex normed space is closed for the ambient norm. A finite-dimensional normed subspace is closed

[F5] The geometry and non-trapping convention in (H) are those of Exterior and truncated obstacle domains and Non-trapping obstacle. Full Choice is retained as an assumption of the scale and finite-dimensionality suppliers. The Axiom of Choice

Given: Choice, (H), the fixed R and φ, T0>0 and σ∈[−2,2) as in the statement.

Goal: Find a constant interval for the invisible spaces and prove the stated flow and Laplacian invariance.

1.1F1given

Each dimension d(T)=dim⁡NTσ is a nonnegative integer. The nonempty set of these integers for T∈[T0/2,T0) has a least element; choose a in that interval attaining it and choose b with a<b<T0. For every T∈[a,b], nesting gives NTσ⊆Naσ and hence d(T)≤d(a), while minimality gives d(T)≥d(a). A subspace of a finite-dimensional space with the same dimension is the whole space. Thus all these spaces equal N:=Naσ, which is finite-dimensional.

2.1F1F3step 1.1

Let v∈N and 0≤h≤b−a. Since v∈Nbσ, its observation vanishes at every time in [0,b]. For t∈[0,a], the group law gives φW(t)W(h)v=φW(t+h)v=0, because t+h∈[0,b]. Therefore W(h)v∈Naσ=N.

3.1F2F3F4step 1.1step 2.1

Regard N as a complex linear subspace of HDσ−2 through the injective embedding. Its finite basis remains a basis of its image, so it is closed in that lower-scale norm. For 0<h≤b−a, both W(h)v and v belong to N, and hence so does (W(h)v−v)/h. Differentiability at zero in HDσ−2 makes these quotients converge to iΔDv. Closedness gives iΔDv∈N.

4.1step 3.1∎

Since N is a complex linear space, multiplication by −i shows ΔDv∈N. As v was arbitrary, ΔDN⊆N in the stated lower-scale identification. This and steps 1.1 and 2.1 prove the conclusion.

Source notes

The original article is cited for attribution of the constant-dimension and invariance argument in the proof of Lemma 3.4 on PDF page 11. The argument above uses the stated mathematical suppliers; the article's conclusion is not used as its own premise.

Depends on

Used by · 2

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.

Sources