math / data /lean /OAI /Probability /FreeIsing /Energy /ComponentCovariance.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
6 kB
import OAI.Probability.FreeIsing.Estimates.ComponentPairCount
import OAI.Probability.FreeIsing.Estimates.PairCorrelation
namespace OAI
noncomputable section
open MeasureTheory
namespace Problem367
theorem componentWordDistance_eq_reducedWordDistance {Ξ± : Type*} [DecidableEq Ξ±]
(u v : List Ξ±) : componentWordDistance u v = reducedWordDistance u v := by
induction u generalizing v with
| nil => rfl
| cons a u ih =>
cases v with
| nil => rfl
| cons b v =>
by_cases hab : a = b <;> simp [componentWordDistance, reducedWordDistance, hab, ih]
def componentVertex {d n : β„•} {c : Fin d} (u : ReducedTail c n) : TreeVertex d :=
⟨c :: u.1, u.2.2⟩
theorem componentVertex_injective {d n : β„•} {c : Fin d} :
Function.Injective (componentVertex : ReducedTail c n β†’ TreeVertex d) := by
intro u v h
apply Subtype.ext
exact (List.cons.inj (congrArg Subtype.val h)).2
theorem HasFreeIsingLaw.component_pair_correlation {d : β„•} {theta : ℝ}
{mu : Measure (TreeVertex d β†’ IsingSpin)}
(hmu : HasFreeIsingLaw theta mu) (hlo : -1 ≀ theta) (hhi : theta ≀ 1)
{c : Fin d} {k l : β„•} (u : ReducedTail c k) (v : ReducedTail c l) :
(∫ x, spinSign (x (componentVertex u)) * spinSign (x (componentVertex v)) βˆ‚mu) =
theta ^ componentWordDistance u.1 v.1 := by
rw [hmu.pair_correlation hlo hhi]
simp [componentVertex, componentWordDistance_eq_reducedWordDistance]
theorem HasFreeIsingLaw.component_level_covariance_critical {d : β„•} {theta : ℝ}
{mu : Measure (TreeVertex d β†’ IsingSpin)}
(hmu : HasFreeIsingLaw theta mu) (hlo : -1 ≀ theta) (hhi : theta ≀ 1)
(c : Fin d) (hcritical : ((d - 1 : β„•) : ℝ) * theta ^ 2 = 1) (k l : β„•) :
(βˆ‘ u : ReducedTail c k, βˆ‘ v : ReducedTail c l, theta ^ k * theta ^ l *
(∫ x, spinSign (x (componentVertex u)) * spinSign (x (componentVertex v)) βˆ‚mu)) =
1 + (min k l : β„•) * (1 - theta ^ 2) := by
simp_rw [hmu.component_pair_correlation hlo hhi]
exact sum_component_weighted_correlation_critical theta c hcritical k l
theorem HasFreeIsingLaw.component_covariance_sum_critical_le {d : β„•} {theta : ℝ}
{mu : Measure (TreeVertex d β†’ IsingSpin)}
(hmu : HasFreeIsingLaw theta mu) (hlo : -1 ≀ theta) (hhi : theta ≀ 1)
(c : Fin d) (hcritical : ((d - 1 : β„•) : ℝ) * theta ^ 2 = 1) (n : β„•) :
(βˆ‘ k ∈ Finset.range (n + 1), βˆ‘ l ∈ Finset.range (n + 1),
βˆ‘ u : ReducedTail c k, βˆ‘ v : ReducedTail c l, theta ^ k * theta ^ l *
(∫ x, spinSign (x (componentVertex u)) * spinSign (x (componentVertex v)) βˆ‚mu)) ≀
(n + 1 : ℝ) ^ 3 := by
simp_rw [hmu.component_pair_correlation hlo hhi]
exact sum_component_weighted_correlation_critical_le theta c hcritical n
theorem HasFreeIsingLaw.component_root_correlation {d : β„•} {theta : ℝ}
{mu : Measure (TreeVertex d β†’ IsingSpin)}
(hmu : HasFreeIsingLaw theta mu) (hlo : -1 ≀ theta) (hhi : theta ≀ 1)
{c : Fin d} {k : β„•} (u : ReducedTail c k) :
(∫ x, spinSign (x ⟨[c], List.IsChain.singleton c⟩) *
spinSign (x (componentVertex u)) βˆ‚mu) = theta ^ k := by
rw [hmu.pair_correlation hlo hhi]
simp only [componentVertex, reducedWordDistance_cons_same, reducedWordDistance_nil_left, u.2.1]
theorem HasFreeIsingLaw.component_level_signal_critical {d : β„•} {theta : ℝ}
{mu : Measure (TreeVertex d β†’ IsingSpin)}
(hmu : HasFreeIsingLaw theta mu) (hlo : -1 ≀ theta) (hhi : theta ≀ 1)
(c : Fin d) (hcritical : ((d - 1 : β„•) : ℝ) * theta ^ 2 = 1) (k : β„•) :
(βˆ‘ u : ReducedTail c k, theta ^ k *
(∫ x, spinSign (x ⟨[c], List.IsChain.singleton c⟩) *
spinSign (x (componentVertex u)) βˆ‚mu)) = 1 := by
simp_rw [hmu.component_root_correlation hlo hhi]
have hlen (u : ReducedTail c k) : u.1.length = k := u.2.1
simpa only [hlen, pow_two] using sum_component_radial_sq_critical theta c hcritical k
theorem HasFreeIsingLaw.component_signal_critical {d : β„•} {theta : ℝ}
{mu : Measure (TreeVertex d β†’ IsingSpin)}
(hmu : HasFreeIsingLaw theta mu) (hlo : -1 ≀ theta) (hhi : theta ≀ 1)
(c : Fin d) (hcritical : ((d - 1 : β„•) : ℝ) * theta ^ 2 = 1) (n : β„•) :
(βˆ‘ k ∈ Finset.range (n + 1), βˆ‘ u : ReducedTail c k, theta ^ k *
(∫ x, spinSign (x ⟨[c], List.IsChain.singleton c⟩) *
spinSign (x (componentVertex u)) βˆ‚mu)) = (n + 1 : ℝ) := by
simp [hmu.component_level_signal_critical hlo hhi c hcritical]
def componentIndexedVertex {d : β„•} {c : Fin d}
(u : Ξ£ k : β„•, ReducedTail c k) : TreeVertex d := componentVertex u.2
theorem componentIndexedVertex_injective {d : β„•} {c : Fin d} :
Function.Injective (componentIndexedVertex (c := c)) := by
rintro ⟨k, u⟩ ⟨l, v⟩ h
have hw : u.1 = v.1 := (List.cons.inj (congrArg Subtype.val h)).2
have hkl : k = l := by rw [← u.2.1, ← v.2.1, hw]
subst l
exact Sigma.ext rfl (heq_of_eq (Subtype.ext hw))
def componentIndexFinset {d : β„•} (c : Fin d) (n : β„•) :
Finset (Ξ£ k : β„•, ReducedTail c k) :=
(Finset.range (n + 1)).sigma (fun _ => Finset.univ)
theorem sum_componentIndexFinset {M : Type*} [AddCommMonoid M]
{d : β„•} (c : Fin d) (n : β„•) (f : (Ξ£ k : β„•, ReducedTail c k) β†’ M) :
(βˆ‘ s ∈ componentIndexFinset c n, f s) =
βˆ‘ k ∈ Finset.range (n + 1), βˆ‘ u : ReducedTail c k, f ⟨k, u⟩ := by
rw [componentIndexFinset, Finset.sum_sigma]
theorem sum_componentIndexFinset_pair {M : Type*} [AddCommMonoid M]
{d : β„•} (c : Fin d) (n : β„•)
(f : (Ξ£ k : β„•, ReducedTail c k) β†’ (Ξ£ k : β„•, ReducedTail c k) β†’ M) :
(βˆ‘ u ∈ componentIndexFinset c n, βˆ‘ v ∈ componentIndexFinset c n, f u v) =
βˆ‘ k ∈ Finset.range (n + 1), βˆ‘ l ∈ Finset.range (n + 1),
βˆ‘ u : ReducedTail c k, βˆ‘ v : ReducedTail c l, f ⟨k, u⟩ ⟨l, v⟩ := by
simp_rw [sum_componentIndexFinset]
apply Finset.sum_congr rfl
intro k _
rw [Finset.sum_comm]
end Problem367
end
end OAI