blockWeight_pos
theoremverifiedformalizationimported Lean
blockWeight_pos
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 omit [DecidableEq I] [LinearOrder I] in lemma blockWeight_pos (i : I) : 0 < blockWeight card i
- Formalizes
- EconCSLib, `blockWeight_pos`
- 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.blockWeight_pos← blockWeight_pos (EconCSLib/Math/FixedPoint/Brouwer_product.lean:537): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- blockWeightWeight (size fraction) of block
i:(card i) / (total_card card). - total_cardTotal number of coordinates: the sum of
card iover alli.
- blockWeightWeight (size fraction) of block
- 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 → ℕ+) inomit [DecidableEq I] [LinearOrder I] inlemma blockWeight_pos (i : I) : 0 < blockWeight card i := by unfold blockWeight have htc : 0 < (total_card card : ℝ) := by norm_cast; exact PNat.pos (total_card card) have hci : 0 < (card i : ℝ) := by norm_cast; exact PNat.pos (card i) exact div_pos hci htc