The off-centre carrier for wired q = 2 FK marginals
A. Translated wired marginals
LemmaTranslated wired marginals converge to the wired density#✓fully proved
The wired marginals of the translated edge e + v in v + Λ_{N+k} converge to the wired
q = 2 density of e.
lemma occ_translated_tendsto_wiredDensity (N : ℕ) (v : Site d) (eb' : Sym2 (boxVerts d N))
{p : ℝ} (hp : 0 < p) (hp1 : p < 1) :
Tendsto (fun k =>
edgeMargProb
(wiredFkProb (fvs_transBoxGraph d (N + k) v) (fvs_transBoxBoundary d (N + k) v) p 2)
(Sym2.map (fvs_transEquiv d (N + k) v) (innerEdgeLE d (Nat.le_add_right N k) eb')))
atTop (𝓝 (wiredEdgeDensity d 2 (edgeIncl d N eb') p))
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
abbrev boxVerts (d n : ℕ) : Type := {x : Site d // x ∈ box d n}
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:131
noncomputable def edgeMargProb (μ : ConfigSpace E → ℝ) (e : E) : ℝ :=
∑ ω : ConfigSpace E, (if ω e then (1 : ℝ) else 0) * μ ω
PhyslibExt/StatisticalMechanics/RandomCluster/EdgeMarginal.lean:59
noncomputable def wiredFkProb (p q : ℝ) (ω : ConfigSpace (Sym2 V)) : ℝ :=
wiredFkWeight G bdry p q ω / wiredFkZ G bdry p q
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:105
def fvs_transBoxGraph (d m : ℕ) (v : Site d) : SimpleGraph (fvs_transBoxVerts d m v) :=
SimpleGraph.comap Subtype.val (hypercubicLattice d)
PhyslibExt/StatisticalMechanics/RandomCluster/FiniteVolumeShift.lean:334
def fvs_transBoxBoundary (d m : ℕ) (v : Site d) (y : fvs_transBoxVerts d m v) : Prop :=
((y : Site d) - v) ∈ vertexBoundary d m
PhyslibExt/StatisticalMechanics/RandomCluster/FiniteVolumeShift.lean:343
noncomputable def fvs_transEquiv (d m : ℕ) (v : Site d) :
boxVerts d m ≃ fvs_transBoxVerts d m v where
toFun := fun x => ⟨(x : Site d) + v, by
change ((x : Site d) + v - v) ∈ box d m
rw [add_sub_cancel_right]; exact x.2⟩
invFun := fun y => ⟨(y : Site d) - v, y.2⟩
left_inv := by intro x; apply Subtype.ext; simp
right_inv := by intro y; apply Subtype.ext; simp
PhyslibExt/StatisticalMechanics/RandomCluster/FiniteVolumeShift.lean:311
def innerEdgeLE (d : ℕ) {n m : ℕ} (h : n ≤ m) : Sym2 (boxVerts d n) → Sym2 (boxVerts d m) :=
Sym2.map (boxVertInclLE d h)
PhyslibExt/StatisticalMechanics/RandomCluster/WiredDomChain.lean:424
noncomputable def wiredEdgeDensity (d : ℕ) (q : ℝ) (e : Sym2 (Site d)) (p : ℝ) : ℝ :=
if h : 0 < p ∧ p < 1 ∧ 0 < q then
(wiredInfiniteVolume d h.1 h.2.1 h.2.2 : Measure (ConfigSpace (Sym2 (Site d)))).real
(fkEdgeOpenEvent e)
else 0
PhyslibExt/StatisticalMechanics/RandomCluster/UniquenessOffCountable.lean:127
def edgeIncl (d n : ℕ) : Sym2 (boxVerts d n) → Sym2 (Site d) :=
Sym2.map (Subtype.val : boxVerts d n → Site d)
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:163
Uses 28
LemmaFree density is at most each translated wired marginal#✓fully proved
The free q = 2 density of e is at most the wired marginal of e + v in v + Λ_{N+k}.
lemma occ_translated_between_iv (N : ℕ) (v : Site d) (eb' : Sym2 (boxVerts d N))
{p : ℝ} (hp : 0 < p) (hp1 : p < 1) (k : ℕ) :
freeEdgeDensity d 2 (edgeIncl d N eb') p
≤ edgeMargProb
(wiredFkProb (fvs_transBoxGraph d (N + k) v) (fvs_transBoxBoundary d (N + k) v) p 2)
(Sym2.map (fvs_transEquiv d (N + k) v) (innerEdgeLE d (Nat.le_add_right N k) eb'))
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
abbrev boxVerts (d n : ℕ) : Type := {x : Site d // x ∈ box d n}
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:131
noncomputable def freeEdgeDensity (d : ℕ) (q : ℝ) (e : Sym2 (Site d)) (p : ℝ) : ℝ :=
if h : 0 < p ∧ p < 1 ∧ 0 < q then
(freeInfiniteVolume d h.1 h.2.1 h.2.2 : Measure (ConfigSpace (Sym2 (Site d)))).real
(fkEdgeOpenEvent e)
else 0
PhyslibExt/StatisticalMechanics/RandomCluster/UniquenessOffCountable.lean:136
def edgeIncl (d n : ℕ) : Sym2 (boxVerts d n) → Sym2 (Site d) :=
Sym2.map (Subtype.val : boxVerts d n → Site d)
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:163
noncomputable def edgeMargProb (μ : ConfigSpace E → ℝ) (e : E) : ℝ :=
∑ ω : ConfigSpace E, (if ω e then (1 : ℝ) else 0) * μ ω
PhyslibExt/StatisticalMechanics/RandomCluster/EdgeMarginal.lean:59
noncomputable def wiredFkProb (p q : ℝ) (ω : ConfigSpace (Sym2 V)) : ℝ :=
wiredFkWeight G bdry p q ω / wiredFkZ G bdry p q
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:105
def fvs_transBoxGraph (d m : ℕ) (v : Site d) : SimpleGraph (fvs_transBoxVerts d m v) :=
SimpleGraph.comap Subtype.val (hypercubicLattice d)
PhyslibExt/StatisticalMechanics/RandomCluster/FiniteVolumeShift.lean:334
def fvs_transBoxBoundary (d m : ℕ) (v : Site d) (y : fvs_transBoxVerts d m v) : Prop :=
((y : Site d) - v) ∈ vertexBoundary d m
PhyslibExt/StatisticalMechanics/RandomCluster/FiniteVolumeShift.lean:343
noncomputable def fvs_transEquiv (d m : ℕ) (v : Site d) :
boxVerts d m ≃ fvs_transBoxVerts d m v where
toFun := fun x => ⟨(x : Site d) + v, by
change ((x : Site d) + v - v) ∈ box d m
rw [add_sub_cancel_right]; exact x.2⟩
invFun := fun y => ⟨(y : Site d) - v, y.2⟩
left_inv := by intro x; apply Subtype.ext; simp
right_inv := by intro y; apply Subtype.ext; simp
PhyslibExt/StatisticalMechanics/RandomCluster/FiniteVolumeShift.lean:311
def innerEdgeLE (d : ℕ) {n m : ℕ} (h : n ≤ m) : Sym2 (boxVerts d n) → Sym2 (boxVerts d m) :=
Sym2.map (boxVertInclLE d h)
PhyslibExt/StatisticalMechanics/RandomCluster/WiredDomChain.lean:424
Uses 37
B. Free and wired densities
LemmaSecant bound gives free–wired density agreement off a countable set#✓fully proved
Under the secant comparison wired(p') ≤ free(p) for p' < p, the free and wired densities
of a box edge agree for all p ∈ (0, 1) outside a countable set, namely the discontinuities of
the monotone wired density.
lemma occ_free_eq_wired_off_countable (N : ℕ) (eb' : Sym2 (boxVerts d N))
(hsecant : ∀ p ∈ Ioo (0 : ℝ) 1, ∀ p' ∈ Ioo (0 : ℝ) 1, p' < p →
wiredEdgeDensity d 2 (edgeIncl d N eb') p' ≤ freeEdgeDensity d 2 (edgeIncl d N eb') p) :
∃ S : Set ℝ, S.Countable ∧ ∀ p ∈ Ioo (0 : ℝ) 1, p ∉ S →
freeEdgeDensity d 2 (edgeIncl d N eb') p = wiredEdgeDensity d 2 (edgeIncl d N eb') p
abbrev boxVerts (d n : ℕ) : Type := {x : Site d // x ∈ box d n}
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:131
noncomputable def wiredEdgeDensity (d : ℕ) (q : ℝ) (e : Sym2 (Site d)) (p : ℝ) : ℝ :=
if h : 0 < p ∧ p < 1 ∧ 0 < q then
(wiredInfiniteVolume d h.1 h.2.1 h.2.2 : Measure (ConfigSpace (Sym2 (Site d)))).real
(fkEdgeOpenEvent e)
else 0
PhyslibExt/StatisticalMechanics/RandomCluster/UniquenessOffCountable.lean:127
def edgeIncl (d n : ℕ) : Sym2 (boxVerts d n) → Sym2 (Site d) :=
Sym2.map (Subtype.val : boxVerts d n → Site d)
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:163
noncomputable def freeEdgeDensity (d : ℕ) (q : ℝ) (e : Sym2 (Site d)) (p : ℝ) : ℝ :=
if h : 0 < p ∧ p < 1 ∧ 0 < q then
(freeInfiniteVolume d h.1 h.2.1 h.2.2 : Measure (ConfigSpace (Sym2 (Site d)))).real
(fkEdgeOpenEvent e)
else 0
PhyslibExt/StatisticalMechanics/RandomCluster/UniquenessOffCountable.lean:136
Uses 32
C. The off-centre carrier
LemmaOff-centre carrier vanishes by translation covariance#✓fully proved
The off-centre carrier vanishes for every k, by translation covariance of the wired box
measures.
lemma occ_offCentreCarrier_eq_zero (N : ℕ) (v : Site d) (eb' : Sym2 (boxVerts d N))
(p q : ℝ) (k : ℕ) :
fbd_offCentreCarrier N v eb' p q k = 0
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
abbrev boxVerts (d n : ℕ) : Type := {x : Site d // x ∈ box d n}
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:131
noncomputable def fbd_offCentreCarrier (N : ℕ) (v : Site d) (eb' : Sym2 (boxVerts d N))
(p q : ℝ) (k : ℕ) : ℝ :=
edgeMargProb (wiredFkProb (boxGraph d (N + k)) (boxBoundary d (N + k)) p q)
(innerEdgeLE d (Nat.le_add_right N k) eb')
- edgeMargProb
(wiredFkProb (fvs_transBoxGraph d (N + k) v) (fvs_transBoxBoundary d (N + k) v) p q)
(Sym2.map (fvs_transEquiv d (N + k) v) (innerEdgeLE d (Nat.le_add_right N k) eb'))
PhyslibExt/StatisticalMechanics/RandomCluster/BoundaryInfluenceDecay.lean:272
Uses 16 · Used by 1
LemmaOff-centre carrier tends to zero#✓fully proved
The off-centre carrier tends to zero, for every p.
lemma occ_offCentreCarrier (N : ℕ) (v : Site d) (eb' : Sym2 (boxVerts d N)) (p : ℝ) :
Tendsto (fbd_offCentreCarrier N v eb' p 2) atTop (𝓝 0)
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
abbrev boxVerts (d n : ℕ) : Type := {x : Site d // x ∈ box d n}
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:131
noncomputable def fbd_offCentreCarrier (N : ℕ) (v : Site d) (eb' : Sym2 (boxVerts d N))
(p q : ℝ) (k : ℕ) : ℝ :=
edgeMargProb (wiredFkProb (boxGraph d (N + k)) (boxBoundary d (N + k)) p q)
(innerEdgeLE d (Nat.le_add_right N k) eb')
- edgeMargProb
(wiredFkProb (fvs_transBoxGraph d (N + k) v) (fvs_transBoxBoundary d (N + k) v) p q)
(Sym2.map (fvs_transEquiv d (N + k) v) (innerEdgeLE d (Nat.le_add_right N k) eb'))
PhyslibExt/StatisticalMechanics/RandomCluster/BoundaryInfluenceDecay.lean:272
Uses 4 · Used by 1
LemmaEqual wired densities from equal translated marginals#✓fully proved
If for every k the wired marginal of e' + v in v + Λ_{N+k} equals the wired marginal of
e in Λ_{N+k}, then e and e' have the same wired density.
lemma occ_wired_density_eq_of_translation_cofinal (N : ℕ) (v : Site d)
(eb eb' : Sym2 (boxVerts d N)) {p : ℝ} (hp : 0 < p) (hp1 : p < 1)
(htrans : ∀ k,
edgeMargProb
(wiredFkProb (fvs_transBoxGraph d (N + k) v) (fvs_transBoxBoundary d (N + k) v) p 2)
(Sym2.map (fvs_transEquiv d (N + k) v) (innerEdgeLE d (Nat.le_add_right N k) eb'))
= edgeMargProb (wiredFkProb (boxGraph d (N + k)) (boxBoundary d (N + k)) p 2)
(innerEdgeLE d (Nat.le_add_right N k) eb)) :
wiredEdgeDensity d 2 (edgeIncl d N eb) p
= wiredEdgeDensity d 2 (edgeIncl d N eb') p
abbrev Site (d : ℕ) : Type := Fin d → ℤ
MathlibExt/Combinatorics/SimpleGraph/Lattice/HypercubicLattice.lean:55
abbrev boxVerts (d n : ℕ) : Type := {x : Site d // x ∈ box d n}
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:131
noncomputable def edgeMargProb (μ : ConfigSpace E → ℝ) (e : E) : ℝ :=
∑ ω : ConfigSpace E, (if ω e then (1 : ℝ) else 0) * μ ω
PhyslibExt/StatisticalMechanics/RandomCluster/EdgeMarginal.lean:59
noncomputable def wiredFkProb (p q : ℝ) (ω : ConfigSpace (Sym2 V)) : ℝ :=
wiredFkWeight G bdry p q ω / wiredFkZ G bdry p q
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:105
def fvs_transBoxGraph (d m : ℕ) (v : Site d) : SimpleGraph (fvs_transBoxVerts d m v) :=
SimpleGraph.comap Subtype.val (hypercubicLattice d)
PhyslibExt/StatisticalMechanics/RandomCluster/FiniteVolumeShift.lean:334
def fvs_transBoxBoundary (d m : ℕ) (v : Site d) (y : fvs_transBoxVerts d m v) : Prop :=
((y : Site d) - v) ∈ vertexBoundary d m
PhyslibExt/StatisticalMechanics/RandomCluster/FiniteVolumeShift.lean:343
noncomputable def fvs_transEquiv (d m : ℕ) (v : Site d) :
boxVerts d m ≃ fvs_transBoxVerts d m v where
toFun := fun x => ⟨(x : Site d) + v, by
change ((x : Site d) + v - v) ∈ box d m
rw [add_sub_cancel_right]; exact x.2⟩
invFun := fun y => ⟨(y : Site d) - v, y.2⟩
left_inv := by intro x; apply Subtype.ext; simp
right_inv := by intro y; apply Subtype.ext; simp
PhyslibExt/StatisticalMechanics/RandomCluster/FiniteVolumeShift.lean:311
def innerEdgeLE (d : ℕ) {n m : ℕ} (h : n ≤ m) : Sym2 (boxVerts d n) → Sym2 (boxVerts d m) :=
Sym2.map (boxVertInclLE d h)
PhyslibExt/StatisticalMechanics/RandomCluster/WiredDomChain.lean:424
def boxGraph (d n : ℕ) : SimpleGraph (boxVerts d n) :=
SimpleGraph.comap Subtype.val (hypercubicLattice d)
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:142
def boxBoundary (d n : ℕ) (x : boxVerts d n) : Prop := (x : Site d) ∈ vertexBoundary d n
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:151
noncomputable def wiredEdgeDensity (d : ℕ) (q : ℝ) (e : Sym2 (Site d)) (p : ℝ) : ℝ :=
if h : 0 < p ∧ p < 1 ∧ 0 < q then
(wiredInfiniteVolume d h.1 h.2.1 h.2.2 : Measure (ConfigSpace (Sym2 (Site d)))).real
(fkEdgeOpenEvent e)
else 0
PhyslibExt/StatisticalMechanics/RandomCluster/UniquenessOffCountable.lean:127
def edgeIncl (d n : ℕ) : Sym2 (boxVerts d n) → Sym2 (Site d) :=
Sym2.map (Subtype.val : boxVerts d n → Site d)
PhyslibExt/StatisticalMechanics/RandomCluster/InfiniteVolume.lean:163
Uses 28
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.