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.

Nonlinear control for trapping obstacle configurations

PDF p. 22: §5.2(E)

Open problem

Assume the Axiom of Choice. Let n∈{2,3} and consider a compact smooth obstacle Θ⊂Rn with connected exterior Ω=Rn∖Θ, allowing trapping. In particular, one may consider suitable configurations of disjoint strictly convex obstacles; strict convexity means that the open segment between distinct points of a body lies in its interior. For R0 with Θ⊂BR0(0), set Ω0=BR0(0)∖Θ, Γ1=∂BR0(0) and Γ2=∂Θ.

Can nonlinear control results analogous to those in the article be established for suitable trapping configurations? For example, for T>0 and s∈{1,2}, determine conditions under which sufficiently small initial and target states in Hs(Ω0) with zero trace on Γ2 can be joined by a solution in C([0,T];Hs(Ω0)) of the cubic Dirichlet problem, with control u∣Γ1∈C([0,T];Hs−1/2(Γ1)). The cubic equation is iut+Δu+λ∣u∣2u=0, with real nonzero λ; the equation is understood distributionally and boundary values as traces. An analogous question concerns the quintic nonlinearity λ∣u∣4u.

Here Hs(Ω0) uses complex scalars and the L2 Bessel-potential restriction space with its quotient norm. For j∈{1,2}, Hr(Γj), r∈{1/2,3/2}, uses the sum of squared whole-space Hr(Rn−1) norms of localized coordinate representatives in a finite smooth atlas and partition; for multiple boundary components the sum also runs over the components. The value trace is the bounded map γj:Hs(Ω0)→Hs−1/2(Γj) extending smooth restriction. Thus the inner condition is γ2u(t)=0 and the outer control is γ1u(t); initial and terminal states are values of the norm-continuous path at 0 and T. The notation C([0,T];X) means norm-continuous X-valued maps with the supremum norm.

For the boundary question put Q=(0,T)×Ω0. The distributional solution condition requires measurable representatives with u,∣u∣m−1u∈Lloc1(Q) and the identity ∫Q(−iu ∂tη+u Δxη+λ∣u∣m−1u η) dt dx=0(η∈Cc∞(Q;C)), where m=3 for the cubic question and m=5 for its quintic variant. Pairings are complex bilinear, without conjugating η. The initial, terminal and boundary conditions above are imposed separately from this interior identity.

Another possible extension asks for small-data exact internal control of the corresponding exterior equations, with a forcing φh supported away from the obstacle, in suitable state and control spaces. Exact control here means finding a control and an admissible solution joining each sufficiently small initial and target pair in the stated spaces. These are questions about suitable geometries and functional settings, not assertions that every trapping obstacle admits control or that the same spaces must suffice.

Facts & Assumptions

[F1]

Exterior and truncated obstacle domains supplies the compact smooth obstacle and truncated exterior notation. Its separately stated non-trapping part of hypothesis (H) is not imposed in this question.

[F2]

Cubic NLS and boundary control formulations supplies the cubic equation and outer Dirichlet boundary-control terminology. Linear and nonlinear internally controlled exterior systems supplies the exterior cubic and quintic equations and the cutoff forcing; it assumes The Axiom of Choice.

[F3]

A ray trapped between two convex obstacles gives a periodic reflected ray between two disjoint smooth strictly convex bodies with connected exterior. It is an example of trapping, not a controllability result.

[F4]

States compatible with the uncontrolled obstacle boundary supplies the complex restriction-quotient Hs(Ω0) convention and the zero inner trace condition, under AC. Only its smooth-obstacle geometry and function-space definitions are used here, without imposing non-trapping.

[F5]

Collar traces and extension across an artificial boundary supplies the finite-atlas boundary spaces and bounded value traces for 1≤s≤2. Apply its boundary-trace assertion to the bounded smooth Ω0 and its compact smooth boundary components. In particular it supplies H1→H1/2 and H2→H3/2, independently of any control result or non-trapping condition.

[F6]

Continuous and mixed time-space function spaces supplies the norm-continuous path convention and its supremum norm.

[F7]

Distributional equation convention for complex Schrödinger solutions supplies complex space-time test functions, distributions and distributional derivatives. Locally integrable functions as regular distributions supplies the bilinear integral pairing for the locally integrable terms. With these conventions, the minus sign on the test-function time derivative and the plus sign on its spatial Laplacian specify the displayed distributional equation. Local integrability is part of the admissible-solution formulation, not a claim that arbitrary distributions have nonlinear powers.

Status

In §5.2(E), the article presents the extension to trapping obstacles as an open question. It reports linear outer-boundary controllability with a loss of derivatives for some strictly convex trapping configurations and identifies handling that loss in the nonlinear perturbation argument as the issue for the proposed extension. The article's cited linear results are reported here as its background attribution, not imported as independently verified premises. This item records the status in the frozen article; it does not certify the present state of the literature or prove either controllability or its failure.

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