Rate matrices of finite continuous-time Markov chains
Probability Theory
StructureRate matrix#✓fully proved
A real square matrix Q is a rate matrix (a Q-matrix in Norris's terminology) if its
off-diagonal entries are nonnegative and each of its rows sums to 0 (Norris 1997, §2.1).
structure IsRateMatrix (Q : Matrix ι ι ℝ) : Prop where
/-- The jump rates `Q i j`, `i ≠ j`, are nonnegative. -/
nonneg_of_ne : ∀ ⦃i j : ι⦄, i ≠ j → 0 ≤ Q i j
/-- Each row sums to `0`. -/
sum_row : ∀ i, ∑ j, Q i j = 0
Used by 42
Is Rate Matrix
TheoremDiagonal of a rate matrix is minus the total jump rate#✓fully proved
The diagonal entry of a rate matrix is minus the total jump rate out of the state.
theorem diag_eq [DecidableEq ι] (hQ : IsRateMatrix Q) (i : ι) :
Q i i = -∑ j ∈ univ.erase i, Q i j
structure IsRateMatrix (Q : Matrix ι ι ℝ) : Prop where
/-- The jump rates `Q i j`, `i ≠ j`, are nonnegative. -/
nonneg_of_ne : ∀ ⦃i j : ι⦄, i ≠ j → 0 ≤ Q i j
/-- Each row sums to `0`. -/
sum_row : ∀ i, ∑ j, Q i j = 0
MathlibExt/Probability/Process/ContinuousTimeMarkovChain/RateMatrix.lean:57
Uses 1 · Used by 4
TheoremDiagonal entries of a rate matrix are nonpositive#✓fully proved
The diagonal entries of a rate matrix are nonpositive.
theorem diag_nonpos (hQ : IsRateMatrix Q) (i : ι) : Q i i ≤ 0
structure IsRateMatrix (Q : Matrix ι ι ℝ) : Prop where
/-- The jump rates `Q i j`, `i ≠ j`, are nonnegative. -/
nonneg_of_ne : ∀ ⦃i j : ι⦄, i ≠ j → 0 ≤ Q i j
/-- Each row sums to `0`. -/
sum_row : ∀ i, ∑ j, Q i j = 0
MathlibExt/Probability/Process/ContinuousTimeMarkovChain/RateMatrix.lean:57
Uses 2 · Used by 13
TheoremRate matrix annihilates the constant vector#✓fully proved
A rate matrix annihilates the constant vector 1.
theorem mulVec_one (hQ : IsRateMatrix Q) : Q *ᵥ 1 = 0
structure IsRateMatrix (Q : Matrix ι ι ℝ) : Prop where
/-- The jump rates `Q i j`, `i ≠ j`, are nonnegative. -/
nonneg_of_ne : ∀ ⦃i j : ι⦄, i ≠ j → 0 ≤ Q i j
/-- Each row sums to `0`. -/
sum_row : ∀ i, ∑ j, Q i j = 0
MathlibExt/Probability/Process/ContinuousTimeMarkovChain/RateMatrix.lean:57
Uses 1 · Used by 1
TheoremUniformization#✓fully proved
If c bounds every exit rate -Q i i, then Q + c • 1 has
nonnegative entries (Jensen 1953).
theorem add_smul_one_nonneg [DecidableEq ι] (hQ : IsRateMatrix Q) {c : ℝ}
(hc : ∀ i, -Q i i ≤ c) (i j : ι) :
0 ≤ (Q + c • (1 : Matrix ι ι ℝ)) i j
structure IsRateMatrix (Q : Matrix ι ι ℝ) : Prop where
/-- The jump rates `Q i j`, `i ≠ j`, are nonnegative. -/
nonneg_of_ne : ∀ ⦃i j : ι⦄, i ≠ j → 0 ≤ Q i j
/-- Each row sums to `0`. -/
sum_row : ∀ i, ∑ j, Q i j = 0
MathlibExt/Probability/Process/ContinuousTimeMarkovChain/RateMatrix.lean:57
Uses 1 · Used by 1
TheoremExistence of a uniformization constant for a rate matrix#✓fully proved
Every rate matrix admits a uniformization constant c ≥ 0.
theorem exists_add_smul_one_nonneg [DecidableEq ι] (hQ : IsRateMatrix Q) :
∃ c : ℝ, 0 ≤ c ∧ ∀ i j, 0 ≤ (Q + c • (1 : Matrix ι ι ℝ)) i j
structure IsRateMatrix (Q : Matrix ι ι ℝ) : Prop where
/-- The jump rates `Q i j`, `i ≠ j`, are nonnegative. -/
nonneg_of_ne : ∀ ⦃i j : ι⦄, i ≠ j → 0 ≤ Q i j
/-- Each row sums to `0`. -/
sum_row : ∀ i, ∑ j, Q i j = 0
MathlibExt/Probability/Process/ContinuousTimeMarkovChain/RateMatrix.lean:57
Uses 3 · Used by 1
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.