import Mathlib import OAI.Probability.SKBarriers.Replicas.MatrixCovarianceAlgebra import OAI.Probability.SKBarriers.Hierarchy.BlockCovarianceComparison namespace OAI section noncomputable section open scoped BigOperators open MeasureTheory ProbabilityTheory Filter Set namespace SK.Analytic attribute [local instance 2000] parameterNormedGroup parameterNormedSpace def matrixInner (d : ℕ) (Q R : Fin d → Fin d → ℝ) : ℝ := ∑ a, ∑ b, Q a b*R a b def matrixSquare (d : ℕ) (Q : Fin d → Fin d → ℝ) : ℝ := ∑ a, ∑ b, (Q a b)^2 theorem matrixSquare_sub (d : ℕ) (R Q : Fin d → Fin d → ℝ) : matrixSquare d (fun a b => R a b-Q a b)=matrixSquare d R-2*matrixInner d Q R+matrixSquare d Q := by simp only [matrixSquare,matrixInner,Finset.mul_sum,← Finset.sum_sub_distrib,← Finset.sum_add_distrib] apply Finset.sum_congr rfl intro a _ apply Finset.sum_congr rfl intro b _ ring theorem matrixSquare_nonneg (d : ℕ) (R : Fin d → Fin d → ℝ) : 0 ≤ matrixSquare d R := Finset.sum_nonneg (fun _ _ => Finset.sum_nonneg (fun _ _ => sq_nonneg _)) theorem matrixCovariance_lower (d : ℕ) (R Q : Fin d → Fin d → ℝ) : -matrixSquare d Q ≤ matrixSquare d R-2*matrixInner d Q R := by have H := matrixSquare_nonneg d (fun a b => R a b-Q a b) rw [matrixSquare_sub] at H linarith def factorPath (d r k : ℕ) (B : Fin (k+1) → Fin r → Fin d → ℝ) (j : Fin (k+1)) (a b : Fin d) : ℝ := ∑ l, if l ≤ j then factorCovariance d r (B l) a b else 0 theorem factorPath_last (d r k : ℕ) (B : Fin (k+1) → Fin r → Fin d → ℝ) (a b : Fin d) : factorPath d r k B (Fin.last k) a b=∑ l, factorCovariance d r (B l) a b := by simp only [factorPath,Fin.le_last,ite_true] theorem factorPath_inner (d r k : ℕ) (B : Fin (k+1) → Fin r → Fin d → ℝ) (j : Fin (k+1)) (R : Fin d → Fin d → ℝ) : matrixInner d (factorPath d r k B j) R= ∑ l, if l ≤ j then matrixInner d (factorCovariance d r (B l)) R else 0 := by simp only [matrixInner,factorPath,Finset.sum_mul,ite_mul,zero_mul] calc _ = ∑ a, ∑ l, ∑ b, if l ≤ j then factorCovariance d r (B l) a b*R a b else 0 := by apply Finset.sum_congr rfl intro a _ exact Finset.sum_comm _ = ∑ l, ∑ a, ∑ b, if l ≤ j then factorCovariance d r (B l) a b*R a b else 0 := Finset.sum_comm _ = _ := by apply Finset.sum_congr rfl intro l _ split_ifs <;> simp only [Finset.sum_const_zero] section variable {S : Type} [Fintype S] [Nonempty S] def matrixHamiltonianObservables (N d : ℕ) (β : ℝ) (X : S → Fin N → Fin d → ℝ) : Fin (N*N) → S → ℝ := fun u s => matrixPairFeature N d β (X s) (finProdFinEquiv.symm u) def matrixFieldObservables (N d r k : ℕ) (β : ℝ) (B : Fin (k+1) → Fin r → Fin d → ℝ) (X : S → Fin N → Fin d → ℝ) : Fin (k+1) → Fin (N*r) → S → ℝ := fun l u s => matrixFieldFeature N d r β (B l) (X s) (finProdFinEquiv.symm u) omit [Fintype S] [Nonempty S] in theorem matrixHamiltonianObservables_covariance {N d : ℕ} (hN : 0 simp theorem matrixFiniteInterpolation {N d r k : ℕ} (hN : 0 K*matrixSquare d (factorPath d r k B j)) (fun s => by simp only [pow_two] rw [matrixHamiltonianObservables_covariance hN] have HF := matrixFieldObservables_prefix β B X (Fin.last k) s s simp only [Fin.le_last,ite_true] at HF rw [HF,hself s] dsimp only [K] ring_nf exact le_rfl) (fun j s t => by rw [matrixHamiltonianObservables_covariance hN,matrixFieldObservables_prefix] have HK := mul_le_mul_of_nonneg_left (matrixCovariance_lower d (replicaCrossOverlap N d (X s) (X t)) (factorPath d r k B j)) hK dsimp only [K] at HK ⊢ nlinarith) have he : (∑ j, w j*(K*matrixSquare d (factorPath d r k B j)))= K*∑ j, w j*matrixSquare d (factorPath d r k B j) := by rw [Finset.mul_sum] apply Finset.sum_congr rfl intro j _ ring rw [he] at H dsimp only convert H using 1 dsimp only [K] ring end end SK.Analytic end end end OAI