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 of partitions λi ⊩ di ≥ 1, we denote by . For finite-dimensional vector spaces V, W and a linear map φ : V → W, we get a linear map
that depends polynomially on φ and satisfies and whenever the former makes sense. In particular, taking V = W and restricting our attention to invertible φ, we find that 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 .
Let be a tuple of partitions of positive integers. The following dichotomy is our first main result.
Main Theorem I 1
Let be a property that, for each finite-dimensional vector space V, can be satisfied by some elements of . Assume that satisfies for every element satisfying and every linear map φ: V → W. Then either is satisfied by all elements of for all V or else all elements satisfying come from simpler spaces for finitely many tuples .
We define later what it means to “come from ”; 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 have bounded strength in the following sense.
Definition 1
The strength of an element f ∈ Sλ(V ) with λ ⊩ d is the minimal integer k ≥ 0 such that there exists an expression
where μi ⊩ di, νi ⊩ ei with di,ei < d, the are GL(V )-equivariant bilinear maps and the , 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 mapping to each other via applied to the projection maps Kn+ 1 → Kn by . This space comes with the action of the direct limit 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 , which we again call the Zariski topology.
Corollary 1 (Corollary 2.6.3)
Suppose that the orbit is Zariski dense in . Then for each integer n ≥ 1, the image of in is all of .
The second goal of this paper is to bring some order in the (typically uncountable) set of elements with dense -orbits. For elements , we write p ≼ q when q specialises to p; see Sections 2.7–2.8 for details.
Example 3
When λ = (d) ⊩ d, the space consists of infinite degree-d forms in variables x1,x2,…. We have p ≼ q 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 , each with a dense -orbit, such that p ≼ q ≼ r for all other with a dense -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 f ∈ K[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
where and 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 [12–14] and in Kazhdan–Ziegler’s work [19, 20]. Also see [3–5, 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 degree ≤ d over K is a functor P : Vec →Vec with the property that for all U, V ∈Vec 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 .
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 ) := {p ∈ P(V )∣∀t ∈ K : 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 U↦Sd(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 φ: U → V 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 [6–8, 11]. Polynomial functors form an Abelian category in which a morphism α: P → Q consists of a linear map αU: P(U) → Q(U) for each U ∈Vec such that for all U, V ∈Vec and all φ ∈Hom(U, V ) the following diagram commutes: 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 V ↦V⊗d. 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 and Q := Sd and define α by
This is a polynomial transformation P → Q.
Example 2.2.5
Let Q, R be polynomial functors and α: Q ⊗ R → P a linear morphism. Then (q, r)↦α(q ⊗ r) defines a bilinear polynomial transformation Q ⊕ R → P.
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 V ∈Vec. The strength of p ∈ P(V ) is the minimal integer k ≥ 0 such that
where, for each i ∈ [k], Qi, Ri are irreducible polynomial functors with positive degrees adding up to d, αi: Qi ⊕ Ri → P is a bilinear polynomial transformation and qi ∈ Qi(V ) and ri ∈ Ri(V ) are tensors.
Remark 2.2.7
Positive degrees of two polynomial functors cannot add up to 1. So nonzero tensors p ∈ P(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 f ∈ Sd(V ) according to Definition 2.1.1 equals that according to Definition 2.2.6.
Proof
The inequality ≥ follows from the fact that is a bilinear polynomial transformation. For the inequality ≤, suppose that α: Q ⊕ R → Sd is a nonzero bilinear polynomial transformation, where Q and R are irreducible of degrees e < d and d − e < d. So Q and R are Schur functors corresponding to Young diagrams with e and d − e boxes, respectively, and Q ⊗ R 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 = Sd−e, and also that there is (up to scaling) a unique morphism Q ⊗ R = Se ⊗ Sd−e → Sd, namely, the one corresponding to the polynomial transformation (g, h)↦g ⋅ h. □
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
where g1,…,gk ∈ Sd(V ) are reducible polynomials.
Example 2.2.10
Consider , so that P(V ) = V ⊗ V, and assume that K is algebraically closed. The only possibilities for Q and R are Q(V ) = R(V ) = V. The bilinear polynomial transformations α : Q ⊕ R → P are of the form
for certain a, b, c, d ∈ K. We note that str(A) = ⌈rk(A)/2⌉ when A ∈ S2(V ) and str(A) = rk(A)/2 when . In general, we have
for all A ∈ V ⊗ V, where each bound can hold with equality. For example, for the matrix
we have rk(A + A⊤)/2 = rk(A − A⊤)/2 = str(A) = rk(A).
Example 2.2.11
Again take and consider P(K2) = K2×2. Assume K is algebraically closed. The matrix
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 au ⊗ v + bv ⊗ u with a, b ∈ K and v, u ∈ K2. 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
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 for each U ∈Vec such that for all ϕ ∈Hom(U, V ) we have . 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 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 f ∈ K[x1,…,xn]d of strength ≥ r and any polynomial g ∈ K[y1,…,ym]d there exists a linear variable substitution under which f specialises to g.
Proof
For each U ∈Vec, define as the set of all f such that the map
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 , then in Sd(U) we can construct a sum f of squarefree monomials in distinct variables and specialise each of these monomials to a prescribed multiple of a basis monomial in Sd(Km). Hence f∉X(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 , 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 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 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 U ∈Vec or else there exist finitely many polynomial functors and polynomial transformations αi: Qi → P with for all U ∈Vec. 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 U ∈Vec and all p ∈ X(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 U ∈Vec be a fixed vector space. Then there exist finitely many polynomial functors and polynomial transformations αi: Qi → P such that for every V ∈Vec and every f ∈ P(V ) that is not in the map Hom(V, U) → P(U),φ↦P(φ)f is surjective.
If P is irreducible, then the condition that can be replaced by the condition that f has strength greater than some function of 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 , where the map P(Kn+ 1) → P(Kn) is P(πn) with πn: Kn+ 1 → Kn the projection map forgetting the last coordinate. We equip with the inverse limit of the Zariski topologies on the P(Kn), which is itself a Zariski topology coming from the fact that . We also write P(πn) for the projection map ; this will not lead to confusion. A polynomial transformation α: P → Q naturally yields a continuous map also denoted by α.
If P = Sd, then the elements of can be thought of as homogeneous series of degree d in infinitely many variables x1,x2,…. Here, closed subsets of are defined by polynomial equations in the coefficients of these series.
On acts the group , where GLn is embedded into GLn+ 1 via the map
Indeed, with this embedding the map P(Kn+ 1) → P(Kn) in the definition of is GLn-equivariant, and this yields the action of on the projective limit. In the case of degree-d series, an element 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 of is a bijection with the collection of closed -stable subsets of [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, clearly has dense orbits, such as that of
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 in each Sd(Kn) is dense. Hence is dense in .
For every pure polynomial functor P, the group has dense orbits on —in fact, uncountably many of them! See [6, §4.5.1]. They have the following interesting property.
Corollary 2.6.3
Suppose that is dense in . Then for each integer n ≥ 1, the image of in P(Kn) is all of P(Kn).
Proof
For V ∈Vec, define
which is exactly the image of under the projection followed by an isomorphism P(φ), where φ: Km → V is a linear isomorphism. We see that X is a subset of P. For each V ∈Vec, the subset X(V ) is dense in P(V ) since is dense in . 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 is the minimal integer k ≥ 0 such that
for some irreducible polynomial functors Qi, Ri whose positive degrees sum up to d, bilinear polynomial transformations αi: Qi ⊕ Ri → P and elements and . 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 has infinite strength if and only if its -orbit is dense.
Proof
If has finite strength, then let αi: Qi × Ri → P be as in the definition above and let
be their sum, so that p ∈im(α). Consider the closed subset , i.e., the closed subset defined by for all V ∈Vec. As is a polynomial in n of degree < d, while 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 , it follows that is not dense.
Suppose, conversely, that is not dense. Then it is contained in 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 be an element of infinite strength. Then also has infinite strength, but the orbit 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 for the limit over all integers n ≥ m. This space is isomorphic to , but the indices have been shifted by m. On acts the group , which is the union of GL(K[n]−[m]) over all n ≥ m. We denote the image of an element in P(K[n]−[m]) by p[n]−[m]. The inclusions ιn: K[n]−[m] → Kn sending v↦(0,v) allow us to view as a subset of .
Corollary 2.6.8
Let P be a homogeneous polynomial functor of degree d ≥ 2 and m ≥ 0 an integer. Let be a tensor whose -orbit is not dense and let be an element with finite strength. Then the -orbit of is also not dense.
Proof
Note that p is contained in the image of for some polynomial transformation α: Q → P with [6, Theorem 4.2.5] and q is contained in the image of for some polynomial transformation β: R → P with deg(R) < d. So since by Remark 2.5.1, we see that p + q is contained in a proper closed subset of P. Hence its -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 , as follows. Elements of are matrices of the block form
where g ∈GLn for some n and is the infinite identity matrix.
Definition 2.7.1
Let 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 be a matrix. Then the block matrix
is an element of E.
We define an action of E on as follows. Let and φ ∈ E. For each integer i ≥ 0, to compute qi in
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 be the i × ni block in the upper-left corner of φ, so that
and we set . Note that if we replace ni by a larger number , then the resulting matrix satisfies , where is the projection. Consequently, we then have
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 .
For infinite degree-d forms, the action of φ ∈ E is by linear variable substitutions . 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 , an E-stable subset of is also -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 and when the polynomial functor P is pure. However, it is easy to see that -stable closed subsets of are also E-stable. In particular, we have .
A Quasi-order on Infinite Tensors
Definition 2.8.1
For infinite tensors we write p ≼ q if p ∈ P(E)q. In this case, we say that q specialises to p.
From the fact that E is a unital monoid that acts on , we find that ≼ is transitive and reflexive. Hence, it induces an equivalence relation on by
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 has a dense -orbit if and only if are linearly independent. Suppose that q has a dense -orbit and let A be the matrix corresponding to q. Then A has full rank. By acting with an element of , we may assume that
where B is again an matrix. Now, take
and note that ϕ−BA = (Ik 0)⊤, so that P(ϕ−B)q = (x1,…,xk). So any two tuples in with a dense -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 .
There is an obvious relation between ≼ and orbit closures, namely: if p ≼ q, then . The converse, however, is not true.
Example 2.8.3
Let . Then q has infinite strength and so . However, we have p⋠q: suppose that
for some and . As only finitely many variables xi are substituted by linear forms containing x1 when specialising q to f, we see that
for some integer n ≥ 1 and . From this, it is easy to see that g has finite strength. Hence f≠p as has infinite strength. So indeed p⋠q.
In order to have a tensor with a dense -orbit, the polynomial functor P must be pure. For some time, we believed that when this is the case all elements with a dense -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 be as before. Now also consider r = p(x1,x3,…) + q(x2,x4,…). We have q = r(0,x1,0,x2,…) ≼ r and so . Hence, both q and r have dense -orbits. And, we have r⋠q: indeed, otherwise p = r(x1,0,x2,0,…) ≼ r ≼ q, but p⋠q.
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 whose -orbits are dense such that p ≼ q ≼ r for all whose -orbit is dense.
The elements p that have this property form a single -class which lies below the -classes of all other whose -orbit is dense. For the construction of such a tensor , see Section 4.1. For the construction of the tensor , 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, V ∈Vec. Then where
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 , where is a polynomial functor. In other words, we have
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
of polynomial functors. This implies that for all U, V we have a short exact sequence
and inspecting the degree-1 parts in V we find a short exact sequence
This, and further straightforward computations, shows that is an exact functor from the category of polynomial functors to itself.
Remark 3.1.1
For U ∈Vec fixed, denote the polynomial functor sending V ↦P(U ⊕ V ) and φ↦P(idU ⊕ ϕ) by ShU(P). Then we have
and from this we see that Qd, e(U, V ) = ShU(P)e(V ) ∩ Pd+e(U ⊕ V ). In particular, when P is homogeneous of degree d, we see that where Qd−e, 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 U ⊕ V.
Example 3.1.2
If P = Sd, then the formula
identifies with Sd− 1.
Example 3.1.3
Let K be an algebraically closed field of characteristic p. Then Sp contains the subfunctor P(V ) := {vp∣v ∈ V }. We have P(U ⊕ V ) = P(U) ⊕ P(V ), and hence .
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 V ∈Vec. Then, in fact, X(V ) is equal to P(V ) for all V ∈Vec.
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 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 q ∈ P(Kn). For each k ≥ n, we consider the incidence variety
We write . Since for every φ ∈Hom(Kk,Kn) of rank n the linear map P(φ) is surjective, Zk is a vector bundle of rank ek − en over the rank-n locus in Hom(Kk,Kn). Hence Zk is an irreducible variety with . We therefore expect the projection π: Zk → P(Kk) to be dominant for k ≫ n. To prove that this is indeed the case, we need to show that for z ∈ Zk sufficiently general, the local dimension at z of the fibre π− 1(π(z)) is (at most) . 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) kn − en.
To find such a point z, set U := Kn and V := Kk−n and consider
where πU: U ⊕ V → U is the projection and ιU: U → U ⊕ V is the inclusion and where we will choose . Note that then
and that P(πU)r = 0 so that z does, indeed, lie in Zk.
The tangent space (projected into Hom(Kk,Kn)) is contained in the solution space of the linear system of equations
for ψ. The dimension of this solution space equals minus the rank of the linear map
So it suffices to prove that for all k ≫ n there is a suitable r such that this linear map is surjective. In fact, we will restrict the domain to those ψ ∈Hom(U ⊕ V, U) of the form ω ∘ πV where πV: U ⊕ V → V is the projection and ω ∈Hom(V, U). Then
So P(ιU)q does not contribute to the coefficient of ε and this coefficient equals
where idU + idU: U ⊕ U → U is the map sending (u1,u2) to u1 + u2. Note that the codomain of equals , so that the composition above makes sense. Below we will show that for and suitable the linear map
is surjective.
Hence, there exists a k such that Zk → P(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 p ∈ X(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 U ∈Vec. Then for V ∈Vec with , there exists an such that
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 ) = V⊗d 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 and have the required property for P, Q, respectively, then
has the required property for P ⊕ Q. Hence, it suffices to prove the lemma in the case where P is an irreducible polynomial functor of degree d. We then have T = P ⊕ Q, where T(V ) = V⊗d and Q is another polynomial functor. By a similar argument as above, if has the required property for T, then its image in has the required property for P. Hence, it suffices to prove the lemma for T.
Now we have
so that is a direct sum of d copies of U↦U⊗d− 1. We take r in the first of these copies, as follows. Let e1,…,en be a basis of U and set
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 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 α: Q → P 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: R → P 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
and a linear polynomial transformation γ: F → P. As γ is linear, we see that str(γV(v)) ≤str(v) for all V ∈Vec and v ∈ F(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
as whenever . 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 V ∈Vec define . If Y is a proper closed subset of P, then by [6, Theorem 4.2.5] there exist finitely many polynomial transformations αi: Qi → P with and for all V ∈Vec. Since , 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 f ∈ P(V ) such that
is not surjective. By Main Theorem I, it suffices to prove that X≠P. As before, we claim that in fact X(V )≠P(V ) already when .
First suppose that P is irreducible. Then P is a Schur functor. Take V0 = Kd and . 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 and be the inclusion and projection maps and take
Then P(φi ∘ πi)(p) = P(φi)pi. Hence,
is surjective.
Next, suppose that P = Q ⊕ R and that there exist f ∈ Q(V ) and g ∈ R(W) such that
are surjective. By induction, we can assume such f, g exist when and . Now, we see that
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 , we see that for all f with strength greater than some function of 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
into Schur functors. For each U ∈Vec of dimension ≥ d the GL(U)-module P(i)(U) is irreducible (and in particular nonzero). Let V ∈Vec 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
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
where we concatenate copies of a basis in the ℓd-dimensional space W(1) to identify W(1) ⊕⋯ ⊕ W(k) with Kkℓd.
Example 4.1.1
Let , so that we may take V = Kd. We may take and , where x1,…,xd and xd+ 1,…,x2d are bases of V(1,1) and V(1,2), respectively. We then have
We will prove, first, that any q constructed in this manner has a dense -orbit in , and second, that q ≼ p for all with a dense -orbit.
Density of the Orbit of q
Proposition 4.2.1
The -orbit of q is dense in .
Proof
It suffices to prove that for each U ∈Vec and each p ∈ P(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 ι: V → U. Now 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
for suitable elements . 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
as desired. □
Minimality of the Class of q
Proposition 4.3.1
We have q ≼ p for every with a dense -orbit.
Proof
Let be a tensor with a dense -orbit and write p = (p0,p1,p2,…) with pi ∈ P(Ki). Take m0 = n0 = 0. There exists a linear map such that , namely the zero map. Write ni = n0 + iℓd. Our goal is to construct, for each integer i ≥ 1, an integer mi ≥ mi− 1 and a linear map such that the linear map making the diagram
commute satisfies .
Let i ≥ 1 be an integer. As observed in Section 3.1, we can write
where is a homogeneous polynomial functor of degree j. Writing as , we obtain a corresponding decomposition
where and and we claim that has a dense -orbit; here we use the notation from Remark 2.6.7.
The polynomial bifunctor (U, V )↦P(U ⊕ V ) 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 where Q, R are Schur functors of degrees d − j, j, respectively. Hence the elements r1,…,rd− 1 have finite strength. Also note that has finite strength. So by Corollary 2.6.8, we see that the -orbit of must be dense.
The tuple may not have a dense -orbit. However, there exists a polynomial functor R less than or equal to R1 ⊕⋯ ⊕ Rd− 1 with R({0}) = {0}, an and a polynomial transformation
such that r has a dense -orbit and α(r) = (r1,…,rd− 1). Since P is homogeneous of degree d > deg(R), the pair has a dense orbit in by [6, Lemma 4.5.3]. Hence, by Corollary 2.6.3, there exists an mi ≥ mi− 1 + ℓd and a linear map such that and .
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,
Thus, informally, applying the map ψi makes specialise to the required q(i), while the terms r1,…,rd− 1 are specialised to zero.
We define φi as above and we have
Iterating this argument, we find that the infinite matrix
has the property that P(e)p = q(1) + q(2) + ⋯ = q, as desired. □
Remark 4.3.2
Note that the element e ∈ E 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 with a dense -orbit. Here q is defined as before in variables distinct from x1,…,xk. To see this, note that a tensor in with a dense -orbit is of the form (ℓ1,…,ℓk,p) where are linearly independent and has a dense -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 m0 ≥ k and a linear map such that the linear map satisfies . 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 -orbit follows directly from Propositions 4.2.1 and 4.3.1. □
Maximal Tensors
Next, we construct maximal elements with respect to ≼ of 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 V ↦V⊗d.
Lemma 4.4.1
There exists a tensor such that p ≼ rd for all .
Proof
For d = 1, we know that the element satisfies p ≼ r1 for all . Now suppose that d ≥ 2 and that satisfies p ≼ rd− 1 for all . We define a satisfying p ≼ rd for all .
For j ∈{1,…,d}, we define the map as the inverse limit of the bilinear maps −⊗j−: V × V⊗d− 1 → V⊗d such that
for all finite-dimensional vector space V and all vectors v1,…,vd ∈ V. Now, we take
where is any injective map. We claim that p ≼ rd for all . Indeed, any such p can we written as
with 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 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 such that p ≼ r for all .
Proof
The space is a direct summand of . Let r be the component in of rd from the previous lemma. Then p ≼ r for all . □
Proposition 4.4.3
Let P be a pure polynomial functor. Then there exists a tensor such that p ≼ r for all .
Proof
Write
as a direct sum of Schur functors. For each i ∈{1,…,k}, let be a tensor such that pi ≼ ri for all and take . Then p ≼ r for all . □
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 with a dense -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 for all P with P({0}) = {0}.
Polynomial Functors of Degree ≤ 2
Example 5.1.1
Take P = S1 ⊕ S1. Then a pair has one of the following forms:
the pair (v, w) with linearly independent vectors;
the pair (λu, μu) with nonzero and ; or
the pair (0,0).
In the first case, the pair (v, w) has a dense -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:
where a point corresponds to the class of (λu, μu) with nonzero and all points in are incomparable.
Example 5.1.2
Take P = S2. By Proposition 4.3.1 each infinite quadric
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:
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 .
Example 5.1.3
Take . By Proposition 4.3.1 each infinite alternating tensor
of infinite rank specialises to q = x1 ∧ x2 + x3 ∧ x4 + ⋯. And, q specialises to p as well by applying the following element of E:
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 .
Example 5.1.4
Take for integers a, b, c ≥ 0. By Remark 4.3.3, any tuple in with a dense -orbit specialises to the tuple
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 . So the tuple with a dense -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 = S2 ⊕ S3. Does there exist a tensor with a dense -orbit such that q ≼ p for all with a dense -orbit?
The next example compares different candidates for such a minimal element.
Example 5.2.2
Take with 1 < d1 < ⋯ < dk. By [6, Lemma 4.5.3], an element has dense -orbit if and only if has dense -orbit for all i = 1,…,k. In particular, the elements
and
have dense -orbits. Clearly q ≼ p. By Corollary 2.6.3, there exists an n ≥ 1 and linear forms ℓ1,…,ℓn in x1,…,xk such that for j = 1,…,k. Take
for h ≥ 1 and i ∈{1,…,k}. Then we see that for j = 1,…,k. So since
we see that q(j)(ℓ1,ℓ2,…) = p(j). Let A be the k × n matrix corresponding to ℓ1,…,ℓn and take
Then P(e)q(j) = q(j)(ℓ1,ℓ2,…). So p ≼ q. Hence .
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 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]