Download data/lean/OAI/Probability/CriticalPercolation/GraphGeometry/HittingSubAvoidance.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 2.32 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/CriticalPercolation/GraphGeometry/HittingSubAvoidance.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/CriticalPercolation/GraphGeometry/HittingSubAvoidance.lean
-
curl -L -o HittingSubAvoidance.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/CriticalPercolation/GraphGeometry/HittingSubAvoidance.lean
2.32 kB
| import Mathlib | |
| import OAI.Probability.CriticalPercolation.Clusters.ClusterUpdate | |
| import OAI.Probability.CriticalPercolation.Clusters.Earlier | |
| import OAI.Probability.CriticalPercolation.Clusters.HitValue | |
| import OAI.Probability.CriticalPercolation.GraphGeometry.LastInverseDiagonal | |
| namespace OAI | |
| section | |
| section | |
| open Set MeasureTheory ProbabilityTheory | |
| open scoped BigOperators | |
| namespace CriticalPercolation.BondGraph | |
| open CriticalPercolation.FiniteProduct CriticalPercolation.ClusterDeletion | |
| open CriticalPercolation.ClusterColumns | |
| open scoped Classical | |
| variable {V E : Type*} [Fintype V] [Fintype E] (G : BondGraph V E) | |
| omit [Fintype V] in | |
| lemma hitting_eq_one_sub_avoidance (w : E β Prop β β) | |
| (hw : β e, β b, w e b = 1) (A : Set V) (s : V) : | |
| expect w (fun Ο => hitValue A (component (G.openGraph Ο) s)) = | |
| 1 - G.avoidedAverage w A s (fun _ => 1) := by | |
| conv_rhs => lhs; rw [β expect_const w hw 1] | |
| unfold avoidedAverage | |
| erw [β expect_sub] | |
| congr 1 | |
| funext Ο | |
| simp only [hitValue, component_inter_nonempty_iff] | |
| split_ifs <;> norm_num | |
| lemma finite_joint_gluing_list {n : β} (w : E β Prop β β) | |
| (hw : β e, β b, w e b = 1) (hpos : β e b, 0 β€ w e b) | |
| (hclosed : β e, 0 < w e False) (x : Fin (n+1) β V) (hx : Function.Injective x) | |
| (T : Set V) (a : β) (ha : β j : Fin n, a β€ expect w | |
| (fun Ο => hitValue T (component (G.openGraph Ο) (x j.castSucc)))) : | |
| expect w (fun Ο => hitValue (earlier x (Fin.last n)) | |
| (component (G.openGraph Ο) (x (Fin.last n)))) * a β€ | |
| expect w (fun Ο => jointHitValue (earlier x (Fin.last n)) T | |
| (component (G.openGraph Ο) (x (Fin.last n)))) := by | |
| rw [G.hitting_eq_one_sub_avoidance w hw] | |
| apply G.finite_cluster_relay w hw hpos hclosed x hx | |
| (jointHitValue_monotone _ _) (jointHitValue_nonneg _ _) | |
| intro j | |
| have he : (fun Ο : E β Prop => jointHitValue (earlier x (Fin.last n)) T | |
| (component (G.openGraph Ο) (x j.castSucc))) = | |
| (fun Ο => hitValue T (component (G.openGraph Ο) (x j.castSucc))) := by | |
| funext Ο | |
| apply jointHitValue_eq_hitValue | |
| exact β¨x j.castSucc, component_self _ _, β¨j.castSucc, Fin.castSucc_lt_last j, rflβ©β© | |
| rw [he] | |
| exact ha j | |
| end CriticalPercolation.BondGraph | |
| open Set MeasureTheory ProbabilityTheory | |
| end | |
| end | |
| end OAI | |