math / data /lean /OAI /Probability /InvariantIsing /Arrays /OverlapBounds.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
4.74 kB
import OAI.Probability.InvariantIsing.Arrays.Overlaps
import OAI.Probability.InvariantIsing.Pressure.PressureLipschitz
namespace OAI
/-! Dimension-independent bounds for projected spectral overlap kernels. -/
noncomputable section
open MeasureTheory
open scoped BigOperators
namespace InvariantIsing
lemma projected_spin_sq_sum_le {N : β„•} (U : Rotation N) (I : Finset (Fin N)) (Οƒ : Spin N) :
(βˆ‘ i ∈ I, U (spinVector Οƒ) i ^ 2) ≀ N := by
rw [← rotated_spin_sq_sum U Οƒ]
exact Finset.sum_le_sum_of_subset_of_nonneg (Finset.subset_univ I) (fun _ _ _ => sq_nonneg _)
lemma projectedOverlap_abs_le_one {N : β„•} (U : Rotation N) (I : Finset (Fin N)) (Οƒ Ο„ : Spin N) :
|projectedOverlap U I Οƒ Ο„| ≀ 1 := by
have hcs := Finset.sum_mul_sq_le_sq_mul_sq I
(fun i => U (spinVector Οƒ) i) (fun i => U (spinVector Ο„) i)
have hs : (βˆ‘ i ∈ I, U (spinVector Οƒ) i * U (spinVector Ο„) i) ^ 2 ≀ (N : ℝ) ^ 2 := by
apply hcs.trans
simpa only [pow_two] using
(mul_le_mul (projected_spin_sq_sum_le U I Οƒ) (projected_spin_sq_sum_le U I Ο„)
(Finset.sum_nonneg fun _ _ => sq_nonneg _) (Nat.cast_nonneg _))
have ha : |βˆ‘ i ∈ I, U (spinVector Οƒ) i * U (spinVector Ο„) i| ≀ N :=
(sq_le_sqβ‚€ (abs_nonneg _) (Nat.cast_nonneg _)).mp (by simpa only [sq_abs] using hs)
unfold projectedOverlap
rw [abs_mul, abs_of_nonneg (show (0 : ℝ) ≀ (N : ℝ)⁻¹ by positivity)]
by_cases hN : N = 0
Β· simp [hN]
Β· have hn : (N : ℝ) β‰  0 := by exact_mod_cast hN
exact (mul_le_mul_of_nonneg_left ha (by positivity)).trans_eq (inv_mul_cancelβ‚€ hn)
lemma projectedOverlap_self_le_one {N : β„•} (U : Rotation N) (I : Finset (Fin N)) (Οƒ : Spin N) :
projectedOverlap U I Οƒ Οƒ ≀ 1 :=
(le_abs_self _).trans (projectedOverlap_abs_le_one U I Οƒ Οƒ)
lemma abs_projected_cross_difference_sum_le {N : β„•}
(U V W : SpecialOrthogonal N) (I : Finset (Fin N)) (Οƒ Ο„ : Spin N) :
|βˆ‘ i ∈ I, (specialRotation U (spinVector Οƒ) i - specialRotation V (spinVector Οƒ) i) *
specialRotation W (spinVector Ο„) i| ≀ N * frobeniusDistance U V := by
let d := frobeniusDistance U V
let x := fun i => specialRotation U (spinVector Οƒ) i - specialRotation V (spinVector Οƒ) i
let y := fun i => specialRotation W (spinVector Ο„) i
have hd : 0 ≀ d := Real.sqrt_nonneg _
have hx : (βˆ‘ i ∈ I, x i ^ 2) ≀ N * d ^ 2 := by
exact (Finset.sum_le_sum_of_subset_of_nonneg (Finset.subset_univ I)
(fun _ _ _ => sq_nonneg _)).trans (specialRotation_spin_dist_sq_le U V Οƒ)
have hy : (βˆ‘ i ∈ I, y i ^ 2) ≀ N := projected_spin_sq_sum_le _ I Ο„
have hsq : (βˆ‘ i ∈ I, x i * y i) ^ 2 ≀ ((N : ℝ) * d) ^ 2 := by
calc
_ ≀ (βˆ‘ i ∈ I, x i ^ 2) * βˆ‘ i ∈ I, y i ^ 2 := Finset.sum_mul_sq_le_sq_mul_sq I x y
_ ≀ ((N : ℝ) * d ^ 2) * N := mul_le_mul hx hy
(Finset.sum_nonneg fun _ _ => sq_nonneg _) (by positivity)
_ = _ := by ring
exact (sq_le_sqβ‚€ (abs_nonneg _) (by positivity)).mp (by simpa only [sq_abs] using hsq)
/-- Every projected overlap has a uniform Frobenius Lipschitz constant. This
controls the covariances of the Gaussian GG perturbations. -/
theorem abs_projectedOverlap_sub_rotation_le {N : β„•} (hN : 0 < N)
(U V : SpecialOrthogonal N) (I : Finset (Fin N)) (Οƒ Ο„ : Spin N) :
|projectedOverlap (specialRotation U) I Οƒ Ο„ - projectedOverlap (specialRotation V) I Οƒ Ο„| ≀
2 * frobeniusDistance U V := by
let A := βˆ‘ i ∈ I, (specialRotation U (spinVector Οƒ) i - specialRotation V (spinVector Οƒ) i) *
specialRotation U (spinVector Ο„) i
let B := βˆ‘ i ∈ I, (specialRotation U (spinVector Ο„) i - specialRotation V (spinVector Ο„) i) *
specialRotation V (spinVector Οƒ) i
have hA : |A| ≀ N * frobeniusDistance U V := abs_projected_cross_difference_sum_le U V U I Οƒ Ο„
have hB : |B| ≀ N * frobeniusDistance U V := abs_projected_cross_difference_sum_le U V V I Ο„ Οƒ
have he : projectedOverlap (specialRotation U) I Οƒ Ο„ - projectedOverlap (specialRotation V) I Οƒ Ο„ =
(N : ℝ)⁻¹ * (A + B) := by
unfold projectedOverlap
rw [← mul_sub]
congr 1
dsimp only [A, B]
rw [← Finset.sum_sub_distrib, ← Finset.sum_add_distrib]
apply Finset.sum_congr rfl
intro i _
ring
have hb : |A + B| ≀ 2 * N * frobeniusDistance U V := by
have h := (abs_add_le A B).trans (add_le_add hA hB)
linarith
rw [he, abs_mul, abs_of_nonneg (show (0 : ℝ) ≀ (N : ℝ)⁻¹ by positivity)]
have hn : (N : ℝ) β‰  0 := by exact_mod_cast hN.ne'
calc
_ ≀ (N : ℝ)⁻¹ * (2 * N * frobeniusDistance U V) := mul_le_mul_of_nonneg_left hb (by positivity)
_ = _ := by field_simp
end InvariantIsing
end
end OAI