Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(1.25), p. 521 — d_i = ∏_{j≤i} |b_j*|², so d_i > 0, d₀ = 1 and dₙ = d(L)²

Proved
LLLFactor.Reduction.gram_eq_prod_gs

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

gram-determinantgram-schmidtlatticelllp2o-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 di=det⁡((bj,bl))1≤j,l≤id_i=\det\big((b_j,b_l)\big)_{1\le j,l\le i}di​=det((bj​,bl​))1≤j,l≤i​ be the Gram determinant of the first iii vectors (1.24). Then for 0≤i≤n0\le i\le n0≤i≤n

di=∏j=1i∣bj∗∣2,d_i=\prod_{j=1}^{i}|b_j^*|^2 ,di​=j=1∏i​∣bj∗​∣2,

hence di>0d_i>0di​>0; moreover d0=1d_0=1d0​=1 and dn=d(L)2d_n=d(L)^2dn​=d(L)2, where d(L)=∣det⁡(b1,…,bn)∣d(L)=|\det(b_1,\dots,b_n)|d(L)=∣det(b1​,…,bn​)∣.

Identity (1.25) expresses the Gram determinants through the Gram–Schmidt lengths; it is how the potential D=∏i=1n−1diD=\prod_{i=1}^{n-1}d_iD=∏i=1n−1​di​ of the termination proof is controlled.

Formalization Note. The product is over Lean indices 0,…,i−10,\dots,i-10,…,i−1, i.e. the paper's j=1,…,ij=1,\dots,ij=1,…,i.

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

theorem gram_eq_prod_gs {n : ℕ} (b : Fin n → LLLFactor.RedBasis.Vec n) (hb : LinearIndependent ℝ b) :
    (∀ (i : ℕ) (hi : i ≤ n),
      gram b i = ∏ j : Fin i, ‖LLLFactor.RedBasis.gs b (Fin.castLE hi j)‖ ^ 2 ∧ 0 < gram b i) ∧
    gram b 0 = 1 ∧ gram b n = LLLFactor.RedBasis.latticeDet b ^ 2 := by sorry

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