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.
The bounded measurable linear ODE has a unique affine state map
Statement
Let , , , , and . Write and for the essential suprema of their Euclidean operator norms. There is a unique absolutely continuous satisfying
Under Countable Choice it satisfies almost everywhere, and it always satisfies
For fixed , the map is affine into , and its zero-initial-state linear part is bounded from to the supremum norm.
The almost-everywhere derivative assertion uses Countable Choice, as required by the cited fundamental theorem. The integral-equation existence, uniqueness, bound, and affine-map claims do not require that axiom.
Facts & Assumptions
Given: , essentially bounded matrix classes , a control , an initial state , and the standard Lebesgue integral.
The scalar Lebesgue integral is linear and satisfies for ; it is monotone on nonnegative integrable functions. Euclidean Cauchy--Schwarz gives (The Lebesgue integral is linear on , The modulus of an integral is bounded by the integral of the modulus, Monotonicity and nonnegative homogeneity of the nonnegative integral, Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation).
The indefinite integral of an function is absolutely continuous; under Countable Choice its derivative equals the integrand almost everywhere (The indefinite integral of an function is absolutely continuous, The indefinite integral of an function is differentiable almost everywhere).
is complete in the supremum metric; the finite product is therefore complete componentwise ( is complete in the supremum metric for every nonempty compact metric space ).
If for continuous and constants , then (Gronwall's integral inequality with variable and constant coefficients).
The Lebesgue integral is linear on ; changing an integrand on a null set does not change the integral (The Lebesgue integral is linear on ).
For , the geometric series converges to (For , , and for the series diverges).
Countable Choice is assumed only for the almost-everywhere derivative conclusion (The Axiom of Countable Choice ()).
Proof
For any Lebesgue-integrable vector function with , write . If , the norm inequality is immediate. Otherwise put . Then , by [F1], linearity componentwise, and . Thus the vector integral estimate needed below holds for these Lebesgue integrands. Now put ; this follows from , , and [F5]. Choose a finite partition with on each subinterval when ; if , use . Given the already constructed value , define on . By [F2], maps continuous functions to continuous functions, and the vector-integral estimate just proved gives with .
Starting from the constant function , let . Then . By [F7], the geometric majorant has finite sum, so the iterates are Cauchy in the supremum norm. Each coordinate converges uniformly by [F3], and the finite coordinate limit is a continuous vector function . The integral estimate in step 1.1 makes continuous in the supremum norm, hence . If are two fixed points, , so . Solving the finitely many subintervals in order gives one continuous solution on , and the same uniqueness on each subinterval proves global uniqueness.
The integrand lies in . Its indefinite integral is absolutely continuous by [F2], as required in the Statement. Under [A1], the fundamental theorem in [F2] differentiates the integral equation almost everywhere and yields . The same equation is independent of the chosen representatives of by [F6].
From the integral equation and step 1.1, . Apply [F4] with and then [F5]; this gives the displayed supremum bound.
Linearity of the integral [F6] shows that a linear combination of two zero-initial-state solutions is the solution for the same linear combination of controls; uniqueness from step 2.1 makes the zero-initial-state map linear. Step 3.2 with bounds this linear map in the and supremum norms, while the fixed initial-state contribution is independent of . Hence the full map is affine and bounded as claimed.
Depends on
- Finite-horizon bounded-control linear-quadratic ODE problem
- The indefinite integral of an $L^1$ function is absolutely continuous
- The indefinite integral of an $L^1$ function is differentiable almost everywhere
- The Lebesgue integral is linear on $L^1(\mu)$
- The modulus of an integral is bounded by the integral of the modulus
- Monotonicity and nonnegative homogeneity of the nonnegative integral
- 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
- $C(K,\mathbb{R})$ is complete in the supremum metric for every nonempty compact metric space $K$
- Gronwall's integral inequality with variable and constant coefficients
- Cauchy-Schwarz inequality for $L^2$
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- For $|r| < 1$, $\sum_{k \ge 0} r^k = 1/(1-r)$, and for $|r| \ge 1$ the series diverges
Used by
- Continuous adjoint equation for the linear-quadratic ODE Definition
- A chemical-dosing model under a constant admissible dose Example
- The backward LQR adjoint equation has a unique solution Lemma
- The LQR adjoint identity gives the reduced gradient 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
Cited to discharge well-definedness by Finite-horizon bounded-control linear-quadratic ODE problem.
Dependency tree · two levels
68 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 (standard reference, not scraped)