Download data/lean/OAI/Probability/LogConcave/TensorGraphs/IncidentMatrix.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 9.9 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/LogConcave/TensorGraphs/IncidentMatrix.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/LogConcave/TensorGraphs/IncidentMatrix.lean
-
curl -L -o IncidentMatrix.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/LogConcave/TensorGraphs/IncidentMatrix.lean
9.9 kB
| import Mathlib | |
| import OAI.Probability.LogConcave.TensorGraphs.RankEquiv | |
| import OAI.Probability.LogConcave.JetEstimates.AllSplitBound | |
| 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.GraphSchedule | |
| open scoped Classical | |
| variable {V U : Type*} [Fintype V] [Fintype U] | |
| (key : V β β) (src dst : U β V) | |
| local instance edgeDecEqT (q : β) : DecidableEq (Edge (U:=U) q) := Classical.decEq _ | |
| local instance finDecEqT (d : β) : DecidableEq (Fin d) := Classical.decEq _ | |
| noncomputable def incidentMatrix (hkey : Function.Injective key) (hne : βu,src uβ dst u) | |
| (first last v : V) (q d : β) | |
| (T : ({t : Edge (U:=U) q // IncidentAt src dst first last v q t} β Fin d) β β) : | |
| (Frontier.Outgoing (emit key src dst first last q) (key v) β Fin d) β | |
| (Frontier.Incoming (absorb key src dst first last q) (key v) β Fin d) β β := | |
| fun o i => T (fun t => Sum.elim i o (incidentSplit key src dst hkey hne first last v q t)) | |
| omit [Fintype U] in | |
| lemma incidentMatrix_global (hkey : Function.Injective key) (hne : βu,src uβ dst u) | |
| (first last v : V) (q d : β) | |
| (T : ({t : Edge (U:=U) q // IncidentAt src dst first last v q t} β Fin d) β β) | |
| (c : Edge (U:=U) q β Fin d) : | |
| incidentMatrix key src dst hkey hne first last v q d T | |
| (fun t => c t.val) (fun t => c t.val)=T (fun t => c t.val) := by | |
| unfold incidentMatrix | |
| congr 1 | |
| funext t | |
| dsimp only [incidentSplit,Equiv.coe_fn_mk] | |
| split_ifs <;> rfl | |
| lemma incidentMatrix_bound (hkey : Function.Injective key) (hne : βu,src uβ dst u) | |
| (first last v : V) (q d : β) | |
| (T : ({t : Edge (U:=U) q // IncidentAt src dst first last v q t} β Fin d) β β) | |
| (M : β) (hT : TensorEnergy.AllSplitBound T M) | |
| [Nonempty (Frontier.Incoming (absorb key src dst first last q) (key v))] | |
| [Nonempty (Frontier.Outgoing (emit key src dst first last q) (key v))] : | |
| TensorEnergy.Bound (incidentMatrix key src dst hkey hne first last v q d T) (M^2) := | |
| hT _ _ (incidentSplit key src dst hkey hne first last v q) | |
| end LogConcaveSampling.GraphSchedule | |
| namespace LogConcaveSampling.GraphSchedule | |
| open scoped BigOperators Classical | |
| open TensorEnergy | |
| variable {V U : Type*} [Fintype V] [Fintype U] [Nonempty V] | |
| local instance edgeDecEqTG (q : β) : DecidableEq (Edge (U:=U) q) := Classical.decEq _ | |
| local instance finDecEqTG (d : β) : DecidableEq (Fin d) := Classical.decEq _ | |
| theorem tensor_graph_bound (e : V β Fin (Fintype.card V)) (src dst : U β V) | |
| (hne : βu,src uβ dst u) (first last : V) (q d : β) | |
| (hsplit : βv, | |
| Nonempty (Frontier.Incoming (absorb (fun v => (e v).val) src dst first last q) (e v).val) β§ | |
| Nonempty (Frontier.Outgoing (emit (fun v => (e v).val) src dst first last q) (e v).val)) | |
| (T : βv,({t : Edge (U:=U) q // IncidentAt src dst first last v q t} β Fin d) β β) | |
| (M : V β β) (hM : βv,0β€M v) (hT : βv,AllSplitBound (T v) (M v)) : | |
| |βc : U β Fin q β Fin d, βv,T v (fun t => duplicate c t.val)|β€ | |
| (d:β)^q*(βv,M v) := by | |
| let key : V β β := fun v => (e v).val | |
| have hkey : Function.Injective key := Fin.val_injective.comp e.injective | |
| let D : β β Type _ := fun k => | |
| (Frontier.Outgoing (emit key src dst first last q) k β Fin d) β | |
| (Frontier.Incoming (absorb key src dst first last q) k β Fin d) β β | |
| let a : βv,D (e v).val := fun v => | |
| incidentMatrix key src dst hkey hne first last v q d (T v) | |
| let A : βk,D k := rankExtend e (fun _ _ _ => 0) a | |
| have hAt (v : V) : A (e v).val=a v := rankExtend_at e _ a v | |
| have hA (v : V) : Bound (A (e v).val) ((M v)^2) := by | |
| rw [hAt] | |
| let := (hsplit v).1 | |
| let := (hsplit v).2 | |
| exact incidentMatrix_bound key src dst hkey hne first last v q d (T v) (M v) (hT v) | |
| have hb := ranked_coordinate_bound e src dst hne first last q d A M hM hA | |
| have heq (v : V) (c : U β Fin q β Fin d) : | |
| A (e v).val (fun t => duplicate c t.val) (fun t => duplicate c t.val)= | |
| T v (fun t => duplicate c t.val) := by | |
| rw [hAt] | |
| exact incidentMatrix_global key src dst hkey hne first last v q d (T v) (duplicate c) | |
| convert hb using 1 | |
| congr 1 | |
| apply Finset.sum_congr rfl | |
| intro c _ | |
| apply Finset.prod_congr rfl | |
| intro v _ | |
| exact (heq v c).symm | |
| end LogConcaveSampling.GraphSchedule | |
| namespace LogConcaveSampling.GraphSchedule | |
| open MeasureTheory TensorEnergy | |
| open scoped BigOperators Classical ENNReal | |
| variable {Ξ© P H U : Type*} [MeasurableSpace Ξ©] [Fintype P] [Fintype H] [Fintype U] | |
| [Nonempty P] | |
| local instance edgeDecEqTGI (q : β) : DecidableEq (Edge (U:=U) q) := Classical.decEq _ | |
| local instance finDecEqTGI (d : β) : DecidableEq (Fin d) := Classical.decEq _ | |
| theorem tensor_graph_integral_bound (ΞΌ : Measure Ξ©) | |
| (e : P β H β Fin (Fintype.card (P β H))) (src dst : U β P β H) | |
| (hne : βu,src uβ dst u) (first last : P β H) (q d : β) | |
| (hsplit : βv, | |
| Nonempty (Frontier.Incoming (absorb (fun v => (e v).val) src dst first last q) (e v).val) β§ | |
| Nonempty (Frontier.Outgoing (emit (fun v => (e v).val) src dst first last q) (e v).val)) | |
| (T : Ξ© β βv,({t : Edge (U:=U) q // IncidentAt src dst first last v q t} β Fin d) β β) | |
| (M : P β H β Ξ© β β) (hM : βv x,0β€M v x) | |
| (hT : βv x,AllSplitBound (T x v) (M v x)) | |
| (B : P β ββ₯0β) (C : H β ββ₯0β) | |
| (hMp : βi,AEMeasurable (fun x => ENNReal.ofReal (M (Sum.inl i) x)) ΞΌ) | |
| (hp : βi,(β«β»x,ENNReal.ofReal (M (Sum.inl i) x)^(Fintype.card P) βΞΌ)β€B i^(Fintype.card P)) | |
| (hh : βh x,ENNReal.ofReal (M (Sum.inr h) x)β€C h) (hC : βh,C hβ β€) : | |
| (β«β»x,ENNReal.ofReal |βc : U β Fin q β Fin d, | |
| βv,T x v (fun t => duplicate c t.val)| βΞΌ)β€ | |
| (d:ββ₯0β)^q*((βi,B i)*(βh,C h)) := by | |
| have hpw (x : Ξ©) : ENNReal.ofReal |βc : U β Fin q β Fin d, | |
| βv,T x v (fun t => duplicate c t.val)|β€ | |
| (d:ββ₯0β)^q*((βi,ENNReal.ofReal (M (Sum.inl i) x))* | |
| (βh,ENNReal.ofReal (M (Sum.inr h) x))) := by | |
| have hb := ENNReal.ofReal_le_ofReal (tensor_graph_bound e src dst hne first last q d | |
| hsplit (T x) (fun v => M v x) (fun v => hM v x) (fun v => hT v x)) | |
| rw [ENNReal.ofReal_mul (by positivity),ENNReal.ofReal_pow (by positivity), | |
| ENNReal.ofReal_natCast,ENNReal.ofReal_prod_of_nonneg (fun v _ => hM v x), | |
| Fintype.prod_sum_type] at hb | |
| exact hb | |
| calc | |
| _ β€ β«β»x,(d:ββ₯0β)^q*((βi,ENNReal.ofReal (M (Sum.inl i) x))* | |
| (βh,ENNReal.ofReal (M (Sum.inr h) x))) βΞΌ := lintegral_mono hpw | |
| _ = (d:ββ₯0β)^q*(β«β»x,(βi,ENNReal.ofReal (M (Sum.inl i) x))* | |
| (βh,ENNReal.ofReal (M (Sum.inr h) x)) βΞΌ) := | |
| lintegral_const_mul' _ _ (by finiteness) | |
| _ β€ _ := mul_le_mul' le_rfl | |
| (NetworkMoments.lintegral_primary_auxiliary_le hMp hp hh hC) | |
| end LogConcaveSampling.GraphSchedule | |
| namespace LogConcaveSampling.AdjointRemoval | |
| open MeasureTheory GraphSchedule TensorEnergy | |
| open scoped BigOperators Classical ENNReal | |
| variable {n : β} {S : State (Fin (n+1))} | |
| local instance edgeDecEqAT (Ξ² : Fin n β β) (q : β) : | |
| DecidableEq (Edge (U:=InternalEdge Ξ²) q) := Classical.decEq _ | |
| local instance cutDecEqAT (Ξ² : Fin n β β) (q : β) : | |
| DecidableEq (InternalEdge Ξ² β Fin q) := | |
| _ _ (Classical.decEq _) (Classical.decEq _) | |
| theorem actual_tensor_contraction_bound | |
| (hS : Sβexpand (Fintype.card (Fin (n+1))) initial) | |
| (Ξ² : Fin n β β) (hΞ² : βk,0<Ξ² k) (q d : β) (hq : 0<q) | |
| (T : βv : TargetVertex S, | |
| ({t : Edge (U:=InternalEdge Ξ²) q // | |
| IncidentAt (V:=TargetVertex S) (edgeSource (S:=S) Ξ²) (edgeTarget (S:=S) hS Ξ²) | |
| (Sum.inl 0) (Sum.inl (Fin.last n)) v q t} β Fin d) β β) | |
| (M : TargetVertex S β β) (hM : βv,0β€M v) (hT : βv,AllSplitBound (T v) (M v)) : | |
| |βc : InternalEdge Ξ² β Fin q β Fin d, βv,T v (fun t => duplicate c t.val)|β€ | |
| (d:β)^q*(βv,M v) := by | |
| obtain β¨e,heβ© := actual_ranked_schedule hS Ξ² hΞ² | |
| exact tensor_graph_bound e (edgeSource (S:=S) Ξ²) (edgeTarget (S:=S) hS Ξ²) | |
| (internal_source_ne hS Ξ²) (Sum.inl 0) (Sum.inl (Fin.last n)) q d (he q hq) T M hM hT | |
| theorem actual_tensor_integral_bound {Ξ© : Type*} [MeasurableSpace Ξ©] (ΞΌ : Measure Ξ©) | |
| (hS : Sβexpand (Fintype.card (Fin (n+1))) initial) | |
| (Ξ² : Fin n β β) (hΞ² : βk,0<Ξ² k) (q d : β) (hq : 0<q) | |
| (T : Ξ© β βv : TargetVertex S, | |
| ({t : Edge (U:=InternalEdge Ξ²) q // | |
| IncidentAt (V:=TargetVertex S) (edgeSource (S:=S) Ξ²) (edgeTarget (S:=S) hS Ξ²) | |
| (Sum.inl 0) (Sum.inl (Fin.last n)) v q t} β Fin d) β β) | |
| (M : TargetVertex S β Ξ© β β) (hM : βv x,0β€M v x) | |
| (hT : βv x,AllSplitBound (T 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, | |
| βv,T x v (fun t => duplicate c t.val)| βΞΌ)β€ | |
| (d:ββ₯0β)^q*((βi,B i)*(βh,C h)) := by | |
| obtain β¨e,heβ© := actual_ranked_schedule hS Ξ² hΞ² | |
| exact tensor_graph_integral_bound ΞΌ e (edgeSource (S:=S) Ξ²) (edgeTarget (S:=S) hS Ξ²) | |
| (internal_source_ne hS Ξ²) (Sum.inl 0) (Sum.inl (Fin.last n)) q d (he q hq) T M hM hT | |
| B C hMp (by simpa only [Fintype.card_fin] using hp) hh hC | |
| end LogConcaveSampling.AdjointRemoval | |
| end UpperProof | |
| end | |
| end | |
| end | |
| end OAI | |