tPush_mem_Icc
theoremverifiedformalizationimported Lean
tPush card x is always in [0, 1].
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Filter in variable {I : Type*} [Fintype I] [DecidableEq I] [Inhabited I] [LinearOrder I] (card : I → ℕ+) in lemma tPush_mem_Icc (x : BigSimplex card) : tPush card x ∈ Set.Icc (0 : ℝ) 1
- Formalizes
- EconCSLib, `tPush_mem_Icc`
- 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.tPush_mem_Icc← tPush_mem_Icc (EconCSLib/Math/FixedPoint/Brouwer_product.lean:558): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- deficit_nonneg
deficit card xis always nonnegative. - tPushAmount to push
xtowardz_uniform(always in[0, 1]). - deficitTotal positive shortfall of block sums relative to block weights.
- BigSimplexThe big simplex on
total_card cardcoordinates. - total_cardTotal number of coordinates: the sum of
card iover alli.
- deficit_nonneg
- Used by 1
- blockSum_pushTowardsZ_posThe block sum after pushing towards
z_uniformis always positive.
- blockSum_pushTowardsZ_posThe block sum after pushing towards
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 Filter invariable {I : Type*} [Fintype I] [DecidableEq I] [Inhabited I] [LinearOrder I] (card : I → ℕ+) in/-- `tPush card x` is always in `[0, 1]`. -/lemma tPush_mem_Icc (x : BigSimplex card) : tPush card x ∈ Set.Icc (0 : ℝ) 1 := by constructor · have hden : 0 ≤ (1 : ℝ) + deficit card x := by have := deficit_nonneg card x; linarith simpa [tPush] using div_nonneg (deficit_nonneg card x) hden · have hdenpos : 0 < (1 : ℝ) + deficit card x := by have := deficit_nonneg card x exact add_pos_of_pos_of_nonneg (by norm_num) this have hle : deficit card x ≤ 1 + deficit card x := by linarith have hinv_nonneg : 0 ≤ (1 + deficit card x)⁻¹ := inv_nonneg.mpr (le_of_lt hdenpos) have := mul_le_mul_of_nonneg_right hle hinv_nonneg have : (deficit card x) / (1 + deficit card x) ≤ (1 + deficit card x) / (1 + deficit card x) := by simpa [div_eq_mul_inv, mul_comm, mul_left_comm, mul_assoc] using this simpa [tPush, div_self (ne_of_gt hdenpos)] using this