embed_from_product
defimported Lean
Embedding of the product of simplices into the big simplex.
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 noncomputable def embed_from_product (y : ProductSimplices card) : BigSimplex card
- Defined in
- EconCSLib, `embed_from_product`
- 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.embed_from_product← embed_from_product (EconCSLib/Math/FixedPoint/Brouwer_product.lean:423): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 7
- index_splitSplit a flat index
kinto its block/index pair(i, j). - index_split_combine_inverse
index_splitis a left inverse toindex_combine. - index_combine_split_inverse
index_combineis a left inverse toindex_split. - ProductSimplicesThe product of simplices indexed by
I. - total_cardTotal number of coordinates: the sum of
card iover alli. - BigSimplexThe big simplex on
total_card cardcoordinates. - index_combineCombine a block/index pair
(i, j)back into a flat index.
- index_splitSplit a flat index
- Used by 2
- project_embed_id
project_to_product ∘ embed_from_product = id. - embed_continuousContinuity of
embed_from_product.
- project_embed_id
Lean source view module on GitHub
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 /-- Embedding of the product of simplices into the big simplex. -/ noncomputable def embed_from_product (y : ProductSimplices card) : BigSimplex card := ⟨fun k => let p := index_split card k (y p.1).1 p.2 * (card p.1 : ℝ) / (total_card card : ℝ), by simp only [stdSimplex, Set.mem_setOf_eq] constructor · intro k let p := index_split card k have h_denom_pos : 0 < (total_card card : ℝ) := by norm_cast exact PNat.pos (total_card card) have h_num_nonneg : 0 ≤ (y p.1).1 p.2 * (card p.1 : ℝ) := mul_nonneg ((y p.1).2.1 p.2) (by positivity) exact div_nonneg h_num_nonneg (le_of_lt h_denom_pos) · rw [← Finset.sum_div] have h_numerator : (∑ k, (y (index_split card k).1).1 (index_split card k).2 * (card (index_split card k).1 : ℝ)) = ↑(total_card card) := by have : (∑ k, (y (index_split card k).1).1 (index_split card k).2 * (card (index_split card k).1 : ℝ)) = (∑ i, ∑ j : Fin (card i), (y i).1 j * (card i : ℝ)) := by let f (p : Σ i, Fin (card i)) := (y p.1).1 p.2 * (card p.1 : ℝ) change (∑ k ∈ (Finset.univ : Finset (Fin (total_card card))), f (index_split card k)) = (∑ i ∈ (Finset.univ : Finset I), ∑ j ∈ (Finset.univ : Finset (Fin (card i))), f ⟨i, j⟩) rw [← Finset.sum_sigma (s := (Finset.univ : Finset I)) (t := fun i => (Finset.univ : Finset (Fin (card i))))] apply Finset.sum_bij (fun k _ => index_split card k) · intro; simp · intro a₁ _ a₂ _ h rw [← index_combine_split_inverse card a₁, ← index_combine_split_inverse card a₂, h] · intro k _ use index_combine card k exact ⟨Finset.mem_univ _, index_split_combine_inverse card k⟩ · intro i j; rfl rw [this] simp_rw [← Finset.sum_mul, (y _).2.2, one_mul] rw [← Nat.cast_sum] simp [total_card] rw [h_numerator] field_simp⟩