import OAI.Dynamics.SmoothObstruction.PairLaw import OAI.Dynamics.SmoothObstruction.ProductCoordinates import OAI.Dynamics.SmoothObstruction.GridCells namespace OAI section open MeasureTheory Filter Topology TopologicalSpace Set Finset open scoped ENNReal NNReal BoundedContinuousFunction open Finset MeasureTheory Filter Topology open scoped BigOperators open Finset Matrix open scoped Matrix.Norms.L2Operator open Matrix namespace SmoothObstruction.PairLaw open MeasureTheory Set Finset open scoped ENNReal variable {X α : Type*} [MeasurableSpace X] [Fintype α] [MeasurableSpace α] [MeasurableSingletonClass α] omit [MeasurableSpace α] [MeasurableSingletonClass α] in /-- Cellwise pair domination sums with the ORIGINAL weights 1/μ(Q). There is no renormalization after restricting to G or to endpoint patterns. -/ theorem law_domination (μ : Measure X) (P : X → α) (G : Set (X × X)) (Φ : X × X → X × X) (hΦ : Measurable Φ) (C : ℝ≥0∞) (hc : ∀ a,(((cell μ P a).prod (cell μ P a)).restrict G).map Φ≤ C • (cell μ P a).prod (cell μ P a)) : ((law μ P).restrict G).map Φ≤C • law μ P := by have he : ((law μ P).restrict G).map Φ= ∑ a,(μ (P ⁻¹' {a}))⁻¹ • (((cell μ P a).prod (cell μ P a)).restrict G).map Φ := by rw [law,←Measure.restrictₗ_apply,map_sum, ←Measure.mapₗ_apply_of_measurable hΦ,map_sum] simp only [Measure.restrictₗ_apply,Measure.restrict_smul, Measure.mapₗ_apply_of_measurable hΦ,Measure.map_smul _ hΦ.aemeasurable] rw [he,law,Finset.smul_sum] apply Finset.sum_le_sum intro a _ simpa only [smul_smul,mul_comm] using smul_le_smul_left ((μ (P ⁻¹' {a}))⁻¹) (hc a) /-- Joint domination yields exactly the first-output switch law 2μ, not a law normalized by the retained mass. -/ theorem first_output_domination (μ : Measure X) [IsFiniteMeasure μ] (P : X → α) (hP : Measurable P) (G : Set (X × X)) (Φ : X × X → X × X) (hΦ : Measurable Φ) (C : ℝ≥0∞) (hdom : ((law μ P).restrict G).map Φ≤C • law μ P) : ((law μ P).restrict G).map (fun z => (Φ z).1)≤C • μ := by have h := Measure.map_mono hdom measurable_fst rw [Measure.map_map measurable_fst hΦ, Measure.map_smul _ measurable_fst.aemeasurable,first_marginal μ P hP] at h exact h end SmoothObstruction.PairLaw namespace SmoothObstruction.PairLaw open MeasureTheory Set Finset open scoped ENNReal variable {X α : Type*} [MeasurableSpace X] [Fintype α] [MeasurableSpace α] [MeasurableSingletonClass α] /-- The original cell-weighted experiment is carried by pairs in the same cell, including zero-mass cells without any special convention. -/ lemma same_cell_ae (μ : Measure X) [IsFiniteMeasure μ] (P : X → α) (hP : Measurable P) : ∀ᵐ z ∂law μ P,P z.1=P z.2 := by classical rw [law,ae_finsetSum_measure_iff] intro a _ apply Measure.ae_smul_measure have hQ : MeasurableSet (P ⁻¹' {a}) := hP (measurableSet_singleton a) rw [cell,Measure.prod_restrict] filter_upwards [ae_restrict_mem (hQ.prod hQ)] with z hz exact (show P z.1=a from hz.1).trans (show P z.2=a from hz.2).symm /-- Retention is measured in the original pair probability, rather than in any conditional law on the good set. -/ theorem retained_bound (μ : Measure X) [IsProbabilityMeasure μ] (P : X → α) (hP : Measurable P) (R : Set X) (hR : MeasurableSet R) : let G := (R ×ˢ R) ∩ {z : X×X | P z.1=P z.2} MeasurableSet G ∧ (law μ P) Gᶜ≤2*μ Rᶜ ∧ 1-2*μ.real Rᶜ≤(law μ P).real G := by intro G have hsame : MeasurableSet {z : X×X | P z.1=P z.2} := measurableSet_eq_fun (hP.comp measurable_fst) (hP.comp measurable_snd) have hG : MeasurableSet G := (hR.prod hR).inter hsame have he : G=ᵐ[law μ P] R ×ˢ R := by filter_upwards [same_cell_ae μ P hP] with z hz apply propext change (z∈R ×ˢ R ∧ P z.1=P z.2) ↔ z∈R ×ˢ R simp only [hz,and_true] have hl : (law μ P) Gᶜ≤2*μ Rᶜ := by rw [measure_congr he.compl] exact bad_pair_bound μ P hP R hR let := law_probability μ P hP refine ⟨hG,hl,?_⟩ have hreal : (law μ P).real Gᶜ≤2*μ.real Rᶜ := by have h := ENNReal.toReal_mono (show 2*μ Rᶜ≠∞ by finiteness) hl simpa only [ENNReal.toReal_mul,ENNReal.toReal_ofNat,Measure.real] using h rw [probReal_compl_eq_one_sub hG] at hreal linarith /-- A measurable canonical pair map can be checked using any cellwise local extension agreeing on the retained set. Different extensions off that set do not affect the ORIGINAL unnormalized pushforward. -/ theorem glue_cell_domination (μ : Measure X) [IsFiniteMeasure μ] (P : X → α) (hP : Measurable P) (G : Set (X×X)) (hG : MeasurableSet G) (Φ : X×X → X×X) (hΦ : Measurable Φ) (C : ℝ≥0∞) (hc : ∀ a,∃ F : X×X → X×X,Measurable F ∧ EqOn F Φ G ∧ (((cell μ P a).prod (cell μ P a)).restrict G).map F≤ C • (cell μ P a).prod (cell μ P a)) : ((law μ P).restrict G).map Φ≤C • law μ P ∧ ((law μ P).restrict G).map (fun z => (Φ z).1)≤C • μ := by have hd : ((law μ P).restrict G).map Φ≤C • law μ P := by apply law_domination μ P G Φ hΦ C intro a obtain ⟨F,_,he,hF⟩ := hc a have he' : F=ᵐ[((cell μ P a).prod (cell μ P a)).restrict G] Φ := (ae_restrict_of_forall_mem hG (fun _ hz => he hz)) rwa [Measure.map_congr he'] at hF exact ⟨hd,first_output_domination μ P hP G Φ hΦ C hd⟩ end SmoothObstruction.PairLaw namespace SmoothObstruction.OrbitSafety open Set MeasureTheory open scoped ENNReal variable {X : Type*} [MeasurableSpace X] /-- A finite two-sided safety exclusion is charged to the original invariant measure at every time, without conditioning the retained law. -/ theorem bilateral_bad_bound (μ : Measure X) (f g : X → X) (hf : MeasurePreserving f μ μ) (hg : MeasurePreserving g μ μ) (W : Set X) (hW : MeasurableSet W) (n : ℕ) : let Z := (⋃ t : Fin (n+1),(f^[t.val]) ⁻¹' W) ∪ (⋃ t : Fin (n+1),(g^[t.val]) ⁻¹' W) MeasurableSet Z ∧ μ Z≤(2*(n+1) : ℝ≥0∞)*μ W ∧ ∀ x,x∉Z → ∀ t≤n,(f^[t]) x∉W ∧ (g^[t]) x∉W := by intro Z have hm : MeasurableSet Z := (MeasurableSet.iUnion (fun t : Fin (n+1) => hW.preimage (hf.iterate t.val).measurable)).union (MeasurableSet.iUnion (fun t : Fin (n+1) => hW.preimage (hg.iterate t.val).measurable)) have h1 : μ (⋃ t : Fin (n+1),(f^[t.val]) ⁻¹' W)≤(n+1 : ℝ≥0∞)*μ W := by calc _ ≤ ∑ t : Fin (n+1),μ ((f^[t.val]) ⁻¹' W) := measure_iUnion_fintype_le μ _ _ = _ := by simp only [(hf.iterate _).measure_preimage hW.nullMeasurableSet, Finset.sum_const,Finset.card_univ,Fintype.card_fin,nsmul_eq_mul,Nat.cast_add,Nat.cast_one] have h2 : μ (⋃ t : Fin (n+1),(g^[t.val]) ⁻¹' W)≤(n+1 : ℝ≥0∞)*μ W := by calc _ ≤ ∑ t : Fin (n+1),μ ((g^[t.val]) ⁻¹' W) := measure_iUnion_fintype_le μ _ _ = _ := by simp only [(hg.iterate _).measure_preimage hW.nullMeasurableSet, Finset.sum_const,Finset.card_univ,Fintype.card_fin,nsmul_eq_mul,Nat.cast_add,Nat.cast_one] refine ⟨hm,?_,?_⟩ · exact (measure_union_le _ _).trans ((add_le_add h1 h2).trans_eq (by ring)) · intro x hx t ht constructor · intro h exact hx (Or.inl (mem_iUnion.mpr ⟨⟨t,Nat.lt_succ_of_le ht⟩,h⟩)) · intro h exact hx (Or.inr (mem_iUnion.mpr ⟨⟨t,Nat.lt_succ_of_le ht⟩,h⟩)) end SmoothObstruction.OrbitSafety namespace SmoothObstruction.RetainedGlobal open Set MeasureTheory open scoped ENNReal variable {X : Type*} [MeasurableSpace X] lemma real_union_le (μ : Measure X) [IsFiniteMeasure μ] (A B : Set X) : μ.real (A∪B)≤μ.real A+μ.real B := by have h := ENNReal.toReal_mono (show μ A+μ B≠∞ by finiteness) (measure_union_le A B) simpa only [Measure.real,ENNReal.toReal_add (measure_ne_top _ _) (measure_ne_top _ _)] using h /-- The actual one-point retained carrier. The fixed atlas core is checked only at 0 and the two endpoints. Coarse margins, product margins, and all boundary-tube checks are charged in the original stationary measure. -/ theorem exists_retained (μ : Measure X) [IsProbabilityMeasure μ] (f g : X → X) (hf : MeasurePreserving f μ μ) (hg : MeasurePreserving g μ μ) (G V Wc Wp Wb : Set X) (hG : MeasurableSet G) (hV : MeasurableSet V) (hWc : MeasurableSet Wc) (hWp : MeasurableSet Wp) (hWb : MeasurableSet Wb) (n : ℕ) : ∃ R : Set X,MeasurableSet R ∧ R⊆G ∧ μ.real Rᶜ≤μ.real Gᶜ+3*(μ.real Vᶜ+μ.real Wc)+μ.real Wp+ 2*((n:ℝ)+1)*μ.real Wb ∧ ∀ x∈R,x∈V ∧ x∉Wc ∧ x∉Wp ∧ f^[n] x∈V ∧ f^[n] x∉Wc ∧ g^[n] x∈V ∧ g^[n] x∉Wc ∧ ∀ t≤n,f^[t] x∉Wb ∧ g^[t] x∉Wb := by let B := Vᶜ∪Wc have hB : MeasurableSet B := hV.compl.union hWc let Z := (⋃ t : Fin (n+1),(f^[t.val]) ⁻¹' Wb) ∪ (⋃ t : Fin (n+1),(g^[t.val]) ⁻¹' Wb) obtain ⟨hZ,hZm,hZsafe⟩ := OrbitSafety.bilateral_bad_bound μ f g hf hg Wb hWb n let R := G∩(B∪(f^[n]) ⁻¹' B∪(g^[n]) ⁻¹' B∪Wp∪Z)ᶜ have hR : MeasurableSet R := hG.inter (((((hB.union (hB.preimage (hf.iterate n).measurable)).union (hB.preimage (hg.iterate n).measurable)).union hWp).union hZ).compl) have hmB : μ.real B≤μ.real Vᶜ+μ.real Wc := real_union_le μ _ _ have hmF : μ.real ((f^[n]) ⁻¹' B)=μ.real B := by exact congrArg ENNReal.toReal ((hf.iterate n).measure_preimage hB.nullMeasurableSet) have hmG : μ.real ((g^[n]) ⁻¹' B)=μ.real B := by exact congrArg ENNReal.toReal ((hg.iterate n).measure_preimage hB.nullMeasurableSet) have hmZ : μ.real Z≤2*((n:ℝ)+1)*μ.real Wb := by have hh := ENNReal.toReal_mono (show (2*((n:ℝ≥0∞)+1))*μ Wb≠∞ by finiteness) hZm simpa only [Measure.real,ENNReal.toReal_mul,ENNReal.toReal_ofNat, ENNReal.toReal_add (by finiteness : (n:ℝ≥0∞)≠∞) (by norm_num : (1:ℝ≥0∞)≠∞), ENNReal.toReal_natCast,ENNReal.toReal_one] using hh refine ⟨R,hR,inter_subset_left,?_,?_⟩ · have he : Rᶜ=Gᶜ∪(B∪(f^[n]) ⁻¹' B∪(g^[n]) ⁻¹' B∪Wp∪Z) := by simp only [R,compl_inter,compl_compl] rw [he] have h0 := real_union_le μ Gᶜ (B∪(f^[n]) ⁻¹' B∪(g^[n]) ⁻¹' B∪Wp∪Z) have h1 := real_union_le μ (B∪(f^[n]) ⁻¹' B∪(g^[n]) ⁻¹' B∪Wp) Z have h2 := real_union_le μ (B∪(f^[n]) ⁻¹' B∪(g^[n]) ⁻¹' B) Wp have h3 := real_union_le μ (B∪(f^[n]) ⁻¹' B) ((g^[n]) ⁻¹' B) have h4 := real_union_le μ B ((f^[n]) ⁻¹' B) rw [hmF] at h4 rw [hmG] at h3 linarith · intro x hx have hh : x∉B ∧ f^[n] x∉B ∧ g^[n] x∉B ∧ x∉Wp ∧ x∉Z := by have h := hx.2 simp only [mem_compl_iff,mem_union,Set.mem_preimage,not_or] at h exact ⟨h.1.1.1.1,h.1.1.1.2,h.1.1.2,h.1.2,h.2⟩ have hb0 : x∈V ∧ x∉Wc := by simpa only [B,mem_union,mem_compl_iff,not_or,not_not] using hh.1 have hbp : f^[n] x∈V ∧ f^[n] x∉Wc := by simpa only [B,mem_union,mem_compl_iff,not_or,not_not] using hh.2.1 have hbm : g^[n] x∈V ∧ g^[n] x∉Wc := by simpa only [B,mem_union,mem_compl_iff,not_or,not_not] using hh.2.2.1 exact ⟨hb0.1,hb0.2,hh.2.2.2.1,hbp.1,hbp.2,hbm.1,hbm.2,hZsafe x hh.2.2.2.2⟩ /-- Retained original cell-pair probability, with all exclusion losses and without replacing cell weights by good-set weights. -/ theorem pair_mass {α : Type*} [Fintype α] [MeasurableSpace α] [MeasurableSingletonClass α] (μ : Measure X) [IsProbabilityMeasure μ] (P : X → α) (hP : Measurable P) (R : Set X) (hR : MeasurableSet R) {η : ℝ} (hm : μ.real Rᶜ≤η/2) : let G := (R ×ˢ R)∩{z : X×X | P z.1=P z.2} MeasurableSet G ∧ 1-η≤(PairLaw.law μ P).real G := by intro G obtain ⟨hG,_,hb⟩ := PairLaw.retained_bound μ P hP R hR exact ⟨hG,by linarith⟩ end SmoothObstruction.RetainedGlobal namespace SmoothObstruction.ManifoldCoordinates open Set MeasureTheory FiniteBins open scoped Manifold ContDiff Matrix.Norms.L2Operator variable {d : ℕ} {H : Type*} [TopologicalSpace H] (I : ModelWithCorners ℝ (EuclideanSpace ℝ (Fin d)) H) {M : Type*} [MetricSpace M] [ChartedSpace H M] [MeasurableSpace M] [BorelSpace M] {ι C : Type*} [Fintype ι] [Fintype C] [MeasurableSpace C] [MeasurableSingletonClass C] open ChartDensity /-- The actual full finite product partition is constructed from one original gauge reference per active starting bin. Wall strips are charged to the ORIGINAL measure. No endpoint or orbit chart code is included in the cell alphabet. The recovery assertion is precisely the ideal exchange needed by both joins. -/ theorem finite_product_partition [IsManifold I ∞ M] (μ : Measure M) [IsProbabilityMeasure μ] (S : Diffeomorph I I M M ∞) (a : ι → M) (K : ι → Set M) (hK : ∀ i,IsCompact (K i)) (hKU : ∀ i,K i⊆(chartAt H (a i)).source) (c : M → ι) (hc : ∀ x,x∈K (c x)) : ∃ D : ℝ,1≤D ∧ ∀ (P : M → C),Measurable P → ∀ (chart : C → ι), (∀ x,chart (P x)=c x) → ∀ (G : Set M) (n : ℕ) (B R : ℝ),0≤B → ∀ (A : ∀ x:G,BilateralGauge I S a c n B R x) (T : G → Finset (Fin d)) (δ : ℝ),0<δ → ∀ N : ℕ,0 (A (ref Q)).forward I S a c) (fun Q => (T (ref Q))ᶜ) let φ (Q : C) (x : M) := coordinates I (a (chart Q)) x have hb (x : M) : ‖φ (P x) x‖≤D := by simpa only [φ,hchart] using hbound x obtain ⟨L,W,hL,hW,hWm,hLP,hdiam,hstable,hcard⟩ := ProductCells.exists_cells μ P hP φ (fun Q => measurable_coordinates I (a (chart Q))) E (show 0≤D by linarith) (show 0≤H₀ by dsimp [H₀]; positivity) (Real.sqrt_nonneg _) hδ hb hEi hE hN refine ⟨L,W,hL,hW,hWm,hLP,?_,?_,hcard⟩ · intro x y hxy simpa only [φ,hchart] using hdiam x y hxy · intro x y z hx hxy hxW hyW hz ref₀ herror apply hstable x y z hxy hxW hyW hz let Q : Active P G := key P G ⟨x,hx⟩ let ideal := φ (P x) x+(((A (ref Q)).forward I S a c).splitting (T (ref Q))ᶜ).slow 0 (φ (P x) y-φ (P x) x) have herr : H₀*‖φ (P x) z-ideal‖≤δ/4 := by simpa only [ideal,φ,hchart,ref,Q] using herror have he (i : Fin d) : |((E (P x)).symm (φ (P x) z)) i-((E (P x)).symm ideal) i|≤δ/4 := by calc _ = ‖(((E (P x)).symm (φ (P x) z-ideal)) i)‖ := by rw [map_sub]; rfl _ ≤ ‖(E (P x)).symm (φ (P x) z-ideal)‖ := PiLp.norm_apply_le _ _ _ ≤ ‖(E (P x)).symm.toContinuousLinearMap‖*‖φ (P x) z-ideal‖ := (E (P x)).symm.toContinuousLinearMap.le_opNorm _ _ ≤ H₀*‖φ (P x) z-ideal‖ := mul_le_mul_of_nonneg_right (hEi _) (norm_nonneg _) _ ≤ δ/4 := herr intro i have hh := hmix Q (φ (P x) x) (φ (P x) y) i change ((E (P x)).symm ideal) i=((E (P x)).symm (φ (P x) x)) i ∨ ((E (P x)).symm ideal) i=((E (P x)).symm (φ (P x) y)) i at hh rcases hh with hh|hh · exact Or.inl (by simpa only [hh] using he i) · exact Or.inr (by simpa only [hh] using he i) end SmoothObstruction.ManifoldCoordinates namespace SmoothObstruction.ManifoldCoordinates open Set Metric Filter Topology open scoped Manifold ContDiff variable {d : ℕ} {H : Type*} [TopologicalSpace H] (I : ModelWithCorners ℝ (EuclideanSpace ℝ (Fin d)) H) {M : Type*} [TopologicalSpace M] [T2Space M] [ChartedSpace H M] [IsManifold I ∞ M] {ι : Type*} [Fintype ι] /-- Uniform comparison of actual chart displacements on the retained interior balls. This is a consequence of the identity diffeomorphism's genuine smooth coordinate maps, not an assumed Riemannian/Lipschitz metric. -/ theorem uniform_chart_transfer (hclosed : IsClosed (range I)) (a : ι → M) (K : ι → Set M) (hK : ∀ i,IsCompact (K i)) (hKU : ∀ i,K i⊆(chartAt H (a i)).source) : ∃ r C : ℝ,0 ?_⟩ have hd := ht i j x δ hxi hxj hδ hδr hsafe have hyb : (extChartAt I (a i)) y∈closedBall ((extChartAt I (a i)) x) δ := mem_closedBall_iff_norm.mpr hxy have hyj := (hd.2.1 hyb).2 have hiy : (extChartAt I (a i)).symm ((extChartAt I (a i)) y)=y := (extChartAt I (a i)).left_inv (by simpa only [extChartAt_source] using hyi) have hix : (extChartAt I (a i)).symm ((extChartAt I (a i)) x)=x := (extChartAt I (a i)).left_inv (by simpa only [extChartAt_source] using hKU i hxi) change Id ((extChartAt I (a i)).symm ((extChartAt I (a i)) y))∈(chartAt H (a j)).source at hyj rw [hiy] at hyj refine ⟨hyj,?_⟩ have hbound := (convex_closedBall ((extChartAt I (a i)) x) δ).norm_image_sub_le_of_norm_fderiv_le (𝕜:=ℝ) (f:=localMap I Id (a i) (a j)) (fun u hu => (hd.2.2 u hu).1.differentiableAt (by norm_num)) (fun u hu => (hd.2.2 u hu).2.1) (mem_closedBall_self hδ) hyb simpa only [localMap,Function.comp_apply,hix,hiy,Id,Diffeomorph.coe_refl,id_eq] using hbound end SmoothObstruction.ManifoldCoordinates namespace SmoothObstruction.ManifoldCoordinates open Set Metric open scoped Manifold ContDiff variable {d : ℕ} {H : Type*} [TopologicalSpace H] (I : ModelWithCorners ℝ (EuclideanSpace ℝ (Fin d)) H) {M : Type*} [MetricSpace M] [ProperSpace M] [ChartedSpace H M] [IsManifold I ∞ M] {ι : Type*} [Fintype ι] /-- A common output in two small selected tubes puts their centers in each other's original chart, with a uniform linear coordinate bound. The chart selector can be discontinuous: only its finite compact carrying patches are used. This is the comparison needed to invoke old-tube rigidity when two canonical switches have the same output. -/ theorem uniform_common_output (hclosed : IsClosed (range I)) (a : ι → M) (K : ι → Set M) (hK : ∀ i,IsCompact (K i)) (hKU : ∀ i,K i⊆(chartAt H (a i)).source) : ∃ r C : ℝ,0 (Wf (π Q,b)).starProjection ((extChartAt I (a (chart b))) (S^[n] z)) let V : J → C → M → EuclideanSpace ℝ (Fin d) := fun Q b z => (Wb (π Q,b)).starProjection ((extChartAt I (a (chart b))) (S.symm^[n] z)) have hf (x z : M) : U (L x) (P (S^[n] x)) z=U (L x) (P (S^[n] x)) x ↔ originalEndpoint I S a c (n:=n) (Wf (P x,P (S^[n] x))) x z := by simp only [U,hπ,hchart,originalEndpoint] have hb (x z : M) : V (L x) (P (S.symm^[n] x)) z=V (L x) (P (S.symm^[n] x)) x ↔ originalEndpoint I S.symm a c (n:=n) (Wb (P x,P (S.symm^[n] x))) x z := by simp only [V,hπ,hchart,originalEndpoint] refine SwitchRecovery.global_injective_tubes L P (S^[n]) (S.symm^[n]) U V (originalTube I S a c (n:=n) ρ) (originalTube I S.symm a c (n:=n) ρ) (originalTube I S a c (n:=n) δ) (originalTube I S.symm a c (n:=n) δ) R G Φ hcommonF hcommonB hgood hcell hlabels ?_ hshadow ?_ · intro u hu obtain ⟨h1,h2,h3,h4⟩ := heq u hu exact ⟨(hf _ _).mpr h1,(hb _ _).mpr h2,(hf _ _).mpr h3,(hb _ _).mpr h4⟩ · intro x hx z h1 h2 h3 h4 exact hrigid x hx z h3 h4 ((hf _ _).mp h1) ((hb _ _).mp h2) end SmoothObstruction.ManifoldCoordinates namespace SmoothObstruction.AtlasCores open Set Filter Topology Metric variable {X E ι C : Type*} [MetricSpace X] [NormedAddCommGroup E] /-- No new label is introduced: positive old grid margin plus a stable selected chart makes the original coarse label locally constant. -/ theorem coarse_label_germ (c : X → ι) (P : X → C) (φ : ι → X → E) (U : ι → Set X) (hU : ∀ i,IsOpen (U i)) (hφ : ∀ i,ContinuousOn (φ i) (U i)) (x : X) (hxU : x∈U (c x)) (s δ : ℝ) (hs : 0 ‖φ (c x) y-φ (c x) x‖) x := (((hφ _).continuousAt ((hU _).mem_nhds hxU)).sub continuousAt_const).norm have hz : ‖φ (c x) x-φ (c x) x‖<δ := by simpa using hδ filter_upwards [Metric.ball_mem_nhds x hs,hcont.eventually (gt_mem_nhds hz)] with y hy hy' exact hrec y (hc y (Metric.mem_ball.mp hy).le) hy'.le /-- Starting and final old labels can all be fixed on one neighborhood; this finite local intersection is not charged to a partition alphabet. -/ theorem finite_label_germ {T : Type*} [Finite T] (P : X → C) (f : T → X → X) (x : X) (hf : ∀ t,ContinuousAt (f t) x) (hP : ∀ t,∀ᶠ y in 𝓝 (f t x),P y=P (f t x)) : ∀ᶠ y in 𝓝 x,∀ t,P (f t y)=P (f t x) := by exact Filter.eventually_all.mpr (fun t => (hf t).eventually (hP t)) end SmoothObstruction.AtlasCores namespace SmoothObstruction.ManifoldCoordinates open Set Metric MeasureTheory Filter Topology open scoped Manifold ContDiff variable {d : ℕ} {H : Type*} [TopologicalSpace H] (I : ModelWithCorners ℝ (EuclideanSpace ℝ (Fin d)) H) {M : Type*} [MetricSpace M] [ChartedSpace H M] {ι : Type*} [Fintype ι] /-- Uniform old-chart tubes give metric shadowing, with constants chosen before the time length, orbit, chart selector, or frame witness. -/ theorem uniform_original_shadow (hclosed : IsClosed (range I)) (a : ι → M) (K : ι → Set M) (hK : ∀ i,IsCompact (K i)) (hKU : ∀ i,K i⊆(chartAt H (a i)).source) {ε : ℝ} (hε : 0<ε) : ∃ σ : ℝ,0<σ ∧ ∀ (S : Diffeomorph I I M M ∞) (c : M → ι) (n : ℕ) (ρ : ℝ) (x z : M), (∀ u,u∈K (c u)) → ρ≤σ → originalTube I S a c (n:=n) ρ x z → ∀ t : Fin (n+1),dist (S^[t.val] z) (S^[t.val] x)<ε := by obtain ⟨σ,hσ,hm⟩ := CoordinateTubes.uniform_inverse_modulus I hclosed a K hK hKU hε refine ⟨σ,hσ,?_⟩ intro S c n ρ x z hc hρ ht t exact hm _ _ (hc _) _ (ht t).1 ((ht t).2.trans hρ) /-- Recovery of the ORIGINAL coarse label, without recording an orbit-chart itinerary in the partition. The only exclusions are the fixed chart core and old coarse-grid wall strip at the particular time under consideration. -/ theorem original_tube_labels (hclosed : IsClosed (range I)) (a : ι → M) (K : ι → Set M) (hK : ∀ i,IsCompact (K i)) (hKU : ∀ i,K i⊆(chartAt H (a i)).source) {s : ℝ} (hs : 0 (closedBall_subset_closedBall hρδ').trans (hsafe y hy t).1) hxt hyt · intro x hx y hy z hxt hyt exact hcommon S.symm c n ρ δ x y z hc hρ hρr hρδ (fun t => (closedBall_subset_closedBall hρδ').trans (hsafe y hy t).2) hxt hyt · exact fun u hu => ⟨hu.1,hu.2.1⟩ · exact fun u hu => ⟨hu.2.2,(hcell u hu).1⟩ · exact hlabels · exact fun u hu => heq u hu.1 hu.2.1 hu.2.2 · intro u hu obtain ⟨h1,h2,h3,h4,_,_⟩ := ht u hu.1 hu.2.1 hu.2.2 exact ⟨h1,h4,h3,h2⟩ · exact hrigid end SmoothObstruction.ManifoldCoordinates end end OAI