Download data/lean/OAI/Analysis/CharacterCriterion/NormUltrapower.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 8.91 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Analysis/CharacterCriterion/NormUltrapower.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Analysis/CharacterCriterion/NormUltrapower.lean
-
curl -L -o NormUltrapower.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Analysis/CharacterCriterion/NormUltrapower.lean
8.91 kB
| import OAI.Analysis.CharacterCriterion.Definitions | |
| import OAI.Analysis.CharacterCriterion.FiniteDrop | |
| namespace OAI | |
| noncomputable section | |
| open scoped TensorProduct | |
| open scoped InnerProductSpace | |
| open scoped BigOperators | |
| open Set Module | |
| open Topology | |
| open NormedSpace | |
| open scoped ComplexOrder | |
| open scoped ComplexOrder | |
| open scoped InnerProductSpace | |
| open scoped InnerProductSpace | |
| open NormedSpace | |
| open scoped TensorProduct InnerProductSpace | |
| open UniformSpace | |
| variable [KirchbergRordam.GenericRW.Size] | |
| local notation "rankNum" => KirchbergRordam.GenericRW.Size.n | |
| variable [KirchbergRordam.GenericRW.PauliData] | |
| omit [KirchbergRordam.GenericRW.Size] [KirchbergRordam.GenericRW.PauliData] | |
| open Filter Topology BoundedContinuousFunction | |
| universe uQuot | |
| namespace KirchbergRordam | |
| namespace NormUltrapower | |
| variable {A : Type*} [CStarAlgebra A] | |
| theorem exists_norm_limit (Ο : Ultrafilter β) (x : BoundedSeq A) : | |
| β r β Set.Icc (0 : β) βxβ, Tendsto (fun n => βx nβ) (Ο : Filter β) (π r) := by | |
| obtain β¨r, hr, hβ© := isCompact_Icc.ultrafilter_le_nhds' | |
| (Ultrafilter.map (fun n => βx nβ) Ο) (by | |
| change βαΆ n in (Ο : Filter β), βx nβ β Set.Icc (0 : β) βxβ | |
| exact Eventually.of_forall fun n => β¨norm_nonneg _, x.norm_coe_le_norm nβ©) | |
| exact β¨r, hr, hβ© | |
| theorem normLimit_nonneg (Ο : Ultrafilter β) (x : BoundedSeq A) : 0 β€ normLimit Ο x := | |
| (exists_norm_limit Ο x).choose_spec.1.1 | |
| theorem normLimit_le (Ο : Ultrafilter β) (x : BoundedSeq A) : normLimit Ο x β€ βxβ := | |
| (exists_norm_limit Ο x).choose_spec.1.2 | |
| theorem tendsto_norm (Ο : Ultrafilter β) (x : BoundedSeq A) : | |
| Tendsto (fun n => βx nβ) (Ο : Filter β) (π (normLimit Ο x)) := | |
| (exists_norm_limit Ο x).choose_spec.2 | |
| @[simp] | |
| theorem normLimit_zero (Ο : Ultrafilter β) : normLimit Ο (0 : BoundedSeq A) = 0 := by | |
| apply tendsto_nhds_unique (tendsto_norm Ο 0) | |
| simp | |
| @[simp] | |
| theorem normLimit_neg (Ο : Ultrafilter β) (x : BoundedSeq A) : | |
| normLimit Ο (-x) = normLimit Ο x := by | |
| apply tendsto_nhds_unique (tendsto_norm Ο (-x)) | |
| simpa using tendsto_norm Ο x | |
| theorem normLimit_add_le (Ο : Ultrafilter β) (x y : BoundedSeq A) : | |
| normLimit Ο (x + y) β€ normLimit Ο x + normLimit Ο y := by | |
| exact le_of_tendsto_of_tendsto (tendsto_norm Ο (x+y)) | |
| ((tendsto_norm Ο x).add (tendsto_norm Ο y)) | |
| (Eventually.of_forall fun n => norm_add_le (x n) (y n)) | |
| theorem normLimit_mul_le (Ο : Ultrafilter β) (x y : BoundedSeq A) : | |
| normLimit Ο (x * y) β€ normLimit Ο x * normLimit Ο y := by | |
| exact le_of_tendsto_of_tendsto (tendsto_norm Ο (x*y)) | |
| ((tendsto_norm Ο x).mul (tendsto_norm Ο y)) | |
| (Eventually.of_forall fun n => norm_mul_le (x n) (y n)) | |
| @[simp] | |
| theorem normLimit_star (Ο : Ultrafilter β) (x : BoundedSeq A) : | |
| normLimit Ο (star x) = normLimit Ο x := by | |
| apply tendsto_nhds_unique (tendsto_norm Ο (star x)) | |
| simpa using tendsto_norm Ο x | |
| theorem normLimit_star_mul (Ο : Ultrafilter β) (x : BoundedSeq A) : | |
| normLimit Ο (star x * x) = normLimit Ο x * normLimit Ο x := by | |
| apply tendsto_nhds_unique (tendsto_norm Ο (star x * x)) | |
| simpa only [BoundedContinuousFunction.mul_apply, BoundedContinuousFunction.star_apply, | |
| CStarRing.norm_star_mul_self] using (tendsto_norm Ο x).mul (tendsto_norm Ο x) | |
| theorem normLimit_sub_le (Ο : Ultrafilter β) (x y : BoundedSeq A) : | |
| normLimit Ο x - normLimit Ο y β€ normLimit Ο (x-y) := by | |
| have h := normLimit_add_le Ο (x-y) y | |
| rw [sub_add_cancel] at h | |
| linarith | |
| theorem normLimit_lipschitz (Ο : Ultrafilter β) : | |
| LipschitzWith 1 (normLimit Ο : BoundedSeq A β β) := by | |
| apply LipschitzWith.of_dist_le_mul | |
| intro x y | |
| rw [NNReal.coe_one, one_mul, Real.dist_eq, abs_le, dist_eq_norm] | |
| constructor | |
| Β· have h := (normLimit_sub_le Ο y x).trans (normLimit_le Ο (y-x)) | |
| rw [norm_sub_rev] at h | |
| linarith | |
| Β· exact (normLimit_sub_le Ο x y).trans (normLimit_le Ο (x-y)) | |
| @[simp] | |
| theorem mem_nullIdeal (Ο : Ultrafilter β) (x : BoundedSeq A) : | |
| x β nullIdeal Ο β Tendsto (fun n => βx nβ) (Ο : Filter β) (π 0) := by | |
| change normLimit Ο x = 0 β _ | |
| constructor | |
| Β· intro h | |
| simpa only [h] using tendsto_norm Ο x | |
| Β· exact fun h => tendsto_nhds_unique (tendsto_norm Ο x) h | |
| @[simp] | |
| theorem star_mk (Ο : Ultrafilter β) (x : BoundedSeq A) : | |
| star (Ideal.Quotient.mk (nullIdeal Ο) x) = Ideal.Quotient.mk (nullIdeal Ο) (star x) := rfl | |
| theorem normLimit_eq_of_sub_mem (Ο : Ultrafilter β) {x y : BoundedSeq A} | |
| (h : x-y β nullIdeal Ο) : normLimit Ο x = normLimit Ο y := by | |
| change normLimit Ο (x-y) = 0 at h | |
| apply le_antisymm | |
| Β· have h' := normLimit_sub_le Ο x y | |
| linarith | |
| Β· have h' := normLimit_sub_le Ο y x | |
| rw [β neg_sub x y, normLimit_neg, h] at h' | |
| linarith | |
| theorem normLimit_le_quotient (Ο : Ultrafilter β) (x : BoundedSeq A) : | |
| normLimit Ο x β€ βIdeal.Quotient.mk (nullIdeal Ο) xβ := by | |
| apply QuotientAddGroup.le_norm_iff.mpr | |
| intro y hy | |
| have h : y-x β nullIdeal Ο := (Ideal.Quotient.eq).mp hy | |
| rw [β normLimit_eq_of_sub_mem Ο h] | |
| exact normLimit_le Ο y | |
| theorem cutRepresentative_norm_le (x : BoundedSeq A) (c : β) (hc : 0 β€ c) : | |
| βcutRepresentative x c hcβ β€ c := by | |
| apply (BoundedContinuousFunction.norm_le hc).mpr | |
| intro n | |
| change βif βx nβ < c then x n else 0β β€ c | |
| split_ifs with h | |
| Β· exact h.le | |
| Β· simpa only [norm_zero] using hc | |
| theorem cutRepresentative_mk_eq (Ο : Ultrafilter β) (x : BoundedSeq A) | |
| (c : β) (hc : 0 β€ c) (hlim : normLimit Ο x < c) : | |
| Ideal.Quotient.mk (nullIdeal Ο) x = | |
| Ideal.Quotient.mk (nullIdeal Ο) (cutRepresentative x c hc) := by | |
| rw [Ideal.Quotient.eq, mem_nullIdeal] | |
| have he : βαΆ n in (Ο : Filter β), βx nβ < c := | |
| (tendsto_norm Ο x).eventually (eventually_lt_nhds hlim) | |
| have hz : Tendsto (fun _ : β => (0 : β)) (Ο : Filter β) (π 0) := tendsto_const_nhds | |
| apply hz.congr' | |
| filter_upwards [he] with n hn | |
| change (0 : β) = βx n - (if βx nβ < c then x n else 0)β | |
| rw [ite_eq_left hn, sub_self, norm_zero] | |
| theorem quotient_norm_le_normLimit (Ο : Ultrafilter β) (x : BoundedSeq A) : | |
| βIdeal.Quotient.mk (nullIdeal Ο) xβ β€ normLimit Ο x := by | |
| apply le_of_forall_pos_le_add | |
| intro Ξ΅ hΞ΅ | |
| have hpos : 0 β€ normLimit Ο x + Ξ΅ := add_nonneg (normLimit_nonneg Ο x) hΞ΅.le | |
| rw [cutRepresentative_mk_eq Ο x (normLimit Ο x + Ξ΅) hpos (lt_add_of_pos_right _ hΞ΅)] | |
| have hb := Submodule.Quotient.norm_mk_le (nullIdeal Ο) | |
| (cutRepresentative x (normLimit Ο x + Ξ΅) hpos) | |
| exact hb.trans (cutRepresentative_norm_le x (normLimit Ο x + Ξ΅) hpos) | |
| theorem norm_mk_eq (Ο : Ultrafilter β) (x : BoundedSeq A) : | |
| βIdeal.Quotient.mk (nullIdeal Ο) xβ = normLimit Ο x := | |
| le_antisymm (quotient_norm_le_normLimit Ο x) (normLimit_le_quotient Ο x) | |
| theorem normLimit_const (Ο : Ultrafilter β) (a : A) : | |
| normLimit Ο (constantSeq a) = βaβ := | |
| tendsto_nhds_unique (tendsto_norm Ο (constantSeq a)) tendsto_const_nhds | |
| @[simp] | |
| theorem norm_diagonal (Ο : Ultrafilter β) (a : A) : βdiagonal Ο aβ = βaβ := by | |
| change βIdeal.Quotient.mk (nullIdeal Ο) (constantSeq a)β = βaβ | |
| rw [norm_mk_eq, normLimit_const] | |
| theorem diagonal_isometry (Ο : Ultrafilter β) : Isometry (diagonal (A := A) Ο) := by | |
| apply Isometry.of_dist_eq | |
| intro a b | |
| rw [dist_eq_norm, β map_sub, norm_diagonal, dist_eq_norm] | |
| instance quotientNontrivial (Ο : Ultrafilter β) [Nontrivial A] : Nontrivial (Algebra A Ο) := | |
| (diagonal_isometry Ο).injective.nontrivial | |
| instance centralNontrivial (Ο : Ultrafilter β) [Nontrivial A] : | |
| Nontrivial (CentralAlgebra A Ο) := inferInstance | |
| theorem mem_central_iff (Ο : Ultrafilter β) (z : Algebra A Ο) : | |
| z β centralSubalgebra Ο β β a : A, diagonal Ο a * z = z * diagonal Ο a := by | |
| change z β StarSubalgebra.centralizer β (Set.range (diagonal Ο)) β _ | |
| rw [StarSubalgebra.mem_centralizer_iff] | |
| constructor | |
| Β· intro h a | |
| exact (h (diagonal Ο a) β¨a, rflβ©).1 | |
| Β· intro h x hx | |
| obtain β¨a, rflβ© := hx | |
| exact β¨h a, by simpa only [map_star] using h (star a)β© | |
| theorem mk_mem_central_iff (Ο : Ultrafilter β) (x : BoundedSeq A) : | |
| quotientMap Ο x β centralSubalgebra Ο β | |
| β a : A, Tendsto (fun n => βx n * a - a * x nβ) (Ο : Filter β) (π 0) := by | |
| rw [mem_central_iff] | |
| constructor | |
| Β· intro h a | |
| have he : Ideal.Quotient.mk (nullIdeal Ο) (x * constantSeq a) = | |
| Ideal.Quotient.mk (nullIdeal Ο) (constantSeq a * x) := (h a).symm | |
| exact (mem_nullIdeal Ο _).mp (Ideal.Quotient.eq.mp he) | |
| Β· intro h a | |
| have he : x * constantSeq a - constantSeq a * x β nullIdeal Ο := | |
| (mem_nullIdeal Ο _).mpr (h a) | |
| exact (Ideal.Quotient.eq.mpr he).symm | |
| end NormUltrapower | |
| end KirchbergRordam | |
| end | |
| end OAI | |