math / data /lean /OAI /Analysis /CircleDomains /Modulus /AdmissiblePathCost.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
3.04 kB
import OAI.Analysis.CircleDomains.Modulus.RetaggedCost
import OAI.Analysis.CircleDomains.Selection.PreterminalTolls
namespace OAI
/-! A positive perturbation of an admissible coding metric gives a genuine
physical-plus-preterminal cost lower bound on every allowed path. -/
open Set MeasureTheory
open scoped ENNReal
noncomputable section
namespace CircleDomainRigidity
variable {X Y D : Type*} [MetricSpace X] [MetricSpace Y] [TopologicalSpace D]
[MeasurableSpace X] [MeasurableSpace Y] [BorelSpace Y]
[MeasurableSpace D] [BorelSpace D] [MeasurableSpace C(PathTime, X)]
def physicalAtomicCost (d : PathCodeData X Y) (p : D β†’ X) (Ξ“ : BasePathCode d)
(g : Y β†’ ℝβ‰₯0∞) (m : D β†’ ℝβ‰₯0∞) : ℝβ‰₯0∞ :=
(∫⁻ y, g y βˆ‚baseCodeOccupation d Ξ“) +
βˆ‘' s, m s * preterminalVisitCount Ξ“.val.1 (p s)
omit [TopologicalSpace D] [MeasurableSpace D] [BorelSpace D] in
theorem nonTupleCost_le_physicalAtomicCost (d : PathCodeData X Y)
(p : D β†’ X) (c : D β†’ ℝβ‰₯0∞) (Ξ“ : BasePathCode d)
(h : PathCostSpace Y D β†’ ℝβ‰₯0∞) (g : Y β†’ ℝβ‰₯0∞) (m : D β†’ ℝβ‰₯0∞)
(hg : βˆ€ y, h (costPhysical y) ≀ g y)
(hm : βˆ€ s, c s * h (costAtomic s) ≀ m s) :
nonTupleCost d p c Ξ“ h ≀ physicalAtomicCost d p Ξ“ g m := by
apply add_le_add (lintegral_mono hg)
apply ENNReal.tsum_le_tsum
intro s
calc
(c s * preterminalVisitCount Ξ“.val.1 (p s)) * h (costAtomic s) =
(c s * h (costAtomic s)) * preterminalVisitCount Ξ“.val.1 (p s) := by ac_rfl
_ ≀ m s * preterminalVisitCount Ξ“.val.1 (p s) := mul_le_mul' (hm s) le_rfl
theorem finite_code_of_physicalAtomicCost (d : PathCodeData X Y)
(p : D β†’ X) (c : D β†’ ℝβ‰₯0∞) (Ξ“ : BasePathCode d)
(g : Y β†’ ℝβ‰₯0∞) (m : D β†’ ℝβ‰₯0∞) {Ξ΄ : ℝβ‰₯0∞}
(hΞ΄ : 0 < Ξ΄) (hm : βˆ€ s, Ξ΄ * c s ≀ m s)
(hcost : physicalAtomicCost d p Ξ“ g m < ∞) :
pathCostMeasure d p c Ξ“ univ < ∞ := by
rw [pathCostMeasure_finite_iff]
apply finite_preterminal_sum_of_positive_tolls Ξ“.val.1 p hΞ΄ hm
exact lt_of_le_of_lt le_add_self hcost
theorem physicalAtomicCost_ge_one (d : PathCodeData X Y)
(p : D β†’ X) (c : D β†’ ℝβ‰₯0∞) (Ξ½ : Measure X) (Ξ“ : BasePathCode d)
(h : PathCostSpace Y D β†’ ℝβ‰₯0∞) (hh : Measurable h)
(hΞ“ : EndpointCode d Ξ½ (tupleInfiniteExclusions (h ∘ costTuple)) Ξ“.val)
(hadm : CostAdmissible d p c Ξ½ h)
(g : Y β†’ ℝβ‰₯0∞) (m : D β†’ ℝβ‰₯0∞) {Ξ΄ : ℝβ‰₯0∞} (hΞ΄ : 0 < Ξ΄)
(hg : βˆ€ y, h (costPhysical y) ≀ g y)
(hm : βˆ€ s, c s * h (costAtomic s) ≀ m s)
(hpos : βˆ€ s, Ξ΄ * c s ≀ m s) :
1 ≀ physicalAtomicCost d p Ξ“ g m := by
by_cases hfinite : physicalAtomicCost d p Ξ“ g m < ∞
Β· exact (nonTupleCost_ge_one_of_admissible d p c Ξ½ Ξ“ h hh hΞ“
(finite_code_of_physicalAtomicCost d p c Ξ“ g m hΞ΄ hpos hfinite) hadm).trans
(nonTupleCost_le_physicalAtomicCost d p c Ξ“ h g m hg hm)
Β· rw [top_unique (not_lt.mp hfinite)]
exact le_top
end CircleDomainRigidity
end
end OAI