Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generated
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 uk∈Uc and uk⇀u weakly in L2(0,T;Rm), then J(u)≤lim inf⁡k→∞J(uk).

Facts & Assumptions

Given: Countable Choice, the LQR data, the associated costs and states, and a weakly convergent sequence uk⇀u in real L2.

[F1]

The state and cost are those of Finite-horizon bounded-control linear-quadratic ODE problem; Q(t)⪰0, P⪰0, and R(t)⪰rI almost everywhere.

[F2]

Weak convergence of controls in Uc implies uniform convergence of their states (Weakly convergent bounded controls have uniformly convergent states).

[F3]

The pairing ⟨v,w⟩=∫0Tv(t)Tw(t)dt is well-defined on vector-valued L2 classes. Pointwise Euclidean Cauchy--Schwarz followed by scalar L2 Cauchy--Schwarz gives ∣⟨v,w⟩∣≤∥v∥2∥w∥2 (Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation, Cauchy-Schwarz inequality for L2).

[F4]

Under Countable Choice, the pointwise admissible set Uc is weakly sequentially closed (Under Countable Choice, pointwise compact convex control constraints are weakly closed in L2).

Proof

1.1A1F1F2F4algebra

By [A1] and [F4], the weak limit u belongs to Uc, so [F2] applies. Put ek=xuk−xd and e=xu−xd; their difference ek−e=xuk−xu tends to zero uniformly. Since Q is essentially bounded, the estimate ∣aTQ(t)a−bTQ(t)b∣≤∥Q(t)∥2(∥a∥2+∥b∥2)∥a−b∥2 shows that ∫0TekTQek dt→∫0TeTQe dt. The terminal terms converge by the same estimate with P and xuk(T)→xu(T).

1.2F1F3givenalgebra

Let Rv=R(⋅)v(⋅). The bounds on R imply ∥Rv∥2≤M∥v∥2 and ⟨Rv,v⟩≥0; symmetry gives ⟨Rv,w⟩=⟨v,Rw⟩. For every fixed w∈L2, ⟨Ruk,uk⟩≥2⟨Ruk,w⟩−⟨Rw,w⟩, because the difference is ⟨R(uk−w),uk−w⟩≥0. The right-hand side converges to 2⟨Ru,w⟩−⟨Rw,w⟩ by weak convergence, as [F3] makes v↦⟨Rv,w⟩=⟨v,Rw⟩ bounded. Taking the supremum over w gives lim inf⁡k⟨Ruk,uk⟩≥⟨Ru,u⟩, with equality in the supremum at w=u.

2.1step 1.1step 1.2algebra∎

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 1/2 and adding these three terms gives J(u)≤lim inf⁡kJ(uk).

Depends on

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