eval_matrix3_decomposition
def
Given a commutative semiring R, a list L of Matrix3Triad R, and 3x3 matrices A and B over R, eval_matrix3_decomposition L A B is the sum of eval_matrix3_triad t A B for t in L.
Statement
def eval_matrix3_decomposition {R : Type*} [CommSemiring R] (L : List (Matrix3Triad R)) (A B : Matrix (Fin 3) (Fin 3) R) : Matrix (Fin 3) (Fin 3) R
- Defined in
- arXiv:2610.01639, Sec. 2.1
- Verified
- 04 Oct 2026
- Axioms
- none listed
- 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 25
- matrix3_shorter_valid_of_shared_u_wIf a list of triads written as L₁ ++ t₁ :: L₂ ++ t₂ :: L₃ is a valid decomposition of matrix multiplication, and t₁ and t₂ have the same u…
- matrix3_unit_check_eq_true_iffThe computable checker matrix3_unit_check is true exactly when the list agrees with matrix multiplication on every pair of 3x3 matrix units.
- matrix3_valid_iff_trace_tensor_identityFor a finite indexed family of triads over any commutative semiring, validity of the decomposition whose output weights are the transposes…
- eval_matrix3_decomposition_sum_rightGiven a commutative semiring R, a finite set s, a list L of triads, a matrix A, and a family of matrices G, evaluating L on A and (∑ i ∈…
- matrix3_unit_check_int_eq_true_iffThe computable integer checker matrix3_unit_check_int is true if and only if the list agrees with matrix multiplication on all 81 pairs of…
- eval_matrix3_decomposition_add_rightGiven a commutative semiring R, a list L of Matrix3Triad R, and matrices A, B₁, and B₂, eval_matrix3_decomposition L A (B₁ + B₂) equals…
- 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…
- matrix3_tensor_rank_le_int_iff_unit_checkThe tensor rank of 3x3 matrix multiplication over ℤ is at most r if and only if there exists a list of at most r triads whose computable…
- eval_matrix3_decomposition_add_leftGiven a commutative semiring R, a list L of Matrix3Triad R, and matrices A₁, A₂, and B, eval_matrix3_decomposition L (A₁ + A₂) B equals…
- matrix3_tensor_rank_le_zmod2_iff_unit_checkFor every natural number r, 3x3 matrix multiplication over ZMod 2 has a valid decomposition with at most r triads if and only if there is…
- matrix3_valid_transpose_swapTransposing and swapping the two input factors along with transposing the output factor, (u, v, w) ↦ (vᵀ, uᵀ, wᵀ), preserves the validity…
- matrix3_unit_check_intA computable Bool-valued checker that tests a list L of triads over ℤ against all 81 pairs of 3x3 matrix units: it returns true exactly…
- matrix3_shorter_valid_of_shared_u_vIf a list of triads written as L₁ ++ t₁ :: L₂ ++ t₂ :: L₃ is a valid decomposition of matrix multiplication, and t₁ and t₂ have the same u…
- eval_matrix3_decomposition_applyEntry (i, j) of the evaluation of a list of 3x3 triads on A and B is the sum, over the triads, of (sum of u_kl A_kl) times (sum of v_kl…
- matrix3_tensor_rank_le_of_surjectiveIf f : R → S is a surjective homomorphism of commutative semirings and 3x3 matrix multiplication over R has a valid triad decomposition…
- matrix3_tensor_rank_comm_ring_le_of_intFor any commutative ring R and any natural number r, if 3x3 matrix multiplication has tensor rank at most r over the integers, then 3x3…
- eval_matrix3_decomposition_sum_leftGiven a commutative semiring R, a finite set s, a list L of triads, a family of matrices F, and a matrix B, evaluating L on (∑ i ∈ s, F i)…
- matrix3_unit_check_witnessesThe checker matrix3_unit_check returns true on the classical 23-triad decomposition of 3x3 matrix multiplication over ZMod 2 (so the…
- matrix3_valid_of_unit_checksIf a list L of triads over a commutative semiring R evaluates to matrix multiplication on all 81 pairs of matrix units, then L is a valid…
- matrix3_tensor_rank_le_pred_of_zero_uIf a valid decomposition has length at most r and contains a triad with zero u matrix, then the tensor rank of 3x3 matrix multiplication…
- 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…
- matrix3_shorter_valid_of_shared_v_wIf a list of triads written as L₁ ++ t₁ :: L₂ ++ t₂ :: L₃ is a valid decomposition of matrix multiplication, and t₁ and t₂ have the same v…
- matrix3_unit_checkA computable Bool-valued checker that tests a list L of triads over ZMod 2 against all 81 pairs of 3x3 matrix units: it returns true…
- matrix3_unit_check_int_witnessesThe checker matrix3_unit_check_int returns true on the classical 23-triad integer decomposition and false on the empty list.
- is_valid_matrix3_decompositionGiven a commutative semiring R and a list L of Matrix3Triad R, is_valid_matrix3_decomposition L asserts that for all 3x3 matrices A and B…
Read back from the Lean
A definition that, given a commutative semiring R, a list L of Matrix3Triad R structures, and two 3×3 matrices A and B over R, computes a 3×3 matrix over R by applying eval_matrix3_triad to each triad in L with matrices A and B, and summing the resulting list of matrices.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- Evaluation of a list of 3x3 triads on input matrices A and B. -/ def eval_matrix3_decomposition {R : Type*} [CommSemiring R] (L : List (Matrix3Triad R)) (A B : Matrix (Fin 3) (Fin 3) R) : Matrix (Fin 3) (Fin 3) R := (L.map (fun t => eval_matrix3_triad t A B)).sum