matrix_is_mortal
def
A set of square matrices S is mortal if some non-empty finite product of matrices in S equals zero.
Statement
def matrix_is_mortal {m : Type*} [Fintype m] [DecidableEq m] {α : Type*} [Semiring α] (S : Set (Matrix m m α)) : Prop
- Defined in
- arXiv:2611.06562 Section 1
- Verified
- 05 Nov 2026
- Axioms
- none listed
- Used by 3
- matrix_is_mortal_of_zero_memAny set of square matrices containing the zero matrix is mortal.
- matrix_not_is_mortal_emptyThe empty set of square matrices is not mortal.
- rank_one_conversion_mortality_reachabilityLet 𝒢 be a finite set of invertible 2 × 2 rational matrices, and let s, t be one-dimensional linear subspaces of ℚ². Let u be a nonzero…
Read back from the Lean
Given a finite type m with decidable equality and a semiring α, a set S of m × m matrices with entries in α satisfies matrix_is_mortal S if and only if there exists a list l of m × m matrices over α such that:
1. l is non-empty (l ≠ []),
2. every matrix M in l belongs to S (∀ M ∈ l, M ∈ S), and
3. the product of the matrices in l is the zero matrix (l.prod = 0).
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 set of square matrices S is mortal if there is a non-empty sequence of matrices in S whose product is zero. -/ def matrix_is_mortal {m : Type*} [Fintype m] [DecidableEq m] {α : Type*} [Semiring α] (S : Set (Matrix m m α)) : Prop := ∃ l : List (Matrix m m α), l ≠ [] ∧ (∀ M ∈ l, M ∈ S) ∧ l.prod = 0