math / data /lean /OAI /Probability /FreeIsing /Spectral /SpectralTransfer.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
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