File size: 6,520 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 | import Mathlib
import OAI.Probability.CriticalPercolation.Model
import OAI.Probability.CriticalPercolation.Clusters.ForcedDisconnectContinuity
import OAI.Probability.CriticalPercolation.GraphGeometry.GraphBalls
import OAI.Probability.CriticalPercolation.Modular.CriticalHeavyIdentity
import OAI.Probability.CriticalPercolation.Modular.SignedDiscrepancyContinuity
namespace OAI
section
noncomputable section
open Set MeasureTheory Filter
open scoped Classical ENNReal Topology BigOperators
namespace CriticalPercolation.BondGraph
open BernoulliProduct
variable {V E : Type*} (G : BondGraph V E) [Countable V] [Countable E]
lemma integrable_disconnectedIndicator (p : unitInterval) (e : E) :
Integrable (fun Ο => G.disconnectedIndicator Ο e) (G.law p) :=
Integrable.of_bound (G.measurable_disconnectedIndicator e).aestronglyMeasurable 1
(Eventually.of_forall (fun Ο => G.norm_disconnectedIndicator_le Ο e))
lemma integrable_clusterCountDrop (hc : G.fullGraph.Connected) (hl : G.LocallyFinite)
(p : unitInterval) (e : E) : Integrable (fun Ο => G.clusterCountDrop Ο e) (G.law p) := by
apply Integrable.of_bound (G.measurable_clusterCountDrop e).aestronglyMeasurable 1
apply Eventually.of_forall
intro Ο
rcases G.clusterCountDrop_mem hc hl Ο e with h|h <;> simp [h]
lemma tendsto_expected_signed_discrepancy_law (hc : G.fullGraph.Connected) (hl : G.LocallyFinite)
(hq : G.QuasiTransitive) (D K : β) (hD : β v, (G.incidentEdges {v}).ncardβ€D)
(hK : β v, (G.vertexBall v 1).ncardβ€K)
(p : unitInterval) (q : β β unitInterval) (hmono : Monotone q)
(hqp : β n, q nβ€p) (hlim : Tendsto q atTop (π p)) :
Tendsto (fun n => β xβ(G.orbitRepresentatives hq).roots,
β« Ο, G.normalizedSignedDiscrepancy (q n) Ο x βG.law (q n)) atTop
(π (β xβ(G.orbitRepresentatives hq).roots,
β« Ο, G.normalizedSignedDiscrepancy p Ο x βG.law p)) := by
apply tendsto_finsetSum _
intro x hx
have h := G.tendsto_expected_normalizedSignedDiscrepancy hc hl hq D K hD hK p q hmono hqp hlim x hx
simpa only [G.integral_atParameter _ _ (G.measurable_normalizedSignedDiscrepancy _ x)] using h
theorem critical_expected_drop_eq_disconnected (hc : G.fullGraph.Connected) (hl : G.LocallyFinite)
(hq : G.QuasiTransitive) (hp0 : 0<G.criticalProbability) (hp1 : G.criticalProbability<1) :
(β yβ(G.orbitRepresentatives hq).roots, β eβ(hl y).toFinset,
β« Ο, G.clusterCountDrop Ο e βG.law G.criticalProbability) =
(β yβ(G.orbitRepresentatives hq).roots, β eβ(hl y).toFinset,
β« Ο, G.disconnectedIndicator Ο e βG.law G.criticalProbability) := by
obtain β¨D,hD0,hDβ© := G.uniform_incident_bound hq
obtain β¨K,hKβ© := G.uniform_ball_bound hq 1
obtain β¨q,hmono,hqmem,hlimβ© := exists_seq_strictMono_tendsto' hp0
have hqp : β n, q nβ€G.criticalProbability := fun n => (hqmem n).2.le
have hsig := G.tendsto_expected_signed_discrepancy_law hc hl hq D K hD hK
G.criticalProbability q hmono.monotone hqp hlim
have hd : Tendsto (fun n => β yβ(G.orbitRepresentatives hq).roots, β eβ(hl y).toFinset,
β« Ο, G.disconnectedIndicator Ο e βG.law (q n)) atTop
(π (β yβ(G.orbitRepresentatives hq).roots, β eβ(hl y).toFinset,
β« Ο, G.disconnectedIndicator Ο e βG.law G.criticalProbability)) := by
apply tendsto_finsetSum _
intro y hy
apply tendsto_finsetSum _
intro e he
exact G.tendsto_integral_disconnectedIndicator G.criticalProbability q hmono.monotone hqp hlim e
have hqreal : Tendsto (fun n => (q n:β)) atTop (π (G.criticalProbability:β)) :=
continuous_subtype_val.continuousAt.tendsto.comp hlim
have hprod := ((hqreal.neg.mul (hqreal.const_sub 1)).mul hd)
have heq (n : β) : (β xβ(G.orbitRepresentatives hq).roots,
β« Ο, G.normalizedSignedDiscrepancy (q n) Ο x βG.law (q n)) =
-(q n:β)*(1-(q n:β))*(β yβ(G.orbitRepresentatives hq).roots, β eβ(hl y).toFinset,
β« Ο, G.disconnectedIndicator Ο e βG.law (q n)) := by
rw [G.expected_signed_discrepancy_drop hc hl hq D K hD hK]
congr 1
apply Finset.sum_congr rfl
intro y hy
apply Finset.sum_congr rfl
intro e he
exact integral_congr_ae (G.clusterCountDrop_eq_disconnected_ae_subcritical hc hl (q n) (hqmem n).2 e)
have hv := tendsto_nhds_unique hsig (hprod.congr' (Eventually.of_forall (fun n => (heq n).symm)))
rw [G.expected_signed_discrepancy_drop hc hl hq D K hD hK] at hv
apply mul_left_cancelβ (a := -(G.criticalProbability:β)*(1-(G.criticalProbability:β))) _ hv
exact mul_ne_zero (neg_ne_zero.mpr (ne_of_gt (show 0<(G.criticalProbability:β) from hp0)))
(sub_ne_zero.mpr (ne_of_gt (show (G.criticalProbability:β)<1 from hp1)))
theorem critical_root_incident_drop_ae (hc : G.fullGraph.Connected) (hl : G.LocallyFinite)
(hq : G.QuasiTransitive) (hp0 : 0<G.criticalProbability) (hp1 : G.criticalProbability<1)
(y : V) (hy : yβ(G.orbitRepresentatives hq).roots) (e : E) (he : yβG.ends e) :
(fun Ο => G.disconnectedIndicator Ο e)=α΅[G.law G.criticalProbability]
(fun Ο => G.clusterCountDrop Ο e) := by
let f := fun (e : E) Ο => G.disconnectedIndicator Ο e-G.clusterCountDrop Ο e
have hnon (e : E) (Ο : Set E) : 0β€f e Ο := sub_nonneg.mpr (G.clusterCountDrop_le_disconnected hc hl Ο e)
have hint (e : E) : Integrable (f e) (G.law G.criticalProbability) :=
(G.integrable_disconnectedIndicator _ e).sub (G.integrable_clusterCountDrop hc hl _ e)
have hsum : (β zβ(G.orbitRepresentatives hq).roots, β aβ(hl z).toFinset,
β« Ο, f a Ο βG.law G.criticalProbability)=0 := by
simp_rw [f,integral_sub (G.integrable_disconnectedIndicator _ _)
(G.integrable_clusterCountDrop hc hl _ _),Finset.sum_sub_distrib]
exact sub_eq_zero.mpr (G.critical_expected_drop_eq_disconnected hc hl hq hp0 hp1).symm
have hout : (β aβ(hl y).toFinset, β« Ο, f a Ο βG.law G.criticalProbability)=0 :=
(Finset.sum_eq_zero_iff_of_nonneg (fun z hz => Finset.sum_nonneg
(fun a ha => integral_nonneg (hnon a)))).mp hsum y hy
have hin : (β« Ο, f e Ο βG.law G.criticalProbability)=0 :=
(Finset.sum_eq_zero_iff_of_nonneg (fun a ha => integral_nonneg (hnon a))).mp hout e
((hl y).mem_toFinset.mpr he)
have hae := (integral_eq_zero_iff_of_nonneg (hnon e) (hint e)).mp hin
filter_upwards [hae] with Ο hΟ
exact sub_eq_zero.mp hΟ
end CriticalPercolation.BondGraph
end
end
end OAI
|