is_irreducible_real_matrix
def
A real matrix P : Matrix (Fin n) (Fin n) ℝ is irreducible if for every pair of indices i, j : Fin n, there exists a natural number m such that (P ^ m) i j > 0.
Statement
def is_irreducible_real_matrix {n : ℕ} (P : Matrix (Fin n) (Fin n) ℝ) : Prop
- Defined in
- scout/2610-08949-primitive-periods-in-greedy-chip-firing-games.md:199
- Verified
- 29 Oct 2026
- Axioms
- none listed
- Used by 1
- is_irreducible_real_matrix_uniformFor any positive natural number n, an n-by-n real matrix P whose entries all equal 1/n is irreducible.
Read back from the Lean
Given a natural number n and an n × n real matrix P, for all row indices i : Fin n and column indices j : Fin n, there exists a natural number m such that the (i, j)-th entry of the matrix power P^m is strictly positive.
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
/-- A real square matrix P on Fin n is irreducible if for all states i and j there is a power m with positive (i, j)-th entry. -/ def is_irreducible_real_matrix {n : ℕ} (P : Matrix (Fin n) (Fin n) ℝ) : Prop := ∀ i j : Fin n, ∃ m : ℕ, 0 < (P ^ m) i j