procurement_others_bids_nonneg
lemmaverified
If every agent bids nonnegatively, so do the others of any agent.
Statement
lemma procurement_others_bids_nonneg {n : ℕ} (β : Fin n → List ℝ) (hβ : ∀ i, ∀ b ∈ β i, 0 ≤ b)
(i : Fin n) : ∀ x ∈ procurement_others_bids β i, 0 ≤ x- 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 1
- proportional_share_no_pne_of_safe_all_costsIf a proportional-share mechanism is ex-post safe for every nonnegative cost, then no profile with at least one agent and nonnegative…
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_nonneg {n : ℕ} (β : Fin n → List ℝ) (hβ : ∀ i, ∀ b ∈ β i, 0 ≤ b) (i : Fin n) : ∀ x ∈ procurement_others_bids β i, 0 ≤ x := by intro x hx unfold procurement_others_bids at hx rw [List.mem_flatMap] at hx obtain ⟨j, _, hj⟩ := hx split_ifs at hj with h · simp at hj · exact hβ j x hj