On commuting pairs in arbitrary sets of 2x2 matrices
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909544353890304 |
|---|---|
| author | Mudgal, Akshat |
| author_facet | Mudgal, Akshat |
| contents | Let $\textrm{Mat}_2(\mathbb{R})$ be the set of $2 \times 2$ matrices with real entries. For any $\varepsilon>0$ and any finitely--supported probability measure $μ$ on $\textrm{Mat}_2(\mathbb{R})$, we prove that either \[ T(μ) = \sum_{X, Y \in {\rm supp}(μ), XY = YX} μ(X) μ(Y) < \varepsilon \] or there exists some finite set ${S}$ contained in a $2$-dimensional subspace of $\textrm{Mat}_2(\mathbb{R})$ such that $μ({S}) \geq \varepsilon/8$. 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 $\mathbb{R}$. For instance, when ${A} \subset \mathbb{R}$ is a generalised arithmetic progression or multiplicative progression of dimension $d$ and $ν= {1}_{A}/|{A}|$, our techniques imply that $|{A}|^{-3} \ll_d T(μ) \ll_d |{A}|^{-3}$. 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 $\mathbb{R}$. The latter includes applications of Schmidt's subspace theorem and the resolution of the weak polynomial Freiman--Ruzsa conjecture over integers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_10404 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On commuting pairs in arbitrary sets of 2x2 matrices Mudgal, Akshat Number Theory Combinatorics 11B30, 11D45, 15B36 Let $\textrm{Mat}_2(\mathbb{R})$ be the set of $2 \times 2$ matrices with real entries. For any $\varepsilon>0$ and any finitely--supported probability measure $μ$ on $\textrm{Mat}_2(\mathbb{R})$, we prove that either \[ T(μ) = \sum_{X, Y \in {\rm supp}(μ), XY = YX} μ(X) μ(Y) < \varepsilon \] or there exists some finite set ${S}$ contained in a $2$-dimensional subspace of $\textrm{Mat}_2(\mathbb{R})$ such that $μ({S}) \geq \varepsilon/8$. 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 $\mathbb{R}$. For instance, when ${A} \subset \mathbb{R}$ is a generalised arithmetic progression or multiplicative progression of dimension $d$ and $ν= {1}_{A}/|{A}|$, our techniques imply that $|{A}|^{-3} \ll_d T(μ) \ll_d |{A}|^{-3}$. 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 $\mathbb{R}$. The latter includes applications of Schmidt's subspace theorem and the resolution of the weak polynomial Freiman--Ruzsa conjecture over integers. |
| title | On commuting pairs in arbitrary sets of 2x2 matrices |
| topic | Number Theory Combinatorics 11B30, 11D45, 15B36 |
| url | https://arxiv.org/abs/2411.10404 |