Download data/lean/OAI/Probability/DilutedSpin/AdmissibleInterval.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 4.64 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/DilutedSpin/AdmissibleInterval.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/DilutedSpin/AdmissibleInterval.lean
-
curl -L -o AdmissibleInterval.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/DilutedSpin/AdmissibleInterval.lean
4.64 kB
| import OAI.Probability.DilutedSpin.VertexContinuity | |
| namespace OAI | |
| section | |
| section | |
| namespace DilutedSpinGlass.ReducedTopology | |
| open scoped BigOperators | |
| noncomputable local instance admissibleIntervalPropDecidable (proposition : Prop) : | |
| Decidable proposition := Classical.propDecidable proposition | |
| /-- With every other depth fixed, admissible values of one branching | |
| coordinate form an interval. No spacing or regularity is needed here. -/ | |
| lemma admissible_update_between (S : ReducedTopology) (q : S.Vertex β β) (v : S.Vertex) | |
| {a b t lo hi : β} (hat : aβ€t) (htb : tβ€b) | |
| (ha : Admissible S (updateCoordinate q v a) lo hi) | |
| (hb : Admissible S (updateCoordinate q v b) lo hi) : | |
| Admissible S (updateCoordinate q v t) lo hi := by | |
| induction S generalizing lo hi with | |
| | leaf => exact v.elim | |
| | node k hk C ih => | |
| cases v with | |
| | none => | |
| simp only [update_root (hk := hk),Admissible,rootSchedule] at ha hb β’ | |
| exact β¨ha.1.trans hat,htb.trans_lt hb.2.1, | |
| fun i => admissible_mono_lower (C i) _ (Nat.succ_le_succ htb) (hb.2.2 i)β© | |
| | some a => | |
| obtain β¨i,vβ© := a | |
| constructor | |
| Β· simpa only [update_desc_root (hk := hk)] using ha.1 | |
| constructor | |
| Β· simpa only [update_desc_root (hk := hk)] using ha.2.1 | |
| intro j | |
| by_cases hj : j=i | |
| Β· subst j | |
| have haa := ha.2.2 i | |
| have hbb := hb.2.2 i | |
| simp only [update_desc_root (hk := hk),update_desc_same (hk := hk)] at haa hbb β’ | |
| exact ih i _ v haa hbb | |
| Β· have haa := ha.2.2 j | |
| simpa only [update_desc_root (hk := hk),update_desc_other q i v _ j hj] using haa | |
| /-- Interval form of the literal one-vertex Dirichlet-energy estimate. -/ | |
| theorem scheduled_vertex_Ico_energy_le {Ξ© : Type} [Fintype Ξ©] | |
| (H d : β) (S : ReducedTopology) (q : S.Vertex β β) (v : S.Vertex) | |
| (a b : β) (hab : aβ€b) | |
| (ha : Admissible S (updateCoordinate q v a) d (d+H)) | |
| (hb : Admissible S (updateCoordinate q v b) d (d+H)) | |
| (T : KernelTower Ξ© H) (f : FinitePath Ξ© H β β) (hf : β x, |f x| β€ 1) : | |
| (β t β Finset.Ico a b, | |
| (PrescribedTree.treeMean (realize H d S (updateCoordinate q v t)) T f- | |
| PrescribedTree.treeMean (realize H d S (updateCoordinate q v (t+1))) T f)^2) β€ | |
| (vertexArity S v:β)^2 := by | |
| have he := scheduled_vertex_energy_le H d S q v a (b-a) (by | |
| intro t | |
| apply admissible_update_between S q v (Nat.le_add_right _ _) ?_ ha hb | |
| have ht := t.isLt | |
| omega) T f hf | |
| let E : β β β := fun t => | |
| (PrescribedTree.treeMean (realize H d S (updateCoordinate q v t)) T f- | |
| PrescribedTree.treeMean (realize H d S (updateCoordinate q v (t+1))) T f)^2 | |
| have he' : (β t : Fin (b-a), E (a+t.val)) β€ (vertexArity S v:β)^2 := by | |
| simpa only [E,Fin.val_castSucc,Fin.val_succ,Nat.add_assoc] using he | |
| rw [Fin.sum_univ_eq_sum_range (fun t => E (a+t)) (b-a)] at he' | |
| change (β t β Finset.Ico a b, E t) β€ _ | |
| rwa [Finset.sum_Ico_eq_sum_range] | |
| /-- Restriction to ANY set of allowed one-step shifts cannot raise the | |
| single-coordinate energy. The proof uses the actual admissible hull. -/ | |
| theorem scheduled_vertex_subset_energy_le {Ξ© : Type} [Fintype Ξ©] | |
| (H d : β) (S : ReducedTopology) (q : S.Vertex β β) (v : S.Vertex) | |
| (I : Finset β) | |
| (ha : β t β I, Admissible S (updateCoordinate q v t) d (d+H) β§ | |
| Admissible S (updateCoordinate q v (t+1)) d (d+H)) | |
| (T : KernelTower Ξ© H) (f : FinitePath Ξ© H β β) (hf : β x, |f x| β€ 1) : | |
| (β t β I, | |
| (PrescribedTree.treeMean (realize H d S (updateCoordinate q v t)) T f- | |
| PrescribedTree.treeMean (realize H d S (updateCoordinate q v (t+1))) T f)^2) β€ | |
| (vertexArity S v:β)^2 := by | |
| classical | |
| by_cases hI : I.Nonempty | |
| Β· have hm := I.min'_mem hI | |
| have hM := I.max'_mem hI | |
| have hsub : I β Finset.Ico (I.min' hI) (I.max' hI+1) := by | |
| intro t ht | |
| exact Finset.mem_Ico.mpr β¨I.min'_le t ht,Nat.lt_succ_of_le (I.le_max' t ht)β© | |
| calc | |
| _ β€ β t β Finset.Ico (I.min' hI) (I.max' hI+1), | |
| (PrescribedTree.treeMean (realize H d S (updateCoordinate q v t)) T f- | |
| PrescribedTree.treeMean (realize H d S (updateCoordinate q v (t+1))) T f)^2 := | |
| Finset.sum_le_sum_of_subset_of_nonneg hsub (fun _ _ _ => sq_nonneg _) | |
| _ β€ _ := scheduled_vertex_Ico_energy_le H d S q v _ _ | |
| ((I.min'_le _ hM).trans (Nat.le_succ _)) (ha _ hm).1 (ha _ hM).2 T f hf | |
| Β· have he : I=β := Finset.not_nonempty_iff_eq_empty.mp hI | |
| simp only [he,Finset.sum_empty] | |
| positivity | |
| end DilutedSpinGlass.ReducedTopology | |
| end | |
| end | |
| end OAI | |