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, pointwise compact convex control constraints are weakly closed in L2
Statement
Assume the Axiom of Countable Choice.
Let be nonempty, compact and convex, and let be the pointwise admissible set in Finite-horizon bounded-control linear-quadratic ODE problem. If and weakly in real , then . Thus is weakly sequentially closed.
Facts & Assumptions
Given: Countable Choice, a finite horizon , a nonempty compact convex set , its pointwise admissible set , and a weakly convergent sequence in real .
Countable Choice ensures the Lebesgue outer measure construction is a measure on its sigma-algebra (The Axiom of Countable Choice (), Assuming countable choice, is a sigma-algebra containing every elementary set and is a complete measure extending elementary volume).
(Finite-horizon bounded-control linear-quadratic ODE problem). The pairing is well-defined for vector-valued classes and bounded by : apply Euclidean Cauchy--Schwarz pointwise and scalar Cauchy--Schwarz to the norm functions (Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation, Cauchy-Schwarz inequality for ).
Weak convergence means convergence under every bounded linear functional; by [F1], is bounded on whenever is measurable (Weak convergence of nets and sequences).
A continuous real function on a nonempty compact metric space attains its minimum (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).
The Lebesgue integral is linear on , and the nonnegative integral is monotone (The Lebesgue integral is linear on , Monotonicity and nonnegative homogeneity of the nonnegative integral).
Rational open boxes form a countable basis of the product topology, and on that topology is the Euclidean metric topology ( is a countable dense subset of , and rational open boxes form a countable basis, For the product topology on copies of the usual topology of is the metric topology of on , and hence also of and , so as a product and as a metric space are one space).
Under Countable Choice, Lebesgue measurable sets form a sigma-algebra and a countable union of measurable null sets is null, by countable subadditivity (Assuming countable choice, is a sigma-algebra containing every elementary set and is a complete measure extending elementary volume, Finite and countable subadditivity of measures).
Given: The set and sequence in the Statement.
Proof
Given: The set and sequence in the Statement.
For set , which is finite because is compact and hence bounded. If , [F3] gives a nearest point to . For each and , convexity gives ; minimality of implies , and division by followed by gives . Thus satisfies . If , then and . By [F5], rational vectors are dense in Euclidean , so one can choose rational close enough to that . Therefore a point belongs to exactly when for every rational vector .
Fix a rational . Every is in , so almost everywhere. For any measurable , the test function lies in because ; weak convergence, [F2], and [F4] give . If on a set of positive measure, then for some integer the measurable set has positive measure, contradicting the integral inequality with . Hence almost everywhere.
The rational vectors form a countable set by [F5], so the exceptional null sets from step 1.2 have a null union by [A1, F6]. Outside that union all rational support inequalities hold simultaneously; step 1.1 then gives almost everywhere. This is exactly .
Depends on
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Finite-horizon bounded-control linear-quadratic ODE problem
- Weak convergence of nets and sequences
- 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$
- The Lebesgue integral is linear on $L^1(\mu)$
- Monotonicity and nonnegative homogeneity of the nonnegative integral
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value
- $\mathbb{Q}^n$ is a countable dense subset of $\mathbb{R}^n$, and rational open boxes form a countable basis
- For $n \ge 1$ the product topology on $n$ copies of the usual topology of $\mathbb{R}$ is the metric topology of $d_\infty$ on $\mathbb{R}^n$, and hence also of $d_1$ and $d_2$, so $\mathbb{R}^n$ as a product and $\mathbb{R}^n$ as a metric space are one space
- Assuming countable choice, $\mathcal{L}(\mathbb{R}^n)$ is a sigma-algebra containing every elementary set and $\lambda_n$ is a complete measure extending elementary volume
- Finite and countable subadditivity of measures
Used by
- An active terminal constraint invalidates the pointwise control-only variational inequality Counterexample
- Under Countable Choice, the LQR objective is weakly lower semicontinuous Lemma
- A bounded-control linear-quadratic ODE has a unique minimizer Theorem
- Mesh-consistent LQR minimizers converge to the unique continuous minimizer Theorem
Dependency tree · two levels
93 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.3.1 (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)