Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5, p. 22 — R̃(k) = V(k+1)⁻¹C(k)V(k) is a row stochastic matrix

Proved
DIGing.Push.rt_row_stochastic

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

directed-graphsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1push-sumstochastic-matrices

Let the mixing matrices C(k)C(k)C(k) satisfy Assumption 7, let v(0)=1\mathbf v(0)=\mathbf 1v(0)=1, v(k+1)=C(k)v(k)\mathbf v(k+1)=C(k)\mathbf v(k)v(k+1)=C(k)v(k), V(k)=diag⁡{v(k)}V(k)=\operatorname{diag}\{\mathbf v(k)\}V(k)=diag{v(k)}, and R~(k)=V(k+1)−1C(k)V(k)\tilde R(k)=V(k+1)^{-1}C(k)V(k)R~(k)=V(k+1)−1C(k)V(k). Then for every kkk, R~(k)\tilde R(k)R~(k) is row stochastic: for all i,ji,ji,j

R~ij(k)≥0and∑j=1nR~ij(k)=1.\tilde R_{ij}(k)\ge0\qquad\text{and}\qquad \sum_{j=1}^n\tilde R_{ij}(k)=1.R~ij​(k)≥0andj=1∑n​R~ij​(k)=1.

Row stochasticity of R~(k)\tilde R(k)R~(k) is what lets the recursion (48) be analysed like DIGing: multiplication by R~(k)\tilde R(k)R~(k) maps consensual matrices to themselves.

Formalization Note The paper cites Lemma 4 of [41] and says "every row sums to 1"; the nonnegativity of the entries, which is part of "row stochastic", is included. Assumption 7 includes the disclosed self-weight; Assumption 6 is not needed.

Preamble
import Mathlib
import Definitions.Def_DIGing_Undir_Common
import Definitions.Def_DIGing_Push_Setting
Formal statement
namespace DIGing.Push

theorem rt_row_stochastic {n : ℕ} (A : ℕ → Finset (Fin n × Fin n))
    (C : ℕ → Matrix (Fin n) (Fin n) ℝ) (h7 : Assumption7 A C) :
    ∀ k i, (∀ j, 0 ≤ Rt C k i j) ∧ ∑ j, Rt C k i j = 1 := by sorry

end DIGing.Push
Source
arXiv:1607.03218v3, §5, p. 22 (sentence after (49)); proof of Lemma 13, p. 23
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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