The separating variety for matrix semi-invariants

Abstract

Let G be a linear algebraic group acting linearly on a vector space V, and let k[V]G be the corresponding algebra of invariant polynomial functions. A separating set S ⊂eq k[V]G is a set of polynomials with the property that for all v,w ∈ V, if there exists f ∈ k[V]G separating v and w, then there exists f ∈ S separating v and w. In this article we consider the action of G = SL2 × SL2 on the C-vector space M2,2n of n-tuples of 2 × 2 matrices by multiplication on the left and the right. Minimal generating sets Sn of C[M2,2n]G are known, and |Sn| = 124(n4-6n3+23n2+6n). In recent work, Domokos showed that Sn is a minimal separating set by inclusion, i.e. that no proper subset of Sn is a separating set. Our main result shows that any separating set for C[M2,2n]G has cardinality ≥ 5n-9. In particular, there is no separating set of size (C[M2n]G) = 4n-6 for n ≥ 4. We also consider the action of G= SLl(C) on Ml,n by left multiplication. In that case the algebra of invariants has a minimum generating set of size nl and dimension ln-l2+1. We show that a separating set for C[Ml,n]G must have size at least (2l-2)n-2(l2-l). In particular, C[Ml,n]G does not contain a separating set of size (C[Ml,n]G) for l ≥ 3 and n ≥ l+2. We include an interpretation of our results in terms of representations of quivers, and make a conjecture generalising the Skowronski-Weyman theorem.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…