Alphabeta Math
DefinitionDefinition: AI-generatedProof: 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.

Reachability and observation vocabulary for controlled evolutions

Definition

Fix T>0. All normed spaces below are over a specified scalar field K∈{R,C}; completeness is required only when stated. Let X and U be Banach spaces over the same scalar field, with X the state space and U the control space; a Banach space is a normed vector space complete in its norm metric. A specified controlled evolution supplies a set E⊆X of admissible endpoints and a relation RT⊆E×U×E. The assertion (x0,h,x1)∈RT means that an admissible solution for control h starts at x0 and ends at x1 at time T. The equation, solution class, control restrictions and endpoint traces are part of the specified evolution, not consequences of this definition.

The evolution is exactly controllable at time T on E if for every x0,x1∈E there is h∈U with (x0,h,x1)∈RT. If 0∈E, it is null controllable at time T on E if for every x0∈E there is h∈U with (x0,h,0)∈RT.

For a prescribed admissible reference solution w with endpoints w(0),w(T)∈E, local exact controllability near w at time T means that some δ>0 has the following property: every x0,x1∈E satisfying ∥x0−w(0)∥X<δ and ∥x1−w(T)∥X<δ admits an h∈U with (x0,h,x1)∈RT.

When E=X, a bounded linear endpoint-to-control operator is a linear map G:X×X→U such that (x0,G(x0,x1),x1)∈RT for every pair and, for some C≥0, ∥G(x0,x1)∥U≤C(∥x0∥X+∥x1∥X) for every pair. Thus the product is equipped with the sum norm. This is a selection of steering controls; its existence is an additional assertion about the evolution.

For a specified adjoint evolution, let Z be the normed space of its admissible initial states, let Y be a normed observation space, and let O:Z→Y send an initial state to its observation. An observability inequality is an estimate ∥z∥Z≤C∥Oz∥Y for every z∈Z, with a constant C>0 independent of z. The adjoint evolution and observation map are supplied by the application; the term alone asserts neither their existence nor a relation to controllability.

For a specified damped evolution with solutions u(t) in a normed state space X for all t≥0, exponential stabilization to zero on a specified class of initial data means that there are constants C,c>0, uniform over that class and over t≥0, such that ∥u(t)∥X≤Ce−ct∥u(0)∥X. This terminology asserts no decay estimate for an unspecified equation and no equivalence with observability.

The following are local terminology conventions for comparison remarks, not assertions that any equation has the stated properties. For an evolution on a specified spatial set D and a specified region ω⊆D, internal control in ω means that the actuator enters the equation as a source fh(t,x) which is zero for x∈D∖ω; any boundary data are prescribed independently of the control h. The solution class specifies the meaning of equality and of localization. This definition does not assert that such a source steers any endpoints.

A control or stabilization statement is called semi-global in the state norm here when it holds on each prescribed bounded set of admissible states, with its stated parameters permitted to depend on that bound. More explicitly, put ER={x∈E:∥x∥X≤R} for R>0. For a family of controlled evolutions specified at positive times, semi-global exact controllability means that for every R>0 there is a time TR>0 such that every x0,x1∈ER admits an admissible control with (x0,h,x1)∈RTR; any asserted control estimates and their constants must also be specified on ER. A semi-global stabilization statement similarly specifies its decay assertion on each bounded set of admissible initial states, with the asserted constants allowed to depend on R. Additional hypotheses remain those of the specified statement. No time, control bound or decay constant uniform over all R is implied.

For a specified damped or feedback evolution with normed state space X and solution time domain [0,∞), an equilibrium is a state x∗∈X for which the constant trajectory u(t)=x∗ for all t≥0 is an admissible solution of that same evolution. Admissibility includes the specified equation, boundary conditions and fixed damping or feedback law. This definition does not assert the existence of an equilibrium.

For that evolution and an equilibrium x∗∈X, stabilization toward x∗ on an admissible class means that every solution in that class satisfies ∥u(t)−x∗∥X→0 as t→∞. A quantitative stabilization statement must specify its decay estimate and the class over which the estimate is uniform. The exponential stabilization condition below is one such quantitative assertion when x∗=0.

For a specified equation and a specified class S of solutions on a domain Q, with a specified observation subset O⊆Q, a unique-continuation implication from O means u∣O=0⟹u=0 on Q for every u∈S. The equation and solution class must specify the meaning of vanishing and restriction, including any time interval and any equivalence-class convention. This defines the implication as a property; it does not assert that it holds for an unspecified equation or solution class.

Justification

The state and control spaces are definite normed spaces with complete norm metrics by Banach space. Once the evolution specifies E and RT, exact and null controllability are predicates with explicit quantifiers over those sets; the local version uses the specified reference endpoints and the norm balls in X. No uniqueness of solutions or choice of a solution map is required.

The sum of the two endpoint norms is a norm on X×X: positivity and homogeneity follow componentwise, and the triangle inequality follows by adding the two component inequalities. Hence the displayed condition on G is exactly boundedness of a linear operator for this product norm, in the sense of A bounded linear operator between normed spaces. The steering condition is separately imposed and is not implied by boundedness.

The observation inequality and stabilization condition are definite predicates once their respective normed spaces, maps, solution classes and constants are specified. The general real and complex normed spaces used here and in the equilibrium and qualitative stabilization clauses are understood in the sense of A norm on a real vector space, the induced metric, and the dictionary with the metric axioms and Complex norm and complex normed space, respectively; these uses impose no completeness requirement. Their inequalities make the dependence on the data and the required uniformity explicit. None of these definitions proves existence, well-posedness, a steering operator, an observation estimate, or a decay theorem.

The added internal-control and unique-continuation clauses are local definitions with their spatial sets, solution classes, sources and equality conventions supplied as data. They invoke no continuation theorem and no controllability theorem. The semi-global convention restricts the already specified endpoint relation to the explicitly defined norm-bounded subsets ER; its quantifier order permits different parameters for different bounds. The equilibrium convention tests whether a specified constant trajectory is admissible for the supplied evolution on [0,∞); it needs no solution uniqueness or independent existence theorem. The qualitative stabilization convention uses the same state norm and an equilibrium in this sense. These conventions add no existence assertion or equivalence with observability.

Depends on

Used by · 16

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.