AFTD Auto-Formalizing Theoretical Domains

matrix_order_four_row_sum_zero_mulVec_const

theoremverified

A real order-four matrix with zero row sums annihilates every complex constant vector.

Statement

theorem matrix_order_four_row_sum_zero_mulVec_const (L : Matrix (Fin 4) (Fin 4) ℝ)
    (hr : ∀ i, ∑ j, L i j = 0) (k : ℂ) :
    (L.map (algebraMap ℝ ℂ)).mulVec (fun _ => k) = 0
Source
Sector-bound formalization for IN-166; arXiv:math/0508176, Theorem 5.
Verified
27 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 1

The proof, explained

To show that the product of the matrix with a constant vector is zero, it suffices to compute each entry of the resulting vector. By definition of matrix-vector multiplication, the $i$-th entry is the sum of row $i$'s entries multiplied by the constant $k$. Factoring out $k$ leaves the $i$-th row sum times $k$, which vanishes because every row sum is zero by hypothesis.

  1. It suffices to show that the $i$-th component $\sum_j L_{i,j} k$ is zero for every row index $i$.

    Two vectors are equal if and only if they agree at every coordinate $i$ (`ext i`). By definition of matrix-vector multiplication, the $i$-th entry of the product of $L$ (cast to complex numbers) with the constant vector $k$ is $\sum_j L_{i,j} k$, while the $i$-th entry of the zero vector is $0$.

    lines 4–5

      ext i
      change (∑ j, (algebraMap ℝ ℂ) (L i j) * k) = 0
  2. Each component sum $\sum_j L_{i,j} k$ evaluates to $0$.

    Factoring out the constant scalar $k$ using right distributivity (`Finset.sum_mul`) rewrites the expression as $(\sum_j L_{i, j}) \cdot k$. Because the canonical ring homomorphism from $\mathbb{R}$ to $\mathbb{C}$ preserves finite sums (`map_sum`), this sum is the complex image of the real row sum $\sum_j L_{i, j}$. By the assumption that all row sums are zero (`hr`), this sum is $0$. The homomorphism maps $0$ to $0$ (`map_zero`), and multiplying $0$ by $k$ gives $0$ (`zero_mul`).

    line 6

    uses Finset.sum_mul, map_sum, map_zero, zero_mul

      rw [← Finset.sum_mul, ← map_sum, hr i, map_zero, zero_mul]
Finset.sum_mul
Multiplication distributes over finite sums from the right: $(\sum_{x \in s} f(x)) \cdot a = \sum_{x \in s} (f(x) \cdot a)$.
map_sum
An additive monoid homomorphism preserves finite sums: $g(\sum_{x \in s} f(x)) = \sum_{x \in s} g(f(x))$.
map_zero
A zero-preserving map sends zero to zero: $f(0) = 0$.
zero_mul
Zero multiplied by any element is zero: $0 \cdot a = 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

theorem matrix_order_four_row_sum_zero_mulVec_const (L : Matrix (Fin 4) (Fin 4) ℝ)    (hr : ∀ i, ∑ j, L i j = 0) (k : ℂ) :    (L.map (algebraMap ℝ ℂ)).mulVec (fun _ => k) = 0 := by  ext i  change (∑ j, (algebraMap ℝ ℂ) (L i j) * k) = 0  rw [← Finset.sum_mul, ← map_sum, hr i, map_zero, zero_mul]
See it in the graphDiscuss this resultChallenge it