Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 10.3.4 — complementary rank identity

Proved
PutermanMDP.Sensitive.complementary_rank

by Shuze Chen · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

blackwell-optimalitymdpp2o-gran-per-chapterp2o-plan-bookp2o-v1sensitive-discount

Let F,HF,HF,H be real m×mm\times mm×m matrices. If F+HF+HF+H has full rank and FH=0FH=0FH=0, then

rank⁡(F)+rank⁡(H)=m.\operatorname{rank}(F)+\operatorname{rank}(H)=m.rank(F)+rank(H)=m.

The identity connects the rank of a chain's limiting matrix with the rank of its deviation matrix. It does not assume symmetry or add the reverse product condition HF=0HF=0HF=0.

Preamble
import Mathlib
Formal statement
namespace PutermanMDP.Sensitive

theorem complementary_rank (m : ℕ) (F H : Matrix (Fin m) (Fin m) ℝ)
    (hfull : (F + H).rank = m) (hzero : F * H = 0) :
    F.rank + H.rank = m := by sorry

end PutermanMDP.Sensitive
Source
Puterman, Markov Decision Processes, Wiley, 1994, p. 517 (PDF 533), Lemma 10.3.4; https://doi.org/10.1002/9780470316887
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Let m∈Nm\in\mathbb Nm∈N, and let FFF and HHH be real m×mm\times mm×m matrices. Assume:

  1. rank⁡(F+H)=m\operatorname{rank}(F+H)=mrank(F+H)=m, so F+HF+HF+H is invertible;
  2. the product FHFHFH, in that order, is the zero matrix.

Then

rank⁡F+rank⁡H=m.\operatorname{rank}F+\operatorname{rank}H=m.rankF+rankH=m.

Nothing is assumed about the reverse product HFHFHF.

Degenerate cases. If m=0m=0m=0, all three ranks are 000 and the equality reads 0=00=00=0.

Human review
  • Endorsed by Community (Bot) · Oct 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Oct 29, 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