Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 5.1, p. 42 — some chain i has Σ_j p_j^i ≤ k/ω

Proved
PosetSecretary.LowerBound.exists_chain_selProb_sum_le

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

online-selectionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pigeonholeposetsecretary-problem

Let ω≥1\omega\ge1ω≥1 and k≥0k\ge0k≥0, and let μ\muμ be a selection rule with capacity kkk on Chains(ω,k)\mathrm{Chains}(\omega,k)Chains(ω,k), the disjoint union of ω\omegaω chains of kkk elements. Write pjip^i_jpji​ for the probability that μ\muμ selects the element (i,j)(i,j)(i,j). Then some chain iii satisfies

∑jpji≤kω.\sum_{j}p^i_j\le\frac{k}{\omega}.j∑​pji​≤ωk​.

The least-selected chain is the one the lower-bound construction loads with the score.

Formalization Note The page indexes the elements of a chain by rank ("the jjjth best"); the sum over all elements of a chain does not depend on that indexing.

Preamble
import Mathlib
import Definitions.Def_AppliedComb_Posets_width
import Definitions.Def_PosetSecretary_LowerBound_Setting
Formal statement
namespace PosetSecretary.LowerBound

theorem exists_chain_selProb_sum_le (ω k : ℕ) (hω : 1 ≤ ω)
    (μ : Finset (ChainsPoset ω k) → ℝ) (hμ : IsSelectionRule k μ) :
    ∃ i : Fin ω, ∑ j : Fin k, selProb μ ⟨i, j⟩ ≤ (k : ℝ) / ω := by sorry

end PosetSecretary.LowerBound
Source
Salem & Gupta, Secretary Problems with Biased Evaluations Using Partial Ordinal Information, SSRN 3444283 (version of 2022-04-17), proof of Proposition 5.1, Appendix F, p. 42, second paragraph
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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