Alphabeta Math
Open problemQuestion: AI-adaptedProof: Not applicable
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.

Question B prime: outer boundary control

PDF p. 2: Question B′

Open problem

Assume countable choice. Let n≥2 and let Θ⊂Rn be a nonempty compact obstacle with smooth boundary, connected exterior Ω=Rn∖Θ, and the non-trapping property of Non-trapping obstacle: every complete admissible generalized reflected ray x:R→Ω‾, parametrized by physical time at unit speed, leaves each compact set in finite forward time. Choose R0>0 with Θ⊂BR0(0), and set Ω0=BR0(0)∖Θ, Γ1=∂BR0(0) and Γ2=∂Θ.

For given s≥0, T>0 and arbitrary u0,u1∈Hs(Ω0), can one find a control h on Γ1×(0,T) and a solution u∈C([0,T];Hs(Ω0)) with u(0)=u0 and u(T)=u1 to the cubic equation iut+Δu+λ∣u∣2u=0, where λ∈R∖{0}, satisfying either the Dirichlet conditions u=h on Γ1 and u=0 on Γ2, or the Neumann conditions ∂νu=h on Γ1 and ∂νu=0 on Γ2?

Here Hs(Ω0) is the restriction space of Hs(Rn), equipped with the infimum extension norm. The path space consists of norm-continuous functions of time. The normal ν is outward from Ω0. The question leaves the control class and any weak interpretation of the boundary conditions to a formulation in which they are meaningful; it does not assert trace existence for arbitrary states.

Justification

Only the function-space formulation is justified here. By Real-order Bessel-potential completion Hˢ, under Countable Choice the whole-space completion Hs(Rn) is complex Banach. For s≥0, Restriction Bessel-potential spaces on polyhedral domains supplies its linear injection ιs into L2(Rn) with ∥ιsF∥2≤∥F∥Hs. Set RF=(ιsF)∣Ω0. Restrictions and vector operations are well-defined on almost-everywhere classes by Complex Holder, Minkowski, and the quotient norm. Monotonicity of the nonnegative integral in Monotonicity and nonnegative homogeneity of the nonnegative integral gives ∥RF∥L2(Ω0)2≤∥ιsF∥L2(Rn)2≤∥F∥Hs(Rn)2. Consequently R is bounded and linear. Its kernel M is closed: if Fj∈M and Fj→F in Hs, then ∥RF∥2=∥R(F−Fj)∥2≤∥F−Fj∥Hs→0, so RF=0. Two extensions have the same restriction precisely when their difference lies in M. The displayed infimum-extension norm in the question is therefore the quotient norm of Hs(Rn)/M. Under the stated Countable Choice, A quotient of a Banach space by a closed subspace is Banach makes it a definite complete norm. This verifies the Banach-target hypothesis of Continuous and mixed time-space function spaces for the path space used in the question. No boundary condition is built into this restriction quotient, and this argument makes no controllability assertion.

Status

Here the ray quantifier uses complete curves defined for all real times, as in the non-trapping supplier; locally admissible ray segments are not separately quantified over, and no theorem extending every segment to a complete ray is assumed.

The frozen v2 article poses this question with arbitrary endpoints. It reports a positive local Dirichlet result for n∈{2,3} and s∈{1,2}, for sufficiently small endpoint data satisfying the obstacle-boundary compatibility condition, and for every T>0; it discusses the Neumann problem separately. This is a restricted result, not a claimed answer to the full question above. The question is recorded as unresolved in the article; no independent current-status review is claimed here.

Remarks

Exact controllability means that every pair of endpoints in the specified admissible set can be joined by an admissible control and solution. The article's question uses all of Hs(Ω0) as its endpoint set, whereas any rigorous answer must specify the admissible control and solution classes and the meanings of the boundary conditions.

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