Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.2 — a finite affine cover of a compact convex set has a positive nonnegative combination

Proved
OnlineCarpoolingLei.Oblivious.positive_affine_combination

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

convex-analysisdiscrepancyp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let B⊂RNB\subset\mathbb R^NB⊂RN be a nonempty compact convex set and let ϕ1,…,ϕm:RN→R\phi_1,\dots,\phi_m:\mathbb R^N\to\mathbb Rϕ1​,…,ϕm​:RN→R be affine functions. Suppose that

B=⋃i=1m{p∈B:ϕi(p)>0}.B=\bigcup_{i=1}^m\{p\in B:\phi_i(p)>0\}.B=i=1⋃m​{p∈B:ϕi​(p)>0}.

Then there exist λ1,…,λm≥0\lambda_1,\dots,\lambda_m\ge0λ1​,…,λm​≥0 such that

∑i=1mλiϕi(p)>0for every p∈B.\sum_{i=1}^m\lambda_i\phi_i(p)>0\qquad\text{for every }p\in B.i=1∑m​λi​ϕi​(p)>0for every p∈B.

The weights are only required to be nonnegative; they need not sum to one. This finite separation lemma lets the proof of Theorem 3.3 combine finitely many test functions into one. If m=0m=0m=0 the hypothesis forces B=∅B=\emptysetB=∅, which is excluded.

Differences from the source:

  • encoding: RN\mathbb R^NRN → Fin N → ℝ; reason: same vector space, topology and convex structure
Preamble
import Mathlib
Formal statement
namespace OnlineCarpoolingLei.Oblivious

/-- Lemma 6.2 (p.12). Let `B ⊂ ℝ^N` be nonempty, compact and convex, and `ϕ₁, …, ϕ_m` affine
functions on `ℝ^N` with `B = ⋃ᵢ {p ∈ B : ϕᵢ(p) > 0}`. Then there are `λ₁, …, λ_m ≥ 0` with
`∑ᵢ λᵢ ϕᵢ(p) > 0` for every `p ∈ B`. -/
theorem positive_affine_combination {N m : ℕ} (B : Set (Fin N → ℝ)) (hB_ne : B.Nonempty)
    (hB_compact : IsCompact B) (hB_convex : Convex ℝ B)
    (ϕ : Fin m → (Fin N → ℝ) →ᵃ[ℝ] ℝ)
    (hcover : B = ⋃ i, {p | p ∈ B ∧ 0 < ϕ i p}) :
    ∃ lam : Fin m → ℝ, (∀ i, 0 ≤ lam i) ∧ ∀ p ∈ B, 0 < ∑ i, lam i * ϕ i p := by sorry

end OnlineCarpoolingLei.Oblivious
Source
Yuhao Lei, STOC 2027 submission #416 (October 2026), Lemma 6.2, p.12 (PDF p.12)
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

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