import OAI.Dynamics.StandardMap.EntropyEndpoint import OAI.Dynamics.StandardMap.Entropy.SupportEntropy namespace OAI section section namespace StandardMapEntropy open MeasureTheory Set Filter open scoped Topology NNReal ENNReal noncomputable def fineScale (k ε δ : ℝ) : ℝ := δ/(8*(1+derivativeVariationBound k)*Real.exp (2*ε)) noncomputable def fineSize (k χ ε δ : ℝ) (z : Torus) : ℝ := fineScale k ε δ*chartRadius k χ ε z noncomputable def fineFrame (k χ ε δ : ℝ) (z : Torus) : RealPlane →L[ℝ] ℂ := flatFrame (fineSize k χ ε δ z) (lyapunovFrame k χ z) noncomputable def fineInverse (k χ ε δ : ℝ) (z : Torus) : ℂ →L[ℝ] RealPlane := flatInverse (fineSize k χ ε δ z) (lyapunovCoframe k χ z) noncomputable def fineStableMultiplier (k χ ε δ : ℝ) (z : Torus) : ℝ := fineSize k χ ε δ z/fineSize k χ ε δ (standardMap k z)*stableMultiplier k χ z noncomputable def fineUnstableMultiplier (k χ ε δ : ℝ) (z : Torus) : ℝ := fineSize k χ ε δ z/fineSize k χ ε δ (standardMap k z)*unstableMultiplier k χ z lemma fineScale_pos (k ε : ℝ) {δ : ℝ} (hδ : 0<δ) : 0.mpr h rw [mul_pow,hex] at hs have ht := mul_le_mul_of_nonneg_left hs (codingScale_pos k ε hδ).le simpa only [codingRadius,mul_left_comm] using ht exact ⟨general _ _ hh,general _ _ hh'⟩ lemma codingLevel_step (k χ ε δ : ℝ) (hδ : 0<δ) (z : Torus) (hz : FineRegular k χ ε z) (J : ℕ) (hJ : Real.exp (2*ε)≤(2 : ℝ)^J) : codingLevel k χ ε δ hδ (standardMap k z)≤codingLevel k χ ε δ hδ z+J ∧ codingLevel k χ ε δ hδ z≤codingLevel k χ ε δ hδ (standardMap k z)+J := by have hr := codingRadius_ratio k χ ε hδ z hz exact ⟨dyadicLevel_mono_bound _ _ J (hr.1.trans (mul_le_mul_of_nonneg_right hJ (codingRadius_pos k χ ε hδ _).le)), dyadicLevel_mono_bound _ _ J (hr.2.trans (mul_le_mul_of_nonneg_right hJ (codingRadius_pos k χ ε hδ _).le))⟩ lemma fineInverse_codingRadius (k χ ε : ℝ) {δ : ℝ} (hδ : 0<δ) (z : Torus) (hz : FineRegular k χ ε z) : ‖fineInverse k χ ε δ z‖*codingRadius k χ ε δ z≤1/100 := by let r := chartRadius k χ ε z let η := fineScale k ε δ let c := codingScale k ε δ have hr : 0 v | n+1 => r.step n (r.orbit v n) lemma Recurrence.orbit_continuous (r : Recurrence ℓ δ) (n : ℕ) : Continuous (fun v => r.orbit v n) := by induction n with | zero => exact continuous_id | succ n ih => exact ((continuous_const.mul ih.fst).add ((r.lipschitz n).continuous.comp ih).fst).prodMk ((continuous_const.mul ih.snd).add ((r.lipschitz n).continuous.comp ih).snd) lemma Recurrence.orbit_unstable_cone (r : Recurrence ℓ δ) (h : ℓ+δ<1) (s t u : ℝ) (n : ℕ) : |(r.orbit (s,t) n).1-(r.orbit (s,u) n).1|≤|(r.orbit (s,t) n).2-(r.orbit (s,u) n).2| ∧ |t-u|≤((ℓ+δ : ℝ≥0) : ℝ)^n*|(r.orbit (s,t) n).2-(r.orbit (s,u) n).2| := by induction n with | zero => exact ⟨by simp only [Recurrence.orbit,sub_self,abs_zero]; positivity,by simp only [Recurrence.orbit,pow_zero,one_mul,le_refl]⟩ | succ n ih => have hh := r.unstable_cone_step h n (r.orbit (s,t) n) (r.orbit (s,u) n) ih.1 refine ⟨hh.1,ih.2.trans ?_⟩ exact (mul_le_mul_of_nonneg_left hh.2 (pow_nonneg (ℓ+δ).coe_nonneg n)).trans_eq (by simp only [Recurrence.orbit,pow_succ]; ring) def Recurrence.trappedBox (r : Recurrence ℓ δ) (n : ℕ) : Set Plane := {v | ∀ j : ℕ, j≤n → ‖r.orbit v j‖≤1} lemma Recurrence.trappedBox_closed (r : Recurrence ℓ δ) (n : ℕ) : IsClosed (r.trappedBox n) := by have he : r.trappedBox n=⋂ j : ℕ, ⋂ (_ : j≤n), {v | ‖r.orbit v j‖≤1} := by ext v; simp only [Recurrence.trappedBox,mem_ofPred_eq,mem_iInter] rw [he] exact isClosed_iInter fun j => isClosed_iInter fun _ => isClosed_le (r.orbit_continuous j).norm continuous_const lemma Recurrence.trappedBox_fiber_diameter (r : Recurrence ℓ δ) (h : ℓ+δ<1) (n : ℕ) {s t u : ℝ} (ht : (s,t)∈r.trappedBox n) (hu : (s,u)∈r.trappedBox n) : |t-u|≤2*((ℓ+δ : ℝ≥0) : ℝ)^n := by have htn := (norm_snd_le (r.orbit (s,t) n)).trans (ht n le_rfl) have hun := (norm_snd_le (r.orbit (s,u) n)).trans (hu n le_rfl) simp only [Real.norm_eq_abs] at htn hun have hb : |(r.orbit (s,t) n).2-(r.orbit (s,u) n).2|≤2 := (abs_sub _ _).trans (by linarith) exact (r.orbit_unstable_cone h s t u n).2.trans ((mul_le_mul_of_nonneg_left hb (pow_nonneg (ℓ+δ).coe_nonneg n)).trans_eq (by ring)) end StandardMapEntropy.NonlinearStable end section namespace StandardMapEntropy.NonlinearStable open Set Filter MeasureTheory open scoped Topology NNReal ENNReal variable {ℓ δ : ℝ≥0} lemma Recurrence.trappedBox_fiber_volume (r : Recurrence ℓ δ) (h : ℓ+δ<1) (n : ℕ) (s : ℝ) : volume (Prod.mk s ⁻¹' r.trappedBox n)≤ENNReal.ofReal (2*((ℓ+δ : ℝ≥0) : ℝ)^n) := by apply (Real.volume_le_diam _).trans apply Metric.ediam_le_iff.mpr intro t ht u hu rw [edist_dist,Real.dist_eq] exact ENNReal.ofReal_le_ofReal (r.trappedBox_fiber_diameter h n ht hu) lemma Recurrence.trappedBox_fiber_empty (r : Recurrence ℓ δ) (n : ℕ) {s : ℝ} (hs : s∉Icc (-1 : ℝ) 1) : Prod.mk s ⁻¹' r.trappedBox n=∅ := by apply Set.eq_empty_iff_forall_notMem.mpr intro t ht have hh := (norm_fst_le (s,t)).trans (ht 0 (Nat.zero_le n)) exact hs (abs_le.mp hh) theorem Recurrence.trappedBox_volume (r : Recurrence ℓ δ) (h : ℓ+δ<1) (n : ℕ) : volume (r.trappedBox n)≤ENNReal.ofReal (4*((ℓ+δ : ℝ≥0) : ℝ)^n) := by change ((volume : Measure ℝ).prod volume) (r.trappedBox n)≤_ rw [Measure.prod_apply (r.trappedBox_closed n).measurableSet] calc _ ≤ ∫⁻ s : ℝ, (Icc (-1 : ℝ) 1).indicator (fun _ => ENNReal.ofReal (2*((ℓ+δ : ℝ≥0) : ℝ)^n)) s ∂volume := by apply lintegral_mono intro s change volume (Prod.mk s ⁻¹' r.trappedBox n)≤_ by_cases hs : s∈Icc (-1 : ℝ) 1 · rw [indicator_of_mem hs] exact r.trappedBox_fiber_volume h n s · rw [indicator_of_notMem hs,r.trappedBox_fiber_empty n hs,measure_empty] _ = _ := by rw [lintegral_indicator measurableSet_Icc,setLIntegral_const,Real.volume_Icc, ←ENNReal.ofReal_mul (by positivity)] congr 1 ring end StandardMapEntropy.NonlinearStable end section namespace StandardMapEntropy open MeasureTheory Set Filter open scoped Topology NNReal ENNReal lemma fine_nonlinearity_coefficient (k χ ε : ℝ) {δ : ℝ} (hδ : 0<δ) (z : Torus) (hz : FineRegular k χ ε z) (hn : FineRegular k χ ε (standardMap k z)) : ‖fineInverse k χ ε δ (standardMap k z)‖*derivativeVariationBound k*‖fineFrame k χ ε δ z‖^2≤δ := by let a := chartRadius k χ ε z let b := chartRadius k χ ε (standardMap k z) let c := ‖lyapunovCoframe k χ (standardMap k z)‖ let η := fineScale k ε δ have ha : 0 simp only [fineCoordinate,Function.iterate_succ_apply'] rw [he] simpa only [Function.iterate_succ_apply',complexProjection_standardLift,fineLocalRecurrence,LocalRecurrence.step] using fine_step k χ ε δ ((standardLift k)^[n] w) (hw n) (fineCoordinate k χ ε δ w p n) def fineTrapped (k χ ε δ : ℝ) (w : ℂ) (n : ℕ) : Set RealPlane := {v | ∀ j : ℕ, j≤n → ‖fineCoordinate k χ ε δ w (w+fineFrame k χ ε δ (complexProjection w) v) j‖≤1} lemma fineTrapped_subset (k χ ε δ : ℝ) (hδ : 0<δ) (w : ℂ) (hw : ∀ n : ℕ, FineRegular k χ ε (complexProjection ((standardLift k)^[n] w))) (n : ℕ) : fineTrapped k χ ε δ w n ⊆ (fineLocalRecurrence k χ ε δ hδ w hw).extend.trappedBox n := by intro v hv have he : ∀ j : ℕ, j≤n → (fineLocalRecurrence k χ ε δ hδ w hw).extend.orbit v j= fineCoordinate k χ ε δ w (w+fineFrame k χ ε δ (complexProjection w) v) j := by intro j induction j with | zero => intro _; exact (fineCoordinate_initial k χ ε hδ w (hw 0) v).symm | succ j ih => intro hj rw [Recurrence.orbit,ih (by omega),extend_step_eq _ j (hv j (by omega)),fineCoordinate_step] intro j hj rw [he j hj] exact hv j hj theorem fineTrapped_volume (k χ ε δ : ℝ) (hδ : 0<δ) (hq : Real.exp (-χ+ε)+δ<1) (w : ℂ) (hw : ∀ n : ℕ, FineRegular k χ ε (complexProjection ((standardLift k)^[n] w))) (n : ℕ) : volume (fineTrapped k χ ε δ w n)≤ENNReal.ofReal (4*(Real.exp (-χ+ε)+δ)^n) := by have hq' : fineLinearRate χ ε+fineErrorRate δ hδ<1 := hq exact (measure_mono (fineTrapped_subset k χ ε δ hδ w hw n)).trans ((fineLocalRecurrence k χ ε δ hδ w hw).extend.trappedBox_volume hq' n) lemma fine_parameters_for_rate {a χ : ℝ} (ha : 0 linarith theorem ae_sharp_fine_volume (k : ℝ) (hk : 0≤k) {a χ : ℝ} (ha : 0