matrix3_eval_triad_zero_v
Evaluating any triad whose v component is zero yields the zero matrix for all input matrices A and B.
Statement
theorem matrix3_eval_triad_zero_v {R : Type*} [CommSemiring R] (u w : Matrix (Fin 3) (Fin 3) R) (A B : Matrix (Fin 3) (Fin 3) R) : eval_matrix3_triad ⟨u, 0, w⟩ A B = 0
- Source
- step towards matrix3_tensor_rank_int_le_22
- Verified
- 25 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- Matrix3TriadGiven a type R, a Matrix3Triad R is a structure consisting of three 3-by-3 matrices with entries in R, labeled u, v, and w.
- eval_matrix3_triadGiven a commutative semiring R, a triad t of type Matrix3Triad R, and 3x3 matrices A and B over R, eval_matrix3_triad t A B is the scalar…
- Used by 1
- matrix3_tensor_rank_le_pred_of_zero_vIf a valid decomposition has length at most r and contains a triad with zero v matrix, then the tensor rank of 3x3 matrix multiplication…
The proof, explained
The theorem states that evaluating any matrix triad with a zero second component v on matrices A and B produces the zero matrix. Evaluating a triad computes the scalar products of A with u and B with v, and multiplies their product by w. Since v is the zero matrix, its scalar product with B vanishes, which makes the overall scalar coefficient zero and results in the zero matrix.
eval_matrix3_triad ⟨u, 0, w⟩ A B = 0 automation
Expanding the definition of `eval_matrix3_triad` expresses the result as (sA * sB) • w, where sB = ∑ i j, v i j * B i j. Since the component v is 0, each entry v i j is 0, so the terms in the sum are 0 * B i j = 0, giving sB = 0. Multiplying sA * 0 gives 0, and scalar-multiplying w by 0 yields the zero matrix. The simplifier performs these algebraic reductions automatically.
uses
eval_matrix3_triadsimp [eval_matrix3_triad]
eval_matrix3_triad- evaluates a triad t = ⟨u, v, w⟩ on matrices A and B as ((∑ i j, u i j * A i j) * (∑ i j, v i j * B i j)) • w
- The `simp` tactic silently applies several standard algebraic lemmas (`Matrix.zero_apply`, `zero_mul`, `Finset.sum_const_zero`, `mul_zero`, and `zero_smul`) after unfolding `eval_matrix3_triad`.
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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- Evaluating any triad whose v component is zero yields the zero matrix for all input matrices A and B. -/theorem matrix3_eval_triad_zero_v {R : Type*} [CommSemiring R] (u w : Matrix (Fin 3) (Fin 3) R) (A B : Matrix (Fin 3) (Fin 3) R) : eval_matrix3_triad ⟨u, 0, w⟩ A B = 0 := by simp [eval_matrix3_triad]