Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix F, p. 42, Figure 8 — the poset of ω disjoint k-element chains has width ω

Proved
PosetSecretary.LowerBound.width_chainsPoset

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

antichainp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1posetposet-width

Let ω≥0\omega\ge0ω≥0 and k≥1k\ge1k≥1, and let Chains(ω,k)\mathrm{Chains}(\omega,k)Chains(ω,k) be the disjoint union of ω\omegaω chains with kkk elements each, two elements being comparable only when they lie in the same chain. Its width, the largest number of pairwise incomparable elements, is

width⁡(Chains(ω,k))=ω.\operatorname{width}\big(\mathrm{Chains}(\omega,k)\big)=\omega .width(Chains(ω,k))=ω.

This is the claim that the instance of Figure 8 has width ω\omegaω, as Proposition 5.1 requires of its instance.

Formalization Note Width is the published AppliedComb.Posets.width (largest antichain), not a minimum number of chains. The hypothesis k≥1k\ge1k≥1 is necessary: for k=0k=0k=0 the poset is empty and has width 000.

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

theorem width_chainsPoset (ω k : ℕ) (hk : 1 ≤ k) :
    AppliedComb.Posets.width (ChainsPoset ω 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, first paragraph and Figure 8
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