Download data/lean/OAI/Probability/RadialTransition/ClusterEmbedding.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 2.25 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/RadialTransition/ClusterEmbedding.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/RadialTransition/ClusterEmbedding.lean
-
curl -L -o ClusterEmbedding.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/RadialTransition/ClusterEmbedding.lean
2.25 kB
| import OAI.Probability.RadialTransition.MultiConvolution | |
| namespace OAI | |
| universe uX | |
| noncomputable section | |
| open scoped BigOperators ENNReal NNReal | |
| open MeasureTheory Set Filter | |
| namespace RadialTransition | |
| attribute [local instance] Classical.propDecidable | |
| lemma configurationMultiset_fibers {X : Type uX} {ΞΉ I : Type} [Fintype ΞΉ] [Fintype I] | |
| (x : ΞΉ β X) (f : ΞΉ β I) : | |
| β q : I, ((Finset.univ.filter (fun j => f j = q)).val.map x) = configurationMultiset x := by | |
| classical | |
| have hq (q : I) : ((Finset.univ.filter (fun j => f j=q)).val.map x) = | |
| β j : ΞΉ, if f j=q then ({x j}:Multiset X) else 0 := by | |
| rw [β Finset.sum_filter] | |
| change _ = ((Finset.univ.filter (fun j => f j=q)).val.map (fun j => ({x j}:Multiset X))).sum | |
| simpa only [Multiset.map_map, Function.comp_def] using | |
| (Multiset.sum_map_singleton ((Finset.univ.filter (fun j => f j=q)).val.map x)).symm | |
| simp_rw [hq] | |
| rw [Finset.sum_comm] | |
| simp [configurationMultiset] | |
| section Embed | |
| variable {X : Type uX} {I Q : Type} [Fintype I] [Fintype Q] | |
| lemma indexedClusterProduct_embedding (W : I β Multiset X β ββ₯0β) | |
| (h0 : β i, 1 β€ W i 0) (f : Q β I) (hf : Function.Injective f) (s : Q β Multiset X) : | |
| (β q, W (f q) (s q)) β€ indexedClusterProduct W (β q, s q) := by | |
| classical | |
| let u (i : I) : Multiset X := β q : Q, if f q=i then s q else 0 | |
| have huv (q : Q) : u (f q) = s q := by | |
| simp [u, hf.eq_iff] | |
| have huz (i : I) (hi : i β Finset.univ.image f) : u i = 0 := by | |
| apply Finset.sum_eq_zero | |
| intro q _ | |
| exact ite_eq_right (fun he => hi (Finset.mem_image.mpr β¨q,Finset.mem_univ _,heβ©)) | |
| have hsum : β i, u i = β q, s q := by | |
| simp only [u] | |
| rw [Finset.sum_comm] | |
| simp | |
| have hp : (β q, W (f q) (s q)) = β i β Finset.univ.image f, W i (u i) := by | |
| rw [Finset.prod_image (fun a _ b _ hab => hf hab)] | |
| simp_rw [huv] | |
| rw [hp] | |
| have hle : (β i β Finset.univ.image f, W i (u i)) β€ β i, W i (u i) := by | |
| apply Finset.prod_le_prod_of_subset_of_one_leβ (Finset.subset_univ _) (fun _ _ => bot_le) | |
| intro i _ hi | |
| rw [huz i hi] | |
| exact h0 i | |
| apply hle.trans | |
| rw [β hsum] | |
| exact indexedClusterProduct_ge W u | |
| end Embed | |
| end RadialTransition | |
| end | |
| end OAI | |