On commuting pairs in arbitrary sets of 2x2 matrices

Abstract

Let Mat2(R) be the set of 2 × 2 matrices with real entries. For any >0 and any finitely--supported probability measure μ on Mat2(R), we prove that either \[ T(μ) = ΣX, Y ∈ supp(μ), XY = YX μ(X) μ(Y) < \] or there exists some finite set S contained in a 2-dimensional subspace of Mat2(R) such that μ(S) ≥ /8. This is sharp up to the multiplicative constant. We prove quantitatively stronger results when \[ μ ( (ai,j)1 ≤ i,j ≤ 2 ) = (a1,1) … (a2,2) \ \ for every \ a1,1, …, a2,2 ∈ R, \] with being some finitely--supported probability measure on R. For instance, when A ⊂ R is a generalised arithmetic progression or multiplicative progression of dimension d and = 1A/|A|, our techniques imply that |A|-3 d T(μ) 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 R. The latter includes applications of Schmidt's subspace theorem and the resolution of the weak polynomial Freiman--Ruzsa conjecture over integers.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…