project_continuous
theoremverifiedformalizationimported Lean
Continuity of project_to_product.
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 project_continuous : Continuous (project_to_product card)
- Formalizes
- EconCSLib, `project_continuous`
- 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.project_continuous← project_continuous (EconCSLib/Math/FixedPoint/Brouwer_product.lean:649): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 9
- pushTowardsZ_continuousContinuity of
pushTowardsZ card. - total_cardTotal number of coordinates: the sum of
card iover alli. - BigSimplexThe big simplex on
total_card cardcoordinates. - ProductSimplicesThe product of simplices indexed by
I. - project_to_productRetraction from the big simplex to the product of simplices.
- pushTowardsZConvex push of
xtowardz_uniformby amounttPush. - index_combineCombine a block/index pair
(i, j)back into a flat index. - blockSumSum of coordinates of
xover the blocki. - blockSum_pushTowardsZ_posThe block sum after pushing towards
z_uniformis always positive.
- pushTowardsZ_continuousContinuity of
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/-- Continuity of `project_to_product`. -/lemma project_continuous : Continuous (project_to_product card) := by apply continuous_pi intro i apply Continuous.subtype_mk apply continuous_pi intro j let k : Fin (total_card card) := index_combine card ⟨i, j⟩ have h_num_cont : Continuous (fun x : BigSimplex card => (pushTowardsZ card x).1 k) := (continuous_apply k).comp (continuous_subtype_val.comp (pushTowardsZ_continuous card)) have h_denom_cont : Continuous (fun x : BigSimplex card => blockSum card i (pushTowardsZ card x)) := by change Continuous (fun x : BigSimplex card => ∑ j : Fin (card i), (pushTowardsZ card x).1 (index_combine card ⟨i, j⟩)) apply continuous_finset_sum intro j _ exact (continuous_apply (index_combine card ⟨i, j⟩)).comp (continuous_subtype_val.comp (pushTowardsZ_continuous card)) have h_denom_ne : ∀ x : BigSimplex card, blockSum card i (pushTowardsZ card x) ≠ 0 := fun x => ne_of_gt (blockSum_pushTowardsZ_pos card i x) have h_div : Continuous (fun x : BigSimplex card => (pushTowardsZ card x).1 k / blockSum card i (pushTowardsZ card x)) := Continuous.div h_num_cont h_denom_cont h_denom_ne simpa [project_to_product, blockSum] using h_div