Schmidt’s Random Counting Theorem

• Schmidt's random counting theorem is a result in the geometry of numbers that establishes almost-sure asymptotics for primitive lattice points in expanding planar sets using Haar measure.
• The theorem employs first and second moment formulas for the primitive Siegel transform, extending classical lattice counting methods with congruence restrictions and explicit density factors.
• Its innovative proof strategy combines ergodic theory, Borel–Cantelli arguments, and orbit classification to yield metric Diophantine applications and refined rational approximation results.

Schmidt’s random counting theorem is a lattice-point counting result in the geometry of numbers and homogeneous dynamics. In the formulation used as a template in later work, one studies the primitive Siegel transform

$$\widehat f(gSL_2(\mathbb Z))=\sum_{v\in P(\mathbb Z^2)} f(gv), \qquad P(\mathbb Z^2)=\{v\in\mathbb Z^2:\gcd(v)=1\},$$

and uses first and second moment formulas to show that, for almost every unimodular lattice $g\mathbb Z^2$, the number of primitive lattice points in a family of sets $A_T$ with $\operatorname{vol}(A_T)\to\infty$ satisfies an asymptotic law (Han et al., 8 Jul 2025). In this sense, the theorem is “random” because the lattice is sampled from the moduli space with respect to Haar measure, while the counted quantity is a lattice-point count in expanding regions. A recent two-dimensional analog with congruence conditions makes the structure explicit and isolates the moment identities, orbit decompositions, and almost-sure error term that drive Schmidt’s argument (Han et al., 8 Jul 2025).

1. Classical setting and probabilistic interpretation

The classical theorem is organized around primitive lattice points rather than all lattice points. The basic counting functional is the primitive Siegel transform

$$\widehat f(gSL_2(\mathbb Z))=\sum_{v\in P(\mathbb Z^2)} f(gv),$$

where $f$ is a test function on $\mathbb R^2$ and $gSL_2(\mathbb Z)$ parametrizes a unimodular lattice in $SL_2(\mathbb R)/SL_2(\mathbb Z)$ (Han et al., 8 Jul 2025). The theorem then concerns the number of primitive lattice points in expanding sets $A_T$, with the lattice varying over the homogeneous space.

The probabilistic content is explicit in the modern description: the random variable is the lattice point count in expanding sets, viewed across the moduli space of lattices (Han et al., 8 Jul 2025). The asymptotic law is an almost-everywhere statement. Thus the theorem does not assert a deterministic asymptotic for every lattice; it asserts that the normalized count behaves as predicted for almost every unimodular lattice.

A key feature is that the count is compared to volume. In the congruence-restricted analog, this comparison becomes completely explicit: the count is asymptotic to volume multiplied by an arithmetic density, and the proof is driven by a first-moment identity, a second-moment identity, and a Borel–Cantelli argument (Han et al., 8 Jul 2025). This suggests that the classical theorem should be understood as a prototype of almost-sure lattice counting derived from variance control on a homogeneous space.

2. Congruence-restricted formulation in dimension $g\mathbb Z^2$0

A precise analog fixes a modulus $g\mathbb Z^2$1 and a primitive residue class $g\mathbb Z^2$2 with $g\mathbb Z^2$3 and $g\mathbb Z^2$4. One then defines

$g\mathbb Z^2$5

which is invariant under the principal congruence subgroup

$g\mathbb Z^2$6

The corresponding Siegel transform is

$g\mathbb Z^2$7

(Han et al., 8 Jul 2025).

This is the basic counting function for primitive lattice points in one fixed congruence class. The ambient space is no longer $g\mathbb Z^2$8 but $g\mathbb Z^2$9, and the density is modified accordingly. Compared to the classical theorem, the new features are that primitive vectors are still counted, but now only those lying in a fixed residue class $A_T$0, and the second moment must reflect the arithmetic restriction imposed by the congruence condition (Han et al., 8 Jul 2025).

The density factor is expressed through

$A_T$1

For $A_T$2, the first-moment density becomes $A_T$3, described as the primitive density factor $A_T$4 times the congruence frequency $A_T$5 up to the Euler factor correction from primes dividing $A_T$6 (Han et al., 8 Jul 2025).

3. First and second moment formulas

The first moment formula is the direct analog of Siegel’s mean value theorem. For bounded compactly supported $A_T$7,

$A_T$8

(Han et al., 8 Jul 2025). Equivalently, the average number of primitive points in the class $A_T$9 is the volume times this density.

The second moment introduces a two-variable transform. For bounded compactly supported $\operatorname{vol}(A_T)\to\infty$0,

$\operatorname{vol}(A_T)\to\infty$1

The corresponding second moment is

$\operatorname{vol}(A_T)\to\infty$2

where

$\operatorname{vol}(A_T)\to\infty$3

(Han et al., 8 Jul 2025).

This formula separates the diagonal or degenerate contributions $\operatorname{vol}(A_T)\to\infty$4 and $\operatorname{vol}(A_T)\to\infty$5 from the non-degenerate pairs with determinant $\operatorname{vol}(A_T)\to\infty$6. The arithmetic restriction is sharp: for each fixed congruence class $\operatorname{vol}(A_T)\to\infty$7, the set

$\operatorname{vol}(A_T)\to\infty$8

is empty unless $\operatorname{vol}(A_T)\to\infty$9, and when nonempty it decomposes into exactly

$$\widehat f(gSL_2(\mathbb Z))=\sum_{v\in P(\mathbb Z^2)} f(gv),$$0

$$\widehat f(gSL_2(\mathbb Z))=\sum_{v\in P(\mathbb Z^2)} f(gv),$$1-orbits (Han et al., 8 Jul 2025). This orbit count is the structural input behind the coefficient in the second moment formula.

4. Cone normalization and the almost-sure counting law

To adapt Schmidt’s random counting theorem, one works over the cone

$$\widehat f(gSL_2(\mathbb Z))=\sum_{v\in P(\mathbb Z^2)} f(gv),$$2

where $$\widehat f(gSL_2(\mathbb Z))=\sum_{v\in P(\mathbb Z^2)} f(gv),$$3 is a fundamental domain for $$\widehat f(gSL_2(\mathbb Z))=\sum_{v\in P(\mathbb Z^2)} f(gv),$$4. The normalized counts are

$$\widehat f(gSL_2(\mathbb Z))=\sum_{v\in P(\mathbb Z^2)} f(gv),$$5

(Han et al., 8 Jul 2025).

Over this cone, the first moment remains

$$\widehat f(gSL_2(\mathbb Z))=\sum_{v\in P(\mathbb Z^2)} f(gv),$$6

The second moment becomes

$$\widehat f(gSL_2(\mathbb Z))=\sum_{v\in P(\mathbb Z^2)} f(gv),$$7

where

$$\widehat f(gSL_2(\mathbb Z))=\sum_{v\in P(\mathbb Z^2)} f(gv),$$8

Moreover,

$$\widehat f(gSL_2(\mathbb Z))=\sum_{v\in P(\mathbb Z^2)} f(gv),$$9

(Han et al., 8 Jul 2025). This asymptotic shows that the second moment has the same leading density as the first moment squared, with an explicit error kernel.

The main almost-sure theorem in the congruence-restricted setting is stated for an increasing family of Borel sets $f$0 with

$f$1

and a non-decreasing function $f$2 satisfying

$f$3

Then for almost every unimodular lattice $f$4,

$f$5

(Han et al., 8 Jul 2025). This is described as the precise congruence-restricted version of Schmidt’s theorem.

5. Proof strategy and Diophantine consequences

The proof follows Schmidt’s strategy closely. The ingredients identified in the modern analog are moment estimates on the homogeneous space $f$6, a Borel–Cantelli argument on a cone over a fundamental domain, and the ergodicity and invariance of Haar measure (Han et al., 8 Jul 2025). At a high level, the method is to establish first and second moment formulas for the congruence-restricted Siegel transform, refine them over the cone $f$7, use the asymptotic control of $f$8 to estimate the variance of the centered counting function, apply a Borel–Cantelli argument over dyadic scales and a decomposition into interval chains, and then conclude almost sure asymptotics for counts in $f$9 (Han et al., 8 Jul 2025).

The technical heart is the second moment computation, especially the classification of $\mathbb R^2$0-orbits in pairs of primitive vectors with fixed determinant and fixed congruence class (Han et al., 8 Jul 2025). This orbit classification is not an auxiliary arithmetic decoration; it is the mechanism that converts pair counting into a computable second-moment coefficient.

The same moment method yields a metric Diophantine approximation theorem with congruence restrictions. The stated corollary is a congruence-restricted quantitative Khintchine theorem: $\mathbb R^2$1 for almost all $\mathbb R^2$2 (Han et al., 8 Jul 2025). This places Schmidt-type random counting within the broader metric theory of rational approximation.

6. Terminological scope and nearby Schmidt results

The name “Schmidt” appears in several distinct theories, and these should not be conflated with the random counting theorem.

Result	Content	arXiv id
Asmus Schmidt’s conjecture	Integrality of coefficients $\mathbb R^2$3 defined by a binomial basis expansion	(Thanatipanonda, 2012)
Schmidt-type theorem for partitions	Periodic counted and uncounted part-positions translated into colored partitions	(Andrews et al., 2022)
Schmidt’s conjecture via Schmidt’s game	$\mathbb R^2$4 is $\mathbb R^2$5-winning for Schmidt’s game	(An, 2012)
Schmidt’s subspace theorem, effective function-field form	Hypersurfaces in $\mathbb R^2$6-subgeneral position on smooth projective varieties	(Le, 2015)

The integrality theorem of Asmus Schmidt concerns the sequence $\mathbb R^2$7 defined implicitly by

$\mathbb R^2$8

and proves that all $\mathbb R^2$9 are integers for every $gSL_2(\mathbb Z)$0 and every $gSL_2(\mathbb Z)$1 (Thanatipanonda, 2012). That problem is algebraic-recursive and unrelated to random lattice counting.

The partition-theoretic Schmidt-type theorem generalizes the “odd-place counting” phenomenon to periodic subsets of counted and uncounted positions modulo $gSL_2(\mathbb Z)$2, using a colored refinement of Stockhofe’s bijection (Andrews et al., 2022). The Schmidt-game result concerns weighted badly approximable vectors and proves that $gSL_2(\mathbb Z)$3 is $gSL_2(\mathbb Z)$4-winning (An, 2012). The effective subspace theorem is a higher-degree function-field generalization in arithmetic geometry, involving local Weil functions, heights, and $gSL_2(\mathbb Z)$5-subgeneral position (Le, 2015). These results share nomenclature and, in different ways, a counting or largeness perspective, but they belong to distinct mathematical frameworks.

In the random-counting sense, Schmidt’s theorem is best understood as an almost-sure asymptotic for primitive lattice points in expanding planar sets, established through first and second moments of Siegel transforms and sharpened in modern work by congruence-restricted formulas that make the density, orbit structure, and error term explicit (Han et al., 8 Jul 2025).