Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(1.15), p. 519 — (1.16)–(1.17) hold trivially at k = 2, and at k = n + 1 they say the basis is reduced

Proved
LLLFactor.Reduction.situation_initial_final

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

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

Let b1,…,bn∈Rnb_1,\dots,b_n\in\mathbb R^nb1​,…,bn​∈Rn. Write Sit(b,k)\mathrm{Sit}(b,k)Sit(b,k) for the situation of (1.15) at subscript kkk:

(1.16) ∣μij∣≤12  (1≤j<i<k),(1.17) ∣bi∗+μi,i−1bi−1∗∣2≥34∣bi−1∗∣2  (1<i<k).\text{(1.16)}\ |\mu_{ij}|\le\tfrac12\ \ (1\le j<i<k),\qquad \text{(1.17)}\ |b_i^*+\mu_{i,i-1}b_{i-1}^*|^2\ge\tfrac34|b_{i-1}^*|^2\ \ (1<i<k).(1.16) ∣μij​∣≤21​  (1≤j<i<k),(1.17) ∣bi∗​+μi,i−1​bi−1∗​∣2≥43​∣bi−1∗​∣2  (1<i<k).

Then:

  1. Sit(b,2)\mathrm{Sit}(b,2)Sit(b,2) holds for every bbb ("these conditions are trivially satisfied if k=2k=2k=2");
  2. if Sit(b,n+1)\mathrm{Sit}(b,n+1)Sit(b,n+1) holds, then bbb satisfies (1.4) and (1.5), i.e. the basis is reduced ("if k=n+1k=n+1k=n+1 then the basis is reduced").

Together with the invariance of the situation under a step, this shows that the algorithm, when it stops, has produced a reduced basis.

Formalization Note. The indices are 0-based in Lean; (1.16) is stated for Lean indices j<ij<ij<i with i+1<ki+1<ki+1<k, and (1.17) for the paper's iii with 2≤i<k2\le i<k2≤i<k, i≤ni\le ni≤n.

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

theorem situation_initial_final {n : ℕ} (b : Fin n → LLLFactor.RedBasis.Vec n) :
    Situation b 2 ∧ (Situation b (n + 1) → LLLFactor.RedBasis.IsReduced b) := by sorry

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