Slice rank

For finite sets $X,Y,Z$ and a field $F$, a three-variable tensor $T:X\times Y\times Z\to F$ has slice rank at most $r$ when it is a sum of $r$ terms, each of which separates one variable from the other two. Such terms have one of the formsThe slice rank is the least possible $r$.

A three-variable tensor is diagonal when it vanishes unless its three arguments are equal.

Ifon a finite set $X$, and every $c_x$ is nonzero, then the slice rank of $T$ is $|X|$. The upper bound uses one $x$-slice for each diagonal entry. For the lower bound, restrict any shorter slice decomposition to a common kernel of the coefficient functions in two slice directions; the remaining diagonal matrix has rank larger than the number of slices available in the third direction, a contradiction.