stdSimplex.upidx
instanceimported Lean
stdSimplex.upidx
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Classical in variable (n l : ℕ+) (i : Fin n) in set_option quotPrecheck false in variable (f : stdSimplex ℝ (Fin n) → stdSimplex ℝ (Fin n)) in variable {n l} in noncomputable instance stdSimplex.upidx (x y : stdSimplex ℝ (Fin n)) : Nonempty { i | x.1 i ≤ y.1 i}
- Defined in
- EconCSLib, `stdSimplex.upidx`
- 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.stdSimplex.upidx← stdSimplex.upidx (EconCSLib/Math/FixedPoint/Brouwer.lean:434): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 1
- stdSimplex.pickstdSimplex.pick
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Classical in variable (n l : ℕ+) (i : Fin n) in set_option quotPrecheck false in variable (f : stdSimplex ℝ (Fin n) → stdSimplex ℝ (Fin n)) in variable {n l} in noncomputable instance stdSimplex.upidx (x y : stdSimplex ℝ (Fin n)) : Nonempty { i | x.1 i ≤ y.1 i} := by by_contra h push Not at h have sum_x_eq_1 := x.2.2 have sum_y_eq_1 := y.2.2 have sum_lt : Finset.sum Finset.univ y.1 < Finset.sum Finset.univ x.1 := by apply Finset.sum_lt_sum_of_nonempty . exact Finset.univ_nonempty . intro i _ have : ¬ (x.1 i ≤ y.1 i) := by intro hle exact @IsEmpty.false _ h ⟨i, hle⟩ exact lt_of_not_ge this rw [sum_y_eq_1, sum_x_eq_1] at sum_lt exact (lt_irrefl 1 sum_lt).elim