Alphabeta Math
ExampleConstruction: AI-generatedVerification: 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.

A bounded-actuator LQR control and its exact objective

Example

Take T=1, x˙=u, x(0)=0, u(t)∈[−1,1], running cost 12u(t)2, and terminal cost 12(x(1)−1)2. The unique optimal actuator signal is the constant u∗(t)=12, and its objective is J(u∗)=14.

Facts & Assumptions

Given: The scalar problem above.

[F1]

The state is xu(t)=∫0tu(s)ds; the objective is J(u)=12∥u∥22+12(∫01u−1)2 (Finite-horizon bounded-control linear-quadratic ODE problem).

[F2]

Under Countable Choice, the backward adjoint exists uniquely and satisfies −p˙=0 and p(1)=x(1)−1 (The backward LQR adjoint equation has a unique solution, Continuous adjoint equation for the linear-quadratic ODE).

[F3]

Under Countable Choice and Dependent Choice, the reduced gradient is BTp+Ru (The LQR adjoint identity gives the reduced gradient).

[A1]

Countable Choice and Dependent Choice are assumed only for the reduced-gradient verification in step 3.1 (The Axiom of Countable Choice (ACω), The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[A2]

Exact real arithmetic is used.

Verification

1.1F1A2algebra

Put m=∫01u(t)dt. Since ∫01(u−m)2dt=∫01u2dt−m2, direct expansion gives J(u)=12∥u−m∥22+12[m2+(m−1)2]=12∥u−m∥22+(m−12)2+14.

2.1step 1.1givenalgebra

Both squared terms are nonnegative, so J(u)≥14. Equality holds exactly when u=m almost everywhere and m=12, hence exactly for u∗(t)=12 almost everywhere. This control satisfies [−1,1] and direct substitution gives J(u∗)=14. Therefore it is the unique minimizer.

3.1A1F2F3step 2.1algebra∎

The state is x(t)=t/2. By [F2], the adjoint equation is −p˙=0 with terminal value p(1)=x(1)−1=−1/2. The constant curve p(t)=−1/2 solves it, and uniqueness in [F2] makes this the adjoint. Under [A1], [F3] gives the reduced gradient g=p+u∗=0. Thus g(t)(c−u∗(t))=0 for every c∈[−1,1], so the control-only pointwise variational inequality holds with equality for this example. The optimizer and objective calculation in steps 1.1–2.1 used no choice axiom.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

31 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