AFTD Auto-Formalizing Theoretical Domains

matrix_support_zero

theoremverified

The support of the zero matrix is the empty set.

Statement

theorem matrix_support_zero {m n α : Type*} [Zero α] : matrix_support (0 : Matrix m n α) = ∅
Source
folklore
Verified
23 Oct 2026
Axioms
Quot.soundpropext
Built on 1
  • matrix_supportThe support of an m × n matrix M is the set of index pairs (i, j) ∈ m × n such that M_ij ≠ 0.

Read back from the Lean

For all types m, n, and α, where α is equipped with a zero element ([Zero α]), the support of the zero matrix (0 : Matrix m n α) is the empty set ∅.

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

By definition, the support of a matrix consists of all coordinate pairs where the entry is nonzero. Every entry of the zero matrix is zero, so the condition that an entry is nonzero is identically false. Hence, the set of such indices is empty.

  1. The support of the zero matrix is the empty set. automation

    Unfolding the definition of `matrix_support`, the support of the zero matrix consists of all index pairs $(i, j)$ such that $0_{i, j} \neq 0$. Since every entry of the zero matrix is $0$, the condition simplifies to $0 \neq 0$, which is false for all pairs. The set of elements satisfying a false condition is the empty set $\emptyset$.

    line 3

    uses matrix_support

      simp [matrix_support]
matrix_support
The support of a matrix M is the set of index pairs (i, j) where M i j ≠ 0.

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 support of the zero matrix is empty. -/theorem matrix_support_zero {m n α : Type*} [Zero α] : matrix_support (0 : Matrix m n α) = ∅ := by  simp [matrix_support]
See it in the graphDiscuss this resultChallenge it