sum_range_getD_append
lemmaverified
Summing the first |mine| entries of mine ++ others gives the sum of mine.
Statement
lemma sum_range_getD_append (mine others : List ℝ) :
∑ j ∈ Finset.range mine.length, (mine ++ others).getD j 0 = mine.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- Used by 2
- proportional_share_allocation_eqIn a proportional-share mechanism an agent's total work is s / (s + R), s its total bid and R the others' total.
- proportional_share_utility_eqIn a proportional-share mechanism an agent's utility is s / (s + R) times (pool(s + R) - c).
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 sum_range_getD_append (mine others : List ℝ) : ∑ j ∈ Finset.range mine.length, (mine ++ others).getD j 0 = mine.sum := by induction mine with | nil => simp | cons a l ih => rw [List.length_cons, Finset.sum_range_succ', List.sum_cons] simp only [List.cons_append, List.getD_cons_succ, List.getD_cons_zero] rw [ih]; ring