Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1, p. 20 — vectors orthogonal to a_1, …, a_d and with positive inner product with a_{d+1}, …, a_{L_1}

Proved
BadLocalMin.Smooth.lemma_1

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

linear-algebraneural-networksp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let L1≤L2L_1 \le L_2L1​≤L2​ and let a1,…,aL1∈RL2\mathbf a_1, \dots, \mathbf a_{L_1} \in \mathbb R^{L_2}a1​,…,aL1​​∈RL2​ be linearly independent. Then for every 1≤d<L11 \le d < L_11≤d<L1​ there are linearly independent vectors u1,…,uL2−d∈RL2\mathbf u_1, \dots, \mathbf u_{L_2 - d} \in \mathbb R^{L_2}u1​,…,uL2​−d​∈RL2​ such that, for every 1≤l≤L2−d1 \le l \le L_2 - d1≤l≤L2​−d,

⟨ul,aj⟩=0(1≤j≤d),⟨ul,aj⟩>0(d<j≤L1).\langle \mathbf u_l, \mathbf a_j\rangle = 0 \quad (1 \le j \le d), \qquad \langle \mathbf u_l, \mathbf a_j\rangle > 0 \quad (d < j \le L_1).⟨ul​,aj​⟩=0(1≤j≤d),⟨ul​,aj​⟩>0(d<j≤L1​).

In the proof of Theorem 1 this lemma is applied to the vectors of Assumption 1(b), with the squared rows X(j,:)∘X(j,:)X(j,:)\circ X(j,:)X(j,:)∘X(j,:) last, to build the output data.

Formalization Note. Vectors are indexed from 0: aj\mathbf a_{j}aj​ is a ⟨j - 1, _⟩, so "j≤dj \le dj≤d" becomes j.val < d and "j>dj > dj>d" becomes d ≤ j.val. The inner product is dotProduct.

Preamble
import Mathlib
Formal statement
namespace BadLocalMin.Smooth

/-- Lemma 1 (p. 20). Vectors are indexed from 0: the paper's a₁, …, a_{L₁} are `a 0`, …,
`a (L1 - 1)`, so "1 ≤ j ≤ d" is `j.val < d` and "d < j ≤ L₁" is `d ≤ j.val`. -/
theorem lemma_1 (L1 L2 d : ℕ) (hL : L1 ≤ L2) (a : Fin L1 → Fin L2 → ℝ)
    (ha : LinearIndependent ℝ a) (hd1 : 1 ≤ d) (hdL : d < L1) :
    ∃ u : Fin (L2 - d) → Fin L2 → ℝ, LinearIndependent ℝ u ∧
      ∀ l j, (j.val < d → u l ⬝ᵥ a j = 0) ∧ (d ≤ j.val → 0 < u l ⬝ᵥ a j) := by sorry

end BadLocalMin.Smooth
Source
Ding, Li & Sun, arXiv:1911.01413v3, p. 20, Lemma 1 (eqs. (24a)–(24b)); proof Appendix F, pp. 46–47
Human review
  • Endorsed by Shuze Chen · Oct 20, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 20, 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