How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Successive minima of a convex body
Definition
Let be a full lattice (Full Euclidean lattice and covolume) and let be centrally symmetric (that is, ), convex in the sense of A convex subset of contains every line segment between two of its points, compact, and with nonempty interior. For a real write
For the -th successive minimum of with respect to is
the infimum ranging over the nonempty set of real numbers for which the linear span of the finite set has dimension at least . When no such exists the infimum is ; for the bodies considered here it is finite, as recorded in the remarks below. We write for when and are fixed in context, and we write by convention.
The scaling convention is that the body is enlarged and the lattice is held fixed: is the set of lattice points lying in the -dilate of . Equivalently, because , one may think of the shortest vectors of in the norm whose unit ball is .
Remarks
The sets involved are finite. Each is bounded because is compact, and a bounded subset of meets a full lattice in finitely many points. Indeed, write using a basis matrix . If is bounded, choose with for all . The inverse linear map is bounded by Every Euclidean linear map has a unique matrix and satisfies for some , say . Thus if for , then , so every integer coordinate of lies in the finite interval ; only finitely many such integer vectors occur. Consequently is a finite-dimensional real subspace and the dimension in the definition is a genuine nonnegative integer, never an undecided quantity.
Monotonicity. If then : for one has and by convexity, so . Hence and the dimension function is nondecreasing in ; the sets inside the infimum are therefore upward-closed, and .
Finiteness and positivity. Central symmetry and nonempty interior put the origin in the interior: if is an interior point then so is , and is an interior point of by convexity. So contains a Euclidean ball about the origin with , and compactness of bounds it by some , with . Write and let be the linear isomorphism . Its inverse is a Euclidean linear map, so the bounded- linear-map result Every Euclidean linear map has a unique matrix and satisfies for some gives a constant such that for every . For every nonzero integer vector , , and therefore . If , then , so and hence . Conversely : for each choose , so that has norm at most and therefore lies in ; for the set contains and spans . The infima defining the are thus positive and finite, and the next items prove that they are attained and control the lattice vectors at the attained levels.
Depends on
Used by
Dependency tree · two levels
12 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Ben Green, Additive Combinatorics, Lecture 3 §3.7 (standard reference, not scraped)
- Martin Henk, Successive Minima and Lattice Points (standard reference, not scraped)