Minkowski’s second theorem

Target entity: Minkowski’s second theorem
Context triple: [Minkowski’s theorem on convex sets, relatedTo, Minkowski’s second theorem]

• A. Minkowski’s theorem on convex sets
  Minkowski’s theorem on convex sets is a fundamental result in convex geometry that characterizes lattice points in convex bodies, underpinning much of the theory of convex polytopes and the geometry of numbers.
• B. Hermite–Minkowski theorem
  The Hermite–Minkowski theorem is a fundamental result in algebraic number theory that gives a finiteness bound on the number of number fields of a given degree and discriminant.
• C. Mazur’s theorem on convex sets
  Mazur’s theorem on convex sets is a fundamental result in functional analysis that characterizes the structure and approximation properties of convex sets in Banach spaces, particularly via convex combinations of sequences.
• D. Siegel’s lemma
  Siegel’s lemma is a result in number theory that guarantees the existence of small-height integer solutions to systems of linear equations with integer coefficients.
• E. Carathéodory’s theorem in convex geometry
  Carathéodory’s theorem in convex geometry is a fundamental result stating that any point in the convex hull of a set in ℝⁿ can be expressed as a convex combination of at most n+1 points from that set.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Minkowski’s second theorem
Target entity description: Minkowski’s second theorem is a fundamental result in the geometry of numbers that relates the successive minima of a convex, symmetric body in Euclidean space to its volume and the determinant of a lattice.

• A. Minkowski’s theorem on convex sets
  Minkowski’s theorem on convex sets is a fundamental result in convex geometry that characterizes lattice points in convex bodies, underpinning much of the theory of convex polytopes and the geometry of numbers.
• B. Hermite–Minkowski theorem
  The Hermite–Minkowski theorem is a fundamental result in algebraic number theory that gives a finiteness bound on the number of number fields of a given degree and discriminant.
• C. Mazur’s theorem on convex sets
  Mazur’s theorem on convex sets is a fundamental result in functional analysis that characterizes the structure and approximation properties of convex sets in Banach spaces, particularly via convex combinations of sequences.
• D. Siegel’s lemma
  Siegel’s lemma is a result in number theory that guarantees the existence of small-height integer solutions to systems of linear equations with integer coefficients.
• E. Carathéodory’s theorem in convex geometry
  Carathéodory’s theorem in convex geometry is a fundamental result stating that any point in the convex hull of a set in ℝⁿ can be expressed as a convex combination of at most n+1 points from that set.
• F. None of above. chosen