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

Theorem 1.4: linearized control around a trajectory

PDF p. 5: Theorem 1.4; PDF p. 19: Proof of Theorem 1.4

Statement

Assume the Axiom of Choice and hypothesis (H): n≥2, Ω=Rn∖Θ is the connected exterior of a nonempty compact obstacle with smooth boundary, and Θ is non-trapping, meaning that every generalized reflected ray leaves every compact set in finite time. Let T>0 and λ∈R∖{0}. Assume (W): w∈C([0,T];HD2(Ω)∩W2,∞(Ω)) solves iwt+Δw+λ∣w∣2w=0 distributionally, with the homogeneous Dirichlet condition encoded by HD2(Ω)=H2(Ω)∩H01(Ω).

Choose R>0 with Θ⊂BR(0) and the real smooth cutoff φ of Control region and nested real cutoffs, zero for ∣x∣≤R, positive for ∣x∣>R, and equal to one for ∣x∣≥R+1. Assume (UCPw): an adjoint solution v∈C([0,T];H01(Ω)) of ivt+Δv+2λ∣w∣2v−λw2v‾=0 that vanishes on (0,T)×{x∈Ω:∣x∣>R} is identically zero.

For s∈{1,2} and arbitrary z0,zT∈HDs(Ω), there is a control h∈C([0,T];HDs(Ω)) and a corresponding solution z∈C([0,T];HDs(Ω)) of

izt+Δz+2λ∣w∣2z+λw2z‾=φh,z∣∂Ω=0,z(0)=z0,

such that z(T)=zT. Here HD1(Ω)=H01(Ω), and continuity is in the relevant spectral norm. The solution is in the mild class of Real HUM operator for the trajectory linearization; no restriction to dimensions two and three is imposed on this linear statement.

Facts & Assumptions

[F1]

Under Choice and (H), (W), and (UCPw), Coercivity and bounded trajectory control operator gives, for E=HDs(Ω) and s∈{1,2}, a bounded real-linear map Gw:E×E→C([0,T];E) selecting a control that steers the linearized system between the prescribed endpoints.

[F2]

In Real HUM operator for the trajectory linearization, the selected control is Gw(x0,xT)=ha, where a=Sw−1(x0−P(0,T)xT); the backward controlled solution starts at Swa and ends at zero, and the homogeneous evolution P(t,T)xT ends at xT. The equation and cutoff are those of Linearized equation and its real-duality adjoint and Control region and nested real cutoffs.

Proof

Given: The assumptions and endpoints in the statement.

Goal: Construct a continuous control and a mild solution with the two prescribed endpoints.

1.1givenF1F2F3

Put E=HDs(Ω) and set h=Gw(z0,zT). The hypotheses of F1 are exactly those assumed, so h∈C([0,T];E). In F2 set a=Sw−1(z0−P(0,T)zT); the inverse exists by F1. The corresponding backward controlled solution za belongs to C([0,T];E), has za(T)=0, and has za(0)=z0−P(0,T)zT.

2.1F2F3step 1.1∎

Define z(t)=za(t)+P(t,T)zT. By the real linearity of the equation and the mild evolution in F2, this is a mild solution with control h, and it is continuous in E. At time zero the two terms sum to z0; at time T they sum to zT. The scale and boundary conventions in F3 give the stated formulation.

Source notes

The original article is cited for attribution of Theorem 1.4 and its HUM method. The argument above applies the independently stated local control-operator proposition; it does not take the article's theorem as a premise.

Depends on

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