Skip to main content
Springer logoLink to Springer
. 2021 Sep 28;50(2):557–580. doi: 10.1007/s10013-021-00522-7

Universality of High-Strength Tensors

Arthur Bik 1, Alessandro Danelon 2, Jan Draisma 2,3,, Rob H Eggermont 2
PMCID: PMC9054888  PMID: 35535306

Abstract

A theorem due to Kazhdan and Ziegler implies that, by substituting linear forms for its variables, a homogeneous polynomial of sufficiently high strength specialises to any given polynomial of the same degree in a bounded number of variables. Using entirely different techniques, we extend this theorem to arbitrary polynomial functors. As a corollary of our work, we show that specialisation induces a quasi-order on elements in polynomial functors, and that among the elements with a dense orbit there are unique smallest and largest equivalence classes in this quasi-order.

Keywords: Strength, Polynomial functor, Infinite tensors, GL-varieties

Introduction

Let K be an algebraically closed field of characteristic 0. For partitions λ of integers d ≥ 1, denoted as λd, we consider the corresponding Schur functors Sλ. We refer the reader to [17] or [16, Lecture 6] for an introduction to these objects. For a tuple λ_=[λ1,,λk] of partitions λidi ≥ 1, we denote Sλ1Sλk by Sλ_. For finite-dimensional vector spaces V, W and a linear map φ : VW, we get a linear map

Sλ_(φ):Sλ_(V)Sλ_(W)

that depends polynomially on φ and satisfies Sλ_(idV)=idSλ_(V) and Sλ_(φψ)=Sλ_(φ)Sλ_(ψ) whenever the former makes sense. In particular, taking V = W and restricting our attention to invertible φ, we find that Sλ_(V) is a polynomial representation of the group GL(V ).

Example 1

For λ = (d), Sλ(V ) = SdV, the d-th symmetric power of V. If x1,…,xn is a basis of V, S(d)(V ) is the space of homogeneous polynomials of degree d in x1,…,xn.

For two tuples λ_, ν_ of partitions, we write ν_λ_ when the number of occurrences of every partition μd in ν_ is at most the number of occurrences of μ in λ_, where d is the maximal integer for which these numbers differ for some μ.

Example 2

We have [(1),(1),(1,1),(3)][(2),(3),(2,1)].

Let λ_ be a tuple of partitions of positive integers. The following dichotomy is our first main result.

Main Theorem I 1

Let P be a property that, for each finite-dimensional vector space V, can be satisfied by some elements of Sλ_(V). Assume that Sλ_(φ)(f)Sλ_(W) satisfies P for every element fSλ_(V) satisfying P and every linear map φ: VW. Then either P is satisfied by all elements of Sλ_(V) for all V or else all elements satisfying P come from simpler spaces Sμ_(V) for finitely many tuples μ_λ_.

We define later what it means to “come from Sμ_(V)”; for a more precise formulation of the theorem, see Theorem 2.5.2. When λ_ consists of one partition, the second case in the theorem says that elements satisfying P have bounded strength in the following sense.

Definition 1

The strength of an element fSλ(V ) with λd is the minimal integer k ≥ 0 such that there exists an expression

f=α1(g1,h1)++αk(gk,hk),

where μidi, νiei with di,ei < d, the αi:Sμi(V)Sνi(V)Sλ(V) are GL(V )-equivariant bilinear maps and the giSμi(V), hiSνi(V) are elements.

In Definition 2.2.6 we will give a broader definition that is equivalent to the one above for tuples consisting of a single partition. The definition above and Definition 2.2.6 extend the strength of polynomials and of tuples of polynomials, respectively. Strength of polynomials plays a key role in the resolution of Stillman’s conjecture by Ananyan–Hochster [1] and in recent work by Kazhdan–Ziegler [19, 20]. Main Theorem I is an extension (in characteristic zero) of [20, Theorem 1.9] for homogeneous polynomials, which is the case where λ_ is a single partition with a single row.

Next, denote the inverse limit of the spaces Sλ_(Kn) mapping to each other via Sλ_ applied to the projection maps Kn+ 1Kn by Sλ_,. This space comes with the action of the direct limit GL of the groups GLn mapping into each other via the maps g↦diag(g,1). It also comes with a topology induced by the Zariski topologies on Sλ_(Kn), which we again call the Zariski topology.

Corollary 1 (Corollary 2.6.3)

Suppose that the orbit GLp is Zariski dense in Sλ_,. Then for each integer n ≥ 1, the image of GLp in Sλ_(Kn) is all of Sλ_(Kn).

The second goal of this paper is to bring some order in the (typically uncountable) set of elements with dense GL-orbits. For elements p,qSλ_,, we write pq when q specialises to p; see Sections 2.72.8 for details.

Example 3

When λ = (d) ⊩ d, the space Sλ, consists of infinite degree-d forms in variables x1,x2,…. We have pq if and only if p = q(1,2,…) where 1,2,… are infinite linear forms such that for all i ≥ 1, the variable xi occurs in only finitely many forms j; this ensures that q(1,2,…) is a well-defined infinite form of degree d.

Our second main result is the following theorem.

Main Theorem II 1 (Theorem 2.9.1)

Let λ_ be a tuple of partitions, all of the same integer d ≥ 1. There exist elements p,rSλ_,, each with a dense GL-orbit, such that pqr for all other qSλ_, with a dense GL-orbit.

Structure of the paper

In Section 2, we introduce all relevant definitions and restate our main results in more precise terms. Also, while our main results require characteristic zero, some of our theory is developed in arbitrary characteristic. In Section 3, we prove Main Theorem I. In Section 4, we prove Main Theorem II by constructing minimal p and maximal r. Finally, we end with some examples in Section 5.

Definitions and Main Results

Fix a field K. In our main results we will assume that K is algebraically closed and of characteristic zero, but for now we make no such assumption.

Strength

Definition 2.1.1

Let n ≥ 1 be an integer and let fK[x1,…,xn]d be a homogeneous polynomial of degree d ≥ 2. Then the strength of f, denoted str(f), is the minimal integer k ≥ 0 such that there exists an expression

f=g1h1++gkhk,

where giK[x1,,xn]di and hiK[x1,,xn]ddi for some integer 0 < di < d for each i ∈ [k].

The strength of polynomials plays a key role in the resolution of Stillman’s conjecture by Ananyan–Hochster [1, 2], the subsequent work by Erman–Sam–Snowden [1214] and in Kazhdan–Ziegler’s work [19, 20]. Also see [35, 7, 9, 10] for other recent papers studying strength.

Polynomial Functors and Their Maps

Assume that K is infinite. Let Vec be the category of finite-dimensional vector spaces over K with K-linear maps.

Definition 2.2.1

A polynomial functor of degreed over K is a functor P : VecVec with the property that for all U, VVec the map P : Hom(U, V ) →Hom(P(U),P(V )) is a polynomial map of degree ≤ d. A polynomial functor is a polynomial functor of degree ≤ d for some integer d<.

Remark 2.2.2

For finite fields K, the correct analogue is that of a strict polynomial functor [15].

Any polynomial functor P is a finite direct sum of its homogeneous parts Pd, which are the polynomial subfunctors defined by Pd(V ) := {pP(V )∣∀tK : P(t idV)p = tdp} for each integer d ≥ 0. A polynomial functor is called homogeneous of degree d when it equals its degree-d part.

Example 2.2.3

The functor USd(U) is a homogeneous polynomial functor of degree d. If U has basis x1,…,xn, then Sd(U) is canonically isomorphic to K[x1,…,xn]d. In this incarnation, linear maps Sd(φ) for φ: UV correspond to substitutions of the variables x1,…,xn by linear forms in variables y1,…,ym representing a basis of V.

Polynomial functors are the ambient spaces in current research on infinite-dimensional algebraic geometry [68, 11]. Polynomial functors form an Abelian category in which a morphism α: PQ consists of a linear map αU: P(U) → Q(U) for each UVec such that for all U, VVec and all φ ∈Hom(U, V ) the following diagram commutes: graphic file with name 10013_2021_522_Figa_HTML.jpg In characteristic zero, each polynomial functor P is isomorphic, in this Abelian category, to a direct sum of Schur functors, which can be thought of as subobjects (or quotients) of the polynomial functors VVd. For that reason, we will informally refer to elements ofP(V ) astensors.

In addition to the linear morphisms between polynomial functors above, we may also allow each αU to be a polynomial map P(U) → Q(U) such that the diagram commutes. Such an α will be called a polynomial transformation from P to Q. If U is irrelevant or clear from the context, we write α instead of αU.

Example 2.2.4

In the context of Definition 2.1.1, we set P:=i=1k(SdiSddi) and Q := Sd and define α by

α(g1,h1,,gk,hk):=g1h1++gkhk.

This is a polynomial transformation PQ.

Example 2.2.5

Let Q, R be polynomial functors and α: QRP a linear morphism. Then (q, r)↦α(qr) defines a bilinear polynomial transformation QRP.

Inspired by these examples, we propose the following definition of strength for elements of homogeneous polynomial functors. We are not sure that this is the best definition in arbitrary characteristic, so we restrict ourselves to characteristic zero.

Definition 2.2.6

Assume that charK = 0. Let P be a homogeneous polynomial functor of degree d ≥ 2 and let VVec. The strength of pP(V ) is the minimal integer k ≥ 0 such that

p=α1(q1,r1)++αk(qk,rk)

where, for each i ∈ [k], Qi, Ri are irreducible polynomial functors with positive degrees adding up to d, αi: QiRiP is a bilinear polynomial transformation and qiQi(V ) and riRi(V ) are tensors.

Remark 2.2.7

Positive degrees of two polynomial functors cannot add up to 1. So nonzero tensors pP(V ) of homogeneous polynomial functors P of degree 1 cannot have finite strength. We say that such tensors p have infinite strength. Note that the strength of 0 ∈ P(V ) always equals 0.

Proposition 2.2.8

Assume that charK = 0. For each integer d ≥ 2, the strength of a polynomial fSd(V ) according to Definition 2.1.1 equals that according to Definition 2.2.6.

Proof

The inequality ≥ follows from the fact that αi:SdiSddiSd,(g,h)gh is a bilinear polynomial transformation. For the inequality ≤, suppose that α: QRSd is a nonzero bilinear polynomial transformation, where Q and R are irreducible of degrees e < d and de < d. So Q and R are Schur functors corresponding to Young diagrams with e and de boxes, respectively, and QR admits a nonzero linear morphism to Sd, whose Young diagram is a row of d boxes. The Littlewood–Richardson rule then implies that the Young diagrams of Q and R must be a single row as well, so that Q = Se and R = Sde, and also that there is (up to scaling) a unique morphism QR = SeSdeSd, namely, the one corresponding to the polynomial transformation (g, h)↦gh. □

The strength of a tensor in P quickly becomes very difficult when P is not irreducible.

Example 2.2.9

Take P = (Sd)e for some integer e ≥ 1. The strength of a tuple (f1,…,fe) ∈ P(V ) is the minimum number k ≥ 0 such that

f1,,fespan{g1,,gk},

where g1,…,gkSd(V ) are reducible polynomials.

Example 2.2.10

Consider P=S22, so that P(V ) = VV, and assume that K is algebraically closed. The only possibilities for Q and R are Q(V ) = R(V ) = V. The bilinear polynomial transformations α : QRP are of the form

α(u,v)=auv+bvu=c(uv+vu)+d(uvvu)

for certain a, b, c, dK. We note that str(A) = ⌈rk(A)/2⌉ when AS2(V ) and str(A) = rk(A)/2 when A2(V). In general, we have

rk(A)/2,rk(A+A)/2,rk(AA)/2str(A)rk(A),rk(A+A)/2+rk(AA)/2

for all AVV, where each bound can hold with equality. For example, for the matrix

A=01000100

we have rk(A + A)/2 = rk(AA)/2 = str(A) = rk(A).

Example 2.2.11

Again take P=S22 and consider P(K2) = K2×2. Assume K is algebraically closed. The matrix

A=1x01

clearly has strength ≤ 2. We will show that A has strength 2 whenever x = ± 2 and strength 1 otherwise. In particular, this shows that the subset of P(K2) of matrices of strength ≤ 1 is not closed.

Suppose A has strength 1. Then we can write A as auv + bvu with a, bK and v, uK2. Let e1, e2 be the standard basis of K2. Without loss of generality, we may assume that u = e1 + λe2 and v = e1 + μe2 for some λ, μK. We get

a+b=1,aμ+bλ=x,aλ+bμ=0,λμ=1.

Using λ = μ− 1 and b = 1 − a, we are left with aμ2 + (1 − a) = xμ and a + (1 − a)μ2 = 0. The latter gives us μ≠ ± 1 and a = μ2/(μ2 − 1). We get μ2 + 1 = xμ. Now, if x≠ ± 2, then such a μ≠ ± 1 exists. So in this case A indeed has strength 1. If x = ± 2, the only solution is μ = ± 1. Hence A has strength 2 in this case.

Subsets of Polynomial Functors

Definition 2.3.1

Let P be a polynomial functor. A subset of P consists of a subset X(U)P(U) for each UVec such that for all ϕ ∈Hom(U, V ) we have P(φ)(X(U))X(V). It is closed if each X(U) is Zariski-closed in P(U).

Example 2.3.2

Fix integers d ≥ 2 and k ≥ 0. The elements in Sd(V ) of strength ≤ k form a subset of Sd. This set is closed for d = 2,3 but not for d = 4; see [3].

Example 2.3.3

Take K= and let X(V ) be the set of positive semidefinite elements in S2(V ), i.e., those that are sums of squares of elements of V. Then X is a subset of S2.

Kazhdan–Ziegler’s Theorem: Universality of Strength

Theorem 2.4.1 (Kazhdan–Ziegler (20, Theorem 1.9))

Let d ≥ 2 be an integer. Assume that K is algebraically closed and of characteristic 0 or > d. Let X be a subset of Sd. Then either X = Sd or else there exists an integer k ≥ 0 such that each polynomial in each X(U) has strength ≤ k.

This theorem is a strengthening of [7, Theorem 4], where the additional assumption is that X is closed. The condition that K be algebraically closed cannot be dropped, e.g. by Example 2.3.3: there is no uniform upper bound on the strength of positive definite quadratic forms. The condition on the characteristic can also not be dropped, but see Remark 2.9.2.

Corollary 2.4.2 (Kazhdan–Ziegler, universality of strength)

With the same assumptions on K, for every fixed number of variables m ≥ 1 and degree d ≥ 2 there exists an r ≥ 0 such that for any number of variables n ≥ 1, any polynomial fK[x1,…,xn]d of strength ≥ r and any polynomial gK[y1,…,ym]d there exists a linear variable substitution xjicijyi under which f specialises to g.

Proof

For each UVec, define X(U)Sd(U) as the set of all f such that the map

Hom(U,Km)Sd(Km)ϕSd(ϕ)f

is not surjective. A straightforward computation shows that this is a subset of Sd. It is not all of Sd, because if we take U to be of dimension ddimSd(Km), then in Sd(U) we can construct a sum f of dimSd(Km) squarefree monomials in distinct variables and specialise each of these monomials to a prescribed multiple of a basis monomial in Sd(Km). Hence fX(U). By Theorem 2.4.1, it follows that the strength of elements of X(U) is uniformly bounded. □

Our Generalisation: Universality for Polynomial Functors

Let P, Q be polynomial functors. We say that Q is smaller than P, denoted QP, when P and Q are not (linearly) isomorphic and Qd is a quotient of Pd for the highest degree d where Pd and Qd are not isomorphic. We say that a polynomial functor P is pure when P({0}) = {0}.

Remark 2.5.1

Let QP be polynomial functors and suppose that P is homogeneous of degree d > 0. Then Qd must be a quotient of Pd. So we see that QRP for any polynomial functor R of degree < d.

The following is our first main result.

Theorem 2.5.2 (Main Theorem I)

Assume that K is algebraically closed of characteristic zero. Let X be a subset of a pure polynomial functor P over K. Then either X(U) = P(U) for all UVec or else there exist finitely many polynomial functors Q1,,QkP and polynomial transformations αi: QiP with X(U)i=1kim(αi,U) for all UVec. In the latter case, X is contained in a proper closed subset of P.

If we assume furthermore that P is irreducible, then in the second case there exists a integer k ≥ 0 such that for all UVec and all pX(U) the strength of p is at most k.

This is a strengthening of a theorem from the upcoming paper [8] (also appearing in the first author’s thesis [6, Theorem 4.2.5]), where the additional assumption is that X be closed.

Remark 2.5.3

When P is irreducible of degree 1, then P(U) = U. In this case, the subsets of P are P and {0}. So indeed, the elements of a proper subset of P have bounded strength, namely 0.

Again, the condition that K be algebraically closed cannot be dropped, and neither can the condition on the characteristic; however, see Remark 2.9.2. Main Theorem I has the same corollary as Theorem 2.4.1.

Corollary 2.5.4

With the same assumptions as in Main Theorem I, let UVec be a fixed vector space. Then there exist finitely many polynomial functors Q1,,QkP and polynomial transformations αi: QiP such that for every VVec and every fP(V ) that is not in i=1kim(αi,V) the map Hom(V, U) → P(U),φP(φ)f is surjective.

If P is irreducible, then the condition that fi=1kim(αi,V) can be replaced by the condition that f has strength greater than some function of dimU only.

Limits and Dense Orbits

Let P be a pure polynomial functor over K. There is another point of view on closed subsets of P, which involves limits that we define now.

Definition 2.6.1

We define P:=limnP(Kn), where the map P(Kn+ 1) → P(Kn) is P(πn) with πn: Kn+ 1Kn the projection map forgetting the last coordinate. We equip P with the inverse limit of the Zariski topologies on the P(Kn), which is itself a Zariski topology coming from the fact that P=(nP(Kn)). We also write P(πn) for the projection map PP(Kn); this will not lead to confusion. A polynomial transformation α: PQ naturally yields a continuous map PQ also denoted by α.

If P = Sd, then the elements of P can be thought of as homogeneous series of degree d in infinitely many variables x1,x2,…. Here, closed subsets of P are defined by polynomial equations in the coefficients of these series.

On P acts the group GL=nGLn, where GLn is embedded into GLn+ 1 via the map

gg001.

Indeed, with this embedding the map P(Kn+ 1) → P(Kn) in the definition of P is GLn-equivariant, and this yields the action of GL on the projective limit. In the case of degree-d series, an element gGLnGL maps each of the first n variables xi to a linear combination of x1,…,xn and the remaining variables to themselves.

The map that sends a closed subset X of P to the closed subset X:=limnX(Kn) of P is a bijection with the collection of closed GL-stable subsets of P [6, Proposition 1.3.28]. Hence closed subsets of polynomial functors can also be studied in this infinite-dimensional setting.

Example 2.6.2

On degree-d forms, GL clearly has dense orbits, such as that of

f=x1x2xd+xd+1xd+2x2d+

The reason is that this series can be specialised to any degree-d form in finitely many variables by linear variable substitutions. This implies that the image of GLf in each Sd(Kn) is dense. Hence GLf is dense in Sd.

For every pure polynomial functor P, the group GL has dense orbits on P—in fact, uncountably many of them! See [6, §4.5.1]. They have the following interesting property.

Corollary 2.6.3

Suppose that GLp is dense in P. Then for each integer n ≥ 1, the image of GLp in P(Kn) is all of P(Kn).

Proof

For VVec, define

X(V):=P(φ)P(πn)p|n1,φHom(Kn,V)P(V),

which is exactly the image of GLp under the projection PP(Km) followed by an isomorphism P(φ), where φ: KmV is a linear isomorphism. We see that X is a subset of P. For each VVec, the subset X(V ) is dense in P(V ) since GLp is dense in P. So X = P by Main Theorem I. □

The notion of strength has an obvious generalisation.

Definition 2.6.4

Assume that charK = 0. Let P be a homogeneous polynomial functor. The strength of a tensor pP is the minimal integer k ≥ 0 such that

p=α1(q1,r1)++αk(qk,rk)

for some irreducible polynomial functors Qi, Ri whose positive degrees sum up to d, bilinear polynomial transformations αi: QiRiP and elements qiQi, and riRi,. If no such k exists, we say that p has infinite strength.

Corollary 2.6.5

Assume that charK = 0 and that P is irreducible of degree ≥ 2. Then an element of P has infinite strength if and only if its GL-orbit is dense.

Proof

If pP has finite strength, then let αi: Qi × RiP be as in the definition above and let

α:=α1++αk:Q:=i=1k(QiRi)P

be their sum, so that p ∈im(α). Consider the closed subset X=im(α)¯, i.e., the closed subset defined by X(V)=im(αV)¯ for all VVec. As dimQ(Kn) is a polynomial in n of degree < d, while dimP(Kn) is a polynomial in n of degree d, we see that X(Kn) is a proper subset of P(Kn) for all n ≫ 0. Since pX, it follows that GLp is not dense.

Suppose, conversely, that GLp is not dense. Then it is contained in X for some proper closed subset X of P. Hence p has finite strength by Main Theorem I. □

Example 2.6.6

Let P, Q be homogeneous functors of the same degree d ≥ 2 and let pP be an element of infinite strength. Then (p,0)PQ also has infinite strength, but the orbit GL(p,0) is not dense.

Remark 2.6.7

In Section 4 we will use a generalisation of notation introduced here: for an integer m ≥ 0 we will write Pm for the limit limnP(K[n][m]) over all integers nm. This space is isomorphic to P, but the indices have been shifted by m. On Pm acts the group GLmGL, which is the union of GL(K[n]−[m]) over all nm. We denote the image of an element pPm in P(K[n]−[m]) by p[n]−[m]. The inclusions ιn: K[n]−[m]Kn sending v↦(0,v) allow us to view Pm as a subset of P.

Corollary 2.6.8

Let P be a homogeneous polynomial functor of degree d ≥ 2 and m ≥ 0 an integer. Let pPm be a tensor whose GLm-orbit is not dense and let qP be an element with finite strength. Then the GL-orbit of p+qP is also not dense.

Proof

Note that p is contained in the image of α:QmPm for some polynomial transformation α: QP with QP [6, Theorem 4.2.5] and q is contained in the image of β:RP for some polynomial transformation β: RP with deg(R) < d. So since QRP by Remark 2.5.1, we see that p + q is contained in a proper closed subset of P. Hence its GL-orbit is not dense. □

Linear Endomorphisms

Our second goal in this paper is to show that there always exist minimal f with dense orbits. This minimality relates to a monoid of linear endomorphisms extending GL, as follows. Elements of GL are × matrices of the block form

g00I,

where g ∈GLn for some n and I is the infinite identity matrix.

Definition 2.7.1

Let EGL be the monoid of × matrices with the property that each row contains only finitely many nonzero entries.

Example 2.7.2

For every integer i ≥ 1, let φiKni×mi be a matrix. Then the block matrix

φ1φ2

is an element of E.

We define an action of E on P as follows. Let p=(p0,p1,)P and φE. For each integer i ≥ 0, to compute qi in

q=(q0,q1,)=P(φ)p

we choose ni ≥ 0 such that all the nonzero entries of the first i rows of φ are in the first ni columns. Now, we let ψiKi×ni be the i × ni block in the upper-left corner of φ, so that

φ=ψi0,

and we set qi:=P(ψi)pni. Note that if we replace ni by a larger number ñi, then the resulting matrix ψ~i satisfies ψ~i=ψiπ, where π:KñiKni is the projection. Consequently, we then have

P(ψ~i)pñi=P(ψi)P(π)pñi=P(ψi)pni,

so that qi is, indeed, well-defined. A straightforward computation shows that, for φ, ψE, we have P(ψ) ∘ P(φ) = P(ψφ), so that E does indeed act on P.

For infinite degree-d forms, the action of φE is by linear variable substitutions xji=1φijxi. Note that, since each xi appears in the image of only finitely many xj, this substitution does indeed make sense on infinite degree-d series.

Since GLE, an E-stable subset of P is also GL-stable. The converse does not hold, since for instance E also contains the zero matrix, and P(0)f = 0≠P(g)f for all nonzero fP and gGL when the polynomial functor P is pure. However, it is easy to see that GL-stable closed subsets of P are also E-stable. In particular, we have GLf¯=P(E)f¯.

A Quasi-order on Infinite Tensors

Definition 2.8.1

For infinite tensors p,qP we write pq if pP(E)q. In this case, we say that q specialises to p.

From the fact that E is a unital monoid that acts on P, we find that ≼ is transitive and reflexive. Hence, it induces an equivalence relation on P by

pq:pqandqp,

as well as a partial order on the equivalence classes of .

Example 2.8.2

Fix an integer k ≥ 1 and consider the polynomial functor P = (S1)k. A tuple q=(q1,,qk)P has a dense GL-orbit if and only if q1,,qkS1 are linearly independent. Suppose that q has a dense GL-orbit and let A be the ×k matrix corresponding to q. Then A has full rank. By acting with an element of GLE, we may assume that

A=IkB,

where B is again an ×k matrix. Now, take

φC:=IkCIE

and note that ϕBA = (Ik 0), so that P(ϕB)q = (x1,…,xk). So any two tuples in P with a dense GL-orbit are in the same equivalence class. Moreover, the element of E specialising one tuple to the other can be chosen to be invertible in E as ϕCφC=I.

There is an obvious relation between ≼ and orbit closures, namely: if pq, then pGLq¯. The converse, however, is not true.

Example 2.8.3

Let p=x1(x12+x22+),q=x13+x23+S3. Then q has infinite strength and so pS3=GLq¯. However, we have pq: suppose that

f:=x1g(x1,x2,)+h(x2,x3,)S3(E)q

for some gS2 and hS3. As only finitely many variables xi are substituted by linear forms containing x1 when specialising q to f, we see that

x1g(x1,x2,)+h~(x2,x3,)S3(E)(x13+x23++xn3)

for some integer n ≥ 1 and h~S3. From this, it is easy to see that g has finite strength. Hence fp as x12+x22+ has infinite strength. So indeed pq.

In order to have a tensor pP with a dense GL-orbit, the polynomial functor P must be pure. For some time, we believed that when this is the case all elements pP with a dense GL-orbit might form a single -equivalence class. When P has degree ≤ 2, this is in fact true; see Example 5.1.4. However, it does not hold for cubics.

Example 2.8.4

Let p,qS3 be as before. Now also consider r = p(x1,x3,…) + q(x2,x4,…). We have q = r(0,x1,0,x2,…) ≼ r and so S3=GLq¯GLr¯. Hence, both q and r have dense GL-orbits. And, we have rq: indeed, otherwise p = r(x1,0,x2,0,…) ≼ rq, but pq.

Minimal Classes of Elements with Dense Orbits

Our second main result is the following.

Theorem 2.9.1 (Main Theorem II)

Suppose that K is algebraically closed of characteristic zero. Let P be a pure homogeneous polynomial functor over K. Then there exist tensors p,rP whose GL-orbits are dense such that pqr for all qP whose GL-orbit is dense.

The elements p that have this property form a single -class which lies below the -classes of all other qP whose GL-orbit is dense. For the construction of such a tensor pP, see Section 4.1. For the construction of the tensor rP, see Section 4.4.

Remark 2.9.2

In both our Main Theorems, we require that the characteristic be zero. This is because the results in [6] and [8] require this. However, the proof of topological Noetherianity for polynomial functors in [11] does not require characteristic zero, and shows that after a shift and a localisation, a closed subset of a polynomial functor admits a homeomorphism into an open subset of a smaller polynomial functor. In characteristic zero, this is in fact a closed embedding, so that it can be inverted and yields a parameterisation of (part of) the closed subset. In positive characteristic, it is not a closed embedding, but the map still becomes invertible if one formally inverts the Frobenius morphism; this is touched upon in [8]. This might imply variants of our Main Theorems in arbitrary characteristic, but we have not yet pursued this direction in detail.

Proof of Main Theorem I

The Linear Approximation of a Polynomial Functor

Let P be a polynomial functor over an infinite field and let U, VVec. Then P(UV)=d,e=0Qd,e(U,V) where

Qd,e(U,V):={vP(UV)|s,tK:P(sidUtidV)v=sdtev}Pd+e(UV).

The terms with e = 0 add up to P(U), and the terms with e = 1 add up to a polynomial bifunctor evaluated at (U, V ) that is linear in V. This is necessarily of the form P(U)V, where P is a polynomial functor. In other words, we have

P(UV)=P(U)(P(U)V)higher-degree terms inV.

We informally think of the first two terms as the linear approximation of P around U. Now suppose that we have a short exact sequence

0PQR0

of polynomial functors. This implies that for all U, V we have a short exact sequence

{0}P(UV)Q(UV)R(UV){0}

and inspecting the degree-1 parts in V we find a short exact sequence

0PQR0.

This, and further straightforward computations, shows that PP is an exact functor from the category of polynomial functors to itself.

Remark 3.1.1

For UVec fixed, denote the polynomial functor sending VP(UV ) and φP(idUϕ) by ShU(P). Then we have

ShU(P)e(V)={vP(UV)|tK:P(idUtidV)v=tev}

and from this we see that Qd, e(U, V ) = ShU(P)e(V ) ∩ Pd+e(UV ). In particular, when P is homogeneous of degree d, we see that P(UV)=e=0dQde,e(U,V) where Qde, e(U, V ) = ShU(P)e(V ). Also note that, in this case, ShU(P)0(V ) = P(U) and ShU(P)d(V ) = P(V ) via the inclusions of U, V into UV.

Example 3.1.2

If P = Sd, then the formula

Sd(UV)e=0dSde(U)Se(V)=Sd(U)(Sd1(U)V)

identifies P with Sd− 1.

Example 3.1.3

Let K be an algebraically closed field of characteristic p. Then Sp contains the subfunctor P(V ) := {vpvV }. We have P(UV ) = P(U) ⊕ P(V ), and hence P=0.

Proof of Main Theorem I

In this subsection we prove Theorem 2.5.2. We start with a result of independent interest.

Theorem 3.2.1

Let P be a pure polynomial functor over an algebraically closed field K of characteristic 0 or > deg(P) and let X be a subset of P such that X(V ) is dense in P(V ) for all VVec. Then, in fact, X(V ) is equal to P(V ) for all VVec.

Example 2.3.3 shows that the condition that K be algebraically closed cannot be dropped. We do not know if the condition on the characteristic of K can be dropped, but the proof will use thathe polynomial functor P introduced in Section 3.1 is sufficiently large, which, by Example 3.1.3, need not be the case when charK is too small.

Proof

Let qP(Kn). For each kn, we consider the incidence variety

Zk:={(φ,r)Hom(Kk,Kn)×P(Kk)|rk(φ)=nandP(φ)r=q}.

We write ek:=dimKP(Kk). Since for every φ ∈Hom(Kk,Kn) of rank n the linear map P(φ) is surjective, Zk is a vector bundle of rank eken over the rank-n locus in Hom(Kk,Kn). Hence Zk is an irreducible variety with dimZk=kn+eken. We therefore expect the projection π: ZkP(Kk) to be dominant for kn. To prove that this is indeed the case, we need to show that for zZk sufficiently general, the local dimension at z of the fibre π− 1(π(z)) is (at most) dim(Zk)ek=knen. By the upper semicontinuity of the fibre dimension [18, Theorem 11.12], it suffices to exhibit a single point z with this property, and indeed, it suffices to show that the tangent space to the fibre at z has dimension (at most) knen.

To find such a point z, set U := Kn and V := Kkn and consider

z:=(πU,P(ιU)q+r)Zk,

where πU: UVU is the projection and ιU: UUV is the inclusion and where we will choose rP(U)VP(UV). Note that then

P(ιU)q+rP(U)(P(U)V)P(UV)

and that P(πU)r = 0 so that z does, indeed, lie in Zk.

The tangent space Tzπ1(π(z)) (projected into Hom(Kk,Kn)) is contained in the solution space of the linear system of equations

P(πU+εψ)(P(ιU)q+r)=qmodε2

for ψ. The dimension of this solution space equals kn=dim(Hom(Kk,Kn)) minus the rank of the linear map

Hom(UV,U)P(U),ψthe coefficient ofεinP(πU+εψ)(P(ιU)q+r).

So it suffices to prove that for all kn there is a suitable r such that this linear map is surjective. In fact, we will restrict the domain to those ψ ∈Hom(UV, U) of the form ωπV where πV: UVV is the projection and ω ∈Hom(V, U). Then

P(πU+εψ)(P(ιU)q)=P((πU+εωπV)ιU)q=P(idU)q=q.

So P(ιU)q does not contribute to the coefficient of ε and this coefficient equals

P(idU+idU)idP(U)ωr,

where idU + idU: UUU is the map sending (u1,u2) to u1 + u2. Note that the codomain of idP(U)ω equals P(U)UP(UU), so that the composition above makes sense. Below we will show that for kn=dimVn and suitable rP(U)V the linear map

ΩP,V,r:Hom(V,U)P(U)ωP(idU+idU)idP(U)ωr

is surjective.

Hence, there exists a k such that ZkP(Kk) is dominant. By Chevalley’s theorem, the image contains a dense open subset of P(Kk), and this dense open subset intersects the dense set X(Kk). Hence, there exists an element pX(Kk) and a φ ∈Hom(Kk,Kn) such that P(ϕ)p = q. Finally, since X is a subset of P, also q is a point in X(Kn). Hence, X(Kn) = P(Kn) for each n, as desired. □

Lemma 3.2.2

Let P be a polynomial functor over an infinite field K with char(K) = 0 or char(K) > deg(P) and let UVec. Then for VVec with dimVdimU, there exists an rP(U)V such that

ΩP,V,r:Hom(V,U)P(U)ωP(idU+idU)idP(U)ωr

is surjective.

Proof

When char(K) = 0, the Abelian category of polynomial functors is semisimple, with the Schur functors as a basis. When char(K) = p > 0, the situation is more complicated. The irreducible polynomial functors still correspond to partitions [17, Theorem 3.5]. A degree-d irreducible polynomial functor is a submodule of the functor T(V ) = Vd if and only if the corresponding partition is column p-regular [21, Theorem 3.2]. Luckily, this is always the case when d < p. And, the Abelian category of polynomial functors of degree < p is semisimple [17, Corollary 2.6e]. Now, if P, Q are such polynomial functors and r1P(U)V and r2Q(U)W have the required property for P, Q, respectively, then

r:=(r1,r2)(P(U)V)(Q(U)W)(P(U)Q(U))(VW)=(PQ)(U)(VW)

has the required property for PQ. Hence, it suffices to prove the lemma in the case where P is an irreducible polynomial functor of degree d. We then have T = PQ, where T(V ) = Vd and Q is another polynomial functor. By a similar argument as above, if rT(U)V has the required property for T, then its image in P(U)V has the required property for P. Hence, it suffices to prove the lemma for T.

Now we have

T(UV)=T(U)(VUUU)(UVUU)(UUUV)terms of higher degree inV,

so that T is a direct sum of d copies of UUd− 1. We take r in the first of these copies, as follows. Let e1,…,en be a basis of U and set

r:=α[n]d1vαeα1eαd1,

where the vα are a basis of a space V of dimension nd− 1. For every β ∈ [n]d− 1 and i ∈ [n], the linear map ω that maps vβ to ei and all other vα to zero is a witness to the fact that eieβ1eβd1 is in the image of ΩT, V, r. Hence, this linear map is surjective. □

Lemma 3.2.3

Assume that K is algebraically closed of characteristic zero. Let P, Q be polynomial functors. Assume that P is irreducible of degree d, Q has degree < d and let α: QP be a polynomial transformation, then there is a uniform bound on the strength of elements of im(αV) that is independent of V.

Proof

Let R be the sum of the components of Q of strictly positive degree. Any element in im(αV) is also in im(βV) for a polynomial transformation βV: RP obtained from α by a suitable specialisation. Write R = R(1) ⊕⋯ ⊕ R(k), where the R(i) are Schur functors of degrees 0 < di < d. The polynomial transformation β factors uniquely as the polynomial transformation

δ:R(1)R(k)F:=e1,,ek0ieidi=di=1kSeiR(i)(r1,,rk)r1e1rkeke1,,ek

and a linear polynomial transformation γ: FP. As γ is linear, we see that str(γV(v)) ≤str(v) for all VVec and vF(V ). So it suffices to prove that the elements of the subset im(δ), which depends only on Q and d, have bounded strength. We have

strr1e1rkeke1,,eke1,,ek0ieidi=dstrr1e1rkeke1,,ek0ieidi=d1

as iei2 whenever ieidi=d. So this is indeed the case. □

Proof

of Theorem 2.5.2 (Main Theorem I) Let X be a subset of a pure polynomial functor P over an algebraically closed field K of characteristic zero. For each VVec define Y(V):=X(V)¯. If Y is a proper closed subset of P, then by [6, Theorem 4.2.5] there exist finitely many polynomial transformations αi: QiP with QiP and Y(V)iim(αi,V) for all VVec. Since XY, we are done. Otherwise, if Y (V ) = P(V ) for all V, then Theorem 3.2.1 implies that also X(V ) = P(V ) for all V. The last statement follows from the previous lemma. □

Proof

of Corollary 2.5.4 Let X be the subset of P consisting of all elements fP(V ) such that

Hom(V,U)P(U)φP(φ)f

is not surjective. By Main Theorem I, it suffices to prove that XP. As before, we claim that in fact X(V )≠P(V ) already when dimVdeg(P)dimP(U).

First suppose that P is irreducible. Then P is a Schur functor. Take V0 = Kd and =dimP(U). Then it is known that Hom(V0,U) ⋅ P(V0) spans P(U). Let P(φ1)p1,…,P(φ)p be a basis of P(U), let ιi:V0V0 and πi:V0V0 be the inclusion and projection maps and take

p=P(ιi)p1++P(ι)pP(V0).

Then P(φiπi)(p) = P(φi)pi. Hence,

Hom(V0,U)P(U)φP(φ)p

is surjective.

Next, suppose that P = QR and that there exist fQ(V ) and gR(W) such that

Hom(V,U)Q(U)andHom(W,U)R(U)φQ(φ)fφR(φ)g

are surjective. By induction, we can assume such f, g exist when dimVdeg(P)dimQ(U) and dimWdeg(P)dimR(U). Now, we see that

Hom(VW,U)P(U)φP(φ)(P(ι1)(f)+P(ι2)(g))

is surjective. This proves the first part of the corollary. For the second statement, we note that when P is irreducible the elements of im(αi) have bounded strength. As the bound depends only on X and X only depends on dimU, we see that fi=1kim(αi) for all f with strength greater than some function of dimU only. □

Proof of Main Theorem II

Construction of the Minimal Class

Let P be a homogeneous polynomial functor of degree d > 0 over an algebraically closed field K of characteristic zero. Decompose

P=P(1)P()

into Schur functors. For each UVec of dimension ≥ d the GL(U)-module P(i)(U) is irreducible (and in particular nonzero). Let VVec be a vector space of dimension d. Let V(1,i) be a copy of V for each i = 1,…, and choose any nonzero q(1,i)P(i)(V(1,i)). We write

q(1):=q(1,1)++q(1,)P(1)(V(1,1))P()(V(1,))P(W(1)),

where W(1) = V(1,1) ⊕⋯ ⊕ V(1,). We take independent copies W(j) = V(j,1) ⊕⋯ ⊕ V(j, ) of W(1) and copies q(j) = q(j,1) + ⋯ + q(j, )P(W(j)) of q1 and set

q:=q(1)+q(2)+P,

where we concatenate copies of a basis in the d-dimensional space W(1) to identify W(1) ⊕⋯ ⊕ W(k) with Kkd.

Example 4.1.1

Let P=Sdd, so that we may take V = Kd. We may take q(1,1):=x1dSd(V(1,1)) and q(1,2):=xd+1x2dd(V(1,2)), where x1,…,xd and xd+ 1,…,x2d are bases of V(1,1) and V(1,2), respectively. We then have

q=(x1d+xd+1x2d)+x2d+1d+x3d+1x4d+

We will prove, first, that any q constructed in this manner has a dense GL-orbit in P, and second, that qp for all pP with a dense GL-orbit.

Density of the Orbit of q

Proposition 4.2.1

The GL-orbit of q is dense in P.

Proof

It suffices to prove that for each UVec and each pP(U) there exists a k ≥ 1 and a linear map φ: W(1) ⊕⋯ ⊕ W(k)U such that P(φ)(q(1) + ⋯ + q(k)) = p. Furthermore, we may assume that U has dimension at least d. Fix a linear injection ι: VU. Now q~(i):=P(ι)(q(j,i)) is a nonzero vector in the GL(U)-module P(i)(U), which is irreducible. Hence, the component p(i) of p in P(i)(U) can be written as

p(i)=Pg(1,i)q~(i)++Pg(ki,i)q~(i)

for suitable elements g(1,i),,g(ki,i)End(U). Do this for all i = 1,…,. By taking the maximum of the numbers ki (and setting the irrelevant g(j, i) equal to zero) we may assume that the ki are all equal to a fixed number k; this is the k that we needed. Now we may define φ by declaring its restriction on V(j, i) to be equal to g(j, i)ι. We then have

P(φ)(q1++qk)=j=1ki=1Pg(j,i)q~(i)=i=1p(i)=p,

as desired. □

Minimality of the Class of q

Proposition 4.3.1

We have qp for every pP with a dense GL-orbit.

Proof

Let pP be a tensor with a dense GL-orbit and write p = (p0,p1,p2,…) with piP(Ki). Take m0 = n0 = 0. There exists a linear map φ0:Km0Kn0 such that P(φ0)pm0=qn0=0, namely the zero map. Write ni = n0 + id. Our goal is to construct, for each integer i ≥ 1, an integer mimi− 1 and a linear map ψi:K[mi][mi1]W(i) such that the linear map φi:KmiKni making the diagram graphic file with name 10013_2021_522_Figb_HTML.jpg

commute satisfies P(φi)pmi=qni=q(1)++q(i).

Let i ≥ 1 be an integer. As observed in Section 3.1, we can write

P(Kmi1V)=P(Kmi1)R1(V)Rd1(V)P(V),

where Rj=ShKmi1(P)j is a homogeneous polynomial functor of degree j. Writing K as Kmi1K[mi1], we obtain a corresponding decomposition

p=pmi1+r1++rd1+p,

where rjRj,mi1 and pPmi1 and we claim that p has a dense GLmi1-orbit; here we use the notation from Remark 2.6.7.

The polynomial bifunctor (U, V )↦P(UV ) is a direct sum of bifunctors of the form (U, V )↦Q(U) ⊗ R(V ) where Q, R are Schur functors. It follows that Rj(V ) is the direct sum of spaces Q(Kmi1)R(V) where Q, R are Schur functors of degrees dj, j, respectively. Hence the elements r1,…,rd− 1 have finite strength. Also note that pmi1P(Kmi1) has finite strength. So by Corollary 2.6.8, we see that the GLmi1-orbit of p must be dense.

The tuple (r1,,rd1)j=1d1Rj,mi1 may not have a dense GLmi1-orbit. However, there exists a polynomial functor R less than or equal to R1 ⊕⋯ ⊕ Rd− 1 with R({0}) = {0}, an rRmi1 and a polynomial transformation

α=(α1,,αd1):RR1Rd1

such that r has a dense GLmi1-orbit and α(r) = (r1,…,rd− 1). Since P is homogeneous of degree d > deg(R), the pair (r,p) has a dense orbit in Rmi1Pmi1 by [6, Lemma 4.5.3]. Hence, by Corollary 2.6.3, there exists an mimi− 1 + d and a linear map ψi:K[mi][mi1]W(i) such that R(ψi)r[mi][mi1]=0 and P(ψi)p[mi][mi1]=q(i).

Since polynomial transformations between polynomial functors with zero constant term map zero to zero, the first equality implies that, for all j = 1,…,d − 1,

Rj(ψi)rj,[mi][mi1]=Rj(ψi)αjr[mi][mi1]=αjR(ψi)r[mi][mi1]=αj(0)=0.

Thus, informally, applying the map ψi makes p specialise to the required q(i), while the terms r1,…,rd− 1 are specialised to zero.

We define φi as above and we have

P(φi)pmi=Pφi1idW(i)Pidmi1ψipmi1+j=1d1rj,[mi][mi1]+p[mi][mi1]=Pφi1idW(i)pmi1+j=1d1Rj(ψi)rj,[mi][mi1]+P(φi)p[mi][mi1]=Pφi1idW(i)pmi1+q(i)=qni1+q(i)=q(1)++q(i).

Iterating this argument, we find that the infinite matrix

φ0ψ1ψ2ψ3=:e

has the property that P(e)p = q(1) + q(2) + ⋯ = q, as desired. □

Remark 4.3.2

Note that the element eE constructed above has only finitely many nonzero entries in each row and in each column!

Remark 4.3.3

Fix an integer k ≥ 0. Then we have the following strengthening of the previous theorem: we have (x1,…,xk,q) ≼ (1,…,k,p) for every (1,,k,p)(S1)kP with a dense GL-orbit. Here q is defined as before in variables distinct from x1,…,xk. To see this, note that a tensor in (S1)kP with a dense GL-orbit is of the form (1,…,k,p) where 1,,kS1 are linearly independent and pP has a dense GL-orbit. By acting with an invertible element of E as in Example 2.8.2, we may assume that i = xi. Take n0 = k. Similar to induction step in the proof of the previous theorem, there exists an integer m0k and a linear map ψ:K[m0][k]Kn0 such that the linear map φ0=idk+ψ:KkK[m0][k]Kn0 satisfies P(φ0)pm0=qn0=0. We now proceed as in the proof of the theorem with these m0,n0,φ0 to find the result.

Proof

of Theorem 2.9.1, existence of p. The existence of a minimal p among all elements with a dense GL-orbit follows directly from Propositions 4.2.1 and 4.3.1. □

Maximal Tensors

Next, we construct maximal elements with respect to ≼ of P for any pure polynomial functor P. We start with n-way tensors, then do Schur functors and finally general polynomial functors. Let d ≥ 1 be an integer and let Td be the polynomial functor sending VVd.

Lemma 4.4.1

There exists a tensor rdTd such that prd for all pTd.

Proof

For d = 1, we know that the element r1:=x1T1 satisfies pr1 for all pT1. Now suppose that d ≥ 2 and that rd1=rd1(x1,x2,)Td1 satisfies prd− 1 for all pTd1. We define a rdTd satisfying prd for all pTd.

For j ∈{1,…,d}, we define the map j:T1×Td1Td as the inverse limit of the bilinear maps −⊗j−: V × Vd− 1Vd such that

vjj(v1vj1vj+1vd)=v1vd

for all finite-dimensional vector space V and all vectors v1,…,vdV. Now, we take

rd:=i=1j=1dxι(i,j,1)jrd1xι(i,j,2),xι(i,j,3),,

where ι:×{1,,d}× is any injective map. We claim that prd for all pTd. Indeed, any such p can we written as

p=i=1j=1dxijpi(xi,xi+1,)

with p1,p2,Td1 and by assumption we can specialise rd− 1 to pi using an element of E for all i. Combined, this yields a specialisation of rd to p. Note here that xι(i, j,1)xi and xι(i, j, k)i, j, k for k > 1 in such a way that x occurs, when ranging over k, in only finitely many i, j, k when i and x does not occur in i, j, k when i > . This means that the specialisation of rd to p indeed goes via an element of E. So for all d ≥ 1, the space Td has a maximal element with respect to ≼. □

Lemma 4.4.2

Let P be a Schur functor of degree d ≥ 1. Then there exists a tensor rP such that pr for all pP.

Proof

The space P is a direct summand of Td. Let r be the component in P of rd from the previous lemma. Then pr for all pP. □

Proposition 4.4.3

Let P be a pure polynomial functor. Then there exists a tensor rP such that pr for all pP.

Proof

Write

P=P(1)P(k)

as a direct sum of Schur functors. For each i ∈{1,…,k}, let ri=ri(x1,x2,)P(i) be a tensor such that piri for all piP(i) and take r=(r1(x1,xk+1,),,rk(xk,x2k,))P. Then pr for all pP. □

Proof

of Theorem 2.9.1, the existence of r. This follows directly from Proposition 4.4.3. □

Further Examples

In this section we give more examples: we prove that tensors in P with a dense GL-orbit for a single equivalence class when P has degree ≤ 2, we compare candidates for minimal tensors in a direct sum of Sd’s of distinct degrees and we construct maximal elements in P for all P with P({0}) = {0}.

Polynomial Functors of Degree ≤ 2

Example 5.1.1

Take P = S1S1. Then a pair (v,w)S1S1 has one of the following forms:

  1. the pair (v, w) with v,wS1 linearly independent vectors;

  2. the pair (λu, μu) with uS1 nonzero and [λ:μ]1; or

  3. the pair (0,0).

In the first case, the pair (v, w) has a dense GL-orbit and is equivalent to (x1,x2). When μvλw = 0 for some λ, μK, then this also holds for all specialisations of (v, w). So the poset of equivalence classes is given by: graphic file with name 10013_2021_522_Figc_HTML.jpg

where a point [λ:μ]1 corresponds to the class of (λu, μu) with uS1 nonzero and all points in 1 are incomparable.

Example 5.1.2

Take P = S2. By Proposition 4.3.1 each infinite quadric

p=1ijaijxixj

of infinite rank specialises to the quadric q = x1x2 + x3x4 + ⋯ via a suitable linear change of coordinates. Here each variable is only allowed to occur in only finitely many of the linear forms that x1,x2,… are substituted by. Conversely, it is not difficult to see that q specialises to p as well by applying the following element of E:

1a1100000a121a22000a130a231a330a140a240a34.

We conclude that the infinite-rank quadrics form a single equivalence class under and that the rank function is an isomorphism from the poset of equivalence classes to the well-ordered set {0,1,2,,}.

Example 5.1.3

Take P=2. By Proposition 4.3.1 each infinite alternating tensor

p=1i<jaijxixj

of infinite rank specialises to q = x1x2 + x3x4 + ⋯. And, q specialises to p as well by applying the following element of E:

1000000a1210000a130a23100a140a240a34.

As before, we conclude that the infinite-rank alternating tensors form a single -equivalence class and that the rank function is an isomorphism from the poset of equivalence classes to the well-ordered set {0,1,2,,}.

Example 5.1.4

Take P=(S1)a(S2)b(2)c for integers a, b, c ≥ 0. By Remark 4.3.3, any tuple in P with a dense GL-orbit specialises to the tuple

(x1,,xa,y1y2+y2b+1y2b+2+,,y2b1y2b+y4b1y4b+,z1z2+z2c+1z2c+2+,,z2c1z2c+z4c1z4c+),

where y2ib+j = xa+ 2ib+ 2ic+j for i ≥ 0 and 1 ≤ j < 2b and z2ic+j = xa+ 2(i+ 1)b+ 2ic+j for i ≥ 0 and 1 ≤ j < 2c. By the previous examples, each of the entries in this latter tuple independently specialises to any tensor in the same space. So the entire tuple also specialises to any other tuple in P. So the tuple with a dense GL-orbit again form a single -equivalence class.

Non-homogeneous Polynomial Functors

The proof of Proposition 4.3.1 relies on the fact that P is homogeneous. Apart from the slight generalisation from Remark 4.3.3, we do not know if such a result holds in a more general setting.

Question 5.2.1

Take P = S2S3. Does there exist a tensor qP with a dense GL-orbit such that qp for all pP with a dense GL-orbit?

The next example compares different candidates for such a minimal element.

Example 5.2.2

Take P=Sd1Sd2Sdk with 1 < d1 < ⋯ < dk. By [6, Lemma 4.5.3], an element (f1,,fk)P has dense GL-orbit if and only if fiSdi has dense GL-orbit for all i = 1,…,k. In particular, the elements

q=q(1),,q(k)=x1d1+x2d1+,,x1dk+x2dk+

and

p=p(1),,p(k)=x1d1+xk+1d1+,,xkdk+x2kdk+

have dense GL-orbits. Clearly qp. By Corollary 2.6.3, there exists an n ≥ 1 and linear forms 1,…,n in x1,…,xk such that qn(j)(1,,n)=xjdj for j = 1,…,k. Take

hn+i=i(xhn+1,,xhn+n)

for h ≥ 1 and i ∈{1,…,k}. Then we see that qn(j)(hn+1,,hn+n)=xhn+jdj for j = 1,…,k. So since

q(j)=qn(j)+qn(j)(xn+1,,x2n)+

we see that q(j)(1,2,…) = p(j). Let A be the k × n matrix corresponding to 1,…,n and take

e:=AAE.

Then P(e)q(j) = q(j)(1,2,…). So pq. Hence pq.

Acknowledgements

AD was supported by JD’s Vici grant 639.033.514 from the Netherlands Organisation for scientific research (NWO).

JD was partially supported by Vici grant 639.033.514 from the NWO and by project grant 200021_191981 from the Swiss National Science Foundation (SNSF). RE was supported by Veni grant 016.Veni.192.113 from the NWO. We thank Andrew Snowden, who first pointed out to us the action of the monoid E on P and asked about its orbit structure there.

Funding

Open Access funding provided by Universität Bern.

Footnotes

To Bernd Sturmfels, on the occasion of his 60th birthday.

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Contributor Information

Arthur Bik, Email: arthur.bik@mis.mpg.de.

Alessandro Danelon, Email: a.danelon@tue.nl.

Jan Draisma, Email: jan.draisma@math.unibe.ch.

Rob H. Eggermont, Email: r.h.eggermont@tue.nl

References

  • 1.Ananyan T, Hochster M. Small subalgebras of polynomial rings and Stillman’s conjecture. J. Amer. Math. Soc. 2020;33:291–309. doi: 10.1090/jams/932. [DOI] [Google Scholar]
  • 2.Ananyan T, Hochster M. Strength conditions, small subalgebras, and Stillman bounds in degree ≤ 4. Trans. Amer. Math. Soc. 2020;373:4757–4806. doi: 10.1090/tran/8060. [DOI] [Google Scholar]
  • 3.Ballico, E., Bik, A., Oneto, A., Ventura, E.: The set of forms with bounded strength is not closed. arXiv:2012.01237 (2020)
  • 4.Ballico, E., Bik, A., Oneto, A., Ventura, E.: Strength and slice rank of forms are generically equal. arXiv:2102.11549 (2021)
  • 5.Ballico, E., Ventura, E.: The strength for line bundles. Math. Scand. To appear (2020)
  • 6.Bik, A.: Strength and noetherianity for infinite tensors. PhD Thesis, Universität Bern (2020)
  • 7.Bik A, Draisma J, Eggermont RH. Polynomials and tensors of bounded strength. Commun. Contemp. Math. 2019;21:1850062. doi: 10.1142/S0219199718500621. [DOI] [Google Scholar]
  • 8.Bik, A., Draisma, J., Eggermont, R.H., Snowden, A.: The geometry of polynomial representations. arXiv:2105.12621 (2021)
  • 9.Bik, A., Oneto, A.: On the strength of general polynomials. Linear and Multilinear Algebra, 10.1080/03081087.2021.1947955 (2021)
  • 10.Derksen H, Eggermont RH, Snowden A. Topological noetherianity for cubic polynomials. Algebra Number Theory. 2017;11:2197–2212. doi: 10.2140/ant.2017.11.2197. [DOI] [Google Scholar]
  • 11.Draisma J. Topological noetherianity of polynomial functors. J. Amer. Math. Soc. 2019;32:691–707. doi: 10.1090/jams/923. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 12.Erman D, Sam SV, Snowden A. Big polynomial rings and Stillman’s conjecture. Invent. math. 2019;218:413–439. doi: 10.1007/s00222-019-00889-y. [DOI] [Google Scholar]
  • 13.Erman D, Sam SV, Snowden A. Strength and Hartshorne’s conjecture in high degree. Math. Z. 2021;297:1467–1471. doi: 10.1007/s00209-020-02564-y. [DOI] [Google Scholar]
  • 14.Erman, D., Sam, S. V., Snowden, A.: Big polynomial rings with imperfect coefficient fields. Mich. Math. J. To appear (2020)
  • 15.Friedlander EM, Suslin A. Cohomology of finite group schemes over a field. Invent. math. 1997;127:209–270. doi: 10.1007/s002220050119. [DOI] [Google Scholar]
  • 16.Fulton W, Harris J. Representation Theory: A First Course. Graduate Texts in Mathematics, vol. 129. New York: Springer; 2004. [Google Scholar]
  • 17.Green JA. Polynomial Representations of GLn, 2nd edn. Lecture Notes in Mathematics, vol. 830. Berlin: Springer; 2007. [Google Scholar]
  • 18.Harris J. Algebraic Geometry: A First Course. Corrected Reprint of the 1992 Original Graduate Texts in Mathematics, vol. 133. New York: Springer; 1995. [Google Scholar]
  • 19.Kazhdan D, Ziegler T. On ranks of polynomials. Algebras Represent Theory. 2018;21:1017–1021. doi: 10.1007/s10468-018-9783-7. [DOI] [Google Scholar]
  • 20.Kazhdan D, Ziegler T. Properties of high rank subvarieties of affine spaces. Geom. Funct. Anal. 2020;30:1063–1096. doi: 10.1007/s00039-020-00542-4. [DOI] [Google Scholar]
  • 21.James GD. The decomposition of tensors over fields of prime characteristics. Math. Z. 1980;172:161–178. doi: 10.1007/BF01182401. [DOI] [Google Scholar]

Articles from Vietnam Journal of Mathematics are provided here courtesy of Springer

RESOURCES