Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 8.2, p. 12 — some unit x′ has ‖Ax′‖ ≤ √|f^A_{[n]−i}(i)|

Proved
CurvatureSubmod.CSSP.exists_unit_small

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

column-subset-selectioncondition-numbercurvaturep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let AAA be a real m×nm \times nm×n matrix with columns c1,…,cnc_1, \dots, c_nc1​,…,cn​, and let fAf^AfA be the column-subset selection objective. For every i∈[n]i \in [n]i∈[n] there is a unit vector x′∈Rnx' \in \mathbb{R}^nx′∈Rn, ∥x′∥=1\|x'\| = 1∥x′∥=1, with

∥Ax′∥≤∣f[n]−iA(i)∣.\|Ax'\| \le \sqrt{\left|f^A_{[n]-i}(i)\right|} .∥Ax′∥≤​f[n]−iA​(i)​​.

A small marginal gain at [n]−i[n] - i[n]−i therefore forces inf⁡∥x∥=1∥Ax∥\inf_{\|x\|=1}\|Ax\|inf∥x∥=1​∥Ax∥ to be small. This is the other estimate behind Lemma 8.2.

Formalization Note No independence of the columns is assumed; the paper's argument does not use it.

Preamble
import Mathlib
import Definitions.Def_CurvatureSubmod_CSSP_Setting
Formal statement
namespace CurvatureSubmod.CSSP

/-- Proof of Lemma 8.2, p. 12: some unit vector `x' ∈ ℝⁿ` has `‖Ax'‖ ≤ √|f^A_{[n]−i}(i)|`. -/
theorem exists_unit_small {m n : ℕ} (c : Fin n → EuclideanSpace ℝ (Fin m)) (i : Fin n) :
    ∃ x : EuclideanSpace ℝ (Fin n), ‖x‖ = 1 ∧
      ‖applyA c x‖ ≤ Real.sqrt |marg (fA c) (Finset.univ.erase i) i| := by sorry

end CurvatureSubmod.CSSP
Source
Sviridenko, Vondrák, Ward, Optimal approximation for submodular and supermodular optimization with bounded curvature (SODA 2015 version, Oct. 9, 2014), p. 12, proof of Lemma 8.2, construction of x′
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

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