Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(1.15), p. 519 — every step of the algorithm keeps b₁, …, bₙ a basis for the same lattice L

Proved
LLLFactor.Reduction.step_preserves_basis

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

algorithmlatticelattice-basis-reductionlllp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let b1,…,bn∈Rnb_1,\dots,b_n\in\mathbb R^nb1​,…,bn​∈Rn be linearly independent and let kkk be a subscript. If one step of the basis reduction algorithm (1.15) (case 1 or case 2, including the achievement of (1.18) and the loop of case 2) leads from the state (b,k)(b,k)(b,k) to the state (b′,k′)(b',k')(b′,k′), then b1′,…,bn′b'_1,\dots,b'_nb1′​,…,bn′​ are linearly independent and

∑i=1nZbi′=∑i=1nZbi.\sum_{i=1}^n\mathbb Z b'_i=\sum_{i=1}^n\mathbb Z b_i .i=1∑n​Zbi′​=i=1∑n​Zbi​.

This is the paper's claim that "in the course of the algorithm the vectors b1,…,bnb_1,\dots,b_nb1​,…,bn​ will be changed several times, but always in such a way that they form a basis for LLL", and it is what makes the output of the algorithm a basis of the input lattice.

Formalization Note. A step is the relation Step of the definitions module; it allows either nearest integer at a tie.

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

theorem step_preserves_basis {n : ℕ} (b b' : Fin n → LLLFactor.RedBasis.Vec n) (k k' : ℕ)
    (hb : LinearIndependent ℝ b) (hstep : Step (b, k) (b', k')) :
    LinearIndependent ℝ b' ∧ LLLFactor.RedBasis.latticeOf b' = LLLFactor.RedBasis.latticeOf b := by sorry

end LLLFactor.Reduction
Source
Lenstra, Lenstra, Lovász, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), p. 519, (1.15)
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