Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(1.23), p. 522 — m(L) > 0 is attained and d_i ≥ (3/4)^{i(i−1)/2} m(L)^i for every basis of L

Proved
LLLFactor.Reduction.gram_lower_bound

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

gram-determinanthermite-constantlatticelllp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let n≥1n\ge1n≥1, let L⊂RnL\subset\mathbb R^nL⊂Rn be a lattice and c1,…,cnc_1,\dots,c_nc1​,…,cn​ a basis for LLL. Put m(L)=min⁡{∣x∣2:x∈L, x≠0}m(L)=\min\{|x|^2:x\in L,\ x\ne0\}m(L)=min{∣x∣2:x∈L, x=0}. Then m(L)m(L)m(L) is a positive real number, it is attained by a non-zero vector of LLL, and the Gram determinants di=det⁡((cj,cl))1≤j,l≤id_i=\det\big((c_j,c_l)\big)_{1\le j,l\le i}di​=det((cj​,cl​))1≤j,l≤i​ satisfy

di ≥ (34)i(i−1)/2m(L)i(1≤i≤n).d_i\ \ge\ \left(\tfrac34\right)^{i(i-1)/2} m(L)^i\qquad(1\le i\le n).di​ ≥ (43​)i(i−1)/2m(L)i(1≤i≤n).

The bound depends only on LLL, not on the basis; since every basis met by the algorithm is a basis for LLL, it gives the positive lower bound for DDD on which termination rests.

Formalization Note. m(L)m(L)m(L) is written as the infimum of {∣x∣2:x∈L, x≠0}\{|x|^2 : x\in L,\ x\ne 0\}{∣x∣2:x∈L, x=0}; the statement asserts that this infimum is attained. The exponent i(i−1)/2i(i-1)/2i(i−1)/2 is a natural number, so it is a natural-number power.

Preamble
import Mathlib
import Definitions.Def_LLLFactor_Reduction_Algorithm
Formal statement
namespace LLLFactor.Reduction

theorem gram_lower_bound {n : ℕ} (hn : 0 < n) (c : Fin n → LLLFactor.RedBasis.Vec n)
    (L : Submodule ℤ (LLLFactor.RedBasis.Vec n)) (hc : LLLFactor.RedBasis.IsBasisFor c L) :
    0 < minSqNorm L ∧
    (∃ x ∈ L, x ≠ 0 ∧ ‖x‖ ^ 2 = minSqNorm L) ∧
    ∀ i : ℕ, 1 ≤ i → i ≤ n →
      (3 / 4 : ℝ) ^ (i * (i - 1) / 2) * minSqNorm L ^ i ≤ gram c i := by sorry

end LLLFactor.Reduction
Source
Lenstra, Lenstra, Lovász, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), p. 522, (1.23)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me