math / data /lean /OAI /Analysis /HardSphere /Paths /Admissible.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
6.32 kB
import Mathlib
import OAI.Analysis.HardSphere.Paths.AcceptedIntegrand
namespace OAI
section
noncomputable section
open MeasureTheory ProbabilityTheory
open scoped ENNReal BigOperators
namespace HardSphere.DyadicSkeleton
open HardSphere.Lattice
attribute [local instance] Classical.propDecidable
def currentAdmissiblePair {K : β„•} [NeZero K] (x y : DiscreteTorus K) : Prop :=
βˆƒ n : β„•, K≀10*n ∧ 8*n≀K ∧ βˆƒ d : Fin 2 β†’ β„€, (βˆ€ j, |d j|≀n) ∧
y=x+![(n:ZMod K),(d 0:ZMod K),(d 1:ZMod K)]
def currentAdmissiblePairs (K : β„•) [NeZero K] : Finset (DiscreteTorus K Γ— DiscreteTorus K) :=
Finset.univ.filter (fun z ↦ currentAdmissiblePair z.1 z.2)
lemma current_admissible_lift {K : β„•} [NeZero K] {x y : DiscreteTorus K}
(h : currentAdmissiblePair x y) :
βˆƒ n : β„•, 0<n ∧ 8*n≀K ∧ K≀10*n ∧ βˆƒ v : Vertex, βˆƒ d : Fin 2 β†’ β„€,
(βˆ€j, |d j|≀n) ∧ torusProjection K v=x ∧
torusProjection K (v+![(n:β„€),d 0,d 1])=y := by
obtain ⟨n,hl,hu,d,hd,hy⟩ := h
let v : Vertex := fun j ↦ (x j).val
have hK : 0<K := NeZero.pos K
refine ⟨n,by omega,hu,hl,v,d,hd,?_,?_⟩
Β· ext j; simp [torusProjection,v]
Β· rw [hy]
ext j; fin_cases j <;> simp [torusProjection,v]
lemma current_admissible_card {K : β„•} [NeZero K] (hK : 400≀K) :
K^6≀2000*(currentAdmissiblePairs K).card := by
let m := K/10
let I := Finset.Icc (K/10+1) (K/8)
let J := Finset.range (2*m+1)
let S : Finset (DiscreteTorus K Γ— β„• Γ— β„• Γ— β„•) :=
Finset.univ Γ—Λ’ (I Γ—Λ’ (J Γ—Λ’ J))
let f : DiscreteTorus K Γ— β„• Γ— β„• Γ— β„• β†’ DiscreteTorus K Γ— DiscreteTorus K :=
fun z ↦ (z.1,z.1+![(z.2.1:ZMod K),((z.2.2.1:β„€)-m:ZMod K),((z.2.2.2:β„€)-m:ZMod K)])
have hI (n : β„•) (hn : n∈I) : K≀10*n ∧ 8*n≀K ∧ n<K ∧ m<n := by
have hn := Finset.mem_Icc.mp hn
dsimp [m]
omega
have hJ (b : β„•) (hb : b∈J) : b<K ∧ |(b:β„€)-m|≀(m:β„€) := by
have hb := Finset.mem_range.mp hb
dsimp [m] at *
constructor
Β· omega
Β· rw [abs_le]; constructor <;> omega
have hsub : S.image fβŠ†currentAdmissiblePairs K := by
intro z hz
obtain ⟨⟨x,n,b,c⟩,hu,rfl⟩ := Finset.mem_image.mp hz
simp only [S,Finset.mem_product] at hu
obtain ⟨_,hn,hb,hc⟩ := hu
have hin := hI n hn
apply Finset.mem_filter.mpr
refine ⟨Finset.mem_univ _,n,hin.1,hin.2.1,![(b:β„€)-m,(c:β„€)-m],?_,?_⟩
Β· intro j
fin_cases j
Β· exact (hJ b hb).2.trans (by exact_mod_cast hin.2.2.2.le)
Β· exact (hJ c hc).2.trans (by exact_mod_cast hin.2.2.2.le)
Β· simp [f]
have hinj : Set.InjOn f (↑S : Set _) := by
rintro ⟨x,n,b,c⟩ hx ⟨x',n',b',c'⟩ hx' he
have he₁ : x=x' := congrArg Prod.fst he
subst x'
have heβ‚‚ : ![(n:ZMod K),((b:β„€)-m:ZMod K),((c:β„€)-m:ZMod K)]=
![(n':ZMod K),((b':β„€)-m:ZMod K),((c':β„€)-m:ZMod K)] :=
add_left_cancel (congrArg Prod.snd he)
change (x,n,b,c)∈S at hx
change (x,n',b',c')∈S at hx'
simp only [S,Finset.mem_product] at hx hx'
obtain ⟨_,hn,hb,hc⟩ := hx
obtain ⟨_,hn',hb',hc'⟩ := hx'
have hnval := congrArg (fun z : Fin 3 β†’ ZMod K ↦ (z 0).val) heβ‚‚
simp only [Matrix.cons_val_zero,ZMod.val_natCast_of_lt (hI n hn).2.2.1,
ZMod.val_natCast_of_lt (hI n' hn').2.2.1] at hnval
have hbeq : (b:ZMod K)=(b':ZMod K) := by
have h := congrFun heβ‚‚ 1
simpa using h
have hceq : (c:ZMod K)=(c':ZMod K) := by
have h := congrFun heβ‚‚ 2
simpa using h
have hbval := congrArg ZMod.val hbeq
have hcval := congrArg ZMod.val hceq
simp only [ZMod.val_natCast_of_lt (hJ b hb).1,ZMod.val_natCast_of_lt (hJ b' hb').1] at hbval
simp only [ZMod.val_natCast_of_lt (hJ c hc).1,ZMod.val_natCast_of_lt (hJ c' hc').1] at hcval
simp only [Prod.mk.injEq]
exact ⟨trivial,hnval,hbval,hcval⟩
have hcard : S.card≀(currentAdmissiblePairs K).card :=
(Finset.card_image_iff.mpr hinj).symm.trans_le (Finset.card_le_card hsub)
have hcardS : S.card=K^3*I.card*J.card^2 := by
dsimp only [S]
rw [Finset.card_product,Finset.card_product,Finset.card_product]
simp [DiscreteTorus,mul_assoc,pow_two]
have hcardI : K≀50*I.card := by
dsimp [I]
rw [Nat.card_Icc]
omega
have hcardJ : K≀6*J.card := by
simp only [J,Finset.card_range,m]
omega
rw [hcardS] at hcard
calc
K^6=K^3*K*K^2 := by ring
_ ≀ K^3*(50*I.card)*(6*J.card)^2 := Nat.mul_le_mul
(Nat.mul_le_mul_left _ hcardI) (Nat.pow_le_pow_left hcardJ 2)
_ = 1800*(K^3*I.card*J.card^2) := by ring
_ ≀ 1800*(currentAdmissiblePairs K).card := Nat.mul_le_mul_left _ hcard
_ ≀ _ := Nat.mul_le_mul_right _ (by decide)
end HardSphere.DyadicSkeleton
end
end
section
noncomputable section
open MeasureTheory ProbabilityTheory
open scoped ENNReal BigOperators
namespace HardSphere.DyadicSkeleton
open HardSphere.Lattice
theorem current_good_paths (R : β„•) :
βˆƒ pβ‚€ ΞΊ : ℝ, 0<pβ‚€ ∧ 0<ΞΊ ∧ βˆƒ Kβ‚€ : β„•, βˆ€ K : β„•, K₀≀K β†’ βˆ€ _ : NeZero K,
K^6≀2000*(currentAdmissiblePairs K).card ∧
βˆ€ {Ξ© : Type*} [MeasurableSpace Ξ©], βˆ€ P : Measure Ξ©, βˆ€ _ : IsProbabilityMeasure P,
βˆ€ b : Ξ© β†’ Finset (DiscreteTorus K), Measurable b β†’
βˆ€ p : ℝ, 0≀p β†’ p≀pβ‚€ β†’
(βˆ€ A : Finset (DiscreteTorus K), P {d | AβŠ†b d}≀(ENNReal.ofReal p)^A.card) β†’
βˆ€ x y : DiscreteTorus K, currentAdmissiblePair x y β†’
βˆƒ E : Set Ξ©, MeasurableSet E ∧ (1/2:ℝβ‰₯0∞)≀P E ∧
βˆƒ Ξ½ : Kernel Ξ© (SimplePath x y), IsMarkovKernel Ξ½ ∧
(βˆ€ e∈E, Ξ½ e {q | simplePathGood (b e) q}=1) ∧
(∫⁻ e, E.indicator (fun e ↦ ∫⁻ q, ∫⁻ q',
ENNReal.ofReal (Real.exp (ΞΊ*(simpleEncounter R q q':ℝ))) βˆ‚Ξ½ e βˆ‚Ξ½ e) e βˆ‚P)≀2 := by
obtain ⟨pβ‚€,ΞΊ,hpβ‚€,hΞΊ,Kβ‚€,hall⟩ := dyadic_good_paths_lift R
refine ⟨pβ‚€,ΞΊ,hpβ‚€,hΞΊ,max Kβ‚€ 400,?_⟩
intro K hK inst
refine ⟨current_admissible_card ((le_max_right Kβ‚€ 400).trans hK),?_⟩
intro Ξ© mΞ© P hP b hb p hp hpp hbad x y hxy
obtain ⟨n,hn,hnK,_,v,d,hd,hv,hw⟩ := current_admissible_lift hxy
subst x y
exact hall K ((le_max_left Kβ‚€ 400).trans hK) inst P hP b hb p hp hpp hbad n hn hnK d hd v
end HardSphere.DyadicSkeleton
end
end
end OAI