Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Display (3) — sufficient condition for a big element to be selectable

Proved
OnlineCRS.Knapsack.big_selectable_condition

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

knapsackonline-contention-resolutionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1selectability

Let eee be a big element, so se>1/2s_e>1/2se​>1/2, and let AAA be a realized active set. If the total size of the other big elements in AAA is at most 1−se1-s_e1−se​, then eee is selectable in the big-element greedy family:

∑f∈(A∩Nbig)∖{e}sf≤1−se⟹e is selectable for (A,Fbig).\sum_{f\in(A\cap N_{\mathrm{big}})\setminus\{e\}}s_f\le1-s_e\quad\Longrightarrow\quad e\text{ is selectable for }(A,F_{\mathrm{big}}).f∈(A∩Nbig​)∖{e}∑​sf​≤1−se​⟹e is selectable for (A,Fbig​).

This is the pointwise implication behind the probability lower bound in display (3).

Formalization Note The printed sum in display (3) includes eee. The next displayed equality removes eee; the corrected exclusion is used here, as recorded in the moderation notes.

Preamble
import Mathlib
import Definitions.Def_OnlineCRS_Knapsack_Model
Formal statement
namespace OnlineCRS.Knapsack

/-- The sufficient condition used at display (3), p. 15, with the tested element removed
from the load as required by the equality in the next display. -/
theorem big_selectable_condition {α : Type} [Fintype α] [DecidableEq α]
    (s : α → ℝ) (hs : ∀ e, 0 ≤ s e ∧ s e ≤ 1)
    (A : Finset α) (e : α) (he : e ∈ bigElements s)
    (hload : ∑ f ∈ ((A ∩ bigElements s).erase e), s f ≤ 1 - s e) :
    OnlineCRS.Matroid.Selectable (bigFamily s) A e := by sorry

end OnlineCRS.Knapsack
Source
arXiv:1508.00142v2, proof of Theorem 2.9, display (3) and following paragraph, p. 15
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