Border rank 2026-11-05
Over , the border rank of a tensor is the least for which lies in the closure of tensors of tensor rank at most . The usual Euclidean topology and Zariski topology give the same closure here. Hence , but equality need not hold.[ref]
Let be a basis of and putFor nonzero ,Each approximant is a sum of two pure tensors, so the border rank is at most two. It is not one, since a matrix obtained by separating one factor from the other two has rank two.
Its exact tensor rank is three. The two tensor slices in the first factor span . Its determinant is , so this space has only one rank-one direction. A rank-two tensor with two independent slices would require their span to be generated by two independent rank-one matrices, a contradiction. The limit therefore permits a decomposition that is impossible exactly.
Tensor slice 2026-11-05
A tensor slice is obtained by contracting one factor of a tensor with a linear functional. For and , the contraction is a two-factor tensor and can be displayed as a matrix after choosing bases. Coordinate slices are the contractions with members of a chosen dual basis; their individual matrices depend on that choice.[ref]
Geometry and complexity theory by J. M. Landsberg. section 2.1, tensor notation and tensors regarded as linear maps
For example, writeThe two first-factor slices are and . Contracting with gives the matrix pencil , whose determinant is . A change of basis in replaces the generators of this pencil, but does not change its span.
The contraction map is intrinsic. If is a sum of pure tensors, its image is contained in the span of two-factor pure tensors. Its matrix rank therefore gives a lower bound for tensor rank. Studying slices converts a tensor-decomposition problem into restrictions on a space of matrices, although a single slice rank does not generally determine the tensor rank.