AFTD Auto-Formalizing Theoretical Domains

matrix_not_is_mortal_empty

theoremverified

The empty set of square matrices is not mortal.

Statement

theorem matrix_not_is_mortal_empty {m : Type*} [Fintype m] [DecidableEq m] {α : Type*} [Semiring α] : ¬ matrix_is_mortal (∅ : Set (Matrix m m α))
Source
folklore
Verified
06 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • matrix_is_mortalA set of square matrices S is mortal if some non-empty finite product of matrices in S equals zero.

Read back from the Lean

For any finite type m with decidable equality and any semiring α, the empty set of m × m matrices with entries in α is not mortal (i.e., ¬ matrix_is_mortal ∅).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

The proof proceeds by contradiction: if the empty set of matrices were mortal, there would exist a non-empty list of matrices chosen from the empty set whose product is zero. Case analysis on the list shows that an empty list directly contradicts the non-emptiness requirement, while a non-empty list must have a first matrix that belongs to the empty set, which is impossible.

  1. Assume for contradiction that the empty set of matrices is mortal, and case-split on whether the witnessing list is empty or non-empty.

    By definition, a set of matrices is mortal if there exists a non-empty list of matrices belonging to the set whose product is zero. We assume such a witness exists and decompose it: hne states the list is non-empty, hmem states every matrix in the list belongs to the empty set, and the list itself is split into the nil case ([]) and the cons case (x :: xs).

    line 3

      rintro ⟨_ | ⟨x, xs⟩, hne, hmem, -⟩
  2. The witnessing list cannot be empty.

    In the nil case, the mortality assumption that the list is non-empty becomes [] ≠ [], which is directly refuted by reflexivity of equality (rfl).

    line 4

      · exact hne rfl
  3. The witnessing list cannot be non-empty, completing the contradiction.

    In the cons case, the list has head x and tail xs. The constructor .head establishes that x is an element of x :: xs. Applying the mortality assumption hmem (which states that every element of the list belongs to ∅) to x shows that x ∈ ∅, which is impossible and derives False.

    line 5

      · exact hmem x (.head xs)

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- The empty set of matrices is not mortal. -/theorem matrix_not_is_mortal_empty {m : Type*} [Fintype m] [DecidableEq m] {α : Type*} [Semiring α] : ¬ matrix_is_mortal (∅ : Set (Matrix m m α)) := by  rintro ⟨_ | ⟨x, xs⟩, hne, hmem, -⟩  · exact hne rfl  · exact hmem x (.head xs)
See it in the graphDiscuss this resultChallenge it