matrix3_eval_triad_zero_w
Evaluating any triad whose w component is zero yields the zero matrix for all input matrices A and B.
Statement
theorem matrix3_eval_triad_zero_w {R : Type*} [CommSemiring R] (u v : Matrix (Fin 3) (Fin 3) R) (A B : Matrix (Fin 3) (Fin 3) R) : eval_matrix3_triad ⟨u, v, 0⟩ A B = 0
- Source
- step towards matrix3_tensor_rank_int_le_22
- Verified
- 24 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_wIf a valid decomposition has length at most r and contains a triad with zero w matrix, then the tensor rank of 3x3 matrix multiplication…
The proof, explained
Evaluating a triad computes a scalar from the u and v components and scales the w component by this scalar. When the w component is the zero matrix, this scalar multiplication results in the zero matrix regardless of the inputs A and B. Lean's simplifier closes the goal directly by unfolding the definition of `eval_matrix3_triad` and applying scalar multiplication by zero.
Evaluating the triad ⟨u, v, 0⟩ on A and B yields the zero matrix. automation
Unfolding the definition of `eval_matrix3_triad`, the evaluation computes the scalar product of the inner products of u with A and v with B, and scales the third component matrix w by this scalar. Since w is the zero matrix 0, scaling it by any scalar yields the zero matrix 0. Lean's simplifier unfolds the definition and evaluates the scalar product with zero to close the goal.
uses
eval_matrix3_triadsimp [eval_matrix3_triad]
eval_matrix3_triad- The evaluation of a triad `t` on matrices `A` and `B`, defined by scaling the matrix `t.w` by the product of the componentwise inner products of `t.u` with `A` and `t.v` with `B`.
- The simplifier `simp` automatically applies the algebraic law that scalar multiplication distributes over or annihilates zero (`smul_zero`), concluding that $(s_A * s_B) • 0 = 0$ without needing an explicit lemma invocation.
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.
/-- A triad with zero w component evaluates to zero everywhere. -/theorem matrix3_eval_triad_zero_w {R : Type*} [CommSemiring R] (u v : Matrix (Fin 3) (Fin 3) R) (A B : Matrix (Fin 3) (Fin 3) R) : eval_matrix3_triad ⟨u, v, 0⟩ A B = 0 := by simp [eval_matrix3_triad]