AFTD Auto-Formalizing Theoretical Domains

matrix3_tensor_rank_le

def

For 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 Matrix3Triad R with length at most r such that is_valid_matrix3_decomposition L holds.

Statement

def matrix3_tensor_rank_le (R : Type*) [CommSemiring R] (r : ℕ) : Prop
Defined in
arXiv:2610.01639, Sec. 5.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.
  • 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…
Used by 22

Read back from the Lean

Given a commutative semiring $R$ and a natural number $r$, matrix3_tensor_rank_le R r asserts that there exists a list $L$ of $3 \times 3$ matrix triads over $R$ of length at most $r$ such that $L$ is a valid decomposition of $3 \times 3$ matrix multiplication over $R$ (that is, evaluating the decomposition on any pair of $3 \times 3$ matrices $A$ and $B$ yields their matrix product $A * B$).

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

/-- The tensor rank of 3x3 matrix multiplication over R is at most r. -/
def matrix3_tensor_rank_le (R : Type*) [CommSemiring R] (r : ℕ) : Prop :=
  ∃ L : List (Matrix3Triad R), L.length ≤ r ∧ is_valid_matrix3_decomposition L
See it in the graphDiscuss this resultChallenge it