Successive minima
Builds on Lattice (group)Convex setCompact setLinear independence
Definition
Let and let be a lattice. Let be a convex compact set with nonempty interior that is symmetric about the origin, that is, for all . For write . Let . The -th successive minimum of for is the infimum of all such that contains linearly independent vectors.
Remarks
The infimum is attained, and . Example: for and , one has . The vector lies in exactly when , and no nonzero integer vector lies in for , so . A vector independent of has first coordinate of absolute value at least , so it needs , and enters at ; so . Non-example: the strip is convex and symmetric but not compact. Then for every , so the infimum defining is and the minima lose their meaning. When is the closed unit ball, is the smallest such that has linearly independent vectors of length at most .
Reading path
To understand this page from the ground up, read these 5 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Compact set concept
- Convex set concept
- Lattice (group) concept
- Linear independence concept
- Successive minima definition
Further reading
About this page
| Tag | EBHS26MHZT |
|---|---|
| URI | m2://EBHS26MHZT |
| Kind | definition |
| Writing | W0 stub |
| MSC | 11H06, 52C07 |
| Defines | Successive minima |
| Uses | Lattice (group), Convex set, Compact set, Linear independence |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.