Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(2.18), proof of (2.16), p. 529 — linearly independent b_j of degree ≤ m all divisible by h₁: #J ≤ m + 1 − deg h₁

Proved
LLLFactor.Factors.card_le_2_18

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

linear-independencep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polynomial-factorization

Let m≥0m\ge0m≥0 and let b1,…,bm+1∈Z[X]b_1,\dots,b_{m+1}\in\mathbb Z[X]b1​,…,bm+1​∈Z[X] have degree at most mmm and linearly independent coefficient vectors in Rm+1\mathbb R^{m+1}Rm+1. Let J⊆{1,…,m+1}J\subseteq\{1,\dots,m+1\}J⊆{1,…,m+1} and let h1∈Z[X]h_1\in\mathbb Z[X]h1​∈Z[X] be a nonzero polynomial dividing bjb_jbj​ for every j∈Jj\in Jj∈J. Then

(2.18)#J≤m+1−deg⁡h1.\text{(2.18)}\qquad \#J\le m+1-\deg h_1.(2.18)#J≤m+1−degh1​.

Each bjb_jbj​ with j∈Jj\in Jj∈J lies in Zh1+Zh1X+⋯+Zh1Xm−deg⁡h1\mathbb Z h_1+\mathbb Zh_1X+\dots+\mathbb Zh_1X^{m-\deg h_1}Zh1​+Zh1​X+⋯+Zh1​Xm−degh1​, a space of rank m+1−deg⁡h1m+1-\deg h_1m+1−degh1​; this counting bound is half of the squeeze that determines ttt in Proposition (2.16).

Formalization Note On the page h1=gcd⁡({bj:j∈J})h_1=\gcd(\{b_j:j\in J\})h1​=gcd({bj​:j∈J}); the statement is given for any nonzero common divisor h1h_1h1​, which contains the page's case. The right-hand side is a natural-number difference; when deg⁡h1>m\deg h_1>mdegh1​>m it is 000 and the statement says J=∅J=\varnothingJ=∅, which is correct because no nonzero polynomial of degree ≤m\le m≤m is divisible by h1h_1h1​. Indices are 0-based.

Preamble
import Mathlib
import Definitions.Def_LLLFactor_Factors_Setting

open Polynomial
Formal statement
namespace LLLFactor.Factors

theorem card_le_2_18 (m : ℕ) (b : Fin (m + 1) → ℤ[X])
    (hli : LinearIndependent ℝ (coeffVec m ∘ b)) (hdeg : ∀ j, (b j).natDegree ≤ m)
    (J : Finset (Fin (m + 1))) (h₁ : ℤ[X]) (hh₁ : h₁ ≠ 0) (hdvd : ∀ j ∈ J, h₁ ∣ b j) :
    J.card ≤ m + 1 - h₁.natDegree := by sorry

end LLLFactor.Factors
Source
Lenstra, Lenstra, Lovász, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), p. 529, (2.18) in the proof of (2.16) Proposition
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