Download data/lean/OAI/Probability/LogConcave/TensorGraphs/HessianIncidenceTensor.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 11 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/LogConcave/TensorGraphs/HessianIncidenceTensor.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/LogConcave/TensorGraphs/HessianIncidenceTensor.lean
-
curl -L -o HessianIncidenceTensor.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/LogConcave/TensorGraphs/HessianIncidenceTensor.lean
11 kB
| import Mathlib | |
| import OAI.Probability.LogConcave.TensorGraphs.IncidentMatrix | |
| import OAI.Probability.LogConcave.JetEstimates.JetCongrList | |
| namespace OAI | |
| section | |
| section | |
| noncomputable section | |
| open MeasureTheory Filter | |
| open scoped ENNReal NNReal Topology | |
| section UpperProof | |
| open MeasureTheory ProbabilityTheory Filter | |
| open scoped ENNReal NNReal RealInnerProductSpace Topology | |
| open Function MeasureTheory Set Filter | |
| open scoped Topology NNReal | |
| namespace LogConcaveSampling.AdjointRemoval | |
| variable {d : β} {P : Type*} | |
| lemma hessian_congr_on_tokens (H : Point d β β) (b c : P β Point d) (h : Hessian P) | |
| (he : βiβh.tokens,b i=c i) : hessian H b h=hessian H c h := by | |
| have hf : b h.first=c h.first := he _ (by simp [Hessian.tokens]) | |
| have hs : b h.second=c h.second := he _ (by simp [Hessian.tokens]) | |
| unfold hessian | |
| rw [hf,hs] | |
| apply JetCalculus.jet_congr_on_list | |
| intro i hi | |
| exact he i (by simp [Hessian.tokens,hi]) | |
| end LogConcaveSampling.AdjointRemoval | |
| namespace LogConcaveSampling.AdjointRemoval | |
| open GraphSchedule | |
| open scoped Classical | |
| variable {n d : β} {S : State (Fin (n+1))} | |
| noncomputable def hessianIncidenceTensor | |
| (hS : Sβexpand (Fintype.card (Fin (n+1))) initial) | |
| (Ξ² : Fin n β β) (q : β) (H : Point d β β) (b : Fin d β Point d) | |
| (h : S.hessians) (x : Point d) | |
| (a : {t : Edge (U:=InternalEdge Ξ²) q // | |
| IncidentAt (edgeSource (S:=S) Ξ²) (edgeTarget hS Ξ²) | |
| (Sum.inl 0) (Sum.inl (Fin.last n)) (Sum.inr h) q t} β Fin d) : β := | |
| hessian H (fun i => if hi : destination hS i=Sum.inr h then | |
| b (a β¨Sum.inl (Sum.inr i),Or.inr hiβ©) else 0) h x | |
| lemma hessianIncidenceTensor_global | |
| (hS : Sβexpand (Fintype.card (Fin (n+1))) initial) | |
| (Ξ² : Fin n β β) (q : β) (H : Point d β β) (b : Fin d β Point d) | |
| (h : S.hessians) (x : Point d) (c : InternalEdge Ξ² β Fin q β Fin d) : | |
| hessianIncidenceTensor hS Ξ² q H b h x (fun t => duplicate c t.val)= | |
| hessian H (fun i => b (c (Sum.inl (Sum.inr i)))) h x := by | |
| unfold hessianIncidenceTensor | |
| refine congrFun (hessian_congr_on_tokens (P:=Fin (n+1)) H _ _ | |
| (h : Hessian (Fin (n+1))) ?_) x | |
| intro i hi | |
| have hd : destination hS i=Sum.inr h := | |
| (destination_iff_mem hS i (Sum.inr h)).mpr hi | |
| simp only [dite_eq_left hd] | |
| rfl | |
| end LogConcaveSampling.AdjointRemoval | |
| namespace LogConcaveSampling.AdjointRemoval | |
| open GraphSchedule | |
| open scoped Classical | |
| variable {n d : β} {S : State (Fin (n+1))} | |
| abbrev TraceEdge (Ξ² : Fin n β β) (q : β) := | |
| ((k : Fin n) Γ Fin (Ξ² k)) β (Fin q β Fin q) | |
| def traceEmbed (Ξ² : Fin n β β) (q : β) : TraceEdge Ξ² q β Edge (U:=InternalEdge Ξ²) q | |
| | Sum.inl e => Sum.inl (Sum.inl e) | |
| | Sum.inr e => Sum.inr e | |
| abbrev PrimaryTraceSlot | |
| (hS : Sβexpand (Fintype.card (Fin (n+1))) initial) | |
| (Ξ² : Fin n β β) (q : β) (i : Fin (n+1)) := | |
| {t : TraceEdge Ξ² q // | |
| IncidentAt (edgeSource (S:=S) Ξ²) (edgeTarget hS Ξ²) | |
| (Sum.inl 0) (Sum.inl (Fin.last n)) (Sum.inl i) q (traceEmbed Ξ² q t)} | |
| noncomputable def primaryIncidenceTensor | |
| (hS : Sβexpand (Fintype.card (Fin (n+1))) initial) | |
| (Ξ² : Fin n β β) (q : β) (b : Fin d β Point d) (i : Fin (n+1)) | |
| (F : (PrimaryTraceSlot hS Ξ² q i β Fin d) β Fin d β Point d β β) (x : Point d) | |
| (a : {t : Edge (U:=InternalEdge Ξ²) q // | |
| IncidentAt (edgeSource (S:=S) Ξ²) (edgeTarget hS Ξ²) | |
| (Sum.inl 0) (Sum.inl (Fin.last n)) (Sum.inl i) q t} β Fin d) : β := | |
| JetCalculus.jet (fun j => if hj : destination hS j=Sum.inl i then | |
| b (a β¨Sum.inl (Sum.inr j),Or.inr hjβ©) else 0) (S.derivatives i) | |
| (F (fun t => a β¨traceEmbed Ξ² q t.val,t.propertyβ©) | |
| (a β¨Sum.inl (Sum.inr i),Or.inl rflβ©)) x | |
| lemma primaryIncidenceTensor_global | |
| (hS : Sβexpand (Fintype.card (Fin (n+1))) initial) | |
| (Ξ² : Fin n β β) (q : β) (b : Fin d β Point d) (i : Fin (n+1)) | |
| (F : (PrimaryTraceSlot hS Ξ² q i β Fin d) β Fin d β Point d β β) | |
| (x : Point d) (c : InternalEdge Ξ² β Fin q β Fin d) : | |
| primaryIncidenceTensor hS Ξ² q b i F x (fun t => duplicate c t.val)= | |
| JetCalculus.jet (fun j => b (c (Sum.inl (Sum.inr j)))) (S.derivatives i) | |
| (F (fun t => duplicate c (traceEmbed Ξ² q t.val)) (c (Sum.inl (Sum.inr i)))) x := by | |
| unfold primaryIncidenceTensor | |
| apply congrFun (JetCalculus.jet_congr_on_list _ _ _ _ ?_) x | |
| intro j hj | |
| have hd : destination hS j=Sum.inl i := | |
| (destination_iff_mem hS j (Sum.inl i)).mpr hj | |
| simp only [dite_eq_left hd] | |
| rfl | |
| end LogConcaveSampling.AdjointRemoval | |
| namespace LogConcaveSampling.AdjointRemoval | |
| open GraphSchedule TensorEnergy MeasureTheory | |
| open scoped BigOperators Classical ENNReal | |
| variable {n d : β} {S : State (Fin (n+1))} | |
| local instance edgeDecEqBT (Ξ² : Fin n β β) (q : β) : | |
| DecidableEq (Edge (U:=InternalEdge Ξ²) q) := Classical.decEq _ | |
| local instance cutDecEqBT (Ξ² : Fin n β β) (q : β) : | |
| DecidableEq (InternalEdge Ξ² β Fin q) := | |
| @instDecidableEqSum _ _ (Classical.decEq _) (Classical.decEq _) | |
| noncomputable def branchIncidenceTensor | |
| (hS : Sβexpand (Fintype.card (Fin (n+1))) initial) | |
| (Ξ² : Fin n β β) (q : β) (H : Point d β β) (b : Fin d β Point d) | |
| (F : βi,(PrimaryTraceSlot hS Ξ² q i β Fin d) β Fin d β Point d β β) | |
| (x : Point d) (v : TargetVertex S) : | |
| ({t : Edge (U:=InternalEdge Ξ²) q // | |
| IncidentAt (edgeSource (S:=S) Ξ²) (edgeTarget hS Ξ²) | |
| (Sum.inl 0) (Sum.inl (Fin.last n)) v q t} β Fin d) β β := | |
| match v with | |
| | Sum.inl i => primaryIncidenceTensor hS Ξ² q b i (F i) x | |
| | Sum.inr h => hessianIncidenceTensor hS Ξ² q H b h x | |
| lemma branchIncidenceTensor_global | |
| (hS : Sβexpand (Fintype.card (Fin (n+1))) initial) | |
| (Ξ² : Fin n β β) (q : β) (H : Point d β β) (b : Fin d β Point d) | |
| (F : βi,(PrimaryTraceSlot hS Ξ² q i β Fin d) β Fin d β Point d β β) | |
| (x : Point d) (c : InternalEdge Ξ² β Fin q β Fin d) : | |
| (βv,branchIncidenceTensor hS Ξ² q H b F x v (fun t => duplicate c t.val))= | |
| (βi,JetCalculus.jet (fun j => b (c (Sum.inl (Sum.inr j)))) (S.derivatives i) | |
| (F i (fun t => duplicate c (traceEmbed Ξ² q t.val)) (c (Sum.inl (Sum.inr i)))) x)* | |
| (S.hessians.map (fun h => hessian H (fun j => b (c (Sum.inl (Sum.inr j)))) h x)).prod := by | |
| rw [Fintype.prod_sum_type] | |
| simp only [branchIncidenceTensor,primaryIncidenceTensor_global,hessianIncidenceTensor_global] | |
| congr 1 | |
| change (Finset.univ.val.map (fun h : S.hessians => | |
| hessian H (fun j => b (c (Sum.inl (Sum.inr j)))) h x)).prod=_ | |
| exact congrArg Multiset.prod (Multiset.map_univ S.hessians | |
| (fun h => hessian H (fun j => b (c (Sum.inl (Sum.inr j)))) h x)) | |
| theorem literal_branch_integral_bound | |
| (ΞΌ : Measure (Point d)) | |
| (hS : Sβexpand (Fintype.card (Fin (n+1))) initial) | |
| (Ξ² : Fin n β β) (hΞ² : βk,0<Ξ² k) (q : β) (hq : 0<q) | |
| (H : Point d β β) (b : Fin d β Point d) | |
| (F : βi,(PrimaryTraceSlot hS Ξ² q i β Fin d) β Fin d β Point d β β) | |
| (M : TargetVertex S β Point d β β) (hM : βv x,0β€M v x) | |
| (hT : βv x,AllSplitBound (branchIncidenceTensor hS Ξ² q H b F x v) (M v x)) | |
| (B : Fin (n+1) β ββ₯0β) (C : S.hessians β ββ₯0β) | |
| (hMp : βi,AEMeasurable (fun x => ENNReal.ofReal (M (Sum.inl i) x)) ΞΌ) | |
| (hp : βi,(β«β»x,ENNReal.ofReal (M (Sum.inl i) x)^(n+1) βΞΌ)β€B i^(n+1)) | |
| (hh : βh x,ENNReal.ofReal (M (Sum.inr h) x)β€C h) (hC : βh,C hβ β€) : | |
| (β«β»x,ENNReal.ofReal |βc : InternalEdge Ξ² β Fin q β Fin d, | |
| (βi,JetCalculus.jet (fun j => b (c (Sum.inl (Sum.inr j)))) (S.derivatives i) | |
| (F i (fun t => duplicate c (traceEmbed Ξ² q t.val)) (c (Sum.inl (Sum.inr i)))) x)* | |
| (S.hessians.map (fun h => hessian H (fun j => b (c (Sum.inl (Sum.inr j)))) h x)).prod| βΞΌ)β€ | |
| (d:ββ₯0β)^q*((βi,B i)*(βh,C h)) := by | |
| have hb := actual_tensor_integral_bound ΞΌ hS Ξ² hΞ² q d hq | |
| (branchIncidenceTensor hS Ξ² q H b F) M hM hT B C hMp hp hh hC | |
| convert hb using 1 | |
| congr 1 | |
| funext x | |
| congr 2 | |
| apply Finset.sum_congr rfl | |
| intro c _ | |
| exact (branchIncidenceTensor_global hS Ξ² q H b F x c).symm | |
| end LogConcaveSampling.AdjointRemoval | |
| namespace LogConcaveSampling.AdjointRemoval | |
| open GraphSchedule | |
| open scoped Classical | |
| variable {n : β} {S : State (Fin (n+1))} | |
| noncomputable def primaryIncidentCases | |
| (hS : Sβexpand (Fintype.card (Fin (n+1))) initial) | |
| (Ξ² : Fin n β β) (q : β) (i : Fin (n+1)) : | |
| {t : Edge (U:=InternalEdge Ξ²) q // | |
| IncidentAt (edgeSource (S:=S) Ξ²) (edgeTarget hS Ξ²) | |
| (Sum.inl 0) (Sum.inl (Fin.last n)) (Sum.inl i) q t} β | |
| PrimaryTraceSlot hS Ξ² q i β (Unit β {j : Fin (n+1) // destination hS j=Sum.inl i}) where | |
| toFun t := by | |
| rcases t with β¨(e|j)|e,htβ© | |
| Β· exact Sum.inl β¨Sum.inl e,htβ© | |
| Β· by_cases hj : j=i | |
| Β· exact Sum.inr (Sum.inl ()) | |
| Β· exact Sum.inr (Sum.inr β¨j,ht.resolve_left (fun h => hj (Sum.inl.inj h))β©) | |
| Β· exact Sum.inl β¨Sum.inr e,htβ© | |
| invFun t := by | |
| rcases t with t | (u | j) | |
| Β· exact β¨traceEmbed Ξ² q t.val,t.propertyβ© | |
| Β· exact β¨Sum.inl (Sum.inr i),Or.inl rflβ© | |
| Β· exact β¨Sum.inl (Sum.inr j.val),Or.inr j.propertyβ© | |
| left_inv t := by | |
| rcases t with β¨(e|j)|e,htβ© | |
| Β· rfl | |
| Β· dsimp only | |
| split_ifs with hj | |
| Β· subst j; rfl | |
| Β· rfl | |
| Β· rfl | |
| right_inv t := by | |
| rcases t with β¨e|e,htβ© | (u | β¨j,hjβ©) | |
| Β· rfl | |
| Β· rfl | |
| Β· cases u | |
| dsimp only | |
| simp only [dite_true] | |
| Β· dsimp only | |
| rw [dite_eq_right (destination_primary_ne hS hj)] | |
| noncomputable def primarySlotEquiv | |
| (hS : Sβexpand (Fintype.card (Fin (n+1))) initial) | |
| (Ξ² : Fin n β β) (q : β) (i : Fin (n+1)) : | |
| (PrimaryTraceSlot hS Ξ² q i β (Unit β Fin (S.derivatives i).length)) β | |
| {t : Edge (U:=InternalEdge Ξ²) q // | |
| IncidentAt (edgeSource (S:=S) Ξ²) (edgeTarget hS Ξ²) | |
| (Sum.inl 0) (Sum.inl (Fin.last n)) (Sum.inl i) q t} := | |
| (Equiv.sumCongr (Equiv.refl _) (Equiv.sumCongr (Equiv.refl _) (derivativeEdgeEquiv hS i))).trans | |
| (primaryIncidentCases hS Ξ² q i).symm | |
| lemma primarySlotEquiv_trace | |
| (hS : Sβexpand (Fintype.card (Fin (n+1))) initial) | |
| (Ξ² : Fin n β β) (q : β) (i : Fin (n+1)) (t : PrimaryTraceSlot hS Ξ² q i) : | |
| (primarySlotEquiv hS Ξ² q i (Sum.inl t)).val=traceEmbed Ξ² q t.val := rfl | |
| lemma primarySlotEquiv_source | |
| (hS : Sβexpand (Fintype.card (Fin (n+1))) initial) | |
| (Ξ² : Fin n β β) (q : β) (i : Fin (n+1)) : | |
| (primarySlotEquiv hS Ξ² q i (Sum.inr (Sum.inl ()))).val=Sum.inl (Sum.inr i) := rfl | |
| lemma primarySlotEquiv_derivative | |
| (hS : Sβexpand (Fintype.card (Fin (n+1))) initial) | |
| (Ξ² : Fin n β β) (q : β) (i : Fin (n+1)) (k : Fin (S.derivatives i).length) : | |
| (primarySlotEquiv hS Ξ² q i (Sum.inr (Sum.inr k))).val= | |
| Sum.inl (Sum.inr ((S.derivatives i).get k)) := rfl | |
| end LogConcaveSampling.AdjointRemoval | |
| end UpperProof | |
| end | |
| end | |
| end | |
| end OAI | |