Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6 — independent bundle selection with exact marginals

Open
LinMatroidSecretary.Online.Supplement.lemma_6

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

matroidsonline-allocationp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1secretary-problemxos-valuations

Let FFF be a finite field, V=FdV=F^dV=Fd, 0≤α≤10\le\alpha\le10≤α≤1, and let ν\nuν be a probability distribution on subspaces of VVV. Suppose that

EW∼νdim⁡(W∩L)≤(1−α)dim⁡Lfor every L≤V.\mathbb E_{W\sim\nu}\dim(W\cap L)\le(1-\alpha)\dim L\qquad\text{for every }L\le V.EW∼ν​dim(W∩L)≤(1−α)dimLfor every L≤V.

Let CCC be an independent bundle in a finite labelled vector family v:E→Vv:E\to Vv:E→V. There exists a randomized rule that, after observing WWW, chooses R⊆CR\subseteq CR⊆C, with a nonnegative conditional distribution of total mass one for each positive-mass WWW, such that

dim⁡(W+⟨R⟩)=dim⁡W+∣R∣almost surely,Pr⁡[c∈R]=α(c∈C).\dim(W+\langle R\rangle)=\dim W+|R|\quad\text{almost surely},\qquad\Pr[c\in R]=\alpha\quad(c\in C).dim(W+⟨R⟩)=dimW+∣R∣almost surely,Pr[c∈R]=α(c∈C).

The probability averages over both WWW and the conditional subset choice. Empty bundles and the endpoints α=0,1\alpha=0,1α=0,1 are included. This is the subset-selection result needed for bundle arrivals.

Differences from the source:

  • encoding: an independent set of vectors in a finite-dimensional space over a finite field → a finite labelled family v : E → F^d, independent on the specified finite bundle, and a finitely supported law on subspaces; reason: independence makes the bundle labels injective on vectors; every finite-dimensional space has coordinates, and over a finite field every subspace law has finite support
Preamble
import Mathlib
import Definitions.Def_LinMatroidSecretary_Online_Supplement_BundleLP
Formal statement
namespace LinMatroidSecretary.Online.Supplement

/-- Lemma 6, STOC 2027 #608, PDF p. 22 (printed p. 20). All clauses of the
conditional subset selection rule are asserted, with exact marginal α. -/
theorem lemma_6 {F : Type} [Field F] [Fintype F] {d : ℕ}
    (α : ℝ) (hα0 : 0 ≤ α) (hα1 : α ≤ 1) (ν : Dist F d)
    (hν : IsDistOn ν ⊤) (hDim : DimIneqAlpha ν α)
    {E : Type} [Fintype E] [DecidableEq E] (v : E → Fin d → F)
    (C : Finset E) (hC : LinearIndepOn F v (C : Set E)) :
    ∃ ρ : SelectionRule F d E, SelectionValid v ν C ρ ∧
      ∀ c ∈ C, selectionMarginal ν C ρ c = α := by sorry

end LinMatroidSecretary.Online.Supplement
Source
Kristóf Bérczi, Shaddin Dughmi, Vasilis Livanos, Jose Soto, Victor Verdugo, The Strong Secretary Conjecture is True for Linear Matroids, STOC 2027 submission #608 (October 2026), https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/608.pdf, Lemma 6, PDF p. 22 (printed p. 20)

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