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.
Under Countable Choice, the LQR objective is weakly lower semicontinuous
Statement
Assume the Axiom of Countable Choice.
For the data of Finite-horizon bounded-control linear-quadratic ODE problem, if and weakly in , then .
Facts & Assumptions
Given: Countable Choice, the LQR data, the associated costs and states, and a weakly convergent sequence in real .
Countable Choice is the hypothesis of the weak-closedness supplier (The Axiom of Countable Choice (), Under Countable Choice, pointwise compact convex control constraints are weakly closed in L2).
The state and cost are those of Finite-horizon bounded-control linear-quadratic ODE problem; , , and almost everywhere.
Weak convergence of controls in implies uniform convergence of their states (Weakly convergent bounded controls have uniformly convergent states).
The pairing is well-defined on vector-valued classes. Pointwise Euclidean Cauchy--Schwarz followed by scalar Cauchy--Schwarz gives (Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation, Cauchy-Schwarz inequality for ).
Under Countable Choice, the pointwise admissible set is weakly sequentially closed (Under Countable Choice, pointwise compact convex control constraints are weakly closed in L2).
Proof
By [A1] and [F4], the weak limit belongs to , so [F2] applies. Put and ; their difference tends to zero uniformly. Since is essentially bounded, the estimate shows that . The terminal terms converge by the same estimate with and .
Let . The bounds on imply and ; symmetry gives . For every fixed , , because the difference is . The right-hand side converges to by weak convergence, as [F3] makes bounded. Taking the supremum over gives , with equality in the supremum at .
The state and terminal cost terms converge by step 1.1, while the control quadratic term is lower semicontinuous by step 1.2. Multiplying by and adding these three terms gives .
Depends on
- Finite-horizon bounded-control linear-quadratic ODE problem
- Weakly convergent bounded controls have uniformly convergent states
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_2$, the parallelogram law and polarisation
- Cauchy-Schwarz inequality for $L^2$
- Under Countable Choice, pointwise compact convex control constraints are weakly closed in L2
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Dependency tree · two levels
36 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)
- S. Gros and M. Diehl, Numerical Optimal Control, draft course manuscript, Chapter 13 (standard reference, not scraped)