Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(1.15), pp. 519–520 — after each step we are again in the situation (1.16)–(1.17), with 1 ≤ k ≤ n + 1

Proved
LLLFactor.Reduction.step_preserves_situation

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

algorithminvariantlattice-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 suppose that at subscript kkk the conditions (1.16) and (1.17) hold:

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

If one step of the algorithm (1.15) leads from (b,k)(b,k)(b,k) to (b′,k′)(b',k')(b′,k′), then (1.16) and (1.17) hold for b′b'b′ at subscript k′k'k′, and 1≤k′≤n+11\le k'\le n+11≤k′≤n+1.

This is the sentence ending both cases of (1.15): "Then we are in the situation described by (1.16) and (1.17), and we proceed with the algorithm from there." It is the loop invariant of the algorithm.

Formalization Note. The bound 1≤k′≤n+11\le k'\le n+11≤k′≤n+1 is the paper's "at each step of the algorithm we shall have a current subscript k∈{1,2,…,n+1}k\in\{1,2,\dots,n+1\}k∈{1,2,…,n+1}".

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

theorem step_preserves_situation {n : ℕ} (b b' : Fin n → LLLFactor.RedBasis.Vec n) (k k' : ℕ)
    (hb : LinearIndependent ℝ b) (hsit : Situation b k)
    (hstep : Step (b, k) (b', k')) :
    Situation b' k' ∧ 1 ≤ k' ∧ k' ≤ n + 1 := by sorry

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