Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Q&A

Seeking a theorem about lattices

+1
−0

I am looking for a reference on the following theorem, or an equivalent statement:

Let $\Lambda$ be an embedding of a free $\mathbb{Z}$-module in $\mathbb{R}^d$. If the rank of $\Lambda$ is greater than $d$ then $\Lambda$ is not discrete.

I have proofs here and here, which both seem correct to me. However I'm ideally looking for a published source for the theorem.

I skimmed through the early chapters of An introduction to the geometry of numbers and Sphere packings, lattices, and groups, the former seems more relevant to me, but I wasn't able to find a statement of the theorem in either.

History
Why does this post require moderator attention?
You might want to add some details to your flag.
Why should this post be closed?

0 comment threads

1 answer

+3
−0

Neukirch - Algebraic Number Theory proposition 4.2 states that a subgroup of $\mathbb{R}^n$ is discrete if and only if it is a lattice. A lattice has a linearly independent basis by definition, so it has rank at most $n$.

History
Why does this post require moderator attention?
You might want to add some details to your flag.

0 comment threads

Sign up to answer this question »