math / data /lean /OAI /Analysis /CircleDomains /Uniformization /FirstExitFragmentLimits.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
3.45 kB
import OAI.Analysis.CircleDomains.Modulus.FirstExitFragmentBudget
namespace OAI
/-! Joint compact hit-position limits and their genuine limiting cost
budget for the actual first-exit fragment array. -/
open Set Function Filter MeasureTheory
open scoped ENNReal Topology
noncomputable section
namespace CircleDomainRigidity
variable {X Y : Type*} [MetricSpace X] [CompactSpace X] [MetricSpace Y]
[MeasurableSpace X] [BorelSpace X] [MeasurableSpace Y] [BorelSpace Y]
[MeasurableSpace C(PathTime, X)]
theorem exists_firstExit_fragment_limits
(d : PathCodeData X Y) (hU : IsOpen d.quotientDomain)
(Ξ“ : β„• β†’ TaggedPhysicalPath d) (V : β„• β†’ Set X)
(hcut : βˆ€n j, j ≀ n β†’ firstExitTime (Ξ“ n).1.val (V (j+1)) <
firstExitTime (Ξ“ n).1.val (V j))
(hV : βˆ€j, IsOpen (V j)) (hanti : Antitone V)
(hstart : βˆ€n, (Ξ“ n).1.val βŠ₯ ∈ V (n+1)) (hend : βˆ€n, (Ξ“ n).1.val ⊀ βˆ‰ V 0)
(g : Y β†’ ℝβ‰₯0∞) (hg : Measurable g) (m : X β†’ ℝβ‰₯0∞)
(hm : βˆ€n j, j ≀ n+1 β†’ m ((Ξ“ n).1.val (firstExitTime (Ξ“ n).1.val (V j))) = 0)
(A : ℝβ‰₯0∞) (hA : Tendsto (fun n => physicalTollCost d g m (Ξ“ n).1) atTop (𝓝 A)) :
βˆƒ (s : β„• β†’ β„•) (x : β„• β†’ X) (c : β„• β†’ ℝβ‰₯0∞), StrictMono s ∧
(βˆ€j, x j ∈ frontier (V j)) ∧
(βˆ€j, Tendsto (fun n => (firstExitFragmentArray d hU Ξ“ V hcut (s n) j).1.val βŠ₯)
atTop (𝓝 (x (j+1)))) ∧
(βˆ€j, Tendsto (fun n => (firstExitFragmentArray d hU Ξ“ V hcut (s n) j).1.val ⊀)
atTop (𝓝 (x j))) ∧
(βˆ€j, Tendsto (fun n => physicalTollCost d g m
(firstExitFragmentArray d hU Ξ“ V hcut (s n) j).1) atTop (𝓝 (c j))) ∧
(βˆ‘'j, c j) ≀ A := by
let hit : β„• β†’ β„• β†’ X := fun n j => (Ξ“ n).1.val (firstExitTime (Ξ“ n).1.val (V j))
let cost : β„• β†’ β„• β†’ ℝβ‰₯0∞ := fun n j =>
physicalTollCost d g m (firstExitFragmentArray d hU Ξ“ V hcut n j).1
obtain ⟨s, _, x, c, hs, _, hx, hc⟩ := exists_joint_fragment_limits hit hit cost
have hindex (j : β„•) : βˆ€αΆ n in atTop, j ≀ s n :=
hs.tendsto_atTop.eventually_ge_atTop j
have hxfront (j : β„•) : x j ∈ frontier (V j) := by
apply isClosed_frontier.mem_of_tendsto (hx j)
filter_upwards [hindex j] with n hn
exact firstExit_frontier (Ξ“ (s n)).1.val (hV j)
(hanti (hn.trans (Nat.le_succ _)) (hstart (s n)))
(fun h => hend (s n) (hanti (Nat.zero_le j) h))
have hstartlim (j : β„•) : Tendsto
(fun n => (firstExitFragmentArray d hU Ξ“ V hcut (s n) j).1.val βŠ₯)
atTop (𝓝 (x (j+1))) := by
apply (hx (j+1)).congr'
filter_upwards [hindex j] with n hn
exact (firstExitFragmentArray_endpoints d hU Ξ“ V hcut hn).1.symm
have hstoplim (j : β„•) : Tendsto
(fun n => (firstExitFragmentArray d hU Ξ“ V hcut (s n) j).1.val ⊀)
atTop (𝓝 (x j)) := by
apply (hx j).congr'
filter_upwards [hindex j] with n hn
exact (firstExitFragmentArray_endpoints d hU Ξ“ V hcut hn).2.symm
refine ⟨s, x, c, hs, hxfront, hstartlim, hstoplim, hc, ?_⟩
apply fragment_limit_budget_of_eventually (fun n j => cost (s n) j) c
(fun n => physicalTollCost d g m (Ξ“ (s n)).1) A hc (hA.comp hs.tendsto_atTop)
intro F
filter_upwards [hindex (F.sup id)] with n hn
apply firstExitFragmentArray_finite_budget d hU Ξ“ V hcut hV hanti hend g hg m hm F
intro j hj
exact (Finset.le_sup (f := id) hj).trans hn
end CircleDomainRigidity
end
end OAI