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.
Finite-horizon bounded-control linear-quadratic ODE problem
Definition
Fix a finite horizon , state and control dimensions , and the real quotient space of measurable controls modulo equality almost everywhere (The space as the quotient by null functions). Let and be equivalence classes, let , and let . Let be nonempty, compact and convex. The pointwise control set is
Let and be symmetric almost everywhere, with and almost everywhere for constants . Let be symmetric positive semidefinite. For each , its state is the unique continuous solution of the Volterra equation
The same state equation is defined for every , and the running and terminal cost on that ambient space is
The constrained problem minimizes this ambient functional over , where additional path or terminal constraints are represented by a nonempty convex weakly sequentially closed set ; with no additional state constraints, . “Weakly sequentially closed” means that every weakly convergent sequence in has its weak limit in (Weak convergence of nets and sequences). The definition asserts no optimizer or adjoint existence; the state-map well-definedness is supplied by The bounded measurable linear ODE has a unique affine state map ↗.
Depends on
Used by
- An active terminal constraint invalidates the pointwise control-only variational inequality Counterexample
- Continuous adjoint equation for the linear-quadratic ODE Definition
- Time meshes and piecewise-constant control parameterization Definition
- A bounded-actuator LQR control and its exact objective Example
- A linear-quadratic transcription with affine constraints is a convex QP Lemma
- Cell averages give a strong recovery sequence for compact convex controls Lemma
- The backward LQR adjoint equation has a unique solution Lemma
- The bounded measurable linear ODE has a unique affine state map Lemma
- The LQR adjoint identity gives the reduced gradient Lemma
- Under Countable Choice, pointwise compact convex control constraints are weakly closed in L2 Lemma
- Under Countable Choice, the LQR objective is weakly lower semicontinuous Lemma
- Weakly convergent bounded controls have uniformly convergent states Lemma
- A bounded-control linear-quadratic ODE has a unique minimizer Theorem
- LQR minimizers satisfy a feasible-set variational inequality Theorem
- Mesh-consistent LQR minimizers converge to the unique continuous minimizer Theorem
- Strong convexity converts transcription objective error into a control bound Theorem
Dependency tree · two levels
23 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- J. Monnier, Optimal Control of ODEs: The Linear-Quadratic (LQ) Case, course notes, Chapter 2 §§2.4–2.5 (standard reference, not scraped)
- W. W. Hager, Runge-Kutta methods in optimal control and the transformed adjoint system, Numerische Mathematik 87 (2000) (standard reference, not scraped)