no. 10 · Friday 6 November 2026
Maximally transitive semigroups of $n\times n$ matrices (revised and extended version)
Abstract
Let $\mathbb{K}=\mathbb{R}$ or $\mathbb{C}$. We prove that for every $n\ge 1$ there is a pair of $n\times n$ matrices with entries in $\mathbb{K}$ that generates a dense subsemigroup of the space $M_n(\mathbb{K})$ of all $n\times n$ matrices. Since the powers of a single matrix are never dense, two generators is optimal. Equivalently, there is a $2$-generator semigroup of linear maps whose action on $(\mathbb{K}^n)^n$ is topologically transitive, whereas no semigroup of linear maps acts topologically transitively on $(\mathbb{K}^n)^{n+1}$. In fact, for such a semigroup every orbit closure in $(\mathbb{K}^n)^k$, for every $k\ge1$, is as large as linear algebra allows. Along the way we give a short self-contained proof of the density of explicit $2$-generator subsemigroups of $GL_2^+(\mathbb{R})$ and of $M_2(\mathbb{R})$, based on a simple criterion for closed subsemigroups of $SL_2(\mathbb{R})$.
- comments
- This is a revised and extended version of a published article
- journal
- M. Javaheri, Maximally transitive semigroups of nxn matrices, J. Math. Anal. Appl. 401 (2013), 743--753
- fields
- Dynamical Systems, Functional Analysis