On commuting pairs in arbitrary sets of 2x2 matrices
arXiv:2411.10404
Abstract
Let be the set of matrices with real entries. For any and any finitely--supported probability measure on , we prove that either \[ T(μ) = \sum_{X, Y \in {\rm supp}(μ), XY = YX} μ(X) μ(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 \[ μ( (a_{i,j})_{1 \leq i,j \leq 2} ) = ν(a_{1,1}) \dots ν(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 and , our techniques imply that . Our methods highlight the connections of this problem to results in incidence geometry, growth in groups phenomenon as well as Bourgain--Chang type sum-product estimates over . The latter includes applications of Schmidt's subspace theorem and the resolution of the weak polynomial Freiman--Ruzsa conjecture over integers.
arXiv comment23 pages, Significant revisions: Theorem 1.1 strengthened, Added connection to growth in groups, see Theorem 1.7, Conjecture 1.8 and newly added section 7, and updated references