Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(1.23), p. 521 — in case 1, d_{k−1} drops by a factor < ¾ and the other d_i are unchanged, so D drops by a factor < ¾; case 2 changes no d_i

Proved
LLLFactor.Reduction.potD_case1_lt

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

algorithmlattice-basis-reductionlllp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1potential-function

Let b1,…,bn∈Rnb_1,\dots,b_n\in\mathbb R^nb1​,…,bn​∈Rn be linearly independent, let did_idi​ be the Gram determinants (1.24) and D=∏i=1n−1diD=\prod_{i=1}^{n-1}d_iD=∏i=1n−1​di​.

  1. If a step of case 1 of the algorithm (1.15) leads from (b,k)(b,k)(b,k) to (b′,k−1)(b',k-1)(b′,k−1), then
dk−1(b′)<34 dk−1(b),di(b′)=di(b)  (0≤i≤n, i≠k−1),D(b′)<34 D(b).d_{k-1}(b')<\tfrac34\,d_{k-1}(b),\qquad d_i(b')=d_i(b)\ \ (0\le i\le n,\ i\ne k-1),\qquad D(b')<\tfrac34\,D(b).dk−1​(b′)<43​dk−1​(b),di​(b′)=di​(b)  (0≤i≤n, i=k−1),D(b′)<43​D(b).
  1. If a step of case 2 leads from (b,k)(b,k)(b,k) to (b′,k+1)(b',k+1)(b′,k+1), then di(b′)=di(b)d_i(b')=d_i(b)di​(b′)=di​(b) for 0≤i≤n0\le i\le n0≤i≤n.

This is the potential argument of (1.23): "the number DDD only changes if some bi∗b_i^*bi∗​ is changed, which only occurs in case 1. In case 1, the number dk−1d_{k-1}dk−1​ is reduced by a factor <34<\tfrac34<43​ … whereas the other did_idi​ are unchanged … hence DDD is reduced by a factor <34<\tfrac34<43​."

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

theorem potD_case1_lt {n : ℕ} (b b' : Fin n → LLLFactor.RedBasis.Vec n) (k k' : ℕ)
    (hb : LinearIndependent ℝ b) :
    (Case1 (b, k) (b', k') →
      gram b' (k - 1) < (3 / 4 : ℝ) * gram b (k - 1) ∧
      (∀ i : ℕ, i ≤ n → i ≠ k - 1 → gram b' i = gram b i) ∧
      potD b' < (3 / 4 : ℝ) * potD b) ∧
    (Case2 (b, k) (b', k') → ∀ i : ℕ, i ≤ n → gram b' i = gram b i) := by sorry

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