Theorem 3.15 (qualitative form) — is Lipschitz on the sublevel set
ProvedFatkhullinPolyak.Flow.grad_lipschitz_on_sublevelAssume the standing assumptions: , , , and . Then is -smooth on the sublevel set for some constant : there is with
This is the property the paper calls -smoothness (§3.6, p. 9: "a function is called -smooth, if its gradient satisfies Lipschitz condition with constant "). It shows that the Lipschitz hypothesis of the main theorem can always be met.
Formalization Note The paper's Theorem 3.15 also gives an explicit value (3.8) for . That value is not claimed here, because it is false as printed: for , , , , , one has on while (3.8) gives ; for state feedback with , , , , , , is twice the value of (3.8). Only the existence of a Lipschitz constant is stated.
import Mathlib import Definitions.Def_FatkhullinPolyak_Flow_LQR
namespace FatkhullinPolyak.Flow
open Matrix
theorem grad_lipschitz_on_sublevel {n m r : ℕ}
(A : Matrix (Fin n) (Fin n) ℝ) (B : Matrix (Fin n) (Fin m) ℝ) (C : Matrix (Fin r) (Fin n) ℝ)
(Q : Matrix (Fin n) (Fin n) ℝ) (R : Matrix (Fin m) (Fin m) ℝ) (Sig : Matrix (Fin n) (Fin n) ℝ)
(hQ : Q.PosDef) (hR : R.PosDef) (hSig : Sig.PosDef) (hC : C.rank = r) (hB : B ≠ 0)
(K₀ : Matrix (Fin m) (Fin r) ℝ) (hK₀ : K₀ ∈ stabSet A B C) :
∃ L : ℝ, 0 < L ∧
∀ K ∈ sublevel A B C Q R Sig K₀, ∀ K' ∈ sublevel A B C Q R Sig K₀,
frobNorm (grad A B C Q R Sig K - grad A B C Q R Sig K') ≤ L * frobNorm (K - K') := by sorry
end FatkhullinPolyak.Flow
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting. Let
Gains are real matrices. The notions used are:
- is the set of gains with every complex eigenvalue of having negative real part.
- and are the unique solutions (or if the solution is not unique) of
- The cost is .
- is the explicit formula.
- is the Frobenius norm.
- .
Hypotheses.
- , , are positive definite (symmetric, with for ).
- .
- .
- .
Conclusion. There exists a real such that for all ,
may depend on all the data, including . The inequality is asserted for every pair of points of , whether or not the segment between them stays in . Nothing is claimed outside .
Degenerate cases.
- forces .
- If , has at most one point and both sides are .
- always contains , so it is nonempty. If it is a single point, the inequality reads .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.