Pith. sign in

REVIEW 4 minor 3 cited by

On commuting pairs in arbitrary sets of 2x2 matrices

T0 review · 0 major / 4 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read For any finitely supported probability measure on 2x2 real matrices, the commuting probability is at most eight times the maximum mass of any subset lying in a 2-dimensional subspace; the bound is sharp up to the constant.

desk verdict Sharp structural dichotomy for commuting pairs in 2x2 real matrices; the proof is sound, with only minor blemishes. read the letter →

arxiv 2411.10404 v2 pith:AUDJ7CCT submitted 2024-11-15 math.NT math.CO

Akshat Mudgal This is my paper · ORCID
classification math.NTmath.CO MSC 11B3011D4515B36
keywords commutingmatrices2x2Szemerédi–Trottertheoremsum-productphenomenongrowthingroupsmultiplicativeenergygeneralisedarithmeticprogressionsprobability
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper asks how likely two randomly chosen 2x2 real matrices are to commute, when the randomness comes from an arbitrary finite collection of matrices. The main theorem gives a clean dichotomy: either the commuting probability is tiny, or a substantial portion of the entire collection sits inside a single 2-dimensional subspace of the 4-dimensional matrix space. Concretely, for every finitely supported probability measure $\mu$, the commuting probability $T(\mu)$ is at most $8\delta(\mu)$, where $\delta(\mu)$ is the largest weight of any part of the support lying in a 2-dimensional subspace; an explicit example shows the constant 8 cannot be replaced by anything smaller than $2/3$. For product measures — where the four entries of a matrix are drawn independently from the same set $A$ — the paper proves matching upper and lower bounds of order $|A|^{-3}$ for the commuting probability whenever $A$ is a generalized arithmetic progression or a multiplicative progression, and it connects these estimates to incidence geometry, sum-product phenomena, and growth in the affine group.

What carries the argument

The load-bearing object is the dichotomy between 2-dimensional subspaces and the rest of $\mathrm{Mat}_2(\mathbb{R})$. Lemma 3.1 — a $2\times2$ matrix that commutes with three linearly independent $2\times2$ matrices must be scalar — forces every large commuting contribution to lie inside a 2-dimensional subspace; Hölder's inequality then converts this structural fact into the factor 8. For the quantitative results, the machinery includes a weighted Szemerédi–Trotter incidence bound, the resolution of the weak polynomial Freiman–Ruzsa conjecture (a structure theorem for sets with small doubling) used together with a quantitative subspace theorem to control additive energy of sets with few products, and energy estimates for affine transformations, which connect $T(\mu)$ to growth in the affine group.

What would settle it

Find a finitely supported probability measure $\mu$ on $\mathrm{Mat}_2(\mathbb{R})$ with $T(\mu) > 8\delta(\mu)$; Theorem 1.1 says no such measure exists. The paper's own example in (1.8)–(1.9) attains $T(\mu)/\delta(\mu) = 2/3 - o(1)$, so the constant 8 is not contradicted but is evidently not optimal.

Watch

Extended reading notes

Core claim

The paper's central claim is that commutativity among $2\times2$ matrices is controlled by low-dimensional concentration. Theorem 1.1 states that for any finitely supported probability measure $\mu$ on $\mathrm{Mat}_2(\mathbb{R})$, $T(\mu) \le 8\delta(\mu)$, and this is optimal up to the multiplicative constant: the family in (1.8)–(1.9) gives $T(\mu) \ge (2/3-o(1))\delta(\mu)$. The proof uses the elementary fact that a matrix commuting with three linearly independent $2\times2$ matrices must be a scalar, together with Hölder's inequality, to reduce all large commuting contributions to two-dimensional configurations. For product measures induced by a measure $\nu$ on $\mathbb{R}$, the paper proves $T(\mu_\nu) \ll \|\nu\|_2^4 M(\nu)^{1/2} + \|\nu\|_\infty^2 M(\nu) + \|\nu\|_2^6 + \nu(0)^3$, and derives from this that $T(A) \sim_d |A|^5$ when $A$ is a generalized arithmetic progression or multiplicative progression of dimension $d$. A further theorem shows $T(\mu_\nu) \ll \|\nu\|_2^{5+c} + \nu(0)^3$ for some absolute $c>0$, extending affine-group energy estimates to arbitrary product measures.

Load-bearing premise

The entire proof of Theorem 1.1 rests on the fact that a $2\times2$ matrix commuting with three linearly independent $2\times2$ matrices must be a scalar multiple of the identity; if that fact were false, the dichotomy would collapse.

Editorial extensions

If this is right

  • Any measure with commuting probability at least $\varepsilon$ has at least $\varepsilon/8$ of its mass in some 2-dimensional subspace, giving a structural test for when random pairs of $2\times2$ matrices are likely to commute.
  • For uniform entries from a generalized arithmetic progression or multiplicative progression of dimension $d$, the number of commuting pairs is within $d$-dependent constants of $|A|^5$, so the exponent 5 is the true order for these structured sets.
  • The low-energy decomposition in Corollary 1.6 splits any finite $A \subset \mathbb{R}$ into a part with nearly minimal additive energy and a part with slightly smaller multiplicative energy, each of which yields separate control on commuting pairs.
  • Theorem 1.7 extends affine-group energy bounds to arbitrary product measures, giving $T(\mu_\nu) \ll \|\nu\|_2^{5+c} + \nu(0)^3$ for some absolute $c>0$, a strict improvement over the generic $|A|^{5+1/2}$ bound.
  • Together these results support Conjecture 1.8, that $T(A) \ll_\varepsilon |A|^{5+\varepsilon}$ for every finite $A \subset \mathbb{R}$; the paper's general bound $T(A) \ll |A|^{5+1/2-c}$ is the current best toward it.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The constant 8 in Theorem 1.1 is probably not optimal; the paper's own example reaches only $2/3$, so the true supremum of $T(\mu)/\delta(\mu)$ lies somewhere between $2/3$ and $8$, and closing this gap is a natural refinement of the Hölder/linear-algebra argument.
  • The dichotomy suggests a fast randomized test for whether a large set of $2\times2$ matrices has many commuting pairs: if a small number of random pairs commutes with high frequency, then a large fraction of the set must be near a 2-dimensional subspace, which can be found by standard linear algebra.
  • The same circle of ideas may extend to $d\times d$ matrices, with the natural threshold involving subspaces of dimension $d(d-1)$ (the centralizer of a generic non-scalar matrix) and with quantitative bounds depending on higher-dimensional analogues of additive and multiplicative energy.
  • Because of the correspondence in (1.4) between commuting pairs and energies in the affine group, any future improvement in affine-group energy bounds should automatically improve the estimates for $T(A)$, and conversely.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 4 minor

Summary. The paper studies the weighted number T(μ) of commuting pairs in a finitely supported probability measure μ on Mat2(R). The main structural result, Theorem 1.1, proves that T(μ) ≤ 8δ(μ), where δ(μ) is the maximum μ-mass of any subset of the support lying in a 2-dimensional subspace, and shows via an explicit construction that this is sharp up to the multiplicative constant. For product measures, the paper proves quantitative upper bounds in terms of the multiplicative energy and l2 norms (Theorem 1.2), near-optimal estimates for sets with small additive doubling (Corollary 1.3) or small multiplicative doubling (Theorem 1.4), a 'few products, many sums' proposition for arbitrary weights (Proposition 1.5), a low-energy decomposition (Corollary 1.6), and an exponent-improving bound for product measures via affine-group energies (Theorem 1.7). The proofs combine incidence geometry (weighted Szemerédi–Trotter), weak polynomial Freiman–Ruzsa, the quantitative Amoroso–Viada subspace theorem, and energy bounds of Rudnev–Shkredov, while clearly separating the elementary core from the external inputs.

Significance. If the results are correct, the paper provides a clean, sharp structure theorem for commuting pairs in arbitrary matrix sets, connecting a classical group-theoretic quantity to additive combinatorics, incidence geometry, and growth in groups. The proof of Theorem 1.1 is elementary and elegant once the small subspace misstatement is corrected, and the lower bound construction in (1.8)-(1.9) shows the optimality of the structural formulation. The quantitative results, while relying on deep recent theorems, are substantial: they yield polynomial bounds without the usual o(1)-factors in several regimes and demonstrate a fruitful interaction between the weak PFR resolution and quantitative subspace theorems. The paper is also honest about its limitations, explicitly stating the missing triangle inequality (1.7) in Section 7. Overall this is a significant contribution to the additive combinatorics of matrix sets.

minor comments (4)
  1. [Section 3, Lemma 3.1] The subspace U'' is defined as {(v_{i,j}) : v_{2,1} = v_{1,2} = 0}, which is the set of diagonal matrices, but the subsequent line takes Z'' to be the anti-diagonal matrix [[0,h],[g,0]]. The intended subspace is {(v_{i,j}) : v_{1,1} = v_{2,2} = 0}; with this correction the argument x1 = x4 goes through. Also in the previous paragraph, 'Z' ∈ (V ∩ U)' should read 'Z' ∈ (V ∩ U')'.
  2. [Section 1, definition of M(ν)] The displayed definition of M(ν) contains a typo: the term ν(a1)ν(a2)ν(a4)ν(a4) should be ν(a1)ν(a2)ν(a3)ν(a4). This is clear from the subsequent use of M(ν) and from the analogous definition of M(A) in Section 2.
  3. [Section 6, proof of Proposition 1.5] In the chain Eν(A0)^{1/4} ≪ Σ_i 2^{-i}‖ν‖_2 E(A_i)^{1/4} ≪ M^{O(1)}‖ν‖_2 Σ_i 2^{-i}|A_i|^{1/2} ≪ M^{O(1)}‖ν‖_2 J, the last step is not expanded. It follows from the level-set definition that 2^{-i}|A_i|^{1/2} ≤ 1 (since |A_i| ≤ 2^{2i} by the l2 constraint), so a short parenthetical justification would help the reader.
  4. [Section 4, proof of Lemma 4.1] In the first case H1 with x2 = 0, the sentence 'then we must either have y3 = 0 or x4 = x1' omits the possibility y2 = 0. The subsequent counting does include this case, so the sentence should be amended to 'y2 = 0 or y3 = 0 or x4 = x1' for accuracy.

Circularity Check

0 steps flagged · score 1.0 of 10

No load-bearing circularity; central bounds derive from independent external theorems and in-paper linear algebra.

full rationale

The main result Theorem 1.1 is obtained from Lemma 3.1 (elementary linear algebra, proved in-paper) and a Hölder/averaging argument; the quantity δ(μ) is an input parameter, not a fitted value. Theorem 1.2 relies on the weighted Szemerédi–Trotter theorem (Lemma 2.1) and direct energy estimates. The multiplicative-structure results (Proposition 1.5 and Theorem 1.4) use the externally proved weak PFR theorem of Gowers–Green–Manners–Tao (Lemma 2.2) and the quantitative subspace theorem of Amoroso–Viada (Lemma 2.3); neither input presupposes any conclusion of this paper. Theorem 1.7 uses external energy bounds of Rudnev–Shkredov (Lemma 2.5) plus the paper's own asymmetric estimates (4.8). The self-citations that occur are pointers to the author's prior work (e.g., [19, Lemma 4.2] for a low-energy decomposition in Corollary 1.6, and [21] in the historical discussion around Proposition 1.5); they are not used as black boxes in the proofs of the central theorems, and the auxiliary Lemma 2.6 is proved here. The affine-group reformulation (1.4) is a genuine identity connecting commuting pairs to group energies, and the subsequent estimates are imported from independent external results, not from an ansatz smuggled in via self-citation. The paper explicitly flags the unavailable triangle inequality (1.7) and does not use it in the proof of Theorem 1.7. The typo in Lemma 3.1 (U'' should be the anti-diagonal subspace) is a textual slip, not a circular step. Accordingly, no prediction or first-principles result reduces by construction to its inputs.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

No new free parameters or invented entities. All external lemmas are stated explicitly and are established results in the literature. The proof of Proposition 1.5 introduces a dyadic level-set decomposition that is standard in additive combinatorics.

assumptions (6)
  • standard math Weighted Szemeredi-Trotter theorem for arbitrary non-negative weights (Lemma 2.1)
    Used in the proof of Theorem 1.2 and Corollary 1.3; quoted from Lund's thesis and related literature.
  • standard math Weak polynomial Freiman-Ruzsa conjecture resolved by Gowers-Green-Manners-Tao (Lemma 2.2)
    Used in Lemma 6.2 to find a large subset of A with small multiplicative rank.
  • standard math Quantitative subspace theorem of Evertse-Schmidt-Schlikewei as refined by Amoroso-Viada (Lemma 2.3)
    Used in Lemma 6.1 to bound additive energy of sets with small multiplicative rank.
  • standard math Ruzsa covering lemma and Plunnecke-Ruzsa inequality (Lemma 2.4)
    Used in Lemma 6.2 and Theorem 1.4 to pass from product doubling to covering by dilates.
  • standard math Rudnev-Shkredov energy bound for affine transformations (Lemma 2.5)
    Used in Theorem 1.7 to bound energies over affine groups.
  • domain assumption The real numbers and matrix algebra over R satisfy the standard field and vector space axioms
    The entire paper works over R with finitely supported measures; no exotic structures are assumed.

how reviews work

0 comments
Cite this review

Pith. "Pith review of On commuting pairs in arbitrary sets of 2x2 matrices." pith.science (2026). https://pith.science/paper/AUDJ7CCT

@misc{pith2026241110404,
  author       = {Pith},
  title        = {Pith review of: On commuting pairs in arbitrary sets of 2x2 matrices},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/AUDJ7CCT}},
  note         = {Machine review of arXiv:2411.10404}
}
abstract

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 $\mu$ on $\textrm{Mat}_2(\mathbb{R})$, 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 ${S}$ contained in a $2$-dimensional subspace of $\textrm{Mat}_2(\mathbb{R})$ such that $\mu({S}) \geq \varepsilon/8$. 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 $\nu$ 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 $\nu = {1}_{{A}}/|{A}|$, our techniques imply that $|{A}|^{-3} \ll_d T(\mu) \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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On commuting integer matrices

    math.NT 2025-04 accept novelty 7.0 of 10

    Commuting pairs of bounded 3x3 integer matrices are shown to number Theta(N^10), and 2x2 commuting pairs have an explicit asymptotic with constant 10 zeta(2)/(3 zeta(3)).

  2. Counting matrices over finite rank multiplicative groups

    math.NT 2025-02 accept novelty 6.0 of 10

    The paper proves upper bounds on the number of matrices with entries from a finite subset of a finite-rank multiplicative group that have a given rank, determinant, or characteristic polynomial.

  3. On an asymmetric additive energy inequality

    math.NT 2026-07 accept novelty 5.0 of 10

    A Fourier-free proof of the asymmetric additive energy inequality via a discrete convexity lemma, with non-abelian and sumset corollaries.

Reference graph

Works this paper leans on

34 extracted references · 32 canonical work pages · cited by 3 Pith papers

  1. [1]

    Amoroso, E

    F. Amoroso, E. Viada, Small points on subvarieties of a torus, Duke Math. J. 150 (2009), no. 3, 407–442

    work page 2009

  2. [2]

    Balog, E

    A. Balog, E. Szemer´ edi, A statistical theorem of set addition , Combinatorica 14 (1994), no.3, 263-268

    work page 1994

  3. [3]

    Balog, T

    A. Balog, T. D. Wooley, A low-energy decomposition theorem , Q. J. Math. 68 (2017), no. 1, 207-226

    work page 2017

  4. [4]

    Bourgain, M

    J. Bourgain, M. C. Chang, On the size of k-fold sum and product sets of integers , J. Amer. Math. Soc., 17 (2004), no. 2, 473-497

    work page 2004

  5. [5]

    Browning, W

    T. Browning, W. Sawin, V. Y. Wang, Pairs of commuting integer matrices , arXiv:2409.01920

    arXiv

  6. [6]

    Chapman, A

    J. Chapman, A. Mudgal, On commuting integer matrices , forthcoming

    work page

  7. [7]

    M. C. Chang, The Erd˝ os–Szemer´ edi problem on sum set and product set, Ann. of Math. (2) 157 (2003), no. 3, 939-957

    work page 2003

  8. [8]

    M. C. Chang, Some consequences of the polynomial Freiman-Ruzsa conject ure, C. R. Math. Acad. Sci. Paris 347 (2009), no. 11-12, 583-588

    work page 2009

Show all 34 references
  1. [9]

    Eberhard, Commuting probabilities of finite groups , Bull

    S. Eberhard, Commuting probabilities of finite groups , Bull. Lond. Math. Soc. 47 (2015), no. 5, 796–808

    2015

  2. [10]

    Erd˝ os, P

    P. Erd˝ os, P. Tur´ an,On some problems of a statistical group-theory. IV , Acta Math. Acad. Sci. Hungar. 19 (1968), 413–435

    1968

  3. [11]

    J. H. Evertse, H. P. Schlickewei, W. M. Schmidt, Linear equations in variables which lie in a multi- plicative group, Ann. of Math. (2) 155 (2002), no. 3, 807-836

    2002

  4. [12]

    W. Feit, N. J. Fine, Pairs of commuting matrices over a finite field , Duke Math. J. 27 (1960), 91-94

    1960

  5. [13]

    W. T. Gowers, A new proof of Szemer´ edi’s theorem for arithmetic progress ions of length four , Geom. Funct. Anal. 8 (1998), no. 3, 529-551

    1998

  6. [14]

    W. T. Gowers, B. Green, F. Manners, T. Tao, On a conjecture of Marton , to appear in Ann. of Math. (2), arXiv:2311.05762

    arXiv

  7. [15]

    Green, F

    B. Green, F. Manners, T. Tao, Sumsets and entropy revisited , to appear in Random Structures Algo- rithms, arXiv:2306.13403

    arXiv

  8. [16]

    W. H. Gustafson, What is the probability that two group elements commute? , Amer. Math. Monthly 80 (1973), 1031–1034

    1973

  9. [17]

    H. A. Helfgott, Growth and generation in SL2(Fp), Ann. of Math. (2) 167 (2008), no. 2, 601–623

    2008

  10. [18]

    Lund, Incidences and Extremal Problems on Finite Point Sets, Thesis (Ph.D.)-Rutgers The State University of New Jersey - New Brunswick

    B. Lund, Incidences and Extremal Problems on Finite Point Sets, Thesis (Ph.D.)-Rutgers The State University of New Jersey - New Brunswick. 2017. 101 pp

    2017

  11. [19]

    Mudgal, Energy estimates in sum-product and convexity problems , to appear in Amer

    A. Mudgal, Energy estimates in sum-product and convexity problems , to appear in Amer. J. Math., arXiv:2109.04932

    arXiv

  12. [20]

    Mudgal, Diameter free estimates for the quadratic Vinogradov mean v alue theorem , Proc

    A. Mudgal, Diameter free estimates for the quadratic Vinogradov mean v alue theorem , Proc. Lond. Math. Soc. (3) 126 (2023), no. 1, 76-128

    2023

  13. [21]

    Mudgal, An Elekes–R´ onyai theorem for sets with few products , Int

    A. Mudgal, An Elekes–R´ onyai theorem for sets with few products , Int. Math. Res. Not. IMRN 2024 (2024), no. 13, 10410-10424

    2024

  14. [22]

    Mudgal, Unbounded expansion of polynomials and products , Math

    A. Mudgal, Unbounded expansion of polynomials and products , Math. Ann. 390 (2024), no. 1, 381–415

    2024

  15. [23]

    Murphy, Upper and lower bounds for rich lines in grids , Amer

    B. Murphy, Upper and lower bounds for rich lines in grids , Amer. J. Math. 143 (2021), no. 2, 577–611

    2021

  16. [24]

    Murphy, O

    B. Murphy, O. Roche-Newton, I. Shkredov, Variations on the sum-product problem , SIAM J. Discrete Math. 29 (2015), no.1, 514-540

    2015

  17. [25]

    P. M. Neumann, Two combinatorial problems in group theory , Bull. London Math. Soc. 21 (1989), no. 5, 456–458

    1989

  18. [26]

    P´ alv¨ olgyi, D

    D. P´ alv¨ olgyi, D. Zhelezov,Query complexity and the polynomial Freiman–Ruzsa conject ure, Adv. Math. 392 (2021), Paper No. 108043, 18 pp

    2021

  19. [27]

    Petridis, New proofs of Pl¨ unnecke–type estimates for product sets in groups, Combinatorica 32 (2012), no

    G. Petridis, New proofs of Pl¨ unnecke–type estimates for product sets in groups, Combinatorica 32 (2012), no. 6, 721-733

    2012

  20. [28]

    Petridis, O

    G. Petridis, O. Roche-Newton, M. Rudnev, A. Warren, An energy bound in the affine group , Int. Math. Res. Not. IMRN 2022, no. 2, 1154–1172

    2022

  21. [29]

    Roche-Newton, M

    O. Roche-Newton, M. Rudnev, On the Minkowski distances and products of sum sets , Israel J. Math. 209 (2015), no.2, 507–526

    2015

  22. [30]

    Rudnev, I

    M. Rudnev, I. D. Shkredov, On the growth rate in SL2(Fp), the affine group and sum-product type implications, Mathematika 68 (2022), no. 3, 738–783. ON COMMUTING PAIRS IN ARBITRARY SETS OF 2 × 2 MATRICES 23

    2022

  23. [31]

    Schoen, New bounds in Balog–Szemer´ edi–Gowers theorem, Combinatorica 35 (2015), no

    T. Schoen, New bounds in Balog–Szemer´ edi–Gowers theorem, Combinatorica 35 (2015), no. 6, 695-701

    2015

  24. [32]

    Shkredov, Some new results on higher energies , Trans

    I. Shkredov, Some new results on higher energies , Trans. Moscow Math. Soc. 2013, 31-63

    2013

  25. [33]

    Solymosi, Bounding multiplicative energy by the sumset , Adv

    J. Solymosi, Bounding multiplicative energy by the sumset , Adv. Math. 222 (2009), no. 2, 402-408

    2009

  26. [34]

    T. Tao, V. H. Vu, Additive combinatorics, Cambridge Studies in Advanced Mathematics, 105. Cam- bridge University Press, Cambridge, 2006. Mathematics Institute, Zeeman Building, University of W ar wick, Coventry CV4 7AL, UK Email address : Akshat.Mudgal@warwick.ac.uk

    2006

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.