Lemma 10.3.3 — finite Krylov membership criterion
DisprovedPutermanMDP.Sensitive.krylov_membershipLet be a real matrix of rank , let have dimension , and let . The printed statement asserts
This is the linear-algebra statement used by the chapter's finite-determination argument. It is retained as printed; FINDINGS F1 gives a counterexample and a disproof is expected.
Formalization Note Rank and dimension are computed from and , respectively; no invariance assumption is added.
import Mathlib
namespace PutermanMDP.Sensitive
/-- Printed Lemma 10.3.3, retained faithfully; FINDINGS F1 gives a counterexample. -/
theorem krylov_membership (m : ℕ) (H : Matrix (Fin m) (Fin m) ℝ)
(U : Submodule ℝ (Fin m → ℝ)) (x : Fin m → ℝ)
(h : ∀ k : ℕ, 1 ≤ k → k ≤ min H.rank (Module.finrank ℝ U) →
(H ^ k).mulVec x ∈ U) :
∀ k : ℕ, 1 ≤ k → (H ^ k).mulVec x ∈ U := by sorry
end PutermanMDP.Sensitive
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let , let be a real matrix, let be a linear subspace of , and let . Write for the dimension of the column space of , and for the dimension of .
Hypothesis. for every integer with
Conclusion. for every integer .
Degenerate cases. If , the hypothesis is vacuous, and the statement asserts for every and every . Two cases arise:
- : then , so the conclusion is immediate.
- : then the statement asserts for every and every . Taking , this says is the zero matrix, for every .
If , every vector is zero and the statement holds trivially.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.