File size: 3,235 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 | 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
|