Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4, proof of Theorem 4.1 (Well definedness), p. 1722 — lifting: ∥z−Πk⋯Π1y0∥k≤r⇒z∈Πk⋯Π1{∥y−y0∥0≤r}\|z-\Pi^k\cdots\Pi^1y^0\|_k\le r\Rightarrow z\in\Pi^k\cdots\Pi^1\{\|y-y^0\|_0\le r\}∥z−Πk⋯Π1y0∥k​≤r⇒z∈Πk⋯Π1{∥y−y0∥0​≤r}

Proved
RealTimeIter.Contract.mem_projTo_ball_of_dist

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

compatible-normsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1real-time-iteration

Let ∥⋅∥k\|\cdot\|_k∥⋅∥k​ be compatible norms, y0∈Rn0y^0\in\mathbb R^{n_0}y0∈Rn0​, k∈Nk\in\mathbb Nk∈N, z∈Rnkz\in\mathbb R^{n_k}z∈Rnk​ and r∈Rr\in\mathbb Rr∈R. If ∥z−Πk⋯Π1y0∥k≤r\|z-\Pi^k\cdots\Pi^1y^0\|_k\le r∥z−Πk⋯Π1y0∥k​≤r, then

z∈Πk⋯Π1{y∈Rn0 ∣ ∥y−y0∥0≤r}.z\in\Pi^k\cdots\Pi^1\big\{y\in\mathbb R^{n_0}\ \big|\ \|y-y^0\|_0\le r\big\}.z∈Πk⋯Π1{y∈Rn0​ ​ ∥y−y0∥0​≤r}.

The witness is y′:=y0+(Πk⋯Π1)T(z−Πk⋯Π1y0)y':=y^0+(\Pi^k\cdots\Pi^1)^T(z-\Pi^k\cdots\Pi^1y^0)y′:=y0+(Πk⋯Π1)T(z−Πk⋯Π1y0), for which ∥y′−y0∥0=∥z−Πk⋯Π1y0∥k\|y'-y^0\|_0=\|z-\Pi^k\cdots\Pi^1y^0\|_k∥y′−y0∥0​=∥z−Πk⋯Π1y0∥k​ by compatibility of the norms.

With z=ykz=y^kz=yk and r=∥Δy0∥0/(1−δ0)r=\|\Delta y^0\|_0/(1-\delta_0)r=∥Δy0∥0​/(1−δ0​) this places the real-time iterates in the projections of the ball B0B_0B0​, which is (4.2).

Preamble
import Mathlib
import Definitions.Def_RealTimeIter_Contract_Problem
import Definitions.Def_RealTimeIter_Contract_Iteration
Formal statement
namespace RealTimeIter.Contract

theorem mem_projTo_ball_of_dist (P : OCP) (ν : CompatNorms P) (y0 : PD P 0) (k : ℕ)
    (z : PD P k) (r : ℝ) (hz : ν.nrm k (z - projTo P k y0) ≤ r) :
    z ∈ projTo P k '' {y | ν.nrm 0 (y - y0) ≤ r} := by sorry

end RealTimeIter.Contract
Source
Diehl, Bock, Schlöder, A real-time iteration scheme for nonlinear optimization in optimal feedback control, SIAM J. Control Optim. 43 (2005), p. 1722, §4, proof of Theorem 4.1 (Well definedness), the point y′ := y^0 + (Π^k⋯Π^1)^T(y^k − Π^k⋯Π^1 y^0)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me