procurement_others_bids_sum
lemmaverified
The total of the other agents' bids is the total of all bids minus agent i's total.
Statement
lemma procurement_others_bids_sum {n : ℕ} (β : Fin n → List ℝ) (i : Fin n) :
(procurement_others_bids β i).sum = (∑ j, (β j).sum) - (β i).sum- Source
- step towards exists_sybil_proof_ex_post_safe_non_winner_take_all_procurement (Sybil-proof, ex-post safe procurement with non-winner-take-all equilibria, the open question of arXiv:2603.27779 v1, Sec. 6)
- Verified
- 06 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- procurement_others_bidsThe list of all bids of agents other than i in a profile where each agent submits a list of bids.
- Used by 3
- stake_share_pne_existsFor n >= 2 agents with costs in [0, L], if K M >= 3 n^2 L then the stake-share mechanism has a pure Nash equilibrium (each agent…
- stake_share_pne_non_winner_take_allIn the stake-share mechanism with K, M > 0 and all costs at most L, every pure Nash equilibrium (with at least one agent) gives positive…
- stake_share_two_agent_pneWith pool 1 + max(0, 2 - W) and costs 1/5 and 9/10, the stakes 24/35 and 18/35 form a pure Nash equilibrium.
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.
lemma procurement_others_bids_sum {n : ℕ} (β : Fin n → List ℝ) (i : Fin n) : (procurement_others_bids β i).sum = (∑ j, (β j).sum) - (β i).sum := by unfold procurement_others_bids rw [List.flatMap_def, List.sum_flatten, List.map_map, ← Fin.sum_univ_def] have h : ∀ j, (List.sum ∘ fun j => if j = i then ([] : List ℝ) else β j) j = (β j).sum - if j = i then (β j).sum else 0 := by intro j; by_cases hj : j = i <;> simp [hj] rw [Finset.sum_congr rfl (fun j _ => h j), Finset.sum_sub_distrib] simp