AFTD Auto-Formalizing Theoretical Domains

Matrix3Triad

structure

Given 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.

Statement

structure Matrix3Triad (R : Type*)
Defined in
arXiv:2610.01639, Sec. 2.1
Verified
04 Oct 2026
Axioms
none listed
Used by 47
  • 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…
  • eval_matrix3_triad_smul_leftGiven a commutative semiring R, a triad t of type Matrix3Triad R, a scalar c : R, and matrices A and B, eval_matrix3_triad t (c • A) B…
  • 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_eval_triad_zero_vEvaluating any triad whose v component is zero yields the zero matrix for all input matrices A and B.
  • 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_tensor_rank_leFor a commutative semiring R and a natural number r, matrix3_tensor_rank_le R r asserts that there exists a list L of elements of…
  • 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_valid_cyclic_rotateCyclic rotation (u, v, w) ↦ (v, wᵀ, uᵀ) of every triad in a valid 3x3 matrix multiplication decomposition produces another valid…
  • matrix3_triad_decidable_eqTwo triads over a type with decidable equality are equal exactly when their u, v and w components are equal; hence Matrix3Triad R inherits…
  • eval_matrix3_triad_add_leftGiven a commutative semiring R, a triad t of type Matrix3Triad R, and matrices A₁, A₂, and B in Matrix (Fin 3) (Fin 3) R,…
  • matrix3_tensor_rank_le_pred_of_shared_u_vIf a valid decomposition has length at most r and contains two triads sharing u and v, 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…
  • 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…
  • 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_tensor_rank_le_iff_trace_familyThe tensor rank of 3x3 matrix multiplication over a commutative semiring R is at most r if and only if there exists a cyclic trace family…
  • matrix3_tensor_rank_ge_iff_trace_tensor_boundA lower bound r for the lengths of all valid 3x3 matrix multiplication triad lists is equivalent to the same lower bound for every finite…
  • 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_eval_triad_zero_wEvaluating any triad whose w component is zero yields the zero matrix for all input matrices A and B.
  • matrix3_tensor_rank_le_pred_of_shared_v_wIf a valid decomposition has length at most r and contains two triads sharing v and w, then the tensor rank of 3x3 matrix multiplication…
  • 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_geFor a commutative semiring R and a natural number r, matrix3_tensor_rank_ge R r asserts that for every list L of elements of Matrix3Triad…
  • 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…
  • matrix3_tensor_rank_le_23_of_comm_ringOver every commutative ring R, 3x3 matrix multiplication has a valid bilinear decomposition with 23 products (the classical…
  • 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)…
  • eval_matrix3_triad_smul_rightGiven a commutative semiring R, a triad t of type Matrix3Triad R, a scalar c : R, and matrices A and B, eval_matrix3_triad t A (c • B)…
  • 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_eval_triad_add_self_of_two_eq_zeroIn characteristic 2 a triad repeated twice contributes nothing: if 2 = 0 in R then eval t A B + eval t A B = 0 for every triad t and all…
  • 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_eval_triad_zero_uEvaluating any triad whose u component is zero yields the zero matrix for all input matrices A and B.
  • eval_matrix3_triad_add_rightGiven a commutative semiring R, a triad t of type Matrix3Triad R, and matrices A, B₁, and B₂ in Matrix (Fin 3) (Fin 3) R,…
  • matrix3_tensor_rank_le_monoFor any commutative semiring R and natural numbers r₁ and r₂, if 3x3 matrix multiplication over R has tensor rank at most r₁ and r₁ ≤ r₂,…
  • 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.
  • eval_matrix3_decompositionGiven 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…
  • 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…
  • matrix3_tensor_rank_le_pred_of_shared_u_wIf a valid decomposition has length at most r and contains two triads sharing u and w, then the tensor rank of 3x3 matrix multiplication…
  • matrix3_eval_triad_mergeTwo triads that agree in two of their three slots can be replaced by a single triad: if they share u and w their v's add, if they share v…

Read back from the Lean

A structure Matrix3Triad R, parameterized by a type R, bundling three $3 \times 3$ matrices over R: fields u, v, and w, each of type Matrix (Fin 3) (Fin 3) R.

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

/-- A triad product for 3x3 matrices over a type R. -/
structure Matrix3Triad (R : Type*) where
  u : Matrix (Fin 3) (Fin 3) R
  v : Matrix (Fin 3) (Fin 3) R
  w : Matrix (Fin 3) (Fin 3) R
See it in the graphDiscuss this resultChallenge it