Download data/lean/OAI/Probability/CriticalPercolation/Entropy/BinaryEventBound.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 3.57 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/CriticalPercolation/Entropy/BinaryEventBound.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/CriticalPercolation/Entropy/BinaryEventBound.lean
-
curl -L -o BinaryEventBound.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/CriticalPercolation/Entropy/BinaryEventBound.lean
3.57 kB
| import Mathlib | |
| import OAI.Probability.CriticalPercolation.Entropy.FiniteEventEntropy | |
| import OAI.Probability.CriticalPercolation.Entropy.BinaryOutputEntropy | |
| namespace OAI | |
| section | |
| section | |
| noncomputable section | |
| namespace CriticalPercolation.BinaryLaw | |
| open scoped Classical | |
| open FiniteProduct BondGraph BinaryInterpolation ExactExposure FiniteEntropy MarkedBits | |
| variable {V E : Type*} [Fintype V] [Fintype E] | |
| local instance eventBoundFinDec (n : β) : DecidableEq (Fin n) := Classical.decEq _ | |
| variable (G : BondGraph V E) (order : List (LazyDFS.Dart V E)) (d : β) (x : β β V) | |
| variable (p : β) (w : E β Prop β β) (s n : β) (D : FixedDescriptor n) | |
| lemma prob_bits (h0 : β e, w e False = 1-p) (h1 : β e, w e True = p) | |
| (P : Set E β Prop) : | |
| (β Ο : E β Bool, if P (configuration Ο) then FiniteProduct.density (QueryTree.bitWeight p) Ο else 0) = | |
| prob w P := by | |
| have hw : QueryTree.bitWeight p = fun e (b : Bool) => w e (b = true) := by | |
| funext e b | |
| cases b <;> simp [QueryTree.bitWeight,h0,h1] | |
| have he := expect_configuration w (fun Ξ· => if P Ξ· then (1:β) else 0) | |
| rw [β hw] at he | |
| simpa only [expect,prob,mul_ite,mul_one,mul_zero] using he | |
| theorem conditioned_event_bound (horder : LazyDFS.GoodDarts G order) | |
| (ho : LazyDFS.Exhaustive G order) (hd : 0<d) (hp : p β Set.Ioo 0 1) | |
| (h0 : β e, w e False = 1-p) (h1 : β e, w e True = p) | |
| {c : β} (hc : 0<c) (hc1 : cβ€1) | |
| (hconn : β j, 0<j β j<d β c β€ prob w (fun Ο => (G.openGraph Ο).Reachable (x 0) (x j))) | |
| (hΞ΄ : 0 < prob w (endpointEvent G (x 0) (x d) s)) | |
| (hD : 0 < descriptorMass G order d x p w s n D) : | |
| let t := interval d n (fromWords (E := E) n (fun j => (D j).1) (fun _ => none)) | |
| 0 < prob w (endpointEvent G (x t.1) (x t.2) s) β§ | |
| -Real.log (prob w (endpointEvent G (x t.1) (x t.2) s)) β€ | |
| (4*(16/(2*p*(1-p)))+6)*constructionCost G order d x p w c s n D + | |
| (2*(16/(2*p*(1-p)))+5)*n*Real.log 4 := by | |
| dsimp only | |
| let t := interval d n (fromWords (E := E) n (fun j => (D j).1) (fun _ => none)) | |
| let P := endpointEvent G (x t.1) (x t.2) s | |
| let Q := conditionedMass G order d x p w s n D | |
| let f : ((E β Bool) Γ (Fin n β Option E)) β (E β Bool) := fun z => stage n D z.1 z.2 n | |
| have hQ := conditionedMass_nonneg G order d x p w s n hp h0 h1 hΞ΄ D hD | |
| have hQ1 : β z, Q z=1 := by | |
| have he := conditionedMass_normalized G order d x p w s n D hD | |
| refine Eq.trans ?_ he | |
| apply Finset.sum_congr | |
| Β· ext z; simp only [Finset.mem_univ] | |
| Β· intro z _; rfl | |
| have hh := supported_event_entropy (pushMass f Q) (FiniteProduct.density (QueryTree.bitWeight p)) | |
| (pushMass_nonneg f Q hQ) ((pushMass_sum f Q).trans hQ1) | |
| (fun Ο => Finset.prod_pos fun e _ => QueryTree.bitWeight_pos hp e (Ο e)) | |
| {Ο | P (configuration Ο)} | |
| (pushMass_supported Q f {Ο | P (configuration Ο)} (fun z hz => | |
| stage_endpointEvent G order d x p w s n D z.1 z.2 hz)) | |
| have hb := prob_bits p w h0 h1 P | |
| change (β Ο : E β Bool, if P (configuration Ο) then FiniteProduct.density (QueryTree.bitWeight p) Ο else 0) = _ at hb | |
| change 0 < (β Ο : E β Bool, if P (configuration Ο) then FiniteProduct.density (QueryTree.bitWeight p) Ο else 0) β§ _ at hh | |
| rw [hb] at hh | |
| have hl := conditioned_output_entropy G order d x p w s n D horder ho hd hp h0 h1 hc hc1 hconn hΞ΄ hD | |
| refine β¨hh.1,?_β© | |
| have he := hh.2.trans hl | |
| simp only [Set.mem_ofPred_eq] at he | |
| rw [hb] at he | |
| simpa only [one_div,Real.log_inv] using he | |
| end CriticalPercolation.BinaryLaw | |
| end | |
| end | |
| end | |
| end OAI | |