introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
3.24 kB
import Mathlib
namespace OAI
noncomputable section
namespace Problem340
def orbitClockLift {X : Type*} (f : X β†’ X) (h : X β†’ ℝ)
(x : X) (tβ‚€ : ℝ) (n : β„•) : ℝ :=
tβ‚€ + βˆ‘ i ∈ Finset.range n, h (f^[i] x)
@[simp] theorem orbitClockLift_zero {X : Type*} (f : X β†’ X) (h : X β†’ ℝ)
(x : X) (tβ‚€ : ℝ) : orbitClockLift f h x tβ‚€ 0 = tβ‚€ := by
simp [orbitClockLift]
theorem orbitClockLift_succ {X : Type*} (f : X β†’ X) (h : X β†’ ℝ)
(x : X) (tβ‚€ : ℝ) (n : β„•) :
orbitClockLift f h x tβ‚€ (n + 1) =
orbitClockLift f h x tβ‚€ n + h (f^[n] x) := by
simp only [orbitClockLift, Finset.sum_range_succ, add_assoc]
theorem coe_orbitClockLift {X : Type*} (P : ℝ)
(f : X β†’ X) (h : X β†’ ℝ) (clock : X β†’ AddCircle P)
(hclock : βˆ€ x, clock (f x) = clock x + (h x : AddCircle P))
(x : X) (tβ‚€ : ℝ) (hβ‚€ : (tβ‚€ : AddCircle P) = clock x) (n : β„•) :
(orbitClockLift f h x tβ‚€ n : AddCircle P) = clock (f^[n] x) := by
induction n with
| zero => simpa using hβ‚€
| succ n hn =>
rw [orbitClockLift_succ, Function.iterate_succ_apply', hclock, ← hn]
simp
theorem monotone_orbitClockLift {X : Type*} (f : X β†’ X) (h : X β†’ ℝ)
(hh : βˆ€ x, 0 ≀ h x) (x : X) (tβ‚€ : ℝ) :
Monotone (orbitClockLift f h x tβ‚€) := by
apply monotone_nat_of_le_succ
intro n
rw [orbitClockLift_succ]
exact le_add_of_nonneg_right (hh _)
theorem orbitClockLift_step_bounds {X : Type*} (f : X β†’ X) (h : X β†’ ℝ)
(hh : βˆ€ x, h x ∈ Set.Icc (0 : ℝ) 1) (x : X) (tβ‚€ : ℝ) (n : β„•) :
orbitClockLift f h x tβ‚€ (n + 1) - orbitClockLift f h x tβ‚€ n ∈
Set.Icc (0 : ℝ) 1 := by
rw [orbitClockLift_succ, add_sub_cancel_left]
exact hh _
theorem orbitClockLift_add_initial {X : Type*} (f : X β†’ X) (h : X β†’ ℝ)
(x : X) (tβ‚€ c : ℝ) (n : β„•) :
orbitClockLift f h x (tβ‚€ + c) n = orbitClockLift f h x tβ‚€ n + c := by
simp only [orbitClockLift]
ring
theorem orbitClockLift_restart {X : Type*} (f : X β†’ X) (h : X β†’ ℝ)
(x : X) (tβ‚€ : ℝ) (m n : β„•) :
orbitClockLift f h (f^[m] x) (orbitClockLift f h x tβ‚€ m) n =
orbitClockLift f h x tβ‚€ (m + n) := by
induction n with
| zero => simp
| succ n hn =>
rw [orbitClockLift_succ, hn, Nat.add_succ, orbitClockLift_succ]
congr 1
rw [← Function.iterate_add_apply, Nat.add_comm n m]
theorem exists_monotone_orbit_clock_lift {X : Type*} (P : ℝ)
(f : X β†’ X) (h : X β†’ ℝ) (clock : X β†’ AddCircle P)
(hclock : βˆ€ x, clock (f x) = clock x + (h x : AddCircle P))
(hh : βˆ€ x, h x ∈ Set.Icc (0 : ℝ) 1) (x : X) :
βˆƒ t : β„• β†’ ℝ,
(βˆ€ n, (t n : AddCircle P) = clock (f^[n] x)) ∧
(βˆ€ n, t (n + 1) = t n + h (f^[n] x)) ∧
Monotone t ∧ (βˆ€ n, t (n + 1) - t n ∈ Set.Icc (0 : ℝ) 1) := by
obtain ⟨tβ‚€, htβ‚€βŸ© := QuotientAddGroup.mk_surjective (clock x)
refine ⟨orbitClockLift f h x tβ‚€, ?_, ?_, ?_, ?_⟩
Β· exact coe_orbitClockLift P f h clock hclock x tβ‚€ htβ‚€
Β· exact orbitClockLift_succ f h x tβ‚€
Β· exact monotone_orbitClockLift f h (fun y => (hh y).1) x tβ‚€
Β· exact orbitClockLift_step_bounds f h hh x tβ‚€
end Problem340
end
end OAI