picking_sequence_outcome_pairwise_disjoint
Distinct agents never receive the same good under a picking sequence: the bundles are pairwise disjoint.
Statement
theorem picking_sequence_outcome_pairwise_disjoint {N G : Type*} [DecidableEq N] [DecidableEq G] {m : ℕ} (seq : List N) (rank : N → Fin m ≃ G) {a b : N} (hab : a ≠ b) : Disjoint (picking_sequence_outcome seq rank a) (picking_sequence_outcome seq rank b)
- Source
- step towards round_robin_three_agents_high_count_two_thirds_ef1
- Verified
- 26 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- picking_sequence_outcomeThe allocation returned by the picking-sequence mechanism PS_π: agents act in the order seq, and at each turn the active agent takes its…
- round_robin_pne_ef1_of_card_le_two_mulWith n agents and at most 2n goods (every agent picks at most twice), every pure Nash equilibrium of Round-Robin, for nonnegative additive…
- picking_turnOne turn of a picking-sequence mechanism: the active agent i receives the first good of its reported ranking l (best first) that is not…
- Used by 1
- round_robin_two_mul_add_one_deviation_certificateRound-Robin with n agents and 2n+1 goods, any reports, agent i ≠ 0: for some good g of agent 0's bundle B_0 (its first pick a1), either…
The proof, explained
The proof proceeds by state invariant induction. The invariant `rr_l1_inv` guarantees that goods are tracked consistently and distinct agents hold mutually disjoint bundles. Since this invariant holds initially for empty bundles and is preserved by every picking turn (via `rr_l1_inv_foldl`), the final outcome preserves disjointness for any two distinct agents.
The empty initial state satisfies the invariant `rr_l1_inv`. automation
In the initial state, every agent has an empty bundle and the set of allocated goods is empty. Each condition of `rr_l1_inv`—subset inclusion, ownership of allocated goods, and pairwise disjointness of bundles—holds vacuously for empty sets, which the simplifier confirms.
uses
rr_l1_invhave hinit : rr_l1_inv ((fun _ : N => (∅ : Finset G)),(∅ : Finset G)) := by simp [rr_l1_inv]
The final bundles of agents `a` and `b` are disjoint.
By `rr_l1_inv_foldl`, the invariant `rr_l1_inv` is preserved throughout the sequence of picking turns starting from the initial state. In particular, its pairwise disjointness component asserts that distinct agents hold disjoint bundles; applying this to `a`, `b`, and the hypothesis `hab` ($a \neq b$) proves the goal.
uses
rr_l1_inv_foldlexact (rr_l1_inv_foldl (fun j => List.ofFn ⇑(rank j)) seq _ hinit).2.2 a b hab
rr_l1_inv- the invariant on allocation states requiring that each agent's bundle is a subset of all allocated goods, every allocated good is owned by some agent, and distinct agents have disjoint bundles
rr_l1_inv_foldl- the invariant `rr_l1_inv` is preserved under folding picking turns across any sequence of agents
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- Bundles of distinct agents in a picking-sequence outcome are disjoint. -/theorem picking_sequence_outcome_pairwise_disjoint {N G : Type*} [DecidableEq N] [DecidableEq G] {m : ℕ} (seq : List N) (rank : N → Fin m ≃ G) {a b : N} (hab : a ≠ b) : Disjoint (picking_sequence_outcome seq rank a) (picking_sequence_outcome seq rank b) := by have hinit : rr_l1_inv ((fun _ : N => (∅ : Finset G)),(∅ : Finset G)) := by simp [rr_l1_inv] exact (rr_l1_inv_foldl (fun j => List.ofFn ⇑(rank j)) seq _ hinit).2.2 a b hab