AFTD Auto-Formalizing Theoretical Domains

matrix3_tensor_rank_exactly

def

For a commutative semiring R and a natural number r, matrix3_tensor_rank_exactly R r is the conjunction of matrix3_tensor_rank_le R r and matrix3_tensor_rank_ge R r.

Statement

def matrix3_tensor_rank_exactly (R : Type*) [CommSemiring R] (r : ℕ) : Prop
Defined in
arXiv:2610.01639, Sec. 5.1
Verified
04 Oct 2026
Axioms
none listed
Built on 2
  • 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_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…
Used by 3
  • matrix3_tensor_rank_z_22_exactAssuming that the tensor rank of 3x3 matrix multiplication over the integers is at least 22 and at most 22, the tensor rank over ℤ is…
  • matrix3_tensor_rank_z_dichotomyAssuming that the tensor rank of 3x3 matrix multiplication over the integers is at least 22 and at most 23, the tensor rank over ℤ is…
  • matrix3_tensor_rank_f2_dichotomyAssuming that the tensor rank of 3x3 matrix multiplication over ZMod 2 is at least 22 and at most 23, the tensor rank over ZMod 2 is…

Read back from the Lean

Given a commutative semiring R and a natural number r, the proposition asserts the conjunction of two conditions: 1. There exists a list L of Matrix3Triad R such that L.length ≤ r and L is a valid decomposition of $3 \times 3$ matrix multiplication (meaning for all $3 \times 3$ matrices $A$ and $B$ over R, evaluating the decomposition L on $A$ and $B$ by summing eval_matrix3_triad t A B over all triads $t \in L$ yields $A * B$). 2. For every list L of Matrix3Triad R, if L is a valid decomposition of $3 \times 3$ matrix multiplication, then r ≤ L.length. Equivalently, $r$ is the minimum length among all valid triad decompositions of $3 \times 3$ matrix multiplication over $R$ (i.e., the tensor rank / bilinear complexity of $3 \times 3$ matrix multiplication over $R$ is exactly $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

/-- The tensor rank of 3x3 matrix multiplication over R is exactly r. -/
def matrix3_tensor_rank_exactly (R : Type*) [CommSemiring R] (r : ℕ) : Prop :=
  matrix3_tensor_rank_le R r ∧ matrix3_tensor_rank_ge R r
See it in the graphDiscuss this resultChallenge it