Download data/lean/OAI/Geometry/Cannon/Modulus/ModulusEnergy.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 3.71 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Geometry/Cannon/Modulus/ModulusEnergy.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Geometry/Cannon/Modulus/ModulusEnergy.lean
-
curl -L -o ModulusEnergy.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Geometry/Cannon/Modulus/ModulusEnergy.lean
3.71 kB
| import Mathlib | |
| import OAI.Geometry.Cannon.Modulus.Cost | |
| namespace OAI | |
| section | |
| section | |
| section | |
| noncomputable section | |
| section | |
| section | |
| section | |
| section | |
| section | |
| open Set Topology | |
| open Set Topology Filter Metric unitInterval | |
| open scoped InnerProductSpace | |
| open Set unitInterval | |
| open Set Metric Topology | |
| open Set Topology unitInterval | |
| namespace CannonCells | |
| open CannonDuality Set Filter | |
| variable {X ΞΉ J : Type*} [Fintype ΞΉ] [Fintype J] | |
| lemma modulus_le_energy (C : ΞΉ β Set X) (F : Set (Set X)) (w : Weights ΞΉ) | |
| (hw : Admissible (familyVectors C F : Set (Weights ΞΉ)) w) : | |
| modulus C F β€ βwβ^2 := by | |
| apply csInf_le | |
| Β· refine β¨0,?_β© | |
| rintro a β¨v,_,rflβ© | |
| exact sq_nonneg _ | |
| Β· exact β¨w,hw,rflβ© | |
| theorem modulus_le_card_mul_sum (C : ΞΉ β Set X) | |
| (hC : β x, β i, x β C i) (F : Set (Set X)) (H : J β Set (Set X)) | |
| (hH : β j, (H j).Nonempty) (hHn : β j A, A β H j β A.Nonempty) | |
| (hsub : β A β F, β j, β B β H j, B β A) : | |
| modulus C F β€ Fintype.card J * β j, modulus C (H j) := by | |
| classical | |
| choose w hw hwe using fun j => (modulus_minimum C hC (hH j) (hHn j)).2 | |
| have hwp (j : J) : Nonnegative (w j) := (hw j).1 | |
| let W : Weights ΞΉ := β j, w j | |
| have hW : Admissible (familyVectors C F : Set (Weights ΞΉ)) W := by | |
| rw [admissible_iff] | |
| have hpoint (i : ΞΉ) : W i = β j, w j i := by simp [W] | |
| have hnon : Nonnegative W := by | |
| intro i | |
| rw [hpoint] | |
| exact Finset.sum_nonneg (fun j _ => hwp j i) | |
| refine β¨hnon,?_β© | |
| intro A hA | |
| obtain β¨j,B,hB,hBAβ© := hsub A hA | |
| have hwj := (admissible_iff C (H j) (w j)).mp (hw j) | |
| calc | |
| 1 β€ β i β indices C B, w j i := hwj.2 B hB | |
| _ β€ β i β indices C A, w j i := Finset.sum_le_sum_of_subset_of_nonneg | |
| (indices_mono C hBA) (fun i _ _ => hwp j i) | |
| _ β€ β i β indices C A, W i := by | |
| apply Finset.sum_le_sum | |
| intro i _ | |
| rw [hpoint] | |
| exact Finset.single_le_sum (fun k _ => hwp k i) (Finset.mem_univ j) | |
| calc | |
| modulus C F β€ βWβ^2 := modulus_le_energy C F W hW | |
| _ β€ (β j, βw jβ)^2 := by | |
| apply pow_le_pow_leftβ (norm_nonneg W) | |
| exact norm_sum_le _ _ | |
| _ β€ (Fintype.card J : β)*β j, βw jβ^2 := by | |
| simpa using (sq_sum_le_card_mul_sum_sq (s := Finset.univ) (f := fun j => βw jβ)) | |
| _ = _ := by simp only [hwe] | |
| theorem exists_modulus_localization [Nonempty J] (C : ΞΉ β Set X) | |
| (hC : β x, β i, x β C i) (F : Set (Set X)) (H : J β Set (Set X)) | |
| (hH : β j, (H j).Nonempty) (hHn : β j A, A β H j β A.Nonempty) | |
| (hsub : β A β F, β j, β B β H j, B β A) : | |
| β j, modulus C F β€ (Fintype.card J : β)^2 * modulus C (H j) := by | |
| obtain β¨j,_,hjβ© := Finset.univ.exists_max_image (fun j => modulus C (H j)) Finset.univ_nonempty | |
| refine β¨j,(modulus_le_card_mul_sum C hC F H hH hHn hsub).trans ?_β© | |
| calc | |
| (Fintype.card J : β)*β k, modulus C (H k) β€ | |
| (Fintype.card J : β)*β _k : J, modulus C (H j) := by | |
| apply mul_le_mul_of_nonneg_left (Finset.sum_le_sum (fun k hk => hj k hk)) | |
| exact Nat.cast_nonneg _ | |
| _ = _ := by simp [pow_two,mul_assoc] | |
| theorem fixed_localization_subsequence (M : β β β) (m : J β β β β) (C : β) | |
| (h : β n, β j, M n β€ C*m j n) : | |
| β j, β N : β β β, StrictMono N β§ β n, M (N n) β€ C*m j (N n) := by | |
| have hf : βαΆ n in atTop, β j, M n β€ C*m j n := | |
| (Eventually.of_forall h).frequently | |
| obtain β¨j,hjβ© := frequently_exists.mp hf | |
| obtain β¨N,hN,hNjβ© := extraction_of_frequently_atTop hj | |
| exact β¨j,N,hN,hNjβ© | |
| end CannonCells | |
| end | |
| end | |
| end | |
| end | |
| end | |
| end | |
| end | |
| end | |
| end | |
| end OAI | |