Effective Joint Equidistribution of Subspaces of Bounded Height in Rigid Adelic Spaces

arXiv:2608.30608 · math.NT, math.DS · Submitted 2026-08-31 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: I'm Ada.

Emmy: And I'm Emmy, here with Kolya.

Ada: We're looking at the paper: "Effective Joint Equidistribution of Subspaces of Bounded Height in Rigid Adelic Spaces".

Emmy: Here's the gist of the paper. The paper establishes an effective joint equidistribution theorem for d-dimensional K-subspaces, where 1 at most d < n, within a fixed n-dimensional rigid adelic space over a number field K.

Ada: The parameters considered are the height, the image in the archimedean Grassmannian, and the isometry classes of the subspace and quotient after rescaling to height 1.

Emmy: For bounded Lipschitz test functions, an explicit power-saving error term is obtained.

Ada: This result refines Thunder’s asymptotic formula for subspaces of bounded height and also yields a power-saving asymptotic estimate for subspaces containing d linearly independent projective points of bounded height, with the leading constant expressed as a moment of the last successive minimum.

Title and authors: Ada: So we're looking at a paper called "Effective Joint Equidistribution of Subspaces of Bounded Height in Rigid Adelic Spaces" written by Ruida Di. It deals with d-dimensional subspaces in an n-dimensional rigid adelic space over a number field K, where d is less than n.

Emmy: The core idea is about getting a precise way to count these subspaces when their height is bounded, and we're looking at parameters like the height itself, the image in the archimedean Grassmannian, and how they compare after rescaling everything to have a height of one.

Kolya: It sounds like this is tackling a very hard counting problem in Diophantine geometry where you're trying to estimate how many subspaces fit within some bounded size constraint.

Ada: Exactly, and the paper shows that for bounded Lipschitz test functions, they can get an explicit power-saving error term in their main formula. This is important because it refines earlier work by Thunder on subspaces of bounded height.

Emmy: And it goes further than just refining old formulas; they get a power-saving asymptotic estimate for subspaces that contain d linearly independent projective points of bounded height, and the leading constant they find is expressed as a moment of the last successive minimum.

Kolya: So, to put it simply, this work provides a more robust counting estimate for these kinds of geometric objects in this adelic setting than what was previously available.

The paper's summary: Ada: What the paper is summarizing is that they establish an effective joint equidistribution theorem for these d-dimensional K-subspaces inside a fixed n-dimensional rigid adelic space over a number field K. They are focusing on parameters like the height, the image in the archimedean Grassmannian, and the isometry classes after rescaling to height one.

Emmy: The summary highlights that they obtain an explicit power-saving error term when using bounded Lipschitz test functions for their main estimate. This means you get a tighter bound than just a general approximation when you're looking at certain types of functions.

Kolya: And then they show an application where they get a power-saving asymptotic estimate for subspaces that contain d linearly independent projective points of bounded height, and the leading constant involves the moment of the last successive minimum.

Ada: That leads into their main quantitative estimate, which is written as psi applied to some ratio involving the height and another geometric term x E(W), where this expression equals a main term involving an integral over a measure mu E.

Emmy: The normalized counting estimate derived from this theorem says that the count of these subspaces is proportional to the product of the height ratio and some other geometric quantity, as B goes to infinity.

Kolya: So, if you're interested in how many of these objects there are up to a certain size B, this theorem gives you a way to estimate that number more accurately than before.

The paper's improvements: Ada: One major improvement they point out is getting an enhanced error term control for counting sums by explicitly linking truncation parameters to growth rates using what they call Proposition three point one four and balancing identities like one hundred nine <ref:2608.30608#pg2>. This helps them get a more precise asymptotic formula when the test function is controlled in its Lipschitz norm, not just bounded.

Emmy: They also incorporate the geometric constraints from Lemma two point seven into their counting framework by using Proposition four point one ii to bound counts of subspaces that contain fixed lower-dimensional subspaces U. This helps quantify how much the cusp region contributes to the main term MR(B).

Kolya: And they improved how they handle non-uniformity in local estimates by using smooth periodized weights built through Lemma three point ten and Proposition three point six, which allows for more robust bounds on sums like SR(B) and MR(B) that are uniform over the arithmetic sectors.

Ada: Another key improvement is a refinement of the asymptotic formula for counting subspaces containing linearly independent projective points by explicitly deriving the leading constant as a moment of the last successive minimum, which gives a more detailed description of what's happening in that error term structure.

Emmy: Finally, they developed a method to remove truncation dependence by applying Proposition four point three to show that the difference between the truncated sum and main term is bounded by an arithmetic tail estimate, which when combined with their counting bound yields a global estimate that doesn't depend on the truncation radius R for large B.

Conclusion: Ada: So, to wrap up, this paper on "Effective Joint Equidistribution of Subspaces of Bounded Height in Rigid Adelic Spaces" gives us a refined total subspace count that is independent of the specific bounds a and b that were used before.

Emmy: The implication here is that they've managed to get power-saving errors for both the height aspect and the geometric aspect of these subspaces, which is significant because it connects different parts of their geometry in a very controlled way.

Kolya: From a probabilistic view, this means we have a much better understanding of the tail behavior when looking at these counts as B gets large, especially concerning those last minima they mentioned.

Ada: I think what this means for the world is that for problems involving counting geometric objects in complex number fields or adelic spaces, we now have a more precise tool to estimate their distribution than before.

Emmy: It provides a solid foundation for future work where you might want to study even more intricate geometric invariants by controlling these equidistribution properties.

Kolya: I'm just saying that this level of control over the error terms is what lets you actually use these estimates in applications, not just in pure theory.

math.NT, math.DS

Submitted: 2026-08-31

Updated: 2026-11-10

Comments: The v3 paper give a more general counting estimates allow the height, positions, shapes to vary simultaneously. It also simply the v2 proof make it more clear. I also add some applications for the new results

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Importance score: 91/100

The gist: The paper establishes an effective joint equidistribution theorem for d-dimensional K-subspaces, where 1 at most d < n, within a fixed n-dimensional rigid adelic space over a number field K.

Key concepts

Joint Equidistribution Theorem
This theorem proves that as we consider a sequence of $d$-dimensional K-subspaces, their distribution across the space becomes predictable. It links how well they are distributed in terms of their height and their geometric shape (image in the archimedean Grassmannian).
Rigid Adelic Space
This is a specific mathematical setting over a number field K. It combines concepts from adeles (local fields) with rigidity, providing a structured environment where subspaces can be studied using tools from arithmetic geometry and harmonic analysis.
Power-Saving Error Term
These are refined error bounds that show how quickly the approximation of a counting formula approaches the true value. The paper achieves these by linking truncation parameters to growth rates, leading to estimates that depend on $B$ raised to a smaller power than previously known.
Last Successive Minimum
This term arises in the counting estimate for subspaces containing linearly independent projective points. It is a specific geometric quantity related to the structure of the subspace and its complement, used to precisely define the leading constant in asymptotic formulas.

Terminology

Summary

The paper establishes an effective joint equidistribution theorem for d-dimensional K-subspaces, where 1 at most d < n, within a fixed n-dimensional rigid adelic space over a number field K. p. 0 The parameters considered are the height, the image in the archimedean Grassmannian, and the isometry classes of the subspace and quotient after rescaling to height 1. p. 0 For bounded Lipschitz test functions, an explicit power-saving error term is obtained. p. 0 This result refines Thunder’s asymptotic formula for subspaces of bounded height and also yields a power-saving asymptotic estimate for subspaces containing d linearly independent projective points of bounded height, with the leading constant expressed as a moment of the last successive minimum. p. 0

Theorem 1.1 provides the main quantitative estimate:

psi (H(W) over B, x E(W)) = a K,n,d H(E) kappa d Z infinity integral from 0 to infinity Z X E psi(r, x), d mu E(x) dr + O a,b delta | psi| B L B-delta

for every bounded Lipschitz function psi on (0, infinity) times X E satisfying supp psi [a, b] times X E, where B-kappa n X W E and K W=d. Consequently, as B to infinity, the normalized counting estimate is derived:

B-kappa n X W E, K W=d delta(H(W)/B, x E(W)) a K,n,d H(E) kappa d kappa nr kappa n-1 dr d mu E.

Theorem 1.2 offers a counting estimate for subspaces with large last minima:

T(1) d(B, R) = X W E, K W=d H(W) at most B lambda d(W c) > R much less than E R - bd,e B kappa n + B kappa n-kappa/d + 1 (d at least 2),

and a similar estimate for the quotient tail. The main term count is given by X J j=1 X gamma in gamma j D B,R(gamma) = M R(B) + O(1). p. 1 Proposition 3. p. 54 identifies the parabolic measure and the main-term constant: assuming H(E)=1, as finite Borel measures on Y d, vol(KE, f) (pi j, Y)* mu S j = kappa n a K,n,d nu E d. p. 0

Proposition 4. p. 54 provides the global estimate:

S(B) - M(B) much less than E a,b, epsilon | phi| B L R 3 rho beta over rho+1 B kappa n-delta 0+ epsilon + R - bd,e B kappa n + kappa n-kappa/ [d,e] + 1.

The final result is the refinement of Thunder’s total subspace count, which is independent of a and b. p. 3

The methodology involves combining parabolic parametrization with quantitative lattice-point counting and arithmetic estimates for cusps. p. 5 The primary difficulty in obtaining an error term stems from the noncompactness of the spaces of normalized isometry classes, which is managed by using last Roy–Thunder minima to control the truncation error. p. 6 The final results provide power-saving errors for both height and geometric aspects of subspaces. p. 3

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Enhanced error term control for counting sums by explicitly linking truncation parameters to growth rates using Proposition 3.14 and balancing identities like (109). This allows for a more precise asymptotic formula when the test function is not just bounded but has controlled Lipschitz norms, improving estimates in Theorem 1.3.

  2. Incorporation of the geometric constraints from Lemma 2.7 into a counting estimate framework, specifically using Proposition 4.1(ii) to bound counts of subspaces containing fixed lower-dimensional subspaces U, which helps in quantifying the contribution of the cusp region to the main term MR(B).

  3. Improved handling of non-uniformity in local estimates by using smooth periodized weights constructed via Lemma 3.10 and Proposition 3.6, allowing for a more robust derivation of bounds on sums like SR(B) and MR(B) that are uniform over the arithmetic sectors.

  4. Refinement of the asymptotic formula for counting subspaces containing linearly independent projective points by explicitly deriving the leading constant as a moment of the last successive minimum, as suggested in Theorem 1.2's corollary, providing a more detailed description of the error term structure.

  5. Development of a method to remove truncation dependence by applying Proposition 4.3 to show that the difference between the truncated sum and main term is bounded by an arithmetic tail estimate (126), which is then combined with the arithmetic counting bound (104) to yield a global estimate that does not depend on the truncation radius R for sufficiently large B.

Sources

Related papers