EconCSLib.StrategicGame.wsum_magic_ineq
theoremverifiedformalizationimported Lean
Helper: weighted-average inequality on the simplex. If ∑_i σ_i * f_i = c, then there exists i with 0 < σ_i and f i ≤ c.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open BigOperators Function in set_option linter.unusedSectionVars false in variable {N : Type*} in variable (G : EconCSLib.StrategicGame N ℝ) in variable [Fintype N] [DecidableEq N] in variable [∀ i, Fintype (G.strategy i)] [∀ i, DecidableEq (G.strategy i)] in variable [∀ i, Inhabited (G.strategy i)] in lemma EconCSLib.StrategicGame.wsum_magic_ineq {X : Type*} [Fintype X] {p : stdSimplex ℝ X} {f : X → ℝ} {c : ℝ} (H : ∑ a : X, p.val a * f a = c) : ∃ a, 0 < p.val a ∧ f a ≤ c
- Formalizes
- EconCSLib, `StrategicGame.wsum_magic_ineq`
- Lean proof
- By xbei (from the file's git history), from github.com/gametheoryinlean/EconCSLib at
1a88f809b538(Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.EconCSLib.StrategicGame.wsum_magic_ineq← StrategicGame.wsum_magic_ineq (EconCSLib/GameTheory/StrategicGame/Nash.lean:256): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- EconCSLib.StrategicGameA strategic game (normal-form game) with players
Nand utilities inU. The structure records only the bare data: strategy spaces and a…
- EconCSLib.StrategicGameA strategic game (normal-form game) with players
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.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen BigOperators Function inset_option linter.unusedSectionVars false invariable {N : Type*} invariable (G : EconCSLib.StrategicGame N ℝ) invariable [Fintype N] [DecidableEq N] invariable [∀ i, Fintype (G.strategy i)] [∀ i, DecidableEq (G.strategy i)] invariable [∀ i, Inhabited (G.strategy i)] in/-- Helper: weighted-average inequality on the simplex. If `∑_i σ_i * f_i = c`, then there exists `i` with `0 < σ_i` and `f i ≤ c`. -/lemma EconCSLib.StrategicGame.wsum_magic_ineq {X : Type*} [Fintype X] {p : stdSimplex ℝ X} {f : X → ℝ} {c : ℝ} (H : ∑ a : X, p.val a * f a = c) : ∃ a, 0 < p.val a ∧ f a ≤ c := by by_contra Hall push_neg at Hall -- Hall : ∀ a, 0 < p.val a → c < f a (after push_neg of ∀ a, ¬(0 < p.val a ∧ f a ≤ c)) -- Actually push_neg gives: ∀ a, 0 < p.val a → c < f a have hpos : ∃ a, 0 < p.val a := by by_contra h_all_npos push_neg at h_all_npos have hzero : ∀ a, p.val a = 0 := fun a => le_antisymm (h_all_npos a) (p.property.1 a) have : (∑ a : X, p.val a) = 0 := by simp [hzero] linarith [p.property.2] have hgt : c < ∑ a : X, p.val a * f a := by have hsum_c : ∑ a : X, p.val a * c = c := by rw [← Finset.sum_mul, p.property.2, one_mul] rw [← hsum_c] apply Finset.sum_lt_sum · intro a _ by_cases ha : 0 < p.val a · exact mul_le_mul_of_nonneg_left (Hall a ha).le (p.property.1 a) · push_neg at ha have := le_antisymm ha (p.property.1 a) simp [this] · obtain ⟨a₀, ha₀⟩ := hpos exact ⟨a₀, Finset.mem_univ _, mul_lt_mul_of_pos_left (Hall a₀ ha₀) ha₀⟩ linarith [H ▸ hgt]