is_irreducible_matrix
def
A rational matrix P : Matrix (Fin n) (Fin n) ℚ is irreducible if for all i j : Fin n, there exists a natural number m such that 0 < (P ^ m) i j.
Statement
def is_irreducible_matrix {n : ℕ} (P : Matrix (Fin n) (Fin n) ℚ) : Prop
- Defined in
- arXiv:2610.08949 line 199
- Verified
- 26 Oct 2026
- Axioms
- none listed
Read back from the Lean
For a natural number n and an n × n matrix P with rational entries (Matrix (Fin n) (Fin n) ℚ), is_irreducible_matrix P asserts that for all i, j : Fin n, there exists a natural number m : ℕ such that the (i, j)-entry of the m-th matrix power P ^ m is strictly positive (0 < (P ^ m) i j).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- Irreducibility of a rational transition matrix: every state is reachable from every other state. -/ def is_irreducible_matrix {n : ℕ} (P : Matrix (Fin n) (Fin n) ℚ) : Prop := ∀ i j : Fin n, ∃ m : ℕ, 0 < (P ^ m) i j