🔢 mathematics

Topological and Diophantine properties of lattice subset projections

This paper establishes a connection between the topological density of lattice subsets in $\mathbb{Z}^m$ and the Diophantine properties of their orthogonal projections onto Grassmannian manifolds, utilizing Baire's category theorem and Khintchine-Groshev's theorem to characterize limit sets and construct examples with varying measure properties.

Original authors: Wayne M Lawton

Published 2026-06-02

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Wayne M Lawton

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you have a giant, infinite grid of dots in space (like a 3D version of graph paper, but in many dimensions). This is your lattice. Now, imagine shining a light through this grid from every possible angle and looking at the shadow it casts on a flat surface.

This paper, written by Wayne M. Lawton, is a mathematical investigation into what those shadows look like. Specifically, it asks: When you project a grid of dots onto a lower-dimensional surface, does the shadow look like a neat, spaced-out pattern, or does it look like a messy, continuous smear?

Here is the breakdown of the paper's ideas using simple analogies:

1. The Setup: The Grid and the Shadow

Think of the grid of dots as a city of streetlights arranged in a perfect, infinite grid.

The Projection: Imagine you are looking at this city from a specific angle. You are squinting your eyes to flatten the 3D city onto a 2D piece of glass (the "projection").
The Question: If you look from a "rational" angle (like looking straight down the street), the lights on the glass will form a neat, repeating pattern (a discrete set). If you look from a "weird" or "irrational" angle, the lights might blur together so much that they look like a solid line or a cloud (a dense set).

2. The "k-Dense" Concept: The Ultimate Grid

The paper introduces a special kind of grid called "k-dense."

The Analogy: Imagine a grid so perfectly arranged that no matter how you tilt your head or rotate your view, you can never find a "blind spot" where the lights disappear. If you look at the grid from any angle, you will always see some lights.
The Finding: The author proves that if your grid is "k-dense," the set of all angles where the shadow looks "messy" (has points piling up infinitely close to zero) is a very specific, well-behaved mathematical shape (called a $G_\delta$ set). It's like saying, "If the grid is perfect, the 'bad' viewing angles are also perfectly structured."

3. The Two Main Tools: "Baire's Category" and "Khintchine-Groshev"

The paper uses two famous mathematical "flashlights" to analyze these shadows.

Baire's Category Theorem (The "Size" Flashlight):
- This tool helps distinguish between "small" and "large" sets in a topological sense.
- The Result: The paper shows that for a "k-dense" grid, the set of angles where the shadow is "messy" is actually large (in a topological sense), while the set of angles where the shadow is "neat" is small (meager).
- Metaphor: If you pick a random angle to look at a perfect grid, you are almost guaranteed to see a messy, continuous smear rather than a neat pattern. The "neat" angles are the rare exceptions.
Khintchine-Groshev's Theorem (The "Probability" Flashlight):
- This tool deals with how well numbers can be approximated (Diophantine properties). It asks: "How close can we get to a perfect alignment?"
- The Result: The author connects the "messiness" of the shadow to how "sparse" or "sparse-like" the original grid is.
- The Twist: By adjusting how the grid is built (making the dots further apart in a specific way), the author can construct grids where the "messy" angles are either almost non-existent (measure 0) or almost everywhere (measure 1). It's like tuning a radio: you can build a grid that only makes static (messy) from almost every angle, or one that makes static from almost no angles.

4. The Big Questions: Crystals and Quasicrystals

The final section of the paper is speculative. It connects these shadow-projection ideas to real-world physics and math structures called Fourier Quasicrystals.

What are they? Think of a crystal (like a diamond) where atoms are arranged in a perfect, repeating pattern. A "quasicrystal" is a material that has order but no repeating pattern (like a Penrose tiling).
The Connection: The paper suggests that these strange, ordered-but-not-repeating structures might be generated by the same "shadow" mechanisms described earlier.
The Open Questions:
1. Question 1: Is every multidimensional Fourier quasicrystal just a "divisor" (a mathematical way of saying it comes from the roots of a specific type of polynomial equation)? The paper doesn't know yet.
2. Question 2: Do all these quasicrystals come from a "generalized lighthouse"? (Recall the "lighthouse" concept mentioned in the text: a setup where a grid and a specific viewing angle create a specific pattern). The author suspects the answer is "Yes," but it hasn't been proven.

Summary

In plain English, this paper is a deep dive into geometry and number theory. It asks: "If I have a perfect grid of points, what does it look like when I squint at it from different angles?"

It proves that for "perfect" grids, the "bad" angles (where the pattern breaks down) are actually very common.
It shows that by carefully designing the grid, you can control whether the "bad" angles are rare or common.
It ends by wondering if these mathematical rules explain the structure of mysterious materials called quasicrystals, suggesting they might all be built from the same geometric "lighthouse" principles.

The paper does not claim to solve any physical problems or medical issues; it is purely a theoretical exploration of how shapes and numbers interact in high-dimensional spaces.

Technical Summary: Topological and Diophantine Properties of Lattice Subset Projections

Problem Statement
This paper investigates the geometric and arithmetic properties of orthogonal projections of lattice subsets $L \subset \mathbb{Z}^m$ onto subspaces $W$ within the Grassmannian manifold $\text{Gr}(n, m)$ , where $1 \le n < m$ and $k = m-n$ . The central problem is to characterize the set of subspaces $W$ for which the projection $P_W(L)$ exhibits specific topological behaviors (discreteness vs. accumulation at the origin) and to relate these behaviors to the "density" or "lacunarity" of the lattice subset $L$ .

Specifically, the paper defines a lattice subset $L$ as $k$ -dense if it intersects the cone $C(O) = \bigcup_{V \in O} V \setminus \{0\}$ for every nonempty open set $O \subset \text{Gr}(k, m)$ . The study focuses on two sets of subspaces in $\text{Gr}(n, m)$ :

$L_{n, \text{disc}} = \{W : P_W(L) \text{ is discrete}\}$ .
$L_{n, \text{lim}} = \{W : 0 \text{ is a limit point of } P_W(L)\}$ .

The goal is to determine the topological size (via Baire category) and measure-theoretic size (via the rotation-invariant measure $\sigma_n$ ) of these sets based on the properties of $L$ .

Methodology
The paper employs a combination of algebraic, topological, and Diophantine approximation techniques:

Algebraic Preliminaries: The author utilizes the theory of free abelian groups and the Smith normal form to analyze subgroups of $\mathbb{Z}^m$ . Key lemmas establish the relationship between the rank of a subspace intersection with the lattice ( $r(W) = \text{rank}(W \cap \mathbb{Z}^m)$ ) and the rationality of the projection matrix $P_W$ . Specifically, $P_W(L)$ is discrete if and only if $P_W \in \mathbb{Q}^{m \times m}$ .
Topological Analysis (Baire Category):
- The paper utilizes the geometry of the Grassmannian $\text{Gr}(n, m)$ as a compact homogeneous space $SO(m, \mathbb{R}) / [SO(n, \mathbb{R}) \times SO(k, \mathbb{R})]$ .
- Baire's Category Theorem is applied to prove that if $L$ is $k$ -dense, the set $L_{n, \text{lim}}$ is a $G_\delta$ set (a countable intersection of dense open sets). Consequently, its complement $L_{n, \text{disc}}$ is meager (a countable union of nowhere dense sets).
- Conversely, if $L$ is not $k$ -dense, $L_{n, \text{disc}}$ contains a nonempty open set.
Diophantine Analysis (Khintchine-Groshev Theorem):
- The paper uses Plücker's embedding to parametrize $\text{Gr}(n, m)$ as a real analytic manifold, allowing the use of Lebesgue measure on local charts.
- Khintchine-Groshev's Theorem on Diophantine approximation is applied to characterize the measure of $L_{n, \text{lim}}$ . By defining a function $\psi(p)$ based on the "lacunary" properties of $L$ (specifically the growth rate of coefficients in the factorization of lattice points), the paper determines whether the measure of $L_{n, \text{lim}}$ is zero or one.
- The condition for $L_{n, \text{lim}}$ to be a null set (measure 0) or its complement to be a null set depends on the convergence or divergence of the series $\sum p^{k-1} \psi(p)^n$ .

Key Contributions and Results

Topological Characterization (Theorem 1): The paper proves that a lattice subset $L \subset \mathbb{Z}^m$ is $k$ -dense if and only if the set $L_{n, \text{lim}}$ is a $G_\delta$ set. This establishes a precise topological dichotomy: for $k$ -dense sets, the "bad" projections (where 0 is a limit point) are topologically large (dense $G_\delta$ ), while the "good" projections (discrete) are topologically small (meager).
Diophantine Characterization (Theorem 2): The paper constructs specific $k$ $k$ -dense lattice subsets $L$ $L$ such that the measure $\sigma_n(L_{n, \text{lim}})$ $σ_{n} (L_{n, lim})$ is either 0 or 1.
- If the series involving the lacunarity function $\psi$ converges, $\sigma_n(L_{n, \text{lim}}) = 0$ .
- If the series diverges, $\sigma_n(\text{Gr}(n, m) \setminus L_{n, \text{lim}}) = 0$ (implying $\sigma_n(L_{n, \text{lim}}) = 1$ ).
- Corollary 3 provides explicit examples using scaled integer vectors $k_j q_j$ to demonstrate these measure-theoretic extremes.
Geometric Lemmas: The paper establishes that the map $W \mapsto W^\perp$ is a measure-preserving isometry between $\text{Gr}(n, m)$ and $\text{Gr}(k, m)$ , and provides metric properties of the Grassmannian using principal angles (Jordan angles).

Significance and Claims
The paper positions its results as having intrinsic mathematical interest, drawing a parallel to Oxtoby's work on Measure and Category. The primary significance lies in the rigorous characterization of the "size" of projection sets for lattice subsets, bridging the gap between the algebraic structure of the lattice and the analytic properties of the Grassmannian.

The author explicitly states that the content of Sections 1–3 is independent of Section 4. The results in the first three sections are presented as foundational tools for understanding the spectra of physical quasicrystals and aperiodic tilings, referencing Yves Meyer's work on crystalline measures.

Research Questions and Speculation
The paper concludes with a speculative section (Section 4) connecting these topological and Diophantine results to the theory of Fourier Quasicrystals (FQ) and Crystalline Measures (CM):

Question 1: It asks whether every Fourier quasicrystal on $\mathbb{R}^n$ (for $n > 1$ ) is a divisor of a trigonometric polynomial map.
Question 2: It posits whether all Fourier quasicrystals arise from "generalized lighthouses" (a concept related to the $k$ -density and projection properties analyzed in the paper).

The author suggests that the analysis of $k$ -dense sets and the measure of $L_{n, \text{lim}}$ provides a framework to answer Question 2 affirmatively, though this remains a conjecture rather than a proven result within the text. The paper does not claim to solve these questions but rather frames them as the natural next step for the theory developed in the preceding sections.