ge_iff_simplex_ge
theoremverifiedformalizationimported Lean
f ≥ v pointwise iff every simplex weighted sum is ≥ v.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Finset BigOperators Matrix in variable {𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] in variable {I : Type*} [Fintype I] in set_option linter.unusedSectionVars false in theorem ge_iff_simplex_ge {f : I → 𝕜} {v : 𝕜} : (∀ i, v ≤ f i) ↔ ∀ x : stdSimplex 𝕜 I, v ≤ wsum x f
- Formalizes
- EconCSLib, `ge_iff_simplex_ge`
- 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.ge_iff_simplex_ge← ge_iff_simplex_ge (EconCSLib/Math/Simplex.lean:341): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 6
- wsumWeighted sum of
fwith weights from a simplex elementx. Thinabbrevover Mathlib's finite dot product⬝ᵥ: definitionally equal,… - wsum_le_wsumWeighted sum is monotone: pointwise
≤implieswsum ≤. - stdSimplex.purePoint-mass simplex element at
i₀. - wsum_pure_applyWeighted sum at a point mass evaluates the chosen coordinate.
- stdSimplex.pure_applystdSimplex.pure_apply
- wsum_constWeighted sum of a constant equals the constant.
- wsumWeighted sum of
- Used by 3
- MatrixGame.image_optimalRowStrategies_eqThe image of the row-optimal subtype set equals the H-representation polytope
A.optimalRowSet. - MinimaxLoomis.lam0_le_mu0Weak duality for the two-player zero-sum matrix game: every maxmin value is bounded by every minmax value.
- MatrixGame.mem_optimalRowStrategies_iff_E_geA row strategy is optimal iff against every mixed column it secures the value.
- MatrixGame.image_optimalRowStrategies_eqThe image of the row-optimal subtype set equals the H-representation polytope
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 Finset BigOperators Matrix invariable {𝕜 : Type*} [Field 𝕜] [LinearOrder 𝕜] [IsStrictOrderedRing 𝕜] invariable {I : Type*} [Fintype I] inset_option linter.unusedSectionVars false in/-- `f ≥ v` pointwise iff every simplex weighted sum is `≥ v`. -/theorem ge_iff_simplex_ge {f : I → 𝕜} {v : 𝕜} : (∀ i, v ≤ f i) ↔ ∀ x : stdSimplex 𝕜 I, v ≤ wsum x f := by classical refine ⟨fun hi x => ?_, fun H i => ?_⟩ · calc v = wsum x (fun _ => v) := (wsum_const x v).symm _ ≤ wsum x f := wsum_le_wsum x hi · simpa using H (stdSimplex.pure i)