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.
Closed pointwise box of L2 controls
Definition
Let be a bounded Lebesgue-measurable set. Let with inner product
and the corresponding norm. This is a real Hilbert space by with the integral pairing is a Hilbert space under Countable Choice The Axiom of Countable Choice ().
For bounds with almost everywhere, define the admissible box
Equalities and inequalities between controls are understood as almost-everywhere statements about their classes. The box is nonempty because it contains . When a finite-element control space is used, its cellwise-constant admissible set is the intersection of this box with the stated piecewise-constant subspace; cellwise averaging preserves the box when both bounds are constant on each control cell.
Depends on
Used by
- Linear coercive elliptic PDE control problem and reduced objective Definition
- A boundary flux control uses the H1 trace and a different control operator Example
- The alpha-zero linear box problem has a bang-bang active set Example
- A pointwise L2 box is nonempty, bounded, closed, and convex Lemma
- A pointwise L2 box is weakly sequentially closed Lemma
- L2 controls on a bounded spatial region form a separable Hilbert space Lemma
- The L2 projection onto a cellwise constant box clips cell averages Lemma
- The L2 projection onto a pointwise box is clipping Lemma
- Parabolic linear-quadratic control has an energy adjoint and reduced gradient Theorem
Dependency tree · two levels
22 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
- Eduardo Casas and Fredi Tröltzsch, Error estimates for linear-quadratic elliptic control problems (standard reference, not scraped)