Math 2.0

Number theory Proof

Proof of Minkowski's theorem from Blichfeldt's theorem

Builds on Lattice (group)Blichfeldt's theoremLebesgue measureConvex set

Proof

Write λ\lambda for Lebesgue measure on ℝn\R^n, so that the volume of SS is λ(S)\lambda(S). The hypothesis speaks of this volume, so SS is Lebesgue measurable.

  1. Put T=12S={12s:s∈S}T = \frac{1}{2} S = \set{\frac{1}{2} s : s \in S}.
  2. The map h(x)=12xh(x) = \frac{1}{2} x is a bijection of ℝn\R^n. It sends each box to a box whose volume is 2−n2^{-n} times as large, and h−1h^{-1} does the reverse.
  3. So hh matches the countable covers of a set AA by boxes with those of h(A)h(A). It multiplies the total volume by 2−n2^{-n}. Hence λ∗(h(A))=2−nλ∗(A)\lambda^*(h(A)) = 2^{-n} \lambda^*(A) for every A⊆ℝnA \subseteq \R^n, where λ∗\lambda^* is Lebesgue outer measure.
  4. The set SS satisfies λ∗(A)=λ∗(A∩S)+λ∗(A∖S)\lambda^*(A) = \lambda^*(A \cap S) + \lambda^*(A \setminus S) for all AA. Apply this to h−1(A)h^{-1}(A) and use step 3. We get the same condition for TT, so TT is measurable and λ(T)=2−nλ(S)\lambda(T) = 2^{-n} \lambda(S).
  5. By hypothesis λ(S)>2nd(L)\lambda(S) > 2^n d(L), so λ(T)>d(L)\lambda(T) > d(L). Here d(L)d(L) is the covolume of the lattice LL.
  6. By Blichfeldt's theorem, there are distinct points x,y∈Tx, y \in T with x−y∈Lx - y \in L.
  7. Write x=12sx = \frac{1}{2} s and y=12s′y = \frac{1}{2} s' with s,s′∈Ss, s' \in S.
  8. Since SS is symmetric about the origin, −s′∈S-s' \in S.
  9. Since SS is convex, the midpoint 12s+12(−s′)\frac{1}{2} s + \frac{1}{2}(-s') of ss and −s′-s' lies in SS.
  10. This midpoint is x−yx - y. So x−yx - y is a point of LL in SS, and x−y≠0x - y \ne 0 because x≠yx \ne y.

Idea

Shrink SS by the factor 22; its volume becomes larger than d(L)d(L). Blichfeldt's theorem then gives two points of the shrunken set that differ by a lattice vector. Symmetry and convexity show that this difference is the midpoint of two points of SS, so it lies in SS.

Reading path

To understand this page from the ground up, read these 13 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. Affine combination concept
  2. Borel sigma-algebra concept
  3. Determinant concept
  4. Euclidean space object
  5. Lattice (group) concept
  6. Linear independence concept
  7. Outer measure concept
  8. Subgroup concept
  9. Convex set definition
  10. Lebesgue measure object
  11. Lattice (group) definition
  12. Blichfeldt's theorem statement
  13. Proof of Minkowski's theorem from Blichfeldt's theorem proof

Where this leads

13 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Minkowski%27s_theorem, Proof
About this page
Tag1FJ7QFJE2E
URIm2://1FJ7QFJE2E
Kindproof
WritingW0 stub
MSC11H06
ProvesMinkowski's theorem
UsesLattice (group), Blichfeldt's theorem, Lebesgue measure, Convex set
Changed4 November 2026

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)

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.