Math 2.0

Number theory Definition

Successive minima

Builds on Lattice (group)Convex setCompact setLinear independence

Definition

Let n≥1n \ge 1 and let Λ⊂ℝn\Lambda \subset \R^n be a lattice. Let K⊂ℝnK \subset \R^n be a convex compact set with nonempty interior that is symmetric about the origin, that is, −x∈K-x \in K for all x∈Kx \in K. For λ>0\lambda > 0 write λK={λx:x∈K}\lambda K = \set{\lambda x : x \in K}. Let k∈{1,…,n}k \in \set{1, \dots, n}. The kk-th successive minimum λk(K,Λ)\lambda_k(K, \Lambda) of Λ\Lambda for KK is the infimum of all λ>0\lambda > 0 such that λK∩Λ\lambda K \cap \Lambda contains kk linearly independent vectors.

Remarks

The infimum is attained, and 0<λ1≤λ2≤⋯≤λn<∞0 < \lambda_1 \le \lambda_2 \le \dots \le \lambda_n < \infty. Example: for Λ=ℤ2\Lambda = \Z^2 and K=[−1,1]×[−2,2]K = [-1, 1] \times [-2, 2], one has λK=[−λ,λ]×[−2λ,2λ]\lambda K = [-\lambda, \lambda] \times [-2\lambda, 2\lambda]. The vector (0,1)(0, 1) lies in λK\lambda K exactly when λ≥1/2\lambda \ge 1/2, and no nonzero integer vector lies in λK\lambda K for λ<1/2\lambda < 1/2, so λ1=1/2\lambda_1 = 1/2. A vector independent of (0,1)(0, 1) has first coordinate of absolute value at least 11, so it needs λ≥1\lambda \ge 1, and (1,0)(1, 0) enters at λ=1\lambda = 1; so λ2=1\lambda_2 = 1. Non-example: the strip K=ℝ×[−1,1]K = \R \times [-1, 1] is convex and symmetric but not compact. Then (1,0)∈λK(1, 0) \in \lambda K for every λ>0\lambda > 0, so the infimum defining λ1\lambda_1 is 00 and the minima lose their meaning. When KK is the closed unit ball, λk\lambda_k is the smallest rr such that Λ\Lambda has kk linearly independent vectors of length at most rr.

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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Compact set concept
  2. Convex set concept
  3. Lattice (group) concept
  4. Linear independence concept
  5. Successive minima definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Minkowski%27s_second_theorem
About this page
TagEBHS26MHZT
URIm2://EBHS26MHZT
Kinddefinition
WritingW0 stub
MSC11H06, 52C07
DefinesSuccessive minima
UsesLattice (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.