Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.10 — a coordinate box of half-widths Nidet⁡Λ/(ddΦ)N_i\det\Lambda/(d^d\Phi)Ni​detΛ/(ddΦ) lies in the spanner parallelepiped

Proved
RelatedSchedFPTAS796.Main.lemma_6_10

by mikedeng1 · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

latticeslinear-algebrap2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let N1,…,Nd>0N_1,\dots,N_d>0N1​,…,Nd​>0 and let b1,…,bd∈∏i=1d[−Ni,Ni]b_1,\dots,b_d\in\prod_{i=1}^d[-N_i,N_i]b1​,…,bd​∈∏i=1d​[−Ni​,Ni​] be linearly independent. Write Φ=∏i=1dNi\Phi=\prod_{i=1}^dN_iΦ=∏i=1d​Ni​ and let Λ=spanZ{b1,…,bd}\Lambda=\mathrm{span}_{\mathbb Z}\{b_1,\dots,b_d\}Λ=spanZ​{b1​,…,bd​}, so that det⁡(Λ)=∣det⁡(b1,…,bd)∣\det(\Lambda)=|\det(b_1,\dots,b_d)|det(Λ)=∣det(b1​,…,bd​)∣. Then

{∑i=1dxiei: ∣xi∣≤Nidet⁡(Λ)dd Φ for every i} ⊆ {∑j=1dtjbj: ∣tj∣≤1 for every j}.\Big\{\sum_{i=1}^dx_ie_i:\ |x_i|\le\frac{N_i\det(\Lambda)}{d^d\,\Phi}\ \text{for every } i\Big\}\ \subseteq\ \Big\{\sum_{j=1}^dt_jb_j:\ |t_j|\le1\ \text{for every } j\Big\}.{i=1∑d​xi​ei​: ∣xi​∣≤ddΦNi​det(Λ)​ for every i} ⊆ {j=1∑d​tj​bj​: ∣tj​∣≤1 for every j}.

In the proof of Theorem 1.3 this shows that a progression of side Nidet⁡(Z)N_i\det(Z)Ni​det(Z) in direction eie_iei​ has spanner coordinates in [−r,r][-r,r][−r,r].

Differences from the source:

  • encoding: det⁡(Λ)\det(\Lambda)det(Λ) for the lattice generated by b1,…,bdb_1,\dots,b_db1​,…,bd​ → ∣det⁡∣|\det|∣det∣ of the matrix with rows b1,…,bdb_1,\dots,b_db1​,…,bd​; reason: the determinant of a lattice with basis bbb is ∣det⁡b∣|\det b|∣detb∣
Preamble
import Mathlib

set_option autoImplicit false
Formal statement
namespace RelatedSchedFPTAS796.Main

/-- **Lemma 6.10**, p.22 (proof Appendix A, pp.25–26). Let `N_1, …, N_d > 0` and let
`b_1, …, b_d ∈ ∏_i [−N_i, N_i]` be linearly independent, `Φ = ∏_i N_i`, and
`Λ = span_ℤ{b_1, …, b_d}`, so `det(Λ) = |det(b_1, …, b_d)|`. Then
`{∑_i x_i e_i : |x_i| ≤ N_i det(Λ)/(d^d Φ) ∀ i} ⊆ {∑_j t_j b_j : |t_j| ≤ 1 ∀ j}`. -/
theorem lemma_6_10 {d : ℕ} (N : Fin d → ℝ) (hN : ∀ i, 0 < N i) (b : Fin d → Fin d → ℝ)
    (hbox : ∀ j i, |b j i| ≤ N i) (hli : LinearIndependent ℝ b) (x : Fin d → ℝ)
    (hx : ∀ i, |x i| ≤ N i * |(Matrix.of b).det| / ((d : ℝ) ^ d * ∏ i, N i)) :
    ∃ t : Fin d → ℝ, (∀ j, |t j| ≤ 1) ∧ x = ∑ j, t j • b j := by sorry

end RelatedSchedFPTAS796.Main
Source
Lin Chen, Tingwei Hu, Jiayi Lian, Yuchen Mao, Guochuan Zhang, Faster Approximation Schemes for Scheduling on Related Machines, STOC 2027 submission #796 (October 2026), source.pdf SHA-256 5d7d0135eed9cbe942c80598e2bb07d8c56ab67aec0d6e8486a067237654f7f3, p.22, Lemma 6.10 (proof Appendix A, pp.25–26)
Human review
  • Endorsed by Shuze Chen · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 11, 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