Monotonicity of the discrete-time Riccati operator on the positive semidefinite cone
ProvedBertsekasDP.riccati_map_monotoneLet be , be , be , and let be . Write
for the discrete-time Riccati operator. If and are positive semidefinite and in the Loewner order, then
The operator therefore preserves the order of the positive semidefinite cone. This is the workhorse behind every convergence argument for the Riccati recursion: it makes the iterates started from nondecreasing, it bounds them above by any fixed point, and it lets one sandwich an arbitrary starting point between two controlled sequences.
The reason it holds is that is the minimum over feedback gains of , an expression that is itself monotone in by congruence, and a minimum of monotone functions is monotone.
Formalization Note Mathlib carries no Loewner order on matrices, so is stated as (P' - P).PosSemidef, and likewise for the conclusion. Positive semidefiniteness in Mathlib includes symmetry. The matrix inverse is Mathlib's total inverse; under and the matrix is positive definite, hence genuinely invertible, so the formula is the intended one.
import Mathlib import Definitions.Def_BertsekasRiccatiMap open Matrix
namespace BertsekasDP
theorem riccati_map_monotone {n m : ℕ}
(A : Matrix (Fin n) (Fin n) ℝ) (B : Matrix (Fin n) (Fin m) ℝ)
(Q : Matrix (Fin n) (Fin n) ℝ) (R : Matrix (Fin m) (Fin m) ℝ)
(P P' : Matrix (Fin n) (Fin n) ℝ)
(hP : P.PosSemidef) (hP' : P'.PosSemidef) (hR : R.PosDef)
(hle : (P' - P).PosSemidef) :
(BertsekasRiccatiMap A B Q R P' - BertsekasRiccatiMap A B Q R P).PosSemidef := by sorry
end BertsekasDP