Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Literature-sourcedPipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-02
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 Λ⊆Rn be a full lattice (Full Euclidean lattice and covolume) and let C⊆Rn be centrally symmetric (that is, −C=C), convex in the sense of A convex subset of Rm contains every line segment between two of its points, compact, and with nonempty interior. For a real t>0 write

tC:={tx:x∈C}.

For 1≤i≤n the i-th successive minimum of C with respect to Λ is

λi(C,Λ):=inf⁡{ t>0:dim⁡Rspan⁡R(tC∩Λ)≥i },

the infimum ranging over the nonempty set of real numbers t>0 for which the linear span of the finite set tC∩Λ has dimension at least i. When no such t exists the infimum is +∞; for the bodies considered here it is finite, as recorded in the remarks below. We write λi for λi(C,Λ) when C and Λ are fixed in context, and we write λ0:=0 by convention.

The scaling convention is that the body is enlarged and the lattice is held fixed: tC∩Λ is the set of lattice points lying in the t-dilate of C. Equivalently, because C=−C, one may think of the shortest vectors of Λ in the norm whose unit ball is C.

Remarks

The sets involved are finite. Each tC is bounded because C is compact, and a bounded subset of Rn meets a full lattice in finitely many points. Indeed, write Λ=BZn using a basis matrix B. If S⊆Rn is bounded, choose M>0 with ∣x∣≤M for all x∈S. The inverse linear map is bounded by Every Euclidean linear map has a unique matrix and satisfies ∥Lh∥2≤K∥h∥2 for some K≥0, say ∣B−1x∣≤K∣x∣. Thus if Bm∈S for m∈Zn, then ∣m∣≤KM, so every integer coordinate of m lies in the finite interval [−KM,KM]; only finitely many such integer vectors occur. Consequently span⁡(tC∩Λ) is a finite-dimensional real subspace and the dimension in the definition is a genuine nonnegative integer, never an undecided quantity.

Monotonicity. If 0<s<t then sC⊆tC: for x∈C one has 0∈C and (s/t)x+(1−s/t)⋅0=(s/t)x∈C by convexity, so sx∈tC. Hence sC∩Λ⊆tC∩Λ and the dimension function is nondecreasing in t; the sets inside the infimum are therefore upward-closed, and 0<λ1≤λ2≤⋯≤λn.

Finiteness and positivity. Central symmetry and nonempty interior put the origin in the interior: if v is an interior point then so is −v, and 0=(v+(−v))/2 is an interior point of C by convexity. So C contains a Euclidean ball ρBn about the origin with ρ>0, and compactness of C bounds it by some R=sup⁡x∈C∣x∣<∞, with R>0. Write Λ=Zb1⊕⋯⊕Zbn and let B:Rn→Rn be the linear isomorphism B(m)=∑imibi. Its inverse is a Euclidean linear map, so the bounded- linear-map result Every Euclidean linear map has a unique matrix and satisfies ∥Lh∥2≤K∥h∥2 for some K≥0 gives a constant K≥1 such that ∣B−1v∣≤K∣v∣ for every v∈Rn. For every nonzero integer vector m∈Zn, ∣m∣≥1, and therefore ∣Bm∣≥1/K. If Bm∈tC, then ∣Bm∣≤tR, so t≥1/(KR) and hence λ1≥1/(KR)>0. Conversely λn<∞: for each i choose ti≥∣bi∣/ρ, so that bi/ti has norm at most ρ and therefore lies in C; for t=max⁡iti the set tC∩Λ contains b1,…,bn and spans Rn. The infima defining the λi 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