Lattices #
Let A be an R-algebra and V an A-module. An R-submodule M of V is a lattice if it is
finitely generated and every R-linearly independent subset of M is A-linearly independent.
If A is a field, this is equivalent to the R-rank of M being equal to the A-rank of its
A-span (see Submodule.IsLattice.iff_fg_and_finrank_span_eq_finrank).
The typical use-case of this is when A = K is a field with [FaithfulSMul R K],
which includes e.g. (R, K) = (ℤ, ℚ) or (R, K) = (ℤ, ℝ).
We do not require a lattice to be full. See Submodule.IsFullLattice for full lattices.
Main definitions #
Submodule.IsLattice: anR-submoduleMofVthat is finitely generated and such that everyR-linearly independent subset ofMisA-linearly independent.
Main statements #
Submodule.IsLattice.of_fg: over the fraction fieldA = Kof a domainRthe second axiom is automatic, so there lattices are exactly the finitely generated submodules.Submodule.IsLattice.free: over a PID, every lattice isR-free.Submodule.IsLattice.inf_left,Submodule.IsLattice.inf_right: over a Noetherian ring, the intersection of a lattice with a submodule is a lattice.
Future work #
In the fraction field setting with V = ι → K for finite ι, scaling a lattice by a unit of K
again gives a lattice, which yields a homothety relation. For R a DVR and ι = Fin 2, the
quotient by it is the vertex set of the Bruhat-Tits tree of GL 2 K.
For R = ℤ and K a normed field, IsZLattice K L instead asks that L be discrete and span
K, making it the topological analogue of Submodule.IsFullLattice; it is used for instance for
complex tori. The two notions agree in common cases, e.g. when K = ℝ and V is
finite-dimensional, but API relating them is still missing.
References #
An R-submodule M of an A-module V is a lattice if it is finitely generated and every
R-linearly independent subset of M is A-linearly independent. If A is a field, this is equivalent to the R-rank of Mbeing equal to theA-rank of its A-span, see Submodule.IsLattice.iff_fg_and_finrank_span_eq_finrank`.
Note: for R = ℤ and A a normed field there is also IsZLattice, the analogue of
Submodule.IsFullLattice with discreteness in place of the two conditions here.
- fg : M.FG
- linearIndepOn (s : Set V) : s ⊆ ↑M → LinearIndepOn R id s → LinearIndepOn A id s
Instances
Any R-independent family of vectors in a lattice is A-linearly independent.
Any basis of an R-lattice in V is A-linearly independent.
Any R-lattice is finite. Not an instance, since A cannot be inferred.
A finitely generated submodule of a lattice is a lattice.
Over a Noetherian ring, any submodule of a lattice is a lattice.
Over a Noetherian ring, the intersection of two submodules, the first a lattice, is a lattice.
Over a Noetherian ring, the intersection of two submodules, the second a lattice, is a lattice.
The action of Aˣ on R-submodules of V preserves IsLattice.
The R-rank of a lattice equals the K-dimension of its K-span.
The R-rank of a lattice equals the K-dimension of its K-span.
This is the finrank version of rank_span_eq_rank.
An R-module M is a lattice in an ambient K-module V if and only if M
is finitely generated, and its R-rank equals the K-dimension of its K-span.
Any lattice over a PID is a free R-module. Not an instance, since K cannot be inferred.
A lattice over a PID has a basis that's K-linearly independent.
If K is the field of fractions of R, any finitely generated R-submodule of V
is a lattice.
If K is the field of fractions of R, then a submodule of V is a lattice if and
only if it is finitely generated.
If K is the field of fractions of R, the supremum of two lattices is a lattice.