File size: 4,928 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
import Mathlib
import OAI.Probability.CriticalPercolation.Model
import OAI.Probability.CriticalPercolation.Modular.NormalizedIncidenceTransport

namespace OAI

section
noncomputable section
open Set MeasureTheory Filter
open scoped Classical ENNReal BigOperators

namespace CriticalPercolation

lemma lintegral_ne_top_of_uniform_bound {Ξ± : Type*} [MeasurableSpace Ξ±]
    (ΞΌ : Measure Ξ±) [IsFiniteMeasure ΞΌ] (f : Ξ± β†’ ℝβ‰₯0∞) (C : ℝβ‰₯0∞) (hC : Cβ‰ βˆž)
    (hb : βˆ€ a, f a≀C) : (∫⁻ a, f a βˆ‚ΞΌ)β‰ βˆž := by
  apply ne_top_of_le_ne_top (ENNReal.mul_ne_top hC (measure_ne_top ΞΌ Set.univ))
  simpa only [lintegral_const] using lintegral_mono hb

lemma sum_integral_toReal {Ξ± ΞΉ : Type*} [MeasurableSpace Ξ±] (ΞΌ : Measure Ξ±) [IsFiniteMeasure ΞΌ]
    (S : Finset ΞΉ) (F : ΞΉ β†’ Ξ± β†’ ℝβ‰₯0∞) (hm : βˆ€ i∈S, Measurable (F i))
    (C : ΞΉ β†’ ℝβ‰₯0∞) (hC : βˆ€ i∈S, C iβ‰ βˆž) (hb : βˆ€ i∈S, βˆ€ a, F i a≀C i) :
    (βˆ‘ i∈S, ∫ a, (F i a).toReal βˆ‚ΞΌ)=(βˆ‘ i∈S, ∫⁻ a, F i a βˆ‚ΞΌ).toReal := by
  rw [ENNReal.toReal_sum]
  Β· apply Finset.sum_congr rfl
    intro i hi
    exact integral_toReal (hm i hi).aemeasurable (Eventually.of_forall (fun a =>
      lt_top_iff_ne_top.mpr (ne_top_of_le_ne_top (hC i hi) (hb i hi a))))
  Β· intro i hi
    exact lintegral_ne_top_of_uniform_bound ΞΌ (F i) (C i) (hC i hi) (hb i hi)

namespace BondGraph
variable {V E : Type*} (G : BondGraph V E)

def selectedIncidenceReturn (hl : G.LocallyFinite) (H : Set E β†’ E β†’ ℝβ‰₯0∞)
    (Ο‰ : Set E) (y : V) : ℝβ‰₯0∞ :=
  βˆ‘ e∈(hl y).toFinset, H Ο‰ e*G.incidentClusterCount Ο‰ e

lemma selectedIncidenceReturn_eq_tsum (hl : G.LocallyFinite) (H : Set E β†’ E β†’ ℝβ‰₯0∞)
    (Ο‰ : Set E) (y : V) : G.selectedIncidenceReturn hl H Ο‰ y =
      βˆ‘' e, if y∈G.ends e then H Ο‰ e*G.incidentClusterCount Ο‰ e else 0 := by
  rw [tsum_eq_sum (s := (hl y).toFinset) (fun e he => ite_eq_right (by simpa using he))]
  apply Finset.sum_congr rfl
  intro e he
  exact (ite_eq_left ((hl y).mem_toFinset.mp he)).symm

lemma measurable_selectedIncidenceReturn [Countable V] [Countable E]
    (hl : G.LocallyFinite) (H : Set E β†’ E β†’ ℝβ‰₯0∞) (hm : βˆ€ e, Measurable (fun Ο‰ => H Ο‰ e)) (y : V) :
    Measurable (fun Ο‰ => G.selectedIncidenceReturn hl H Ο‰ y) :=
  Finset.measurable_sum _ (fun e _ => (hm e).mul (G.measurable_incidentClusterCount e))

lemma selectedIncidenceReturn_le (hc : G.fullGraph.Connected) (hl : G.LocallyFinite)
    (H : Set E β†’ E β†’ ℝβ‰₯0∞) (hH : βˆ€ Ο‰ e, H Ο‰ e≀1) (Ο‰ : Set E) (y : V) :
    G.selectedIncidenceReturn hl H Ο‰ y≀(hl y).toFinset.card*2 := by
  unfold selectedIncidenceReturn
  calc _ ≀ βˆ‘ _e∈(hl y).toFinset, (2:ℝβ‰₯0∞) := by
          apply Finset.sum_le_sum
          intro e _
          exact (mul_le_mul' (hH Ο‰ e) (G.incidentClusterCount_le_two hc hl Ο‰ e)).trans_eq (one_mul 2)
       _ = _ := by simp

lemma selectedIncidenceReturn_toReal (hc : G.fullGraph.Connected) (hl : G.LocallyFinite)
    (H : Set E β†’ E β†’ ℝβ‰₯0∞) (hH : βˆ€ Ο‰ e, H Ο‰ e≀1) (Ο‰ : Set E) (y : V) :
    (G.selectedIncidenceReturn hl H Ο‰ y).toReal=
      βˆ‘ e∈(hl y).toFinset, (H Ο‰ e).toReal*(G.incidentClusterCount Ο‰ e).toReal := by
  unfold selectedIncidenceReturn
  rw [ENNReal.toReal_sum]
  Β· simp only [ENNReal.toReal_mul]
  Β· intro e _
    exact ENNReal.mul_ne_top (ne_top_of_le_ne_top ENNReal.one_ne_top (hH Ο‰ e))
      (ne_top_of_le_ne_top (by norm_num : (2:ℝβ‰₯0∞)β‰ βˆž) (G.incidentClusterCount_le_two hc hl Ο‰ e))

lemma expected_selectedIncidence_real [Countable V] [Countable E]
    (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) (H : Set E β†’ E β†’ ℝβ‰₯0∞)
    (hm : βˆ€ e, Measurable (fun Ο‰ => H Ο‰ e)) (hH : βˆ€ Ο‰ e, H Ο‰ e≀1)
    (ha : βˆ€ (Ο† : G.Aut) Ο‰ e, H (Ο†.edge '' Ο‰) (Ο†.edge e)=H Ο‰ e) :
    (βˆ‘ x∈(G.orbitRepresentatives hq).roots, ∫ Ο‰, (G.normalizedSelectedIncidence H Ο‰ x).toReal βˆ‚G.law p)=
      βˆ‘ y∈(G.orbitRepresentatives hq).roots, ∫ Ο‰, (G.selectedIncidenceReturn hl H Ο‰ y).toReal βˆ‚G.law p := by
  rw [sum_integral_toReal (G.law p) _ _ (fun x _ => G.measurable_normalizedSelectedIncidence H hm x)
      (fun _ => (D*(2*K) : β„•)) (fun _ _ => ENNReal.natCast_ne_top _)
      (fun x _ Ο‰ => G.normalizedSelectedIncidence_le hc hl D K hD hK H hH Ο‰ x),
    sum_integral_toReal (G.law p) _ _ (fun y _ => G.measurable_selectedIncidenceReturn hl H hm y)
      (fun y => (hl y).toFinset.card*2) (fun _ _ => ENNReal.mul_ne_top (ENNReal.natCast_ne_top _) (by norm_num))
      (fun y _ Ο‰ => G.selectedIncidenceReturn_le hc hl H hH Ο‰ y)]
  congr 1
  simp_rw [G.selectedIncidenceReturn_eq_tsum]
  exact G.expected_normalizedSelectedIncidence hc hl hq p H hm ha

end BondGraph
end CriticalPercolation
end
end

end OAI