Download data/lean/OAI/Probability/FreeIsing/Energy/ComponentCovariance.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 6 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/FreeIsing/Energy/ComponentCovariance.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/FreeIsing/Energy/ComponentCovariance.lean
-
curl -L -o ComponentCovariance.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/FreeIsing/Energy/ComponentCovariance.lean
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 | |