Download data/lean/OAI/Analysis/CircleDomains/Modulus/AdmissiblePathCost.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 3.04 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Analysis/CircleDomains/Modulus/AdmissiblePathCost.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Analysis/CircleDomains/Modulus/AdmissiblePathCost.lean
-
curl -L -o AdmissiblePathCost.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Analysis/CircleDomains/Modulus/AdmissiblePathCost.lean
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 | |