math / data /lean /OAI /Combinatorics /MatchingCount /Sampling /FiniteSampler3.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
3.21 kB
import Mathlib
import OAI.Combinatorics.MatchingCount.Sampling.ChosenChord
namespace OAI
namespace MatchingFPRAS.Transport.CellDemands
variable {V L : Type*} [Fintype V] [DecidableEq V] [Fintype L] [DecidableEq L]
variable {bags : V β†’ Finset L} {G : SimpleGraph L}
noncomputable local instance finiteSampler3WeightedCellBagEdgeFintype : Fintype (BagEdge bags) := Fintype.ofFinite _
variable {hbags : βˆ€ v, βˆ€ a ∈ bags v, βˆ€ b ∈ bags v, a = b ∨ G.Adj a b}
variable {hG : G.IsAcyclic}
variable (height : L β†’ ℝ) (hheight : βˆ€ l, 0 < height l)
variable (hstep : βˆ€ a b, G.Adj a b β†’ height a ≀ 2 * height b)
variable (D : ℝ) (hD : 1 ≀ D) (w : BagEdge bags β†’ ℝ)
variable (hw : βˆ€ e, height e.color / D ≀ w e ∧ w e ≀ 3 * height e.color)
variable (lo hi : ℝ) (hlo : 0 < lo) (hlohi : lo ≀ hi)
include hheight hstep hD hw hlohi
variable {V L : Type*} [Fintype V] [DecidableEq V] [Fintype L] [DecidableEq L]
variable {bags : V β†’ Finset L} {G : SimpleGraph L}
noncomputable local instance finiteSampler3AcyclicCellBagEdgeFintype : Fintype (BagEdge bags) := Fintype.ofFinite _
variable {hbags : βˆ€ v, βˆ€ a ∈ bags v, βˆ€ b ∈ bags v, a = b ∨ G.Adj a b}
variable {hG : G.IsAcyclic}
variable {V L : Type*} [Fintype V] [DecidableEq V] [Fintype L] [DecidableEq L]
variable {bags : V β†’ Finset L} {G : SimpleGraph L}
noncomputable local instance finiteSampler3DemandCellBagEdgeFintype : Fintype (BagEdge bags) := Fintype.ofFinite _
variable {hbags : βˆ€ v, βˆ€ a ∈ bags v, βˆ€ b ∈ bags v, a = b ∨ G.Adj a b}
variable {hG : G.IsAcyclic}
end MatchingFPRAS.Transport.CellDemands
namespace MatchingFPRAS.Transport
variable {V L : Type*} [Fintype V] [DecidableEq V] [Fintype L] [DecidableEq L]
variable {bags : V β†’ Finset L} {G : SimpleGraph L}
noncomputable local instance finiteSampler3TransportBagEdgeFintype : Fintype (BagEdge bags) := Fintype.ofFinite _
variable (hbags : βˆ€ v, βˆ€ a ∈ bags v, βˆ€ b ∈ bags v, a = b ∨ G.Adj a b)
variable (hG : G.IsAcyclic)
end MatchingFPRAS.Transport
namespace MatchingFPRAS.Transport.CellDemands
variable {V L : Type*} [Fintype V] [DecidableEq V] [Fintype L] [DecidableEq L]
variable {bags : V β†’ Finset L} {G : SimpleGraph L}
noncomputable local instance finiteSampler3BoundedCellBagEdgeFintype : Fintype (BagEdge bags) := Fintype.ofFinite _
variable {hbags : βˆ€ v, βˆ€ a ∈ bags v, βˆ€ b ∈ bags v, a = b ∨ G.Adj a b}
variable {hG : G.IsAcyclic}
variable (height : L β†’ ℝ) (hheight : βˆ€ l, 0 < height l)
variable (hstep : βˆ€ a b, G.Adj a b β†’ height a ≀ 2 * height b)
variable (D : ℝ) (hD : 1 ≀ D) (w : BagEdge bags β†’ ℝ)
variable (hw : βˆ€ e, height e.color / D ≀ w e ∧ w e ≀ 3 * height e.color)
variable (lo hi : ℝ) (hlo : 0 < lo) (hlohi : lo ≀ hi)
include hheight hstep hD hw hlo hlohi hbags hG
end MatchingFPRAS.Transport.CellDemands
namespace MatchingFPRAS.Transport
open Finset
variable {V L : Type*} [Fintype V] [DecidableEq V] [Fintype L] [DecidableEq L]
variable {bags : V β†’ Finset L}
noncomputable local instance finiteSampler3BagEdgeFintype : Fintype (BagEdge bags) := Fintype.ofFinite _
end MatchingFPRAS.Transport
end OAI