Papers
Topics
Authors
Recent
Search
2000 character limit reached

The separating variety for matrix invariants

Published 19 Aug 2025 in math.RT, math.AC, and math.CO | (2508.13865v1)

Abstract: Let GG be a linear algebraic group defined over an algebraically closed field kk, and let VV be a vector space on which GG acts linearly. The separating variety S<em>G,V\mathcal{S}<em>{G,V} is the subvariety of V<sup>2V<sup>2 consisting of pairs of points indistinguishable by invariant polynomials in k[V]<sup>Gk[V]<sup>G. Its geometry places restrictions on the existence of small separating sets, i.e. sets of invariants which distinguish the same points as the full algebra of invariants. The purpose of this article is to study the separating variety in the important special case where G=GLp(C)G=\mathrm{GL}_p(\mathbb{C}) acts on the set VV of nn-tuples of p×pp \times p matrices by simultaneous conjugation. We define a purely combinatorial poset, P</em>p,n\mathcal{P}</em>{p,n}, whose maximal elements are in 1-1 correspondence with the irreducible components of S<em>G,V\mathcal{S}<em>{G,V}. We show that S</em>G,V\mathcal{S}</em>{G,V} is a variety of dimension (n+1)p<sup>21(n+1)p<sup>2-1, and determine its subdimension for all nn and pp. In particular we show the subdimension is (n+1)p<sup>2p(n+1)p<sup>2-p if n3n \geq 3, or n2n \geq 2 and p4p \geq 4. In the case n3n \geq 3, we give a formula for the number of components of given codimension in S<em>G,V\mathcal{S}<em>{G,V}. We give explicit decompositions of S</em>G,V\mathcal{S}</em>{G,V} for all nn where p=2,3p=2,3 or $4$. Our results in particular show that when n2n\geq 2 and p4p\geq 4, or n3n\geq 3 and p=3p=3, C[V]<sup>G\mathbb{C}[V]<sup>G does not contain a polynomial or hypersurface separating set. It was proven in arXiv:2202.05717 that the same is true if n4n \geq 4 and p=2p=2. The author made a conjecture in arXiv:2211.17088 generalising the Skronowski-Weyman theorem for representations of quivers. The results of this paper prove that conjecture in two important special cases: for the quiver with one vertex and an arbitrary number, nn, of loops, and for the quiver with two vertices and nn arrows between them.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 2 tweets with 1 like about this paper.