math / data /lean /OAI /Geometry /Arnold /Midpoint.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
14.2 kB
import OAI.Geometry.Arnold.CompactField
namespace OAI
universe uE
noncomputable section
open scoped BigOperators ContDiff
open scoped ContDiff Topology NNReal
open Set Filter
namespace ArnoldCounterexample.Midpoint
variable {E : Type uE} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E]
omit [CompleteSpace E] in
lemma contraction (X : E β†’ E) {C : ℝβ‰₯0} (hX : LipschitzWith C X)
(s : ℝ) (z : E) (hs : β€–sβ€– * C < 1) :
ContractingWith (β€–sβ€–β‚Š * C) (fun u ↦ z + s β€’ X u) := by
refine ⟨?_, ?_⟩
Β· exact_mod_cast hs
Β· apply LipschitzWith.of_dist_le_mul
intro x y
rw [dist_eq_norm, add_sub_add_left_eq_sub, ← smul_sub, norm_smul, ← dist_eq_norm]
simpa only [NNReal.coe_mul, coe_nnnorm, mul_assoc] using
mul_le_mul_of_nonneg_left (hX.dist_le_mul x y) (norm_nonneg s)
/-- The inverse of id-sX, for a smooth uniformly small parameter s. -/
def resolvent (X : E β†’ E) {C : ℝβ‰₯0} (hX : LipschitzWith C X)
(Ο„ : ℝ β†’ ℝ) (hΟ„ : βˆ€ t, β€–Ο„ tβ€– * C < 1) (p : ℝ Γ— E) : E :=
(contraction X hX (Ο„ p.1) p.2 (hΟ„ p.1)).fixedPoint (fun u ↦ p.2 + Ο„ p.1 β€’ X u)
lemma resolvent_eq (X : E β†’ E) {C : ℝβ‰₯0} (hX : LipschitzWith C X)
(Ο„ : ℝ β†’ ℝ) (hΟ„ : βˆ€ t, β€–Ο„ tβ€– * C < 1) (p : ℝ Γ— E) :
resolvent X hX Ο„ hΟ„ p = p.2 + Ο„ p.1 β€’ X (resolvent X hX Ο„ hΟ„ p) := by
exact ((contraction X hX (Ο„ p.1) p.2 (hΟ„ p.1)).fixedPoint_isFixedPt).symm
lemma resolvent_unique (X : E β†’ E) {C : ℝβ‰₯0} (hX : LipschitzWith C X)
(Ο„ : ℝ β†’ ℝ) (hΟ„ : βˆ€ t, β€–Ο„ tβ€– * C < 1) (p : ℝ Γ— E) (u : E)
(hu : u = p.2 + Ο„ p.1 β€’ X u) : u = resolvent X hX Ο„ hΟ„ p := by
exact (contraction X hX (Ο„ p.1) p.2 (hΟ„ p.1)).fixedPoint_unique hu.symm
omit [CompleteSpace E] in
lemma implicit_partial (X : E β†’ E) (hX : ContDiff ℝ ∞ X)
(Ο„ : ℝ β†’ ℝ) (hΟ„ : ContDiff ℝ ∞ Ο„) (p : ℝ Γ— E) (u : E) :
fderiv ℝ (fun q : (ℝ Γ— E) Γ— E ↦ q.2 - q.1.2 - Ο„ q.1.1 β€’ X q.2) (p,u) ∘L
ContinuousLinearMap.inr ℝ (ℝ Γ— E) E =
ContinuousLinearMap.id ℝ E - Ο„ p.1 β€’ fderiv ℝ X u := by
have hg : ContDiff ℝ ∞ (fun q : (ℝ Γ— E) Γ— E ↦ q.2 - q.1.2 - Ο„ q.1.1 β€’ X q.2) := by fun_prop
have hu : HasFDerivAt (fun v ↦ v - p.2 - Ο„ p.1 β€’ X v)
(ContinuousLinearMap.id ℝ E - Ο„ p.1 β€’ fderiv ℝ X u) u :=
((hasFDerivAt_id u).sub_const p.2).sub ((hX.differentiable (by simp) u).hasFDerivAt.const_smul _)
have hc := (hg.differentiable (by simp) (p,u)).hasFDerivAt.comp u
((hasFDerivAt_const p u).prodMk (hasFDerivAt_id (π•œ := ℝ) u))
convert hc.unique hu using 1; congr 1
lemma resolvent_smooth (X : E β†’ E) {C : ℝβ‰₯0} (hX : LipschitzWith C X)
(hXs : ContDiff ℝ ∞ X) (Ο„ : ℝ β†’ ℝ) (hΟ„ : βˆ€ t, β€–Ο„ tβ€– * C < 1)
(hΟ„s : ContDiff ℝ ∞ Ο„) : ContDiff ℝ ∞ (resolvent X hX Ο„ hΟ„) := by
rw [contDiff_iff_contDiffAt]
intro p
let u := resolvent X hX Ο„ hΟ„ p
let g : (ℝ Γ— E) Γ— E β†’ E := fun q ↦ q.2 - q.1.2 - Ο„ q.1.1 β€’ X q.2
have hg : ContDiffAt ℝ ∞ g (p,u) := by dsimp [g]; fun_prop
have hi : (fderiv ℝ g (p,u) ∘L ContinuousLinearMap.inr ℝ (ℝ Γ— E) E).IsInvertible := by
rw [show g = (fun q : (ℝ Γ— E) Γ— E ↦ q.2 - q.1.2 - Ο„ q.1.1 β€’ X q.2) from rfl,
implicit_partial X hXs Ο„ hΟ„s]
have hb : β€–Ο„ p.1 β€’ fderiv ℝ X uβ€– < 1 := by
rw [norm_smul]
exact lt_of_le_of_lt (mul_le_mul_of_nonneg_left
(norm_fderiv_le_of_lipschitz ℝ hX) (norm_nonneg _)) (hΟ„ p.1)
obtain ⟨A,hA⟩ := isUnit_one_sub_of_norm_lt_one hb
exact ⟨ContinuousLinearEquiv.ofUnit A, hA⟩
apply (hg.contDiffAt_implicitFunction (by simp) hi).congr_of_eventuallyEq
filter_upwards [hg.eventually_apply_implicitFunction (by simp) hi] with q hq
have hbase : g (p,u) = 0 := by
dsimp [g]
have he := resolvent_eq X hX Ο„ hΟ„ p
change u = _ at he
calc
u - p.2 - Ο„ p.1 β€’ X u = u - (p.2 + Ο„ p.1 β€’ X u) := by abel
_ = 0 := sub_eq_zero.mpr he
rw [hbase] at hq
have hu : hg.implicitFunction (by simp) hi q = q.2 + Ο„ q.1 β€’ X (hg.implicitFunction (by simp) hi q) := by
dsimp [g] at hq
exact (sub_eq_iff_eq_add.mp (sub_eq_zero.mp hq)).trans (add_comm _ _)
exact (resolvent_unique X hX Ο„ hΟ„ q _ hu).symm
lemma neg_small {C : ℝβ‰₯0} {Ο„ : ℝ β†’ ℝ} (hΟ„ : βˆ€ t, β€–Ο„ tβ€– * C < 1) :
βˆ€ t, β€–-Ο„ tβ€– * C < 1 := by simpa only [norm_neg] using hΟ„
/-- The implicit midpoint step. The actual step size is 2Ο„. -/
def step (X : E β†’ E) {C : ℝβ‰₯0} (hX : LipschitzWith C X)
(Ο„ : ℝ β†’ ℝ) (hΟ„ : βˆ€ t, β€–Ο„ tβ€– * C < 1) (p : ℝ Γ— E) : E :=
(2 : ℝ) β€’ resolvent X hX Ο„ hΟ„ p - p.2
lemma step_center (X : E β†’ E) {C : ℝβ‰₯0} (hX : LipschitzWith C X)
(Ο„ : ℝ β†’ ℝ) (hΟ„ : βˆ€ t, β€–Ο„ tβ€– * C < 1) (p : ℝ Γ— E) :
step X hX Ο„ hΟ„ p = resolvent X hX Ο„ hΟ„ p + Ο„ p.1 β€’ X (resolvent X hX Ο„ hΟ„ p) := by
have he : resolvent X hX Ο„ hΟ„ p - p.2 = Ο„ p.1 β€’ X (resolvent X hX Ο„ hΟ„ p) := by
exact sub_eq_iff_eq_add.mpr ((resolvent_eq X hX Ο„ hΟ„ p).trans (add_comm _ _))
calc
step X hX Ο„ hΟ„ p = resolvent X hX Ο„ hΟ„ p + (resolvent X hX Ο„ hΟ„ p - p.2) := by
dsimp [step]; module
_ = _ := by rw [he]
lemma resolvent_step (X : E β†’ E) {C : ℝβ‰₯0} (hX : LipschitzWith C X)
(Ο„ : ℝ β†’ ℝ) (hΟ„ : βˆ€ t, β€–Ο„ tβ€– * C < 1) (p : ℝ Γ— E) :
resolvent X hX (fun t ↦ -Ο„ t) (neg_small hΟ„) (p.1, step X hX Ο„ hΟ„ p) =
resolvent X hX Ο„ hΟ„ p := by
symm
apply resolvent_unique
simp only [step_center, neg_smul]
abel
lemma step_inverse (X : E β†’ E) {C : ℝβ‰₯0} (hX : LipschitzWith C X)
(Ο„ : ℝ β†’ ℝ) (hΟ„ : βˆ€ t, β€–Ο„ tβ€– * C < 1) (p : ℝ Γ— E) :
step X hX (fun t ↦ -Ο„ t) (neg_small hΟ„) (p.1, step X hX Ο„ hΟ„ p) = p.2 := by
rw [step, resolvent_step]
dsimp [step]
module
lemma step_smooth (X : E β†’ E) {C : ℝβ‰₯0} (hX : LipschitzWith C X)
(hXs : ContDiff ℝ ∞ X) (Ο„ : ℝ β†’ ℝ) (hΟ„ : βˆ€ t, β€–Ο„ tβ€– * C < 1)
(hΟ„s : ContDiff ℝ ∞ Ο„) : ContDiff ℝ ∞ (step X hX Ο„ hΟ„) :=
((resolvent_smooth X hX hXs Ο„ hΟ„ hΟ„s).const_smul (2 : ℝ)).sub contDiff_snd
lemma resolvent_zero (X : E β†’ E) {C : ℝβ‰₯0} (hX : LipschitzWith C X)
(Ο„ : ℝ β†’ ℝ) (hΟ„ : βˆ€ t, β€–Ο„ tβ€– * C < 1) (t : ℝ) (ht : Ο„ t = 0) (z : E) :
resolvent X hX Ο„ hΟ„ (t,z) = z := by
simpa only [ht, zero_smul, add_zero] using resolvent_eq X hX Ο„ hΟ„ (t,z)
lemma step_zero (X : E β†’ E) {C : ℝβ‰₯0} (hX : LipschitzWith C X)
(Ο„ : ℝ β†’ ℝ) (hΟ„ : βˆ€ t, β€–Ο„ tβ€– * C < 1) (t : ℝ) (ht : Ο„ t = 0) (z : E) :
step X hX Ο„ hΟ„ (t,z) = z := by
rw [step_center, resolvent_zero _ _ _ _ _ ht]
simp [ht]
lemma resolvent_symmetry (X : E β†’ E) {C : ℝβ‰₯0} (hX : LipschitzWith C X)
(Ο„ : ℝ β†’ ℝ) (hΟ„ : βˆ€ t, β€–Ο„ tβ€– * C < 1) (S : E β†’β‚—[ℝ] E)
(hS : βˆ€ z, X (S z) = S (X z)) (p : ℝ Γ— E) :
resolvent X hX Ο„ hΟ„ (p.1, S p.2) = S (resolvent X hX Ο„ hΟ„ p) := by
symm
apply resolvent_unique
calc
S (resolvent X hX Ο„ hΟ„ p) = S (p.2 + Ο„ p.1 β€’ X (resolvent X hX Ο„ hΟ„ p)) :=
congrArg S (resolvent_eq X hX Ο„ hΟ„ p)
_ = _ := by simp only [map_add, map_smul, hS]
lemma step_symmetry (X : E β†’ E) {C : ℝβ‰₯0} (hX : LipschitzWith C X)
(Ο„ : ℝ β†’ ℝ) (hΟ„ : βˆ€ t, β€–Ο„ tβ€– * C < 1) (S : E β†’β‚—[ℝ] E)
(hS : βˆ€ z, X (S z) = S (X z)) (p : ℝ Γ— E) :
step X hX Ο„ hΟ„ (p.1, S p.2) = S (step X hX Ο„ hΟ„ p) := by
simp [step, resolvent_symmetry X hX Ο„ hΟ„ S hS p]
lemma resolvent_fderiv_equation (X : E β†’ E) {C : ℝβ‰₯0} (hX : LipschitzWith C X)
(hXs : ContDiff ℝ ∞ X) (Ο„ : ℝ β†’ ℝ) (hΟ„ : βˆ€ t, β€–Ο„ tβ€– * C < 1)
(hΟ„s : ContDiff ℝ ∞ Ο„) (p : ℝ Γ— E) (a : ℝ) (v : E) :
fderiv ℝ (resolvent X hX Ο„ hΟ„) p (a,v) = v +
(a * deriv Ο„ p.1) β€’ X (resolvent X hX Ο„ hΟ„ p) +
Ο„ p.1 β€’ fderiv ℝ X (resolvent X hX Ο„ hΟ„ p)
(fderiv ℝ (resolvent X hX Ο„ hΟ„) p (a,v)) := by
let R := resolvent X hX Ο„ hΟ„
have hR := ((resolvent_smooth X hX hXs Ο„ hΟ„ hΟ„s).differentiable (by simp) p).hasFDerivAt
have hΟ„R := ((hΟ„s.differentiable (by simp) p.1).hasDerivAt).comp_hasFDerivAt p (hasFDerivAt_fst (π•œ := ℝ) (p := p))
have hXR := (hXs.differentiable (by simp) (R p)).hasFDerivAt.comp p hR
have hd := hasFDerivAt_snd.add (hΟ„R.smul hXR)
have heq : (fun q : ℝ Γ— E ↦ q.2 + Ο„ q.1 β€’ X (R q)) = R := by
funext q
exact (resolvent_eq X hX Ο„ hΟ„ q).symm
change HasFDerivAt (fun q : ℝ Γ— E ↦ q.2 + Ο„ q.1 β€’ X (R q)) _ p at hd
rw [heq] at hd
have he := congrArg (fun L : (ℝ Γ— E) β†’L[ℝ] E ↦ L (a,v)) (hR.unique hd)
change fderiv ℝ (resolvent X hX Ο„ hΟ„) p (a,v) =
v + (Ο„ p.1 β€’ fderiv ℝ X (resolvent X hX Ο„ hΟ„ p)
(fderiv ℝ (resolvent X hX Ο„ hΟ„) p (a,v)) +
(deriv Ο„ p.1 * a) β€’ X (resolvent X hX Ο„ hΟ„ p)) at he
simpa only [add_assoc, add_comm, add_left_comm, mul_comm] using he
omit [CompleteSpace E] in
lemma hamiltonian_linearization (Οƒ : E β†’L[ℝ] E β†’L[ℝ] ℝ)
(hΟƒ : βˆ€ a b, Οƒ a b = -Οƒ b a) (X : E β†’ E) (hX : ContDiff ℝ ∞ X)
(K : E β†’ ℝ) (hK : ContDiff ℝ ∞ K) (u : E)
(hHK : βˆ€αΆ  w in 𝓝 u, Οƒ (X w) = fderiv ℝ K w) (a b : E) :
Οƒ (fderiv ℝ X u a) b = -Οƒ a (fderiv ℝ X u b) := by
have hd := Οƒ.hasFDerivAt.comp u ((hX.differentiable (by simp) u).hasFDerivAt)
have hdK := hd.congr_of_eventuallyEq (show (fun w ↦ Οƒ (X w)) =αΆ [𝓝 u] fderiv ℝ K from hHK).symm
have hs := (hK.contDiffAt (x := u)).isSymmSndFDerivAt (by
simp only [minSmoothness_of_isRCLikeNormedField]
change ((2 : β„•βˆž) : β„•βˆžΟ‰) ≀ ((⊀ : β„•βˆž) : β„•βˆžΟ‰)
exact WithTop.coe_le_coe.mpr le_top) a b
rw [hdK.fderiv] at hs
simpa only [ContinuousLinearMap.comp_apply, hσ _ a] using hs
end ArnoldCounterexample.Midpoint
namespace ArnoldCounterexample.Midpoint
variable {E : Type uE} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E]
def hamiltonian (X : E β†’ E) {C : ℝβ‰₯0} (hX : LipschitzWith C X)
(Ο„ : ℝ β†’ ℝ) (hΟ„ : βˆ€ t, β€–Ο„ tβ€– * C < 1) (K : E β†’ ℝ) (p : ℝ Γ— E) : ℝ :=
(2 * deriv Ο„ p.1) * K (resolvent X hX (fun t ↦ -Ο„ t) (neg_small hΟ„) p)
lemma hamiltonian_smooth (X : E β†’ E) {C : ℝβ‰₯0} (hX : LipschitzWith C X)
(hXs : ContDiff ℝ ∞ X) (Ο„ : ℝ β†’ ℝ) (hΟ„ : βˆ€ t, β€–Ο„ tβ€– * C < 1)
(hΟ„s : ContDiff ℝ ∞ Ο„) (K : E β†’ ℝ) (hK : ContDiff ℝ ∞ K) :
ContDiff ℝ ∞ (hamiltonian X hX Ο„ hΟ„ K) := by
have hd : ContDiff ℝ ∞ (deriv Ο„) := hΟ„s.deriv'
exact (contDiff_const.mul (hd.comp contDiff_fst)).mul
(hK.comp (resolvent_smooth X hX hXs _ (neg_small hΟ„) hΟ„s.neg))
lemma step_time_derivative (X : E β†’ E) {C : ℝβ‰₯0} (hX : LipschitzWith C X)
(hXs : ContDiff ℝ ∞ X) (Ο„ : ℝ β†’ ℝ) (hΟ„ : βˆ€ t, β€–Ο„ tβ€– * C < 1)
(hΟ„s : ContDiff ℝ ∞ Ο„) (p : ℝ Γ— E) :
deriv (fun t ↦ step X hX Ο„ hΟ„ (t,p.2)) p.1 =
(2 : ℝ) β€’ fderiv ℝ (resolvent X hX Ο„ hΟ„) p (1,0) := by
have hR := ((resolvent_smooth X hX hXs Ο„ hΟ„ hΟ„s).differentiable (by simp) p).hasFDerivAt
have ht : HasDerivAt (fun t : ℝ ↦ (t,p.2)) (1,0) p.1 :=
(hasDerivAt_id p.1).prodMk (hasDerivAt_const p.1 p.2)
have hd := ((hR.comp_hasDerivAt p.1 ht).const_smul (2 : ℝ)).sub_const p.2
exact hd.deriv
lemma step_hamiltonian_equation (Οƒ : E β†’L[ℝ] E β†’L[ℝ] ℝ)
(hΟƒ : βˆ€ a b, Οƒ a b = -Οƒ b a) (X : E β†’ E) {C : ℝβ‰₯0} (hX : LipschitzWith C X)
(hXs : ContDiff ℝ ∞ X) (Ο„ : ℝ β†’ ℝ) (hΟ„ : βˆ€ t, β€–Ο„ tβ€– * C < 1)
(hΟ„s : ContDiff ℝ ∞ Ο„) (K : E β†’ ℝ) (hK : ContDiff ℝ ∞ K) (p : ℝ Γ— E)
(hHK : βˆ€αΆ  w in 𝓝 (resolvent X hX Ο„ hΟ„ p), Οƒ (X w) = fderiv ℝ K w) (v : E) :
Οƒ (deriv (fun t ↦ step X hX Ο„ hΟ„ (t,p.2)) p.1) v =
fderiv ℝ (fun w ↦ hamiltonian X hX Ο„ hΟ„ K (p.1,w)) (step X hX Ο„ hΟ„ p) v := by
let u := resolvent X hX Ο„ hΟ„ p
let y := step X hX Ο„ hΟ„ p
let A := fderiv ℝ (resolvent X hX Ο„ hΟ„) p (1,0)
let R := resolvent X hX (fun t ↦ -Ο„ t) (neg_small hΟ„)
let B := fderiv ℝ R (p.1,y) (0,v)
have hRu : R (p.1,y) = u := resolvent_step X hX Ο„ hΟ„ p
have hA : A = deriv Ο„ p.1 β€’ X u + Ο„ p.1 β€’ fderiv ℝ X u A := by
simpa only [zero_add, one_mul] using resolvent_fderiv_equation X hX hXs Ο„ hΟ„ hΟ„s p 1 0
have hB : B = v - Ο„ p.1 β€’ fderiv ℝ X u B := by
have h := resolvent_fderiv_equation X hX hXs (fun t ↦ -Ο„ t) (neg_small hΟ„) hΟ„s.neg (p.1,y) 0 v
change B = v + (0 * deriv (fun t ↦ -Ο„ t) p.1) β€’ X (R (p.1,y)) +
(-Ο„ p.1) β€’ fderiv ℝ X (R (p.1,y)) B at h
simpa only [zero_mul, zero_smul, add_zero, hRu, neg_smul, sub_eq_add_neg] using h
have hlin := hamiltonian_linearization σ hσ X hXs K hK u hHK A B
have eeA : Οƒ A B = deriv Ο„ p.1 * Οƒ (X u) B + Ο„ p.1 * Οƒ (fderiv ℝ X u A) B := by
conv_lhs => rw [hA]
simp only [map_add, map_smul, add_apply, smul_apply, smul_eq_mul]
have eeB : Οƒ A B = Οƒ A v - Ο„ p.1 * Οƒ A (fderiv ℝ X u B) := by
conv_lhs => rw [hB]
simp only [map_sub, map_smul, smul_eq_mul]
have ee : Οƒ A v = deriv Ο„ p.1 * Οƒ (X u) B := by rw [hlin] at eeA; nlinarith
have hKX : fderiv ℝ K u = Οƒ (X u) := (Filter.EventuallyEq.eq_of_nhds hHK).symm
have hRd := ((resolvent_smooth X hX hXs _ (neg_small hΟ„) hΟ„s.neg).differentiable (by simp) (p.1,y)).hasFDerivAt
have hinc : HasFDerivAt (fun w : E ↦ (p.1,w)) (ContinuousLinearMap.inr ℝ ℝ E) y :=
(hasFDerivAt_const p.1 y).prodMk (hasFDerivAt_id (π•œ := ℝ) y)
have hKd := (hK.differentiable (by simp) (R (p.1,y))).hasFDerivAt
have hd := ((hKd.comp y (hRd.comp y hinc)).const_mul (2 * deriv Ο„ p.1))
change HasFDerivAt (fun w ↦ hamiltonian X hX Ο„ hΟ„ K (p.1,w)) _ y at hd
rw [hd.fderiv, step_time_derivative X hX hXs Ο„ hΟ„ hΟ„s p]
change Οƒ ((2 : ℝ) β€’ A) v = _
simp only [map_smul, smul_apply, smul_eq_mul, ContinuousLinearMap.comp_apply]
rw [hRu, hKX]
change 2 * Οƒ A v = (2 * deriv Ο„ p.1) * Οƒ (X u) B
rw [ee]
ring
end ArnoldCounterexample.Midpoint
end
end OAI