On Strassen's rank additivity for small three-way tensors
Jaros{\l}aw Buczy\'nski, Elisa Postinghel, Filip Rupniewski

TL;DR
This paper investigates the additivity of tensor rank for small three-way tensors, proving it holds in several specific cases and providing insights into the border rank additivity, with some results valid over arbitrary fields.
Contribution
It establishes new cases where tensor rank additivity holds for small three-way tensors, extending understanding beyond known counterexamples.
Findings
Additivity holds if tensor rank is at most 6.
Additivity holds for tensors in C^k ⊗ C^3 ⊗ C^3.
Border rank additivity holds for tensors in C^4 ⊗ C^4 ⊗ C^4.
Abstract
We address the problem of the additivity of the tensor rank. That is for two independent tensors we study if the rank of their direct sum is equal to the sum of their individual ranks. A positive answer to this problem was previously known as Strassen's conjecture until recent counterexamples were proposed by Shitov. The latter are not very explicit, and they are only known to exist asymptotically for very large tensor spaces. In this article we prove that for some small three-way tensors the additivity holds. For instance, if the rank of one of the tensors is at most 6, then the additivity holds. Or, if one of the tensors lives in for any , then the additivity also holds. More generally, if one of the tensors is concise and its rank is at most 2 more than the dimension of one of the linear spaces, then additivity holds. In addition we also treat some…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
\headers
On Strassen’s rank additivity for small three-way tensorsJarosŁaw Buczyński, Elisa Postinghel, Filip Rupniewski
On Strassen’s rank additivity for small three-way tensors ††thanks: Submitted to the editors
DATE.
JarosŁaw Buczyński
Institute of Mathematics of the Polish Academy of Sciences, ul. Śniadeckich 8, 00-656 Warsaw, Poland, and Faculty of Mathematics, Computer Science and Mechanics, University of Warsaw, ul. Banacha 2, 02-097 Warsaw, Poland () [email protected]
Elisa Postinghel
Department of Mathematical Sciences, Loughborough University, Leicestershire LE11 3TU, United Kingdom () [email protected]
Filip Rupniewski
Institute of Mathematics of the Polish Academy of Sciences, ul. Śniadeckich 8, 00-656 Warsaw, Poland () [email protected]
Abstract
We address the problem of the additivity of the tensor rank. That is, for two independent tensors we study if the rank of their direct sum is equal to the sum of their individual ranks. A positive answer to this problem was previously known as Strassen’s conjecture until recent counterexamples were proposed by Shitov. The latter are not very explicit, and they are only known to exist asymptotically for very large tensor spaces. In this article we prove that for some small three-way tensors the additivity holds. For instance, if the rank of one of the tensors is at most 6, then the additivity holds. Or, if one of the tensors lives in for any , then the additivity also holds. More generally, if one of the tensors is concise and its rank is at most 2 more than the dimension of one of the linear spaces, then additivity holds. In addition we also treat some cases of the additivity of the border rank of such tensors. In particular, we show that the additivity of the border rank holds if the direct sum tensor is contained in . Some of our results are valid over an arbitrary base field.
keywords:
Tensor rank, additivity of tensor rank, Strassen’s conjecture, slices of tensor, secant variety, border rank.
{AMS}
Primary: 15A69, Secondary: 14M17, 68W30, 15A03.
1 Introduction
The matrix multiplication is a bilinear map , where is the linear space of matrices with coefficients in a field . In particular, , where denotes an isomorphism of vector spaces. We can interpret as a three-way tensor
[TABLE]
Following the discoveries of Strassen [30], scientists started to wonder what is the minimal number of multiplications required to calculate the product of two matrices , for any and . This is a question about the tensor rank of .
Suppose , , and are finite dimensional vector spaces over . A simple tensor is an element of the tensor space which can be written as for some , , . The rank of a tensor is the minimal number of simple tensors needed, such that can be expressed as a linear combination of simple tensors. Thus if and only if , and if and only if is a simple tensor. In general, the higher the rank is, the more complicated “tends” to be. In particular, the minimal number of multiplications needed to calculate as above is equal to . See for instance [17], [22], [13] and references therein for more details and further motivations to study tensor rank.
Our main interest in this article is in the additivity of the tensor rank. Going on with the main example, given arbitrary four matrices , , , , suppose we want to calculate both products and simultaneously. What is the minimal number of multiplications needed to obtain the result? Is it equal to the sum of the ranks ? More generally, the same question can be asked for arbitrary tensors. If we are given two tensors in independent vector spaces, is the rank of their sum equal to the sum of their ranks? A positive answer to this question was widely known as Strassen’s Conjecture [31, p. 194, §4, Vermutung 3], [22, §5.7], until it was disproved by Shitov [29].
Problem 1** (Strassen’s additivity problem).**
Suppose , , and , where all are finite dimensional vector spaces over a field . Pick and and let , which we will write as . Does the following equality hold
[TABLE]
In this article we address several cases of Problem 1 and its generalisations. It is known that if one of the vector spaces , , , , , is at most two dimensional, then the additivity of the tensor rank (1.1) holds: see [21] for the original proof and Section 3.2 for a discussion of more recent approaches. One of our results includes the next case, that is, if say , then (1.1) holds. The following theorem summarises our main results.
Theorem 1.2**.**
Let be any base field and let , , , , , be vector spaces over . Assume and and let
[TABLE]
If at least one of the following conditions holds, then the additivity of the rank holds for , that is, :
- •
* or (complex or real numbers) and and .*
- •
* and is not contained in for any linear subspace (this part of the statement is valid for any field ).*
- •
* or is an algebraically closed field of characteristic and .*
*Analogous statements hold if we exchange the roles of , , and/or of ′ and ′′. *
The theorem summarises the content of Theorems 4.17–4.19 proven in Section 4.4.
Remark 1.3**.**
*Although most of our arguments are characteristic free, we partially rely on some earlier results which often are proven only over the fields of the complex or the real numbers, or other special fields. Specifically, we use upper bounds on the maximal rank of small tensors, such as [6] or [33]. See Section 4.4 for a more detailed discussion. In particular, the consequence of the proof of Theorem 4.19 is that if (over any field ) there are and such that and , then and . In [6] it is shown that if (the field with two elements), then such tensors with exist. *
Some other cases of additivity were shown in [18]. Another variant of Problem 1 asks the same question in the setting of symmetric tensors and the symmetric tensor rank, or equivalently, for homogeneous polynomials and their Waring rank. No counterexamples to this version of the problem are yet known, while some partial positive results are described in [10], [11], [12], [14], and [34]. Possible ad hoc extensions to the symmetric case of the techniques and results obtained in this article are subject of a follow-up research.
Next we turn our attention to the border rank. Roughly speaking, over the complex numbers, a tensor has border rank at most , if and only if it is a limit of tensors of rank at most . The border rank of is denoted by . One can pose the analogue of Problem 1 for the border rank: for which tensors and is the border rank additive, that is, ?
In general, the answer is negative; in fact there exist examples for which : Schönhage [28] proposed a family of counterexamples amongst which the smallest is
[TABLE]
see also [22, §11.2.2].
Nevertheless, one may be interested in special cases of the problem. We describe one instance suggested by J. Landsberg (private communication, also mentioned during his lectures at Berkeley in 2014).
Problem 2** (Landsberg).**
*Suppose are vector spaces and . Let be any tensor and be a non-zero tensor. Is ? *
Another interesting question is what is the smallest counterexample to the additivity of the border rank? The example of Schönhage lives in , that is, it requires using a seven dimesional vector space. Here we show that if all three spaces , , have dimensions at most , then it is impossible to find a counterexample to the additivity of the border rank.
Theorem 1.4**.**
Suppose are vector spaces over and , , and . If , then for any and the additivity of the border rank holds:
[TABLE]
We prove the theorem in Section 5 as Corollary 5.2, Propositions 5.13 and 5.14, which in fact cover a wider variety of cases.
1.1 Overview
In this article, for the sake of simplicity, we mostly restrict our presentation to the case of three-way tensors, even though some intermediate results hold more generally. In Section 2 we introduce the notation and review known methods about tensors in general. We review the translation of the rank and border rank of three-way tensors into statements about linear spaces of matrices. In Proposition 2.10 we explain that any decomposition that uses elements outside of the minimal tensor space containing a given tensor must involve more terms than the rank of that tensor. In Section 3 we present the notation related to the direct sum tensors and we prove the first results on the additivity of the tensor rank. In particular, we slightly generalise the proof of the additivity of the rank when one of the tensor spaces has dimension . In Section 4 we analyse rank one matrices contributing to the minimal decompositions of tensors, and we distinguish seven types of such matrices. Then we show that to prove the additivity of the tensor rank one can get rid of two of those types, that is, we can produce a smaller example, which does not have these two types, but if the additivity holds for the smaller one, then it also holds for the original one. This is the core observation to prove the main result, Theorem 1.2. Finally, in Section 5 we analyse the additivity of the border rank for small tensor spaces. For most of the possible splittings of the triple , , , there is an easy observation (Corollary 5.2) proving the additivity of the border rank. The remaining two pairs of triples are treated by more advanced methods, involving in particular the Strassen type equations for secant varieties. We conclude the article with a brief discussion of the potential analogue of Theorem 1.4 for .
2 Ranks and slices
This section reviews the notions of rank, border rank, slices, conciseness. Readers that are familiar to these concepts may easily skip this section. The main things to remember from here are Notation 2.2 and Proposition 2.10.
Let , , , , and be finite dimensional vector spaces over a field . Recall a tensor is simple if and only if it can be written as with . Simple tensors will also be referred to as rank one tensors throughout this paper. If is a subset of , we denote by its linear span. If is a finite subset, we will write rather than to simplify notation.
Definition 2.1**.**
*Suppose is a linear subspace of the tensor product space. We define , the rank of , to be the minimal number , such that there exist simple tensors with contained in . For , we write . *
In the setting of the definition, if , then . If and is -dimensional, then is the rank of viewed as a linear map . If and is -dimensional, then is equal to in the sense of Section 1. More generally, for arbitrary , one can relate the rank of -way tensors with the rank of certain linear subspaces in the space of -way tensors. This relation is based on the slice technique, which we are going to review in Section 2.4.
2.1 Variety of simple tensors
As it is clear from the definition, the rank of a tensor does not depend on the non-zero rescalings of . Thus it is natural and customary to consider the rank as a function on the projective space . There the set of simple tensors is naturally isomorphic to the cartesian product of projective spaces. Its embedding in the tensor space is also called the Segre variety:
[TABLE]
We will intersect linear subspaces of the tensor space with the Segre variety. Using the language of algebraic geometry, such intersection may have a non-trivial scheme structure. In this article we just ignore the scheme structure and all our intersections are set theoretic. To avoid ambiguity of notation, we write to underline this issue, while the reader not originating from algebraic geometry should ignore the symbol .
Notation 2.2**.**
Given a linear subspace of a tensor space, , we denote:
[TABLE]
*Thus is (up to projectivisation) the set of rank one tensors in . *
In this setting, we have the following trivial rephrasing of the definition of rank:
Proposition 2.3**.**
Suppose is a linear subspace. Then is equal to the minimal number , such that there exists a linear subspace of dimension with and is linearly spanned by . In particular,
- (i)
* if and only if*
[TABLE] 2. (ii)
Let be the linear subspace such that . Then tensors from can be used in the minimal decomposition of , that is, there exist such that and are simple tensors.
2.2 Secant varieties and border rank
For this subsection (and also in Section 5) we assume . See Remark 2.6 for generalisations.
In general, the set of tensors of rank at most is neither open nor closed. One of the very few exceptions is the case of matrices, that is, tensors in . Instead, one defines the secant variety as:
[TABLE]
The overline denotes the closure in the Zariski topology. However in this definition, the resulting set coincides with the Euclidean closure. This is a classically studied algebraic variety [2], [26], [35], and leads to a definition of border rank of a point.
Definition 2.4**.**
*For define , the border rank of , to be the minimal number , such that , where is the underlying point of in the projective space. We follow the standard convention that if and only if . *
Analogously we can give the same definitions for linear subspaces. Fix and an integer . Denote by the Grassmannian of -dimensional linear subspaces of the vector space . Let be the Grassmann secant variety [9], [15], [16]:
[TABLE]
Definition 2.5**.**
*For , a linear subspace of dimension , define , the border rank of , to be the minimal number , such that . *
In particular, if , then Definition 2.5 coincides with Definition 2.4: . An important consequence of the definitions of border rank of a point or of a linear space is that it is a semicontinuous function
[TABLE]
for every . Moreover, if and only if .
Remark 2.6**.**
When treating the border rank and secant varieties we assume the base field is . However, the results of [8, §6, Prop. 6.11] imply (roughly) that anything that we can say about a secant variety over , we can also say about the same secant variety over any field of characteristic [math]. In particular, the same results for border rank over an algebraically closed field will be true. If is not algebraically closed, then the definition of border rank above might not generalise immediately, as there might be a difference between the closure in the Zariski topology or in some other topology, the latter being the Euclidean topology in the case .
2.3 Independence of the rank of the ambient space
As defined above, the notions of rank and border rank of a vector subspace , or of a tensor , might seem to depend on the ambient spaces . However, it is well known that the rank is actually independent of the choice of the vector spaces. We first recall this result for tensors, then we apply the slice technique to show it in general.
Lemma 2.7** ([22, Prop. 3.1.3.1] and [9, Cor. 2.2]).**
*Suppose and for some linear subspaces . Then (respectively, ) measured as the rank (respectively, the border rank) in is equal to the rank (respectively, the border rank) measured in . *
We also state a stronger fact about the rank from the same references: in the notation of Lemma 2.7, any minimal expression , for simple tensors , must be contained in . Here we show that the difference in the length of the decompositions must be at least the difference of the respective dimensions. For simplicity of notation, we restrict the presentation to the case . The reader will easily generalise the argument to any other numbers of factors. We stress that the lemma below does not depend on the base field, in particular, it does not require algebraic closedness.
Lemma 2.8**.**
Suppose that , for a linear subspace , and that we have an expression , where are simple tensors. Then:
[TABLE]
In particular, Lemma 2.8 implies the rank part of Lemma 2.7 for any base field , which on its own can also be seen by following the proof of [22, Prop. 3.1.3.1] or [9, Cor. 2.2].
**Proof. **For simplicity of notation, we assume that (by replacing with a smaller subspace if needed) and that (by replacing with a smaller subspace). Set and let us reorder the simple tensors in such a way that the first of the ’s are linearly independent and .
Let so that and consider the quotient map . Then the composition is an isomorphism, denoted by . By a minor abuse of notation, let and also denote the induced maps and . We have
[TABLE]
Using the inverse of the isomorphism , we get a presentation of as a linear combination of simple tensors, that is, as claimed.
2.4 Slice technique and conciseness
We define the notion of conciseness of tensors and we review a standard slice technique that replaces the calculation of rank of three way tensors with the calculation of rank of linear spaces of matrices.
A tensor determines a linear map . Consider the image . The elements of a basis of (or the image of a basis of ) are called slices of . The point is that essentially uniquely (up to an action of ) determines (cfr. [9, Cor. 3.6]). Thus the subspace captures the geometric information about , in particular its rank and border rank.
Lemma 2.9** ([9, Thm 2.5]).**
*Suppose and as above. Then and (if ) . *
Clearly, we can also replace with any of the to define slices as images and obtain the analogue of the lemma.
We can now prove the analogue of Lemmas 2.7 and 2.8 for higher dimensional subspaces of the tensor space. As before, to simplify the notation, we only consider the case , which is our main interest.
Proposition 2.10**.**
Suppose for some linear subspaces , .
- (i)
The numbers and measured as the rank and border rank of in are equal to its rank and border rank calculated in (in the statement about border rank, we assume that ). 2. (ii)
Moreover, if we have an expression , where are simple tensors, then:
[TABLE]
**Proof. **Reduce to Lemmas 2.7 and 2.8 using Lemma 2.9.
We conclude this section by recalling the following definition.
Definition 2.11**.**
*Let be a tensor or let be a linear subspace. We say that or is -concise if for all linear subspaces , if (respectively, ), then . Analogously, we define -concise tensors and spaces for . We say or is concise if it is -concise for all . *
Remark 2.12**.**
*Notice that is -concise if and only if is injective. *
3 Direct sum tensors and spaces of matrices
Again, for simplicity of notation we restrict the presentation to the case of tensors in or linear subspaces of .
We introduce the following notation that will be adopted throughout this manuscript.
Notation 3.1**.**
Let be vector spaces over of dimensions, respectively, . Suppose , , and , and .
*For the purpose of illustration, we will interpret the two-way tensors in as matrices in . This requires choosing bases of and , but (whenever possible) we will refrain from naming the bases explicitly. We will refer to an element of the space of matrices as a partitioned matrix. Every matrix is a block matrix with four blocks of size , , and respectively. *
Notation 3.2**.**
As in Section 2.4, a tensor is a linear map ; we denote by the image of in the space of matrices . Similarly, if is such that and , we set and . In such situation, we will say that is a direct sum tensor.
We have the following direct sum decomposition:
[TABLE]
and an induced matrix partition of type on every matrix such that
[TABLE]
*where and , and the two ’s denote zero matrices of size and respectively. *
Proposition 3.3**.**
*Suppose that , , etc. are as in Notation 3.2. Then the additivity of the rank holds for , that is , if and only if the additivity of the rank holds for , that is, . *
**Proof. **It is an immediate consequence of Lemma 2.9.
3.1 Projections and decompositions
The situation we consider here again concerns the direct sums and their minimal decompositions. We fix and and we choose a minimal decomposition of , that is, a linear subspace such that , and . Such linear spaces , and will be fixed for the rest of Sections 3 and 4.
In addition to Notations 2.2, 3.1 and 3.2 we need the following.
Notation 3.4**.**
Under Notation 3.1, let denote the projection
[TABLE]
whose kernel is the space . With slight abuse of notation, we shall denote by also the following projections
[TABLE]
with kernels, respectively, and . The target of the projection is regarded as a subspace of , , or , so that it is possible to compose such projections, for instance:
[TABLE]
We also let (resp. ) be the minimal vector subspace such that (resp. ) is contained in (resp. ).
*By swapping the roles of and , we define and analogously. By the lowercase letters we denote the dimensions of the subspaces . *
If the differences and (which we will informally call the gaps) are large, then the spaces could be large too, in particular they can coincide with respectively. In fact, these spaces measure “how far” a minimal decomposition of a direct sum is from being a direct sum of decompositions of and .
In particular, we will show in Proposition 4.5 and Corollary 4.16, that if or if both and are sufficiently small, then . Then, as a consequence of Corollary 3.7, if one of the gaps is at most two (say, ), then the additivity of the rank holds, see Theorem 4.17.
Lemma 3.5**.**
In Notation 3.4 as above, with , the following inequalities hold.
[TABLE]
Proof.
We prove only the first inequality , the other follow in the same way by swapping and or ′ and ′′. By Proposition 2.10(i) and (ii) we may assume is concise: or are not affected by choosing the minimal subspace of by (i), also the minimal decomposition cannot involve anyone from outside of the minimal subspace by (ii).
Since is spanned by rank one matrices and the projection preserves the set of matrices of rank at most one, also the vector space is spanned by rank one matrices, say
[TABLE]
with . Moreover, contains . We claim that
[TABLE]
Indeed, the inclusion follows from the conciseness of , as . Moreover, the inclusions and follow from the definition of , cf. Notation 3.4.
Thus Proposition 2.10(ii) implies that
[TABLE]
Since contains and , we have
[TABLE]
The claim follows from the above inequality together with (3.6).
Rephrasing the inequalities of Lemma 3.5, we obtain the following.
Corollary 3.7**.**
If , then
[TABLE]
This immediately recovers the known case of additivity, when the gap is equal to [math], that is, if , then (because ). Moreover, it implies that if one of the gaps is equal to (say ), then either the additivity holds or both and are trivial vector spaces. In fact, the latter case is only possible if the former case holds too.
Lemma 3.8**.**
*With Notation 3.4, suppose and . Then the additivity of the rank holds . In particular, if , then the additivity holds. *
Proof.
Since and , by the definition of and we must have the following inclusions:
[TABLE]
Therefore and is obtained from the union of the decompositions of and .
The last statement follows from Corollary 3.7
Later in Proposition 4.5 we will show a stronger version of the above lemma, namely that it is sufficient to assume that only one of or is zero. In Corollary 4.16 we prove a further generalisation based on the results in the following subsection.
3.2 “Hook”-shaped spaces
It is known since [21] that the additivity of the tensor rank holds for tensors with one of the factors of dimension , that is, using Notation 3.1 and 3.2, if then . The same claim is recalled in [24, Sect. 4] after Theorem 4.1. The brief comment says that if rank of can be calculated by the substitution method, then the additivity of the rank holds. Landsberg and Michałek implicitly suggest that if , then the rank of can be calculated by the substitution method, [24, Items (1)–(6) after Prop. 3.1]. This is indeed the case (at least over an algebraically closed field ), although rather demanding to verify, at least in the version of the algorithm presented in the cited article. In particular, to show that the substitution method can calculate the rank of , one needs to use the normal forms of such tensors [22, §10.3] and understand all the cases, and it is hard to agree that this method is so much simplier than the original approach of [21].
Instead, probably, the intention of the authors of [24] was slightly different, with a more direct application of [24, Prop. 3.1] (or Proposition 3.11 below). This has been carefully detailed and described in [27, Prop. 3.2.12] and here we present this approach to show a stronger statement about small “hook”-shaped spaces (Proposition 3.18). We stress that our argument for Proposition 3.18, as well as [27, Prop. 3.2.12] requires the assumption of an algebraically closed base field , while the original approach of [21] works over any field. For a short while we also work over an arbitrary field.
Definition 3.9**.**
*For non-negative integers , we say that a linear subspace is -hook shaped, if for some choices of linear subspaces and . *
The name “hook shaped” space comes from the fact that under an appropriate choice of basis, the only non-zero coordinates form a shape of a hook situated in the upper left corner of the matrix, see Example 3.10. The integers specify how wide the edges of the hook are. A similar name also appears in the context of Young diagrams, see for instance [5, Def. 2.3].
Example 3.10**.**
A -hook shaped subspace of has only the following possibly nonzero entries in some coordinates:
[TABLE]
The following elementary observation is presented in [24, Prop. 3.1] and in [3, Lem. B.1]. Here we have phrased it in a coordinate free way.
Proposition 3.11**.**
Let , , and pick such that is nonzero. Consider two hyperplanes in : the linear hyperplane and the affine hyperplane . For any , denote
[TABLE]
Then:
- (i)
there exists a choice of such that , 2. (ii)
if in addition , then for any choice of we have .
See [24, Prop. 3.1] for the proof (note the statement there is over the complex numbers only, but the proof is field independent) or, alternatively, using Lemma 2.9 translate it into the following straightforward statement on linear spaces of tensors:
Proposition 3.12**.**
Suppose is a linear subspace, . Assume is a non-zero element. Then:
- (i)
there exists a choice of a complementary subspace , such that and , and 2. (ii)
if in addition , then for any choice of the complementary subspace we have .
Proposition 3.11 is crucial in the proof that the additivity of the rank holds for vector spaces, one of which is -hook shaped (provided that the base field is algebraically closed). Before taking care of that, we use the same proposition to prove a simpler statement about -hook shaped spaces, which is valid without any assumption on the field. The proof essentially follows the idea outlined in [24, Thm 4.1].
Proposition 3.13**.**
*Suppose is -hook shaped and is an arbitrary subspace. Then the additivity of the rank holds for . *
Before commencing the proof of the proposition we state three lemmas, which will be applied to both and hook shaped spaces. The first lemma is analogous to [24, Thm 4.1]. In this lemma (and also in the rest of this section) we will work with a sequence of tensors, in the space , which are not necessarily direct sums. Nevertheless, for each , we write (that is, this is the “corner” of corresponding to , and ). We define analogously.
Lemma 3.14**.**
Suppose and are two subspaces. Let and suppose that there exists a sequence of tensors satisfying the following properties:
- (1)
* is such that ,* 2. (2)
* for every ,* 3. (3)
* for every ,* 4. (4)
* for each .*
*Then the additivity of the rank holds for and for each we must have . *
Proof.
We have
[TABLE]
The nonvanishing of follows from (3).
The second lemma tells us how to construct a single step in the above sequence.
Lemma 3.15**.**
Suppose is a linear subspace, is a tensor, and is such that:
- •
,
- •
* preserves , that is, , where .*
- •
* does not have entries in , that is *
*Consider to be the perpendicular hyperplane. Then there exists that satisfies properties (2)–(4) of Lemma 3.14 (for a fixed ). *
Proof.
As in Proposition 3.11 for set . We will pick among the . In fact by Proposition 3.11(i) there exists a choice of such that has rank less than , that is, (4) is satisfied. On the other hand, since is in , we have (where with and ) and by Proposition 3.11(ii) also (3) is satisfied. Property (2) follows, as (in particular, ) has no entries in . Finally, thanks to the assumption that preserves and is a linear subspace.
The next lemma is the common first step in the proofs of additivity for and hooks: we construct a few initial elements of the sequence needed in Lemma 3.14.
Lemma 3.16**.**
Suppose is a -hook shaped space for some integer and is arbitrary. Fix and as in Definition 3.9 for . Then there exists a sequence of tensors for some that satisfies properties (1)–(4) of Lemma 3.14 and in addition and for every we have . In particular:
- •
* is a -hook shaped space for every , while is a -hook shaped space.*
- •
Every is “almost” a direct sum tensor, that is, where
[TABLE]
Proof.
To construct the sequence we recursively apply Lemma 3.15. By our assumptions, for some choice of and fixed . We let .
Tensor is defined by (1). Suppose we have already constructed and that is not yet contained in . Therefore there exists a hyperplane for some such that , but . Equivalently, and . In particular, and . Thus preserves as in Lemma 3.15 and has no entries in .
Thus we construct using Lemma 3.15. Since we are gradually reducing the dimension of the third factor of the tensor space containing , eventually we will arrive at the case , proving the claim.
Proof of Proposition 3.13.
We construct the sequence as in Lemma 3.14. The initial elements of the sequence are given by Lemma 3.16. By the lemma and our assumptions, for some choices of and and
[TABLE]
Now suppose that we have constructed for some satisfying (2)–(4), such that
[TABLE]
If , then by Lemma 3.14 we are done, as . So suppose , and choose such that , that is, since . We produce using Lemma 3.15 with the roles of and swapped (so also takes the role of etc.).
We stop after constructing and thus the desired sequence exists and proves the claim.
In the rest of this section we will show that an analogous statement holds for -hook shaped spaces under an additional assumption that the base field is algebraically closed. We need the following lemma (false for nonclosed fields), whose proof is a straightforward dimension count, see also [27, Prop. 3.2.11].
Lemma 3.17**.**
Suppose is algebraically closed (of any characteristic) and and . Then at least one of the following holds:
- •
there exists a rank one matrix in , or
- •
for any there exists a rank one matrix in , where is the hyperplane defined by .
Proof.
If is not -concise, then both claims trivially hold (except if rank of is one, then only the first claim holds). Thus without loss of generality, we may suppose is concise by replacing and with smaller spaces if necessary. If , then the projectivisation of the image intersects the Segre variety by the dimension count [20, Thm I.7.2] (note that here we use that the base field is algebraically closed). Otherwise, and the intersection
[TABLE]
has positive dimension by the same dimension count. In particular, any hyperplane also intersects the Segre variety.
The next proposition reproves (under the additional assumption that is algebraically closed) and slightly strengthens the theorem of JaJa-Takche [21], which can be thought of as a theorem about -hook shaped spaces.
Proposition 3.18**.**
*Suppose is algebraically closed, is -hook shaped and is an arbitrary subspace. Then the additivity of the rank holds for . *
Proof.
We will use Lemmas 3.14, 3.15 and 3.16 again. That is, we are looking for a sequence with the properties (1)–(4), and the initial elements are constructed in such a way that p_{k}\in A^{\prime}\otimes B^{\prime}\otimes C^{\prime}\oplus A^{\prime\prime}\otimes\big{(}\left\langle x\right\rangle\otimes C^{\prime}\oplus B^{\prime\prime}\otimes{\Bbbk}^{2}\big{)}. Here is such that .
We have already “cleaned” the part of the hook of size , and now we work with the remaining space of matrices. Unfortunately, cleaning produces rubbish in the other parts of the tensor, and we have to control the rubbish so that it does not affect , see (2). Note that what is left to do is not just the plain case of Strassen’s additivity in the case of proven in [21] since may have already nontrivial entries in another block, the one corresponding to (the small tensor in the statement of Lemma 3.16).
We set . To construct we use Lemma 3.17 (in particular, here we exploit the algebraic closedness of ). Thus either there exists such that , or there exists such that . In both cases we apply Lemma 3.15 with the roles of and swapped or the roles of and swapped. The conditions in the lemma are straightforward to verify.
We stop after constructing and thus the desired sequence exists and proves the claim.
4 Rank one matrices and additivity of the tensor rank
As hinted by the proof of Proposition 3.18, as long as we have a rank one matrix in the linear space or , we have a good starting point for an attempt to prove the additivity of the rank. Throughout this section we will make a formal statement out of this observation and prove that if there is a rank one matrix in the linear spaces, then either the additivity holds or there exists a “smaller” example of failure of the additivity. In Section 4.4 we exploit several versions of this claim in order to prove Theorem 1.2.
Throughout this section we follow Notations 2.2 (denoting the rank one elements in a vector space by the subscript ), 3.1 (introducing the vector spaces and their dimensions ), 3.2 (defining a direct sum tensor and the corresponding vector spaces ), and also 3.4 (which explains the conventions for projections and vector spaces , which measure how much the fixed decomposition of sticks out from the direct sum ).
4.1 Combinatorial splitting of the decomposition
We carefully analyse the structure of the rank one matrices in . We will distinguish seven types of such matrices.
Lemma 4.1**.**
Every element of lies in the projectivisation of one of the following subspaces of :
- (i)
, , (, ) 2. (ii)
, , (, )
, , (, ) 3. (iii)
. ()
The spaces in (i) are purely contained in the original direct summands, hence, in some sense, they are the easiest to deal with (we will show how to “get rid” of them and construct a smaller example justifying a potential lack of additivity).111The word comes from the Polish way of pronouncing the ′′ symbol. The spaces in (ii) stick out of the original summand, but only in one direction, either horizontal (, ), or vertical (, )222Here the letters “H, V, L, R” stand for “horizontal, vertical, left, right” respectively.. The space in (iii) is mixed and it sticks out in all directions. It is the most difficult to deal with and we expect that the typical counterexamples to the additivity of the rank will have mostly (or only) such mixed matrices in their minimal decomposition. The mutual configuration and layout of those spaces in the case , is illustrated in Figure 1.
Proof of Lemma 4.1.
Let be a matrix of rank one. Write and , where and . We consider the image of via the four natural projections introduced in Notation 3.4:
[TABLE]
Notice that and cannot be simultaneously zero, since . Analogously, .
Equations (4.2a)–(4.2d) prove that the non-vanishing of one of induces a restriction on another one. For instance, if , then by (4.2b) we must have . Or, if , then (4.2a) forces , and so on. Altogether we obtain the following cases:
- (1)
If , then (case ).
- (2)
if and , then (case ).
- (3)
if and , then (case ).
- (4)
If , then either and therefore (case ), or and (case ).
- (5)
If , then either and thus (case ), or and (case ).
This concludes the proof.
As in Lemma 4.1 every element of lies in one of seven subspaces of . These subspaces may have nonempty intersection. We will now explain our convention with respect to choosing a basis of consisting of elements of .
Here and throughout the article by we denote the disjoint union.
Notation 4.3**.**
We choose a basis of in such a way that:
- •
* consist of rank one matrices only,*
- •
, where each of , , , , , , and is a finite set of rank one matrices of the respective type as in Lemma 4.1 (for instance, , , etc.).
- •
* has as many elements of and as possible, subject to the first two conditions,*
- •
* has as many elements of , , and as possible, subject to all of the above conditions.*
*Let be the number of elements of (equivalently, ) and analogously define , , , , , and . The choice of need not be unique, but we fix one for the rest of the article. Instead, the numbers , , and are uniquely determined by (there may be some non-uniqueness in dividing between , , , ). *
Thus to each decomposition we associated a sequence of seven non-negative integers . We now study the inequalities between these integers and exploit them to get theorems about the additivity of the rank.
Proposition 4.4**.**
In Notations 3.4 and 4.3 the following inequalities hold:
- (i)
\mathbf{prime}+\mathbf{hl}+\mathbf{vl}+\min\big{(}\mathbf{mix},\mathbf{e}^{\prime}\mathbf{f}^{\prime}\big{)}\geq R(W^{\prime}), 2. (ii)
\mathbf{bis}+\mathbf{hr}+\mathbf{vr}+\min\big{(}\mathbf{mix},\mathbf{e}^{\prime\prime}\mathbf{f}^{\prime\prime}\big{)}\geq R(W^{\prime\prime}), 3. (iii)
\mathbf{prime}+\mathbf{hl}+\mathbf{vl}+\min\big{(}\mathbf{hr}+\mathbf{mix},\mathbf{f}^{\prime}(\mathbf{e}^{\prime}+\mathbf{e}^{\prime\prime})\big{)}\geq R(W^{\prime})+\mathbf{e}^{\prime\prime}, 4. (iv)
\mathbf{prime}+\mathbf{hl}+\mathbf{vl}+\min\big{(}\mathbf{vr}+\mathbf{mix},\mathbf{e}^{\prime}(\mathbf{f}^{\prime}+\mathbf{f}^{\prime\prime})\big{)}\geq R(W^{\prime})+\mathbf{f}^{\prime\prime}, 5. (v)
\mathbf{bis}+\mathbf{hr}+\mathbf{vr}+\min\big{(}\mathbf{hl}+\mathbf{mix},\mathbf{f}^{\prime\prime}(\mathbf{e}^{\prime}+\mathbf{e}^{\prime\prime})\big{)}\geq R(W^{\prime\prime})+\mathbf{e}^{\prime}, 6. (vi)
\mathbf{bis}+\mathbf{hr}+\mathbf{vr}+\min\big{(}\mathbf{vl}+\mathbf{mix},\mathbf{e}^{\prime\prime}(\mathbf{f}^{\prime}+\mathbf{f}^{\prime\prime})\big{)}\geq R(W^{\prime\prime})+\mathbf{f}^{\prime}.
Proof.
To prove Inequality (i) we consider the composition of projections . The linear space is spanned by rank one matrices (where as in Notation 4.3), and it contains . Thus . But the only elements of the basis that survive both projections (that is, they are not mapped to zero under the composition) are , , , and . Thus
[TABLE]
On the other hand, , thus among we can choose at most linearly independent matrices. Thus
[TABLE]
The two inequalities prove (i).
To show Inequality (iii) we may assume that is concise as in the proof of Lemma 3.5. Moreover, as in that same proof (more precisely, Inequality (3.6)) we show that But sends all matrices from and to zero, thus
[TABLE]
As in the proof of Part (i), we can also replace by , since , concluding the proof of (iii).
The proofs of the remaining four inequalities are identical to one of the above, after swapping the roles of and or ′ and ′′ (or swapping both pairs).
Proposition 4.5**.**
*With Notation 3.4, if one among is zero, then . *
Proof.
Let us assume without loss of generality that . Using the definitions of sets , , ,…as in Notation 4.3 we see that , due to the order of choosing the elements of the basis : For instance, a potential candidate to became a member of , would be first elected to , and similarly is consumed by and by . Thus:
[TABLE]
Proposition 4.4(i) and (ii) implies
[TABLE]
while always holds. This shows the desired additivity.
Corollary 4.6**.**
Assume that the additivity fails for and , that is, . Then the following inequalities hold:
- (a)
, 2. (b)
, 3. (c)
.
Proof.
To prove (a) consider the inequalities (i) and (ii) from Proposition 4.4 and their sum:
[TABLE]
The lefthand side of (4.7) is equal to , while its righthand side is . Thus the desired claim.
Similarly, using inequalities (iii) and (v) of the same propostion we obtain (b), while (iv) and (vi) imply (c). Note that and by Proposition 4.5.
4.2 Replete pairs
As we hunger after inequalities involving integers we distinguish a class of pairs with particularly nice properties.
Definition 4.8**.**
*Consider a pair of linear spaces and with a fixed minimal decomposition and as in Notation 4.3. We say is replete, if and . *
Remark 4.9**.**
*Striclty speaking, the notion of replete pair depends also on the minimal decomposition . But as always we consider a pair and with a fixed decomposition , so we refrain from mentioning in the notation. *
The first important observation is that as long as we look for pairs that fail to satisfy the additivity, we are free to replenish any pair. More precisely, for any fixed , (and ) define the repletion of as the pair :
[TABLE]
Proposition 4.11**.**
For any , with Notation 4.3, we have:
[TABLE]
In particular, if the additivity of the rank fails for , then it also fails for . Moreover,
- (i)
* is a minimal decomposition of ; in particular, the same distinguished basis works for both and .* 2. (ii)
* is a replete pair.* 3. (iii)
The gaps , , and , are at most (respectively) , , and .
Proof.
Since , the inequality is clear. Moreover is spanned by and additional matrices, that can be chosen out of — in particular, these additional matrices are all of rank and . The inequalities about ′′ and follow similarly.
Further , thus is a decomposition of . Therefore also , showing and (i). Item (ii) follows from (i), while (iii) is a rephrasement of the initial inequalities.
Moreover, if one of the inequalities of Lemma 3.5 is an equality, then the respective or is not affected by the repletion.
Lemma 4.12**.**
*If, say, , then , and analogous statements hold for the other equalities coming from replacing by in Lemma 3.5. *
Proof.
By Lemma 3.5 applied to and by Proposition 4.11 we have:
[TABLE]
Therefore all inequalities are in fact equalities. In particular, . The claim of the lemma follows from .
4.3 Digestion
For replete pairs it makes sense to consider the complement of in , and of in .
Definition 4.13**.**
With Notation 4.3, suppose and denote the following linear spaces:
[TABLE]
*We call the pair the digested version of . *
Lemma 4.14**.**
*If is replete, then and . *
Proof.
Both and are contained in . The intersection is zero, since the seven sets are disjoint and together they are linearly independent. Furthermore,
[TABLE]
Thus , which concludes the proof of the first claim. The second claim is analogous.
These complements might replace the original replete pair : as we will show, if the additivity of the rank fails for , it also fails for . Moreover, is still replete, but it does not involve any or .
Lemma 4.15**.**
Suppose is replete, define and as above and set . Then
- (i)
* and the space determines a minimal decomposition of . In particular, is replete and both spaces and contain no rank one matrices.* 2. (ii)
If the additivity of the rank holds for , then it also holds for , that is, .
Proof.
Since , we must have . On the other hand, , hence . These two claims show the equality for in (i) and that gives a minimal decomposition of . Since there is no tensor of type or in this minimal decomposition, it follows that the pair is replete by definition. If, say, contained a rank one matrix, then by our choice of basis in Notation 4.3 it would be in the span of , a contradiction.
Finally, if , then:
[TABLE]
showing the statement (ii) for .
As a summary, in our search for examples of failure of the additivity of the rank, in the previous section we replaced a linear space by its repletion , that is possibly larger. Here in turn, we replace by a smaller linear space . In fact, and , and also and etc. That is, changing into makes the corresponding tensors possibly “smaller”, but not larger. In addition, we gain more properties: is replete and has no ’s or ’s in its minimal decomposition.
Corollary 4.16**.**
Suppose that is as in Notation 3.2 and that and are as in Notation 3.4. If either:
- (i)
* is an arbitrary field, and , or* 2. (ii)
* is algebraically closed, and ,*
*then the additivity of the rank holds. *
Proof.
By Proposition 4.11 and Lemma 4.15, we can assume is replete and equal to its digested version. But then (since ) we must have . In particular, is, respectively, a -hook shaped space or a -hook shaped space. Then the claim follows from Proposition 3.13 or Proposition 3.18.
4.4 Additivity of the tensor rank for small tensors
We conclude our discussion of the additivity of the tensor rank with the following summarising results.
Theorem 4.17**.**
Over an arbitrary base field assume is any tensor, while is concise and . Then the additivity of the rank holds:
[TABLE]
*The analogous statements with the roles of replaced by or , or the roles of ′ and ′′ swapped, hold as well. *
Proof.
Since is concise, the corresponding vector subspace has dimension equal to . By Corollary 4.16(i) we may assume or . Say, , then by Corollary 3.7 the additivity must hold.
Theorem 4.18**.**
*Suppose the base field is or (complex or real numbers) and assume is any tensor, while for an arbitrary vector space . Then the additivity of the rank holds: . *
Proof.
By the classical Ja’Ja’-Takche Theorem [21] (in the algebraically closed case also shown in Proposition 3.18), we can assume is concise in . But then by [33, Thm 5 and Thm 6] the rank of is at most and the result follows from Theorem 4.17.
Note that in the proof above we exploit the results about maximal rank in . In [33] the authors assume that the base field is o r. We are not aware of any similar results over other fields, with the unique exception of , see the next proof for a discussion.
Theorem 4.19**.**
Suppose the base field is such that:
- •
the maximal rank of a tensor in is at most .
*(For example is algebraically closed of characteristic or ). Furthermore assume . Then independently of , the additivity of the rank holds: . *
Proof.
Without loss of generality, we may assume is concise in . As in the previous proof, if any of the dimensions , , is at most , then the claim follows from [21]. On the other hand, if any of the dimensions , , is at least , then the result follows from Theorem 4.17. The remaining case also follows from Theorem 4.17 by our assumption on the field .
The assumption is satisfied for see [6, Thm 5.1] or [33, Thm 5]. In [6, top of p. 402] the authors say that their proof is also valid for any algebraically closed field of characteristic not equal to . They also provide the interesting history of this question and, furthermore, they show that the assumption about maximal rank in fails for .
Assuming the base field is , one of the smallest cases not covered by the above theorems would be the case of . The generic rank (that is, the rank of a general tensor) in is , moreover [4, p. 6] claims the maximal rank is (see also [33, Prop. 2]).
Example 4.20**.**
Suppose and either and or and . Suppose both and are tensors of rank and that the additivity of the rank fails for . Let and be as in Notation 3.2, and , , etc. be as in Notation 3.4. Then:
- •
,
- •
,
- •
with , , etc., as in Notation 4.3, we have , and the following inequalities hold:
[TABLE]
Sketch of proof.
For brevity we only argue in the case , while the proof of is very similar. Both tensors must be concise, as otherwise either Theorem 4.18 or JaJa-Takche Theorem imply the additivity of the rank. By Corollary 3.7 we must have , and similarly for , , . If one of them is strictly less then , then Corollary 4.16(ii) implies the additivity, a contradiction, thus .
By the failure of the additivity, we must have , but Lemma 3.5 implies also , showing that .
If, say , then the digested version of repletion of is also a counterexample to the additivity by Lemma 4.15(ii). If has lower rank than , then either is not concise, contradicting Theorem 4.18 or contradicts the above calculations of rank. Thus also and by Lemma 4.15(i) we must have . In fact, .
Let be the smallest linear subspace such that . Set . Since , we must have
[TABLE]
That is, is -hook shaped. Since , Proposition 3.18 shows that . Similarly, , , are also at least . We also see that , that is, the elements of type are concise in .
Next, we show that , which is perhaps the most interesting part of this example. For this purpose we consider the projection . The related map (which by the standard abuse we also denote ), kills all the rank one tensors of types , , and , leaving only those of type alive. The image has rank at most and is concise (otherwise, either Proposition 3.18 shows the additivity or is not concise, a contradiction in both cases). Note that and there are only two (up to a change of basis) concise linear subspaces of which have rank at most . In both cases it is straightforward to verify that there exists such that has rank . Then, by swapping the roles of and , the process of repletion and digestion (Lemma 4.15) leads to a smaller tensor which is also a counterexample to the additivity of the rank, again a contradiction. Thus must be at least and consequently, . The same argument shows that .
Combining the inequalities obtained so far we also get:
[TABLE]
The inequality follows from Corollary 4.6(a), and it is left to show only the last two inequalities. To prove , we use Proposition 4.4(ii):
[TABLE]
The last inequality follows from a similar argument.
5 Additivity of the tensor border rank
Throughout this section we will follow Notations 3.1 and 3.2. Moreover, we restrict to the base field .
We turn our attention to the additivity of the border rank. That is, we ask for which tensors and the following equality holds:
[TABLE]
Since the known counterexamples to the additivity are much smaller than in the case of the additivity of the tensor rank, our methods are more restricted to very small cases. We commence with the following elementary observation.
Lemma 5.1**.**
*Consider concise tensors and with and (thus in fact and ). Let . Then the additivity of the border rank holds . *
Proof.
Since and are concise, the linear maps and are injective. Then also the map is injective and
[TABLE]
The opposite inequality always holds.
Corollary 5.2**.**
*Suppose both triples of integers and fall into one of the following cases: , , with , with , with . Then for any concise tensors and the additivity of the border rank holds. *
Note that the list of triples in the corollary is a bit exaggerated, as some of these triples have no concise tensors. However, this phrasing is convenient for further applications and search for unsolved pairs of triples.
Proof.
After removing the triples that do not admit any concise tensor the list reduces to: , , (for ), (for ), . We claim that in all these cases and . In fact:
- •
The claim is clear for , , and .
- •
For and the claim follows from the classification of such tensors, see the argument in the first paragraph of [7, §5.3].
- •
For (with ), and (with ), the claim follows from the previous case: any such concise tensor has border rank at least . But is at the same time a (non-concise) tensor in a larger tensor space or . Thus by Lemma 2.7 the border rank of is at most the generic (border) rank in this larger space, which is equal to by the previous item.
Therefore we conclude using Lemma 5.1.
Theorem 1.4 claims that the additivity of the border rank holds for . Most of the cases follow from Corollary 5.2, with the exception of and , which are covered in Sections 5.2 and 5.3.
Definition 5.3**.**
*Assume are two tensors. We say that is more degenerate than if . *
Example 5.4**.**
*Any concise tensor in is more degenerate than any concise tensor in . *
Example 5.5**.**
Consider concise tensors in . According to [22, Table 10.3.1], there are two orbits of the action of of such tensors, both orbits of border rank . One orbit is “generic”, the other is more degenerate. The latter is represented by:
[TABLE]
Lemma 5.6**.**
*Suppose is an arbitrary tensor and are such that and is more degenerate than . If the additivity of the border rank holds for then it also holds for . *
Proof.
Since is more degenerate than also is more degenerate than . Thus
[TABLE]
5.1 Strassen’s equations of secant varieties
Often as a criterion to determine whether a tensor is or is not of a given border rank, we exploit defining equations of the corresponding secant varieties. We review here one type of equations that is most important for the small cases we consider in this article.
First assume and consider the space of square matrices . Let be the map of matrices defined as follows:
[TABLE]
where denotes the adjoint matrix of .
As in Section 2.4 write
[TABLE]
where are matrices and is a basis of .
Proposition 5.8**.**
Assume that .
- (i)
[32]** Suppose . Then if and only if for every . 2. (ii)
[23]** Suppose and . Then , for every .
See also [19, Thm 3.2].
We also recall Ottaviani’s derivation of Strassen’s equations ([25], see also [22, Sect. 3.8.1]) for secant varieties of three factor Segre embeddings.
Given a tensor , consider the contraction operator
[TABLE]
obtained as composition of the map with the natural projection .
Proposition 5.9** ([25, Theorem 4.1]).**
*Assume . If , then . *
If , we can slice as follows (cf. Section 2.4): , with . Then the matrix representation of in block matrices is the following partitioned matrix
[TABLE]
Proposition 5.11** ([22, Prop. 7.6.4.4]).**
If , the degree nine equation
[TABLE]
*defines the variety . *
If and , with , then the matrix representation of in block matrices is the following partitioned matrix
[TABLE]
5.2 Case
Assume , and .
Proposition 5.13**.**
*For any and the additivity of the border rank holds. *
Proof.
We can assume is concise, so that . Also if is not concise, then Corollary 5.2 shows the claim. So suppose is concise and thus .
We can write and , where are matrices and is an invertible matrix.
As for , by Example 5.5 and Lemma 5.6 we can choose the more degenerate tensor, which has the following normal form:
[TABLE]
Write , where are the following partitioned matrices
[TABLE]
We use the same notation as in Section 5.1. We claim that the matrix representing the contraction operator , denoted by as in (5.12), has rank . We conclude that by Proposition 5.9 showing the addivitity.
In order to prove the claim, we observe that can be transformed via permutations of rows and columns into the following -partitioned matrix
[TABLE]
where is the following matrix
[TABLE]
One can compute that the rank of equals . Moreover, since and , we conclude the proof of the claim.
5.3 Case
Recall our usual setting: , , , etc. (Notation 3.2). In this subsection we are going to prove the following case of additivity of the border rank.
Proposition 5.14**.**
*The additivity of the border rank holds for if , and is concise and . *
Proof.
By replacing and with smaller spaces we can assume is also concise and in particular . If then Lemma 5.1 implies the claim. On the other hand, by Terracini’s Lemma, . Thus it is sufficient to treat the cases and .
Let be a basis of and let be a basis of . Write
[TABLE]
where are matrices. Similarly, let
[TABLE]
where are partitioned matrices:
[TABLE]
We now analyse the two cases and separately.
The additivity holds if the border rank of is equal to four
Assume by contradiction that . By Proposition 5.8(ii), we obtain the following equations: , for every and . We can see that is the following partitioned matrix
[TABLE]
Therefore we have
[TABLE]
Since is concise, , and thus from the vanishing of we also obtain that . Therefore by Proposition 5.8(i), a contradiction.
The additivity holds if the border rank of is equal to five
Consider the projection given by
[TABLE]
Consider and write , where, for , is the partitioned matrix
[TABLE]
We claim that . Indeed, by swapping both rows and columns of (see Equation 5.10) we obtain the following partitioned matrix
[TABLE]
Since , the matrix has rank , by Proposition 5.11. Moreover has rank . Therefore, by Proposition 5.9, we obtain . We conclude by observing that .
This concludes the proof of Theorem 1.4, as all possible splittings , , with are covered either by Corollary 5.2 or one of Propositions 5.13 or 5.14.
One could analyse the additivity for (so for the bound one more than in Theorem 1.4) by checking all 10 possible cases listed in Table 1. We conclude the article by solving also Case from the table.
Example 5.17**.**
*If and are both concise, then the additivity of the border rank holds for . Indeed, by Example 5.4 there exists more degenerate than , but of the same border rank. By Lemma 5.6 it is enough to prove the additivity for . This is provided by Proposition 5.14. *
Acknowledgments
We are enormously grateful to Joseph Landsberg for introducing us to this topic and numerous discussions and explanations. We also thank Michael Forbes, Mateusz Michałek, Artie Prendergast-Smith, Zach Teitler, and Alan Thompson for reference suggestions and their valuable comments. We are also greatful the referees and the journal editors for their suggestions that have helped to improve the results and presentation.
The research on this project was spread across a wide period of time. It commenced once E. Postinghel was a postdoc at IMPAN in Warsaw (Poland, 2012-2013) under the project “Secant varieties, computational complexity, and toric degenerations” realised within the Homing Plus programme of Foundation for Polish Science, cofinanced from European Union, Regional Development Fund.
Also our collaboration in years 2014-2019 was possible during many meetings, in particular those that were related to special programmes, such as: the thematic semester “Algorithms and Complexity in Algebraic Geometry” at Simons Institute for the Theory of Computing (2014), the Polish Algebraic Geometry mini-Semester (miniPAGES, 2016), and the thematic semester Varieties: Arithmetic and Transformations (2018). The latter two events were supported by the grant 346300 for IMPAN from the Simons Foundation and the matching 2015-2019 Polish MNiSW fund. We are grateful to the participants of these semesters for numerous inspiring discussions and to the sponsors for supporting our participations.
We are grateful to Loughborough University for hosting our collaboration in May 2017 and to Copenhagen University for hosting us in January 2019.
In addition, J. Buczyński is supported by the Polish National Science Center project “Algebraic Geometry: Varieties and Structures”, 2013/08/A/ST1/00804, the scholarship “START” of the Foundation for Polish Science and a scholarship of Polish Ministry of Science.
E. Postinghel was supported by a grant of the Research Foundation - Flanders (FWO) between 2013-2016 and is supported by the EPSRC grant no. EP/S004130/1 from late 2018.
Finally, the paper is also a part of the activities of the AGATES research group.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] H. Abo, G. Ottaviani, and C. Peterson , Induction for secant varieties of Segre varieties , Trans. Amer. Math. Soc., 361 (2009), pp. 767–792, https://doi.org/10.1090/S 0002-9947-08-04725-9 , http://dx.doi.org/10.1090/S 0002-9947-08-04725-9 . · doi ↗
- 2[2] B. Ådlandsvik , Joins and higher secant varieties , Math. Scand., 61 (1987), pp. 213–222, https://doi.org/10.7146/math.scand.a-12200 , https://doi.org/10.7146/math.scand.a-12200 . · doi ↗
- 3[3] B. Alexeev, M. A. Forbes, and J. Tsimerman , Tensor rank: some lower and upper bounds , in 26th Annual IEEE Conference on Computational Complexity, IEEE Computer Soc., Los Alamitos, CA, 2011, pp. 283–291, https://doi.org/10.1109/ccc.2011.28 . · doi ↗
- 4[4] M. D. Atkinson and N. M. Stephens , On the maximal multiplicative complexity of a family of bilinear forms , Linear Algebra Appl., 27 (1979), pp. 1–8, https://doi.org/10.1016/0024-3795(79)90026-0 , https://doi.org/10.1016/0024-3795(79)90026-0 . · doi ↗
- 5[5] A. Berele and A. Regev , Hook Young diagrams with applications to combinatorics and to representations of Lie superalgebras , Adv. in Math., 64 (1987), pp. 118–175, https://doi.org/10.1016/0001-8708(87)90007-7 , https://doi.org/10.1016/0001-8708(87)90007-7 . · doi ↗
- 6[6] M. R. Bremner and J. Hu , On Kruskal’s theorem that every 3 × 3 × 3 3 3 3 3\times 3\times 3 array has rank at most 5 , Linear Algebra Appl., 439 (2013), pp. 401–421, https://doi.org/10.1016/j.laa.2013.03.021 , https://doi.org/10.1016/j.laa.2013.03.021 . · doi ↗
- 7[7] J. Buczyński, K. Han, M. Mella, and Z. Teitler , On the locus of points of high rank , Eur. J. Math., 4 (2018), pp. 113–136, https://doi.org/10.1007/s 40879-017-0172-2 . · doi ↗
- 8[8] J. Buczyński and J. Jelisiejew , Finite schemes and secant varieties over arbitrary characteristic , Differential Geom. Appl., 55 (2017), pp. 13–67, https://doi.org/10.1016/j.difgeo.2017.08.004 , https://doi.org/10.1016/j.difgeo.2017.08.004 . · doi ↗
