On commuting pairs in arbitrary sets of 2x2 matrices
Akshat Mudgal

TL;DR
This paper investigates the structure of pairs of commuting matrices in arbitrary sets of 2x2 real matrices, establishing conditions under which such pairs are rare or concentrated in low-dimensional subspaces, with implications for incidence geometry and additive combinatorics.
Contribution
The authors provide a quantitative characterization of commuting pairs in matrix sets, connecting algebraic, geometric, and additive combinatorics techniques, and extend results to structured measures on real numbers.
Findings
Either the probability of commuting pairs is very small or matrices are concentrated in a low-dimensional subspace.
Established bounds for measures supported on generalized arithmetic or multiplicative progressions.
Connected the problem to incidence geometry, growth in groups, and sum-product estimates over the reals.
Abstract
Let be the set of matrices with real entries. For any and any finitely--supported probability measure on , we prove that either \[ T(\mu) = \sum_{X, Y \in {\rm supp}(\mu), XY = YX} \mu(X) \mu(Y) < \varepsilon \] or there exists some finite set contained in a -dimensional subspace of such that . This is sharp up to the multiplicative constant. We prove quantitatively stronger results when \[ \mu ( (a_{i,j})_{1 \leq i,j \leq 2} ) = \nu(a_{1,1}) \dots \nu(a_{2,2}) \ \ \text{for every} \ a_{1,1}, \dots, a_{2,2} \in \mathbb{R}, \] with being some finitely--supported probability measure on . For instance, when is a generalised arithmetic progression or multiplicative progression of dimension…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Matrix Theory and Algorithms · advanced mathematical theories
