Download data/lean/OAI/Probability/FreeIsing/Spectral/SpectralTransfer.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 8.05 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/FreeIsing/Spectral/SpectralTransfer.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/FreeIsing/Spectral/SpectralTransfer.lean
-
curl -L -o SpectralTransfer.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/FreeIsing/Spectral/SpectralTransfer.lean
8.05 kB
| import Mathlib | |
| namespace OAI | |
| open Filter | |
| open scoped Topology | |
| namespace Problem367 | |
| section | |
| variable {π : Type*} [RCLike π] | |
| variable {E : Type*} [NormedAddCommGroup E] [InnerProductSpace π E] | |
| [CompleteSpace E] | |
| lemma selfAdjoint_pow_norm_sq_le (T : E βL[π] E) (hT : IsSelfAdjoint T) | |
| (x : E) (n : β) : | |
| β(T ^ n) xβ ^ 2 β€ β(T ^ (2 * n)) xβ * βxβ := by | |
| calc | |
| β(T ^ n) xβ ^ 2 = RCLike.re (inner π ((T ^ n) x) ((T ^ n) x)) := | |
| (inner_self_eq_norm_sq _).symm | |
| _ = RCLike.re (inner π ((T ^ n) ((T ^ n) x)) x) := | |
| congrArg RCLike.re ((hT.pow n).isSymmetric ((T ^ n) x) x).symm | |
| _ = RCLike.re (inner π ((T ^ (2 * n)) x) x) := by | |
| rw [two_mul, pow_add, mul_apply_eq_comp] | |
| _ β€ β(T ^ (2 * n)) xβ * βxβ := re_inner_le_norm _ _ | |
| lemma selfAdjoint_norm_pow_two_pow_le (T : E βL[π] E) (hT : IsSelfAdjoint T) | |
| (x : E) (hx : βxβ = 1) (n : β) : | |
| βT xβ ^ (2 ^ n) β€ β(T ^ (2 ^ n)) xβ := by | |
| induction n with | |
| | zero => simp | |
| | succ n hn => | |
| calc | |
| βT xβ ^ (2 ^ (n + 1)) = (βT xβ ^ (2 ^ n)) ^ 2 := by | |
| rw [pow_succ, pow_mul] | |
| _ β€ β(T ^ (2 ^ n)) xβ ^ 2 := | |
| pow_le_pow_leftβ (by positivity) hn 2 | |
| _ β€ β(T ^ (2 * 2 ^ n)) xβ := by | |
| simpa [hx] using selfAdjoint_pow_norm_sq_le T hT x (2 ^ n) | |
| _ = β(T ^ (2 ^ (n + 1))) xβ := by rw [pow_succ, Nat.mul_comm] | |
| lemma selfAdjoint_norm_apply_le_of_unit_power_bound | |
| (T : E βL[π] E) (hT : IsSelfAdjoint T) (x : E) (hx : βxβ = 1) | |
| {rho C : β} (hrho : 0 β€ rho) | |
| (hbound : β n : β, β(T ^ n) xβ β€ C * rho ^ n) : | |
| βT xβ β€ rho := by | |
| rcases eq_or_lt_of_le hrho with hrho | hrho | |
| Β· simpa [β hrho] using hbound 1 | |
| by_contra hnot | |
| have hratio : 1 < βT xβ / rho := (one_lt_div hrho).2 (lt_of_not_ge hnot) | |
| have hlim : Tendsto (fun n : β => (βT xβ / rho) ^ (2 ^ n)) atTop atTop := | |
| (tendsto_pow_atTop_atTop_of_one_lt hratio).comp | |
| (tendsto_pow_atTop_atTop_of_one_lt (by norm_num : (1 : β) < 2)) | |
| obtain β¨n, hnβ© := (hlim.eventually_gt_atTop C).exists | |
| have hle : (βT xβ / rho) ^ (2 ^ n) β€ C := by | |
| rw [div_pow, div_le_iffβ (pow_pos hrho _)] | |
| exact (selfAdjoint_norm_pow_two_pow_le T hT x hx n).trans (hbound (2 ^ n)) | |
| exact (not_lt_of_ge hle) hn | |
| lemma selfAdjoint_norm_apply_le_of_power_bound | |
| (T : E βL[π] E) (hT : IsSelfAdjoint T) (x : E) | |
| {rho C : β} (hrho : 0 β€ rho) | |
| (hbound : β n : β, β(T ^ n) xβ β€ C * rho ^ n) : | |
| βT xβ β€ rho * βxβ := by | |
| by_cases hx : x = 0 | |
| Β· simp [hx] | |
| have hnx : 0 < βxβ := norm_pos_iff.mpr hx | |
| have hi : 0 β€ βxββ»ΒΉ := inv_nonneg.mpr (norm_nonneg x) | |
| let y : E := ((βxββ»ΒΉ : β) : π) β’ x | |
| have hy : βyβ = 1 := by | |
| simp [y, norm_smul, inv_mul_cancelβ hnx.ne'] | |
| have hby (n : β) : β(T ^ n) yβ β€ (βxββ»ΒΉ * C) * rho ^ n := by | |
| simpa [y, norm_smul, RCLike.norm_ofReal, abs_of_nonneg hi, mul_assoc] using | |
| mul_le_mul_of_nonneg_left (hbound n) hi | |
| have h := selfAdjoint_norm_apply_le_of_unit_power_bound T hT y hy hrho hby | |
| have hdiv : βT xβ / βxβ β€ rho := by | |
| simpa [y, norm_smul, RCLike.norm_ofReal, abs_of_nonneg hi, div_eq_mul_inv, mul_comm] | |
| using h | |
| exact (div_le_iffβ hnx).mp hdiv | |
| lemma selfAdjoint_norm_apply_le_on_closure_of_power_bound | |
| (T : E βL[π] E) (hT : IsSelfAdjoint T) {rho : β} (hrho : 0 β€ rho) | |
| {s : Set E} | |
| (hbound : β x β s, β C : β, β n : β, β(T ^ n) xβ β€ C * rho ^ n) | |
| {x : E} (hx : x β closure s) : βT xβ β€ rho * βxβ := by | |
| have hc : IsClosed {x : E | βT xβ β€ rho * βxβ} := | |
| isClosed_le T.continuous.norm (continuous_const.mul continuous_norm) | |
| have hsub : s β {x : E | βT xβ β€ rho * βxβ} := by | |
| intro x hx | |
| obtain β¨C, hCβ© := hbound x hx | |
| exact selfAdjoint_norm_apply_le_of_power_bound T hT x hrho hC | |
| exact hc.closure_subset_iff.mpr hsub hx | |
| lemma selfAdjoint_opNorm_le_of_dense_power_bound | |
| (T : E βL[π] E) (hT : IsSelfAdjoint T) {rho : β} (hrho : 0 β€ rho) | |
| {s : Set E} (hs : Dense s) | |
| (hbound : β x β s, β C : β, β n : β, β(T ^ n) xβ β€ C * rho ^ n) : | |
| βTβ β€ rho := by | |
| refine T.opNorm_le_bound hrho fun x => ?_ | |
| exact selfAdjoint_norm_apply_le_on_closure_of_power_bound T hT hrho hbound | |
| (by rw [hs.closure_eq]; trivial) | |
| lemma selfAdjoint_opNorm_le_of_dense_even_moment_bound | |
| (T : E βL[π] E) (hT : IsSelfAdjoint T) {rho : β} (hrho : 0 β€ rho) | |
| {s : Set E} (hs : Dense s) | |
| (hmoment : β x β s, β C : β, β n : β, | |
| RCLike.re (inner π x ((T ^ (2 * n)) x)) β€ C * rho ^ (2 * n)) : | |
| βTβ β€ rho := by | |
| apply selfAdjoint_opNorm_le_of_dense_power_bound T hT hrho hs | |
| intro x hx | |
| obtain β¨C, hCβ© := hmoment x hx | |
| have hC0 : 0 β€ C := by | |
| have h := hC 0 | |
| simp only [Nat.mul_zero, pow_zero, one_apply_eq_self, mul_one, | |
| inner_self_eq_norm_sq] at h | |
| exact (sq_nonneg βxβ).trans h | |
| refine β¨Real.sqrt C, fun n => ?_β© | |
| apply (sq_le_sqβ (norm_nonneg _) (mul_nonneg (Real.sqrt_nonneg _) (pow_nonneg hrho _))).mp | |
| rw [mul_pow, Real.sq_sqrt hC0, β pow_mul, Nat.mul_comm n 2] | |
| have heq : β(T ^ n) xβ ^ 2 = RCLike.re (inner π x ((T ^ (2 * n)) x)) := by | |
| calc | |
| β(T ^ n) xβ ^ 2 = RCLike.re (inner π ((T ^ n) x) ((T ^ n) x)) := | |
| (inner_self_eq_norm_sq _).symm | |
| _ = RCLike.re (inner π x ((T ^ n) ((T ^ n) x))) := | |
| congrArg RCLike.re ((hT.pow n).isSymmetric x ((T ^ n) x)) | |
| _ = RCLike.re (inner π x ((T ^ (2 * n)) x)) := by | |
| rw [two_mul, pow_add, mul_apply_eq_comp] | |
| rw [heq] | |
| exact hC n | |
| omit [CompleteSpace E] in | |
| lemma norm_pow_apply_le_of_intertwiner | |
| {G : Type*} [NormedAddCommGroup G] [NormedSpace π G] | |
| (T : E βL[π] E) (A : G βL[π] G) (D : G βL[π] E) | |
| (hcomm : β x : G, T (D x) = D (A x)) {rho : β} | |
| (hrho : 0 β€ rho) (hA : βAβ β€ rho) (x : G) (n : β) : | |
| β(T ^ n) (D x)β β€ (βDβ * βxβ) * rho ^ n := by | |
| have hp (n : β) : (T ^ n) (D x) = D ((A ^ n) x) := by | |
| induction n with | |
| | zero => simp | |
| | succ n hn => | |
| simp only [pow_succ', mul_apply_eq_comp, hn, hcomm] | |
| have hb (n : β) : β(A ^ n) xβ β€ rho ^ n * βxβ := by | |
| induction n with | |
| | zero => simp | |
| | succ n hn => | |
| rw [pow_succ', mul_apply_eq_comp] | |
| calc | |
| βA ((A ^ n) x)β β€ βAβ * β(A ^ n) xβ := A.le_opNorm _ | |
| _ β€ rho * (rho ^ n * βxβ) := | |
| mul_le_mul hA hn (norm_nonneg _) hrho | |
| _ = rho ^ (n + 1) * βxβ := by ring | |
| rw [hp] | |
| calc | |
| βD ((A ^ n) x)β β€ βDβ * β(A ^ n) xβ := D.le_opNorm _ | |
| _ β€ βDβ * (rho ^ n * βxβ) := | |
| mul_le_mul_of_nonneg_left (hb n) (norm_nonneg _) | |
| _ = (βDβ * βxβ) * rho ^ n := by ring | |
| lemma selfAdjoint_norm_apply_le_on_closure_range_of_intertwiner | |
| {G : Type*} [NormedAddCommGroup G] [NormedSpace π G] | |
| (T : E βL[π] E) (hT : IsSelfAdjoint T) (A : G βL[π] G) | |
| (D : G βL[π] E) (hcomm : β x : G, T (D x) = D (A x)) | |
| {rho : β} (hrho : 0 β€ rho) (hA : βAβ β€ rho) | |
| {x : E} (hx : x β closure (Set.range D)) : βT xβ β€ rho * βxβ := by | |
| apply selfAdjoint_norm_apply_le_on_closure_of_power_bound T hT hrho (s := Set.range D) ?_ hx | |
| rintro _ β¨y, rflβ© | |
| exact β¨βDβ * βyβ, norm_pow_apply_le_of_intertwiner T A D hcomm hrho hA yβ© | |
| lemma selfAdjoint_opNorm_le_of_dense_intertwiner | |
| {G : Type*} [NormedAddCommGroup G] [NormedSpace π G] | |
| (T : E βL[π] E) (hT : IsSelfAdjoint T) (A : G βL[π] G) | |
| (D : G βL[π] E) (hD : DenseRange D) | |
| (hcomm : β x : G, T (D x) = D (A x)) {rho : β} | |
| (hrho : 0 β€ rho) (hA : βAβ β€ rho) : βTβ β€ rho := by | |
| refine T.opNorm_le_bound hrho fun x => ?_ | |
| exact selfAdjoint_norm_apply_le_on_closure_range_of_intertwiner T hT A D hcomm hrho hA | |
| (by rw [hD.closure_range]; trivial) | |
| end | |
| end Problem367 | |
| end OAI | |