Ranks of linear matrix pencils separate simultaneous similarity orbits
arXiv:2109.09418 · doi:10.1016/j.aim.2023.108888
Abstract
This paper solves the two-sided version and provides a counterexample to the general version of the 2003 conjecture by Hadwin and Larson. Consider evaluations of linear matrix pencils on matrix tuples as . It is shown that ranks of linear matrix pencils constitute a collection of separating invariants for simultaneous similarity of matrix tuples. That is, -tuples and of matrices are simultaneously similar if and only if the ranks of and are equal for all linear matrix pencils of size . Variants of this property are also established for symplectic, orthogonal, unitary similarity, and for the left-right action of general linear groups. Furthermore, a polynomial time algorithm for orbit equivalence of matrix tuples under the left-right action of special linear groups is deduced.
References in corpus (6)
- Towards a theory of non-commutative optimization: geodesic first and second order methods for moment maps and polytopes
- Geometry of free loci and factorization of noncommutative polynomials
- Invariant theory and scaling algorithms for maximum likelihood estimation
- Arveson extreme points span free spectrahedra
- Free loci of matrix pencils and domains of noncommutative rational functions
- Algorithms for orbit closure separation for invariants and semi-invariants of matrices