url
stringclasses
147 values
commit
stringclasses
147 values
file_path
stringlengths
7
101
full_name
stringlengths
1
94
start
stringlengths
6
10
end
stringlengths
6
11
tactic
stringlengths
1
11.2k
state_before
stringlengths
3
2.09M
state_after
stringlengths
6
2.09M
input
stringlengths
73
2.09M
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
SuperAtC.superNearC'
[576, 1]
[630, 16]
rcases choose_spec (h _ i.mem) with ⟨_, _, _, s⟩
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t✝ : Set (β„‚ Γ— β„‚) s : SuperAtC f d u w : Set (β„‚ Γ— β„‚) wo : IsOpen w wc : βˆ€ c ∈ u, (c, 0) ∈ w h : βˆ€ c ∈ u, βˆƒ r > 0, ball c r βŠ† u ∧ ball (c, 0) r βŠ† w ∧ SuperNearC f d (ball c r) (ball (c, 0) r) r : ↑u β†’ ℝ := fun c => choose β‹― v : ↑u β†’ Set β„‚ := fun c => ball (↑c) (r c) t : ↑u β†’ Set (β„‚ Γ— β„‚) := fun c => ball (↑c, 0) (r c) e : u = ⋃ c, v c tw : ⋃ c, t c βŠ† w i : ↑u ⊒ SuperNearC f d (v i) (t i)
case intro.intro.intro f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t✝ : Set (β„‚ Γ— β„‚) s✝ : SuperAtC f d u w : Set (β„‚ Γ— β„‚) wo : IsOpen w wc : βˆ€ c ∈ u, (c, 0) ∈ w h : βˆ€ c ∈ u, βˆƒ r > 0, ball c r βŠ† u ∧ ball (c, 0) r βŠ† w ∧ SuperNearC f d (ball c r) (ball (c, 0) r) r : ↑u β†’ ℝ := fun c => choose β‹― v : ↑u β†’ Set β„‚ := fun c => ball (↑c) (r c) t : ↑u β†’ Set (β„‚ Γ— β„‚) := fun c => ball (↑c, 0) (r c) e : u = ⋃ c, v c tw : ⋃ c, t c βŠ† w i : ↑u left✝² : choose β‹― > 0 left✝¹ : ball (↑i) (choose β‹―) βŠ† u left✝ : ball (↑i, 0) (choose β‹―) βŠ† w s : SuperNearC f d (ball (↑i) (choose β‹―)) (ball (↑i, 0) (choose β‹―)) ⊒ SuperNearC f d (v i) (t i)
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t✝ : Set (β„‚ Γ— β„‚) s : SuperAtC f d u w : Set (β„‚ Γ— β„‚) wo : IsOpen w wc : βˆ€ c ∈ u, (c, 0) ∈ w h : βˆ€ c ∈ u, βˆƒ r > 0, ball c r βŠ† u ∧ ball (c, 0) r βŠ† w ∧ SuperNearC f d (ball c r) (ball (c, 0) r) r : ↑u β†’ ℝ := fun c => choose β‹― v : ↑u β†’ Set β„‚ := fun c => ball (↑c) (r c) t : ↑u β†’ Set (β„‚ Γ— β„‚) := fun c => ball (↑c, 0) (r c) e : u = ⋃ c, v c tw : ⋃ c, t c βŠ† w i : ↑u ⊒ SuperNearC f d (v i) (t i) TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
SuperAtC.superNearC'
[576, 1]
[630, 16]
exact s
case intro.intro.intro f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t✝ : Set (β„‚ Γ— β„‚) s✝ : SuperAtC f d u w : Set (β„‚ Γ— β„‚) wo : IsOpen w wc : βˆ€ c ∈ u, (c, 0) ∈ w h : βˆ€ c ∈ u, βˆƒ r > 0, ball c r βŠ† u ∧ ball (c, 0) r βŠ† w ∧ SuperNearC f d (ball c r) (ball (c, 0) r) r : ↑u β†’ ℝ := fun c => choose β‹― v : ↑u β†’ Set β„‚ := fun c => ball (↑c) (r c) t : ↑u β†’ Set (β„‚ Γ— β„‚) := fun c => ball (↑c, 0) (r c) e : u = ⋃ c, v c tw : ⋃ c, t c βŠ† w i : ↑u left✝² : choose β‹― > 0 left✝¹ : ball (↑i) (choose β‹―) βŠ† u left✝ : ball (↑i, 0) (choose β‹―) βŠ† w s : SuperNearC f d (ball (↑i) (choose β‹―)) (ball (↑i, 0) (choose β‹―)) ⊒ SuperNearC f d (v i) (t i)
no goals
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t✝ : Set (β„‚ Γ— β„‚) s✝ : SuperAtC f d u w : Set (β„‚ Γ— β„‚) wo : IsOpen w wc : βˆ€ c ∈ u, (c, 0) ∈ w h : βˆ€ c ∈ u, βˆƒ r > 0, ball c r βŠ† u ∧ ball (c, 0) r βŠ† w ∧ SuperNearC f d (ball c r) (ball (c, 0) r) r : ↑u β†’ ℝ := fun c => choose β‹― v : ↑u β†’ Set β„‚ := fun c => ball (↑c) (r c) t : ↑u β†’ Set (β„‚ Γ— β„‚) := fun c => ball (↑c, 0) (r c) e : u = ⋃ c, v c tw : ⋃ c, t c βŠ† w i : ↑u left✝² : choose β‹― > 0 left✝¹ : ball (↑i) (choose β‹―) βŠ† u left✝ : ball (↑i, 0) (choose β‹―) βŠ† w s : SuperNearC f d (ball (↑i) (choose β‹―)) (ball (↑i, 0) (choose β‹―)) ⊒ SuperNearC f d (v i) (t i) TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
SuperAtC.superNearC
[633, 1]
[634, 89]
rcases s.superNearC' isOpen_univ fun _ _ ↦ Set.mem_univ _ with ⟨t, _, s⟩
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperAtC f d u ⊒ βˆƒ t, SuperNearC f d u t
case intro.intro f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t✝ : Set (β„‚ Γ— β„‚) s✝ : SuperAtC f d u t : Set (β„‚ Γ— β„‚) left✝ : t βŠ† univ s : SuperNearC f d u t ⊒ βˆƒ t, SuperNearC f d u t
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperAtC f d u ⊒ βˆƒ t, SuperNearC f d u t TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
SuperAtC.superNearC
[633, 1]
[634, 89]
exact ⟨t, s⟩
case intro.intro f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t✝ : Set (β„‚ Γ— β„‚) s✝ : SuperAtC f d u t : Set (β„‚ Γ— β„‚) left✝ : t βŠ† univ s : SuperNearC f d u t ⊒ βˆƒ t, SuperNearC f d u t
no goals
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t✝ : Set (β„‚ Γ— β„‚) s✝ : SuperAtC f d u t : Set (β„‚ Γ— β„‚) left✝ : t βŠ† univ s : SuperNearC f d u t ⊒ βˆƒ t, SuperNearC f d u t TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
iterates_analytic_c
[636, 1]
[641, 30]
induction' n with n nh
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun c => (f c)^[n] z) c
case zero f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun c => (f c)^[0] z) c case succ f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t n : β„• nh : AnalyticAt β„‚ (fun c => (f c)^[n] z) c ⊒ AnalyticAt β„‚ (fun c => (f c)^[n + 1] z) c
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun c => (f c)^[n] z) c TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
iterates_analytic_c
[636, 1]
[641, 30]
simp only [Function.iterate_zero, id]
case zero f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun c => (f c)^[0] z) c
case zero f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun c => z) c
Please generate a tactic in lean4 to solve the state. STATE: case zero f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun c => (f c)^[0] z) c TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
iterates_analytic_c
[636, 1]
[641, 30]
exact analyticAt_const
case zero f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun c => z) c
no goals
Please generate a tactic in lean4 to solve the state. STATE: case zero f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun c => z) c TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
iterates_analytic_c
[636, 1]
[641, 30]
simp_rw [Function.iterate_succ']
case succ f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t n : β„• nh : AnalyticAt β„‚ (fun c => (f c)^[n] z) c ⊒ AnalyticAt β„‚ (fun c => (f c)^[n + 1] z) c
case succ f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t n : β„• nh : AnalyticAt β„‚ (fun c => (f c)^[n] z) c ⊒ AnalyticAt β„‚ (fun c => (f c ∘ (f c)^[n]) z) c
Please generate a tactic in lean4 to solve the state. STATE: case succ f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t n : β„• nh : AnalyticAt β„‚ (fun c => (f c)^[n] z) c ⊒ AnalyticAt β„‚ (fun c => (f c)^[n + 1] z) c TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
iterates_analytic_c
[636, 1]
[641, 30]
simp only [Function.comp_apply]
case succ f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t n : β„• nh : AnalyticAt β„‚ (fun c => (f c)^[n] z) c ⊒ AnalyticAt β„‚ (fun c => (f c ∘ (f c)^[n]) z) c
case succ f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t n : β„• nh : AnalyticAt β„‚ (fun c => (f c)^[n] z) c ⊒ AnalyticAt β„‚ (fun c => f c ((f c)^[n] z)) c
Please generate a tactic in lean4 to solve the state. STATE: case succ f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t n : β„• nh : AnalyticAt β„‚ (fun c => (f c)^[n] z) c ⊒ AnalyticAt β„‚ (fun c => (f c ∘ (f c)^[n]) z) c TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
iterates_analytic_c
[636, 1]
[641, 30]
refine (s.fa _ ?_).comp ((analyticAt_id _ _).prod nh)
case succ f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t n : β„• nh : AnalyticAt β„‚ (fun c => (f c)^[n] z) c ⊒ AnalyticAt β„‚ (fun c => f c ((f c)^[n] z)) c
case succ f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t n : β„• nh : AnalyticAt β„‚ (fun c => (f c)^[n] z) c ⊒ (id c, (f c)^[n] z) ∈ t
Please generate a tactic in lean4 to solve the state. STATE: case succ f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t n : β„• nh : AnalyticAt β„‚ (fun c => (f c)^[n] z) c ⊒ AnalyticAt β„‚ (fun c => f c ((f c)^[n] z)) c TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
iterates_analytic_c
[636, 1]
[641, 30]
exact (s.ts m).mapsTo n m
case succ f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t n : β„• nh : AnalyticAt β„‚ (fun c => (f c)^[n] z) c ⊒ (id c, (f c)^[n] z) ∈ t
no goals
Please generate a tactic in lean4 to solve the state. STATE: case succ f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t n : β„• nh : AnalyticAt β„‚ (fun c => (f c)^[n] z) c ⊒ (id c, (f c)^[n] z) ∈ t TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_analytic_c
[643, 1]
[652, 75]
refine AnalyticAt.cpow ?_ analyticAt_const ?_
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun c => term (f c) d n z) c
case refine_1 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun c => g (f c) d ((f c)^[n] z)) c case refine_2 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t ⊒ g (f c) d ((f c)^[n] z) ∈ Complex.slitPlane
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun c => term (f c) d n z) c TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_analytic_c
[643, 1]
[652, 75]
have e : (fun c ↦ g (f c) d ((f c)^[n] z)) = fun c ↦ g2 f d (c, (f c)^[n] z) := rfl
case refine_1 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun c => g (f c) d ((f c)^[n] z)) c
case refine_1 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t e : (fun c => g (f c) d ((f c)^[n] z)) = fun c => g2 f d (c, (f c)^[n] z) ⊒ AnalyticAt β„‚ (fun c => g (f c) d ((f c)^[n] z)) c
Please generate a tactic in lean4 to solve the state. STATE: case refine_1 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun c => g (f c) d ((f c)^[n] z)) c TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_analytic_c
[643, 1]
[652, 75]
rw [e]
case refine_1 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t e : (fun c => g (f c) d ((f c)^[n] z)) = fun c => g2 f d (c, (f c)^[n] z) ⊒ AnalyticAt β„‚ (fun c => g (f c) d ((f c)^[n] z)) c
case refine_1 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t e : (fun c => g (f c) d ((f c)^[n] z)) = fun c => g2 f d (c, (f c)^[n] z) ⊒ AnalyticAt β„‚ (fun c => g2 f d (c, (f c)^[n] z)) c
Please generate a tactic in lean4 to solve the state. STATE: case refine_1 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t e : (fun c => g (f c) d ((f c)^[n] z)) = fun c => g2 f d (c, (f c)^[n] z) ⊒ AnalyticAt β„‚ (fun c => g (f c) d ((f c)^[n] z)) c TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_analytic_c
[643, 1]
[652, 75]
refine (s.ga _ ?_).comp ?_
case refine_1 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t e : (fun c => g (f c) d ((f c)^[n] z)) = fun c => g2 f d (c, (f c)^[n] z) ⊒ AnalyticAt β„‚ (fun c => g2 f d (c, (f c)^[n] z)) c
case refine_1.refine_1 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t e : (fun c => g (f c) d ((f c)^[n] z)) = fun c => g2 f d (c, (f c)^[n] z) ⊒ (c, (f c)^[n] z) ∈ t case refine_1.refine_2 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t e : (fun c => g (f c) d ((f c)^[n] z)) = fun c => g2 f d (c, (f c)^[n] z) ⊒ AnalyticAt β„‚ (fun c => (c, (f c)^[n] z)) c
Please generate a tactic in lean4 to solve the state. STATE: case refine_1 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t e : (fun c => g (f c) d ((f c)^[n] z)) = fun c => g2 f d (c, (f c)^[n] z) ⊒ AnalyticAt β„‚ (fun c => g2 f d (c, (f c)^[n] z)) c TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_analytic_c
[643, 1]
[652, 75]
exact (s.ts m).mapsTo n m
case refine_1.refine_1 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t e : (fun c => g (f c) d ((f c)^[n] z)) = fun c => g2 f d (c, (f c)^[n] z) ⊒ (c, (f c)^[n] z) ∈ t
no goals
Please generate a tactic in lean4 to solve the state. STATE: case refine_1.refine_1 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t e : (fun c => g (f c) d ((f c)^[n] z)) = fun c => g2 f d (c, (f c)^[n] z) ⊒ (c, (f c)^[n] z) ∈ t TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_analytic_c
[643, 1]
[652, 75]
apply (analyticAt_id _ _).prod (iterates_analytic_c s n m)
case refine_1.refine_2 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t e : (fun c => g (f c) d ((f c)^[n] z)) = fun c => g2 f d (c, (f c)^[n] z) ⊒ AnalyticAt β„‚ (fun c => (c, (f c)^[n] z)) c
no goals
Please generate a tactic in lean4 to solve the state. STATE: case refine_1.refine_2 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t e : (fun c => g (f c) d ((f c)^[n] z)) = fun c => g2 f d (c, (f c)^[n] z) ⊒ AnalyticAt β„‚ (fun c => (c, (f c)^[n] z)) c TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_analytic_c
[643, 1]
[652, 75]
refine mem_slitPlane_of_near_one ?_
case refine_2 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t ⊒ g (f c) d ((f c)^[n] z) ∈ Complex.slitPlane
case refine_2 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t ⊒ Complex.abs (g (f c) d ((f c)^[n] z) - 1) < 1
Please generate a tactic in lean4 to solve the state. STATE: case refine_2 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t ⊒ g (f c) d ((f c)^[n] z) ∈ Complex.slitPlane TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_analytic_c
[643, 1]
[652, 75]
exact lt_of_le_of_lt ((s.ts m).gs ((s.ts m).mapsTo n m)) (by norm_num)
case refine_2 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t ⊒ Complex.abs (g (f c) d ((f c)^[n] z) - 1) < 1
no goals
Please generate a tactic in lean4 to solve the state. STATE: case refine_2 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t ⊒ Complex.abs (g (f c) d ((f c)^[n] z) - 1) < 1 TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_analytic_c
[643, 1]
[652, 75]
norm_num
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t ⊒ 1 / 4 < 1
no goals
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ n : β„• m : (c, z) ∈ t ⊒ 1 / 4 < 1 TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_prod_analytic_c
[655, 1]
[663, 42]
have c12 : (1 / 2 : ℝ) ≀ 1 / 2 := by norm_num
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun c => ∏' (n : β„•), term (f c) d n z) c
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t c12 : 1 / 2 ≀ 1 / 2 ⊒ AnalyticAt β„‚ (fun c => ∏' (n : β„•), term (f c) d n z) c
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun c => ∏' (n : β„•), term (f c) d n z) c TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_prod_analytic_c
[655, 1]
[663, 42]
have a0 : 0 ≀ (1 / 2 : ℝ) := by norm_num
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t c12 : 1 / 2 ≀ 1 / 2 ⊒ AnalyticAt β„‚ (fun c => ∏' (n : β„•), term (f c) d n z) c
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t c12 : 1 / 2 ≀ 1 / 2 a0 : 0 ≀ 1 / 2 ⊒ AnalyticAt β„‚ (fun c => ∏' (n : β„•), term (f c) d n z) c
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t c12 : 1 / 2 ≀ 1 / 2 ⊒ AnalyticAt β„‚ (fun c => ∏' (n : β„•), term (f c) d n z) c TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_prod_analytic_c
[655, 1]
[663, 42]
set t' := {c | (c, z) ∈ t}
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t c12 : 1 / 2 ≀ 1 / 2 a0 : 0 ≀ 1 / 2 ⊒ AnalyticAt β„‚ (fun c => ∏' (n : β„•), term (f c) d n z) c
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t c12 : 1 / 2 ≀ 1 / 2 a0 : 0 ≀ 1 / 2 t' : Set β„‚ := {c | (c, z) ∈ t} ⊒ AnalyticAt β„‚ (fun c => ∏' (n : β„•), term (f c) d n z) c
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t c12 : 1 / 2 ≀ 1 / 2 a0 : 0 ≀ 1 / 2 ⊒ AnalyticAt β„‚ (fun c => ∏' (n : β„•), term (f c) d n z) c TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_prod_analytic_c
[655, 1]
[663, 42]
have o' : IsOpen t' := s.o.preimage (by continuity)
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t c12 : 1 / 2 ≀ 1 / 2 a0 : 0 ≀ 1 / 2 t' : Set β„‚ := {c | (c, z) ∈ t} ⊒ AnalyticAt β„‚ (fun c => ∏' (n : β„•), term (f c) d n z) c
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t c12 : 1 / 2 ≀ 1 / 2 a0 : 0 ≀ 1 / 2 t' : Set β„‚ := {c | (c, z) ∈ t} o' : IsOpen t' ⊒ AnalyticAt β„‚ (fun c => ∏' (n : β„•), term (f c) d n z) c
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t c12 : 1 / 2 ≀ 1 / 2 a0 : 0 ≀ 1 / 2 t' : Set β„‚ := {c | (c, z) ∈ t} ⊒ AnalyticAt β„‚ (fun c => ∏' (n : β„•), term (f c) d n z) c TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_prod_analytic_c
[655, 1]
[663, 42]
refine (fast_products_converge' o' c12 a0 (by linarith) ?_ fun n c m ↦ term_converges (s.ts m) n m).2.1 _ m
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t c12 : 1 / 2 ≀ 1 / 2 a0 : 0 ≀ 1 / 2 t' : Set β„‚ := {c | (c, z) ∈ t} o' : IsOpen t' ⊒ AnalyticAt β„‚ (fun c => ∏' (n : β„•), term (f c) d n z) c
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t c12 : 1 / 2 ≀ 1 / 2 a0 : 0 ≀ 1 / 2 t' : Set β„‚ := {c | (c, z) ∈ t} o' : IsOpen t' ⊒ βˆ€ (n : β„•), AnalyticOn β„‚ (fun c => term (f (c, z).1) d n z) t'
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t c12 : 1 / 2 ≀ 1 / 2 a0 : 0 ≀ 1 / 2 t' : Set β„‚ := {c | (c, z) ∈ t} o' : IsOpen t' ⊒ AnalyticAt β„‚ (fun c => ∏' (n : β„•), term (f c) d n z) c TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_prod_analytic_c
[655, 1]
[663, 42]
exact fun n c m ↦ term_analytic_c s n m
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t c12 : 1 / 2 ≀ 1 / 2 a0 : 0 ≀ 1 / 2 t' : Set β„‚ := {c | (c, z) ∈ t} o' : IsOpen t' ⊒ βˆ€ (n : β„•), AnalyticOn β„‚ (fun c => term (f (c, z).1) d n z) t'
no goals
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t c12 : 1 / 2 ≀ 1 / 2 a0 : 0 ≀ 1 / 2 t' : Set β„‚ := {c | (c, z) ∈ t} o' : IsOpen t' ⊒ βˆ€ (n : β„•), AnalyticOn β„‚ (fun c => term (f (c, z).1) d n z) t' TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_prod_analytic_c
[655, 1]
[663, 42]
norm_num
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t ⊒ 1 / 2 ≀ 1 / 2
no goals
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t ⊒ 1 / 2 ≀ 1 / 2 TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_prod_analytic_c
[655, 1]
[663, 42]
norm_num
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t c12 : 1 / 2 ≀ 1 / 2 ⊒ 0 ≀ 1 / 2
no goals
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t c12 : 1 / 2 ≀ 1 / 2 ⊒ 0 ≀ 1 / 2 TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_prod_analytic_c
[655, 1]
[663, 42]
continuity
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t c12 : 1 / 2 ≀ 1 / 2 a0 : 0 ≀ 1 / 2 t' : Set β„‚ := {c | (c, z) ∈ t} ⊒ Continuous fun c => (c, z)
no goals
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t c12 : 1 / 2 ≀ 1 / 2 a0 : 0 ≀ 1 / 2 t' : Set β„‚ := {c | (c, z) ∈ t} ⊒ Continuous fun c => (c, z) TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_prod_analytic_c
[655, 1]
[663, 42]
linarith
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t c12 : 1 / 2 ≀ 1 / 2 a0 : 0 ≀ 1 / 2 t' : Set β„‚ := {c | (c, z) ∈ t} o' : IsOpen t' ⊒ 1 / 2 < 1
no goals
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t c12 : 1 / 2 ≀ 1 / 2 a0 : 0 ≀ 1 / 2 t' : Set β„‚ := {c | (c, z) ∈ t} o' : IsOpen t' ⊒ 1 / 2 < 1 TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_prod_analytic
[666, 1]
[670, 68]
refine Pair.hartogs s.o ?_ ?_
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t ⊒ AnalyticOn β„‚ (fun p => ∏' (n : β„•), term (f p.1) d n p.2) t
case refine_1 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t ⊒ βˆ€ (c0 c1 : β„‚), (c0, c1) ∈ t β†’ AnalyticAt β„‚ (fun z0 => ∏' (n : β„•), term (f (z0, c1).1) d n (z0, c1).2) c0 case refine_2 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t ⊒ βˆ€ (c0 c1 : β„‚), (c0, c1) ∈ t β†’ AnalyticAt β„‚ (fun z1 => ∏' (n : β„•), term (f (c0, z1).1) d n (c0, z1).2) c1
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t ⊒ AnalyticOn β„‚ (fun p => ∏' (n : β„•), term (f p.1) d n p.2) t TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_prod_analytic
[666, 1]
[670, 68]
intro c z m
case refine_1 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t ⊒ βˆ€ (c0 c1 : β„‚), (c0, c1) ∈ t β†’ AnalyticAt β„‚ (fun z0 => ∏' (n : β„•), term (f (z0, c1).1) d n (z0, c1).2) c0
case refine_1 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun z0 => ∏' (n : β„•), term (f (z0, z).1) d n (z0, z).2) c
Please generate a tactic in lean4 to solve the state. STATE: case refine_1 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t ⊒ βˆ€ (c0 c1 : β„‚), (c0, c1) ∈ t β†’ AnalyticAt β„‚ (fun z0 => ∏' (n : β„•), term (f (z0, c1).1) d n (z0, c1).2) c0 TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_prod_analytic
[666, 1]
[670, 68]
simp only
case refine_1 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun z0 => ∏' (n : β„•), term (f (z0, z).1) d n (z0, z).2) c
case refine_1 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun z0 => ∏' (n : β„•), term (f z0) d n z) c
Please generate a tactic in lean4 to solve the state. STATE: case refine_1 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun z0 => ∏' (n : β„•), term (f (z0, z).1) d n (z0, z).2) c TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_prod_analytic
[666, 1]
[670, 68]
exact term_prod_analytic_c s m
case refine_1 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun z0 => ∏' (n : β„•), term (f z0) d n z) c
no goals
Please generate a tactic in lean4 to solve the state. STATE: case refine_1 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun z0 => ∏' (n : β„•), term (f z0) d n z) c TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_prod_analytic
[666, 1]
[670, 68]
intro c z m
case refine_2 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t ⊒ βˆ€ (c0 c1 : β„‚), (c0, c1) ∈ t β†’ AnalyticAt β„‚ (fun z1 => ∏' (n : β„•), term (f (c0, z1).1) d n (c0, z1).2) c1
case refine_2 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun z1 => ∏' (n : β„•), term (f (c, z1).1) d n (c, z1).2) z
Please generate a tactic in lean4 to solve the state. STATE: case refine_2 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t ⊒ βˆ€ (c0 c1 : β„‚), (c0, c1) ∈ t β†’ AnalyticAt β„‚ (fun z1 => ∏' (n : β„•), term (f (c0, z1).1) d n (c0, z1).2) c1 TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_prod_analytic
[666, 1]
[670, 68]
simp only
case refine_2 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun z1 => ∏' (n : β„•), term (f (c, z1).1) d n (c, z1).2) z
case refine_2 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun z1 => ∏' (n : β„•), term (f c) d n z1) z
Please generate a tactic in lean4 to solve the state. STATE: case refine_2 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun z1 => ∏' (n : β„•), term (f (c, z1).1) d n (c, z1).2) z TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
term_prod_analytic
[666, 1]
[670, 68]
exact term_prod_analytic_z (s.ts m) _ m
case refine_2 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun z1 => ∏' (n : β„•), term (f c) d n z1) z
no goals
Please generate a tactic in lean4 to solve the state. STATE: case refine_2 f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c z : β„‚ m : (c, z) ∈ t ⊒ AnalyticAt β„‚ (fun z1 => ∏' (n : β„•), term (f c) d n z1) z TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
have df : βˆ€ e z, (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z := by intro e z m; apply HasDerivAt.deriv have fg : f e = fun z ↦ z ^ d * g (f e) d z := by funext; rw [(s.ts m).fg] nth_rw 1 [fg] apply HasDerivAt.mul; apply hasDerivAt_pow rw [hasDerivAt_deriv_iff]; exact ((s.ts m).ga _ m).differentiableAt
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u ⊒ βˆ€αΆ  (p : β„‚ Γ— β„‚) in 𝓝 (c, 0), deriv (f p.1) p.2 = 0 ↔ p.2 = 0
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z ⊒ βˆ€αΆ  (p : β„‚ Γ— β„‚) in 𝓝 (c, 0), deriv (f p.1) p.2 = 0 ↔ p.2 = 0
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u ⊒ βˆ€αΆ  (p : β„‚ Γ— β„‚) in 𝓝 (c, 0), deriv (f p.1) p.2 = 0 ↔ p.2 = 0 TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
apply small.mp
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z small : βˆ€αΆ  (p : β„‚ Γ— β„‚) in 𝓝 (c, 0), Complex.abs (p.2 * deriv (g (f p.1) d) p.2) < Complex.abs (↑d * g (f p.1) d p.2) ⊒ βˆ€αΆ  (p : β„‚ Γ— β„‚) in 𝓝 (c, 0), deriv (f p.1) p.2 = 0 ↔ p.2 = 0
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z small : βˆ€αΆ  (p : β„‚ Γ— β„‚) in 𝓝 (c, 0), Complex.abs (p.2 * deriv (g (f p.1) d) p.2) < Complex.abs (↑d * g (f p.1) d p.2) ⊒ βˆ€αΆ  (x : β„‚ Γ— β„‚) in 𝓝 (c, 0), Complex.abs (x.2 * deriv (g (f x.1) d) x.2) < Complex.abs (↑d * g (f x.1) d x.2) β†’ (deriv (f x.1) x.2 = 0 ↔ x.2 = 0)
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z small : βˆ€αΆ  (p : β„‚ Γ— β„‚) in 𝓝 (c, 0), Complex.abs (p.2 * deriv (g (f p.1) d) p.2) < Complex.abs (↑d * g (f p.1) d p.2) ⊒ βˆ€αΆ  (p : β„‚ Γ— β„‚) in 𝓝 (c, 0), deriv (f p.1) p.2 = 0 ↔ p.2 = 0 TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
apply (s.o.eventually_mem (s.s m).t0).mp
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z small : βˆ€αΆ  (p : β„‚ Γ— β„‚) in 𝓝 (c, 0), Complex.abs (p.2 * deriv (g (f p.1) d) p.2) < Complex.abs (↑d * g (f p.1) d p.2) ⊒ βˆ€αΆ  (x : β„‚ Γ— β„‚) in 𝓝 (c, 0), Complex.abs (x.2 * deriv (g (f x.1) d) x.2) < Complex.abs (↑d * g (f x.1) d x.2) β†’ (deriv (f x.1) x.2 = 0 ↔ x.2 = 0)
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z small : βˆ€αΆ  (p : β„‚ Γ— β„‚) in 𝓝 (c, 0), Complex.abs (p.2 * deriv (g (f p.1) d) p.2) < Complex.abs (↑d * g (f p.1) d p.2) ⊒ βˆ€αΆ  (x : β„‚ Γ— β„‚) in 𝓝 (c, 0), x ∈ t β†’ Complex.abs (x.2 * deriv (g (f x.1) d) x.2) < Complex.abs (↑d * g (f x.1) d x.2) β†’ (deriv (f x.1) x.2 = 0 ↔ x.2 = 0)
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z small : βˆ€αΆ  (p : β„‚ Γ— β„‚) in 𝓝 (c, 0), Complex.abs (p.2 * deriv (g (f p.1) d) p.2) < Complex.abs (↑d * g (f p.1) d p.2) ⊒ βˆ€αΆ  (x : β„‚ Γ— β„‚) in 𝓝 (c, 0), Complex.abs (x.2 * deriv (g (f x.1) d) x.2) < Complex.abs (↑d * g (f x.1) d x.2) β†’ (deriv (f x.1) x.2 = 0 ↔ x.2 = 0) TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
apply Filter.eventually_of_forall
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z small : βˆ€αΆ  (p : β„‚ Γ— β„‚) in 𝓝 (c, 0), Complex.abs (p.2 * deriv (g (f p.1) d) p.2) < Complex.abs (↑d * g (f p.1) d p.2) ⊒ βˆ€αΆ  (x : β„‚ Γ— β„‚) in 𝓝 (c, 0), x ∈ t β†’ Complex.abs (x.2 * deriv (g (f x.1) d) x.2) < Complex.abs (↑d * g (f x.1) d x.2) β†’ (deriv (f x.1) x.2 = 0 ↔ x.2 = 0)
case hp f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z small : βˆ€αΆ  (p : β„‚ Γ— β„‚) in 𝓝 (c, 0), Complex.abs (p.2 * deriv (g (f p.1) d) p.2) < Complex.abs (↑d * g (f p.1) d p.2) ⊒ βˆ€ x ∈ t, Complex.abs (x.2 * deriv (g (f x.1) d) x.2) < Complex.abs (↑d * g (f x.1) d x.2) β†’ (deriv (f x.1) x.2 = 0 ↔ x.2 = 0)
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z small : βˆ€αΆ  (p : β„‚ Γ— β„‚) in 𝓝 (c, 0), Complex.abs (p.2 * deriv (g (f p.1) d) p.2) < Complex.abs (↑d * g (f p.1) d p.2) ⊒ βˆ€αΆ  (x : β„‚ Γ— β„‚) in 𝓝 (c, 0), x ∈ t β†’ Complex.abs (x.2 * deriv (g (f x.1) d) x.2) < Complex.abs (↑d * g (f x.1) d x.2) β†’ (deriv (f x.1) x.2 = 0 ↔ x.2 = 0) TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
clear small
case hp f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z small : βˆ€αΆ  (p : β„‚ Γ— β„‚) in 𝓝 (c, 0), Complex.abs (p.2 * deriv (g (f p.1) d) p.2) < Complex.abs (↑d * g (f p.1) d p.2) ⊒ βˆ€ x ∈ t, Complex.abs (x.2 * deriv (g (f x.1) d) x.2) < Complex.abs (↑d * g (f x.1) d x.2) β†’ (deriv (f x.1) x.2 = 0 ↔ x.2 = 0)
case hp f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z ⊒ βˆ€ x ∈ t, Complex.abs (x.2 * deriv (g (f x.1) d) x.2) < Complex.abs (↑d * g (f x.1) d x.2) β†’ (deriv (f x.1) x.2 = 0 ↔ x.2 = 0)
Please generate a tactic in lean4 to solve the state. STATE: case hp f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z small : βˆ€αΆ  (p : β„‚ Γ— β„‚) in 𝓝 (c, 0), Complex.abs (p.2 * deriv (g (f p.1) d) p.2) < Complex.abs (↑d * g (f p.1) d p.2) ⊒ βˆ€ x ∈ t, Complex.abs (x.2 * deriv (g (f x.1) d) x.2) < Complex.abs (↑d * g (f x.1) d x.2) β†’ (deriv (f x.1) x.2 = 0 ↔ x.2 = 0) TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
intro ⟨e, w⟩ m' small
case hp f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z ⊒ βˆ€ x ∈ t, Complex.abs (x.2 * deriv (g (f x.1) d) x.2) < Complex.abs (↑d * g (f x.1) d x.2) β†’ (deriv (f x.1) x.2 = 0 ↔ x.2 = 0)
case hp f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z e w : β„‚ m' : (e, w) ∈ t small : Complex.abs ((e, w).2 * deriv (g (f (e, w).1) d) (e, w).2) < Complex.abs (↑d * g (f (e, w).1) d (e, w).2) ⊒ deriv (f (e, w).1) (e, w).2 = 0 ↔ (e, w).2 = 0
Please generate a tactic in lean4 to solve the state. STATE: case hp f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z ⊒ βˆ€ x ∈ t, Complex.abs (x.2 * deriv (g (f x.1) d) x.2) < Complex.abs (↑d * g (f x.1) d x.2) β†’ (deriv (f x.1) x.2 = 0 ↔ x.2 = 0) TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
simp only [df _ _ m'] at small ⊒
case hp f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z e w : β„‚ m' : (e, w) ∈ t small : Complex.abs ((e, w).2 * deriv (g (f (e, w).1) d) (e, w).2) < Complex.abs (↑d * g (f (e, w).1) d (e, w).2) ⊒ deriv (f (e, w).1) (e, w).2 = 0 ↔ (e, w).2 = 0
case hp f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z e w : β„‚ m' : (e, w) ∈ t small : Complex.abs (w * deriv (g (f e) d) w) < Complex.abs (↑d * g (f e) d w) ⊒ ↑d * w ^ (d - 1) * g (f e) d w + w ^ d * deriv (g (f e) d) w = 0 ↔ w = 0
Please generate a tactic in lean4 to solve the state. STATE: case hp f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z e w : β„‚ m' : (e, w) ∈ t small : Complex.abs ((e, w).2 * deriv (g (f (e, w).1) d) (e, w).2) < Complex.abs (↑d * g (f (e, w).1) d (e, w).2) ⊒ deriv (f (e, w).1) (e, w).2 = 0 ↔ (e, w).2 = 0 TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
nth_rw 4 [← Nat.sub_add_cancel (Nat.succ_le_of_lt (s.s m).dp)]
case hp f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z e w : β„‚ m' : (e, w) ∈ t small : Complex.abs (w * deriv (g (f e) d) w) < Complex.abs (↑d * g (f e) d w) ⊒ ↑d * w ^ (d - 1) * g (f e) d w + w ^ d * deriv (g (f e) d) w = 0 ↔ w = 0
case hp f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z e w : β„‚ m' : (e, w) ∈ t small : Complex.abs (w * deriv (g (f e) d) w) < Complex.abs (↑d * g (f e) d w) ⊒ ↑d * w ^ (d - 1) * g (f e) d w + w ^ (d - Nat.succ 0 + Nat.succ 0) * deriv (g (f e) d) w = 0 ↔ w = 0
Please generate a tactic in lean4 to solve the state. STATE: case hp f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z e w : β„‚ m' : (e, w) ∈ t small : Complex.abs (w * deriv (g (f e) d) w) < Complex.abs (↑d * g (f e) d w) ⊒ ↑d * w ^ (d - 1) * g (f e) d w + w ^ d * deriv (g (f e) d) w = 0 ↔ w = 0 TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
simp only [pow_add, pow_one, mul_comm _ (w ^ (d - 1)), mul_assoc (w ^ (d - 1)) _ _, ← left_distrib, mul_eq_zero, pow_eq_zero_iff (Nat.sub_pos_of_lt (s.s m).d2).ne']
case hp f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z e w : β„‚ m' : (e, w) ∈ t small : Complex.abs (w * deriv (g (f e) d) w) < Complex.abs (↑d * g (f e) d w) ⊒ ↑d * w ^ (d - 1) * g (f e) d w + w ^ (d - Nat.succ 0 + Nat.succ 0) * deriv (g (f e) d) w = 0 ↔ w = 0
case hp f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z e w : β„‚ m' : (e, w) ∈ t small : Complex.abs (w * deriv (g (f e) d) w) < Complex.abs (↑d * g (f e) d w) ⊒ w = 0 ∨ ↑d * g (f e) d w + w * deriv (g (f e) d) w = 0 ↔ w = 0
Please generate a tactic in lean4 to solve the state. STATE: case hp f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z e w : β„‚ m' : (e, w) ∈ t small : Complex.abs (w * deriv (g (f e) d) w) < Complex.abs (↑d * g (f e) d w) ⊒ ↑d * w ^ (d - 1) * g (f e) d w + w ^ (d - Nat.succ 0 + Nat.succ 0) * deriv (g (f e) d) w = 0 ↔ w = 0 TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
exact or_iff_left (add_ne_zero_of_abs_lt small)
case hp f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z e w : β„‚ m' : (e, w) ∈ t small : Complex.abs (w * deriv (g (f e) d) w) < Complex.abs (↑d * g (f e) d w) ⊒ w = 0 ∨ ↑d * g (f e) d w + w * deriv (g (f e) d) w = 0 ↔ w = 0
no goals
Please generate a tactic in lean4 to solve the state. STATE: case hp f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z e w : β„‚ m' : (e, w) ∈ t small : Complex.abs (w * deriv (g (f e) d) w) < Complex.abs (↑d * g (f e) d w) ⊒ w = 0 ∨ ↑d * g (f e) d w + w * deriv (g (f e) d) w = 0 ↔ w = 0 TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
intro e z m
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u ⊒ βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t ⊒ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u ⊒ βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
apply HasDerivAt.deriv
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t ⊒ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z
case h f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t ⊒ HasDerivAt (f e) (↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z) z
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t ⊒ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
have fg : f e = fun z ↦ z ^ d * g (f e) d z := by funext; rw [(s.ts m).fg]
case h f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t ⊒ HasDerivAt (f e) (↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z) z
case h f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t fg : f e = fun z => z ^ d * g (f e) d z ⊒ HasDerivAt (f e) (↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z) z
Please generate a tactic in lean4 to solve the state. STATE: case h f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t ⊒ HasDerivAt (f e) (↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z) z TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
nth_rw 1 [fg]
case h f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t fg : f e = fun z => z ^ d * g (f e) d z ⊒ HasDerivAt (f e) (↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z) z
case h f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t fg : f e = fun z => z ^ d * g (f e) d z ⊒ HasDerivAt (fun z => z ^ d * g (f e) d z) (↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z) z
Please generate a tactic in lean4 to solve the state. STATE: case h f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t fg : f e = fun z => z ^ d * g (f e) d z ⊒ HasDerivAt (f e) (↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z) z TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
apply HasDerivAt.mul
case h f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t fg : f e = fun z => z ^ d * g (f e) d z ⊒ HasDerivAt (fun z => z ^ d * g (f e) d z) (↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z) z
case h.hc f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t fg : f e = fun z => z ^ d * g (f e) d z ⊒ HasDerivAt (fun y => y ^ d) (↑d * z ^ (d - 1)) z case h.hd f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t fg : f e = fun z => z ^ d * g (f e) d z ⊒ HasDerivAt (fun y => g (f e) d y) (deriv (g (f e) d) z) z
Please generate a tactic in lean4 to solve the state. STATE: case h f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t fg : f e = fun z => z ^ d * g (f e) d z ⊒ HasDerivAt (fun z => z ^ d * g (f e) d z) (↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z) z TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
apply hasDerivAt_pow
case h.hc f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t fg : f e = fun z => z ^ d * g (f e) d z ⊒ HasDerivAt (fun y => y ^ d) (↑d * z ^ (d - 1)) z case h.hd f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t fg : f e = fun z => z ^ d * g (f e) d z ⊒ HasDerivAt (fun y => g (f e) d y) (deriv (g (f e) d) z) z
case h.hd f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t fg : f e = fun z => z ^ d * g (f e) d z ⊒ HasDerivAt (fun y => g (f e) d y) (deriv (g (f e) d) z) z
Please generate a tactic in lean4 to solve the state. STATE: case h.hc f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t fg : f e = fun z => z ^ d * g (f e) d z ⊒ HasDerivAt (fun y => y ^ d) (↑d * z ^ (d - 1)) z case h.hd f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t fg : f e = fun z => z ^ d * g (f e) d z ⊒ HasDerivAt (fun y => g (f e) d y) (deriv (g (f e) d) z) z TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
rw [hasDerivAt_deriv_iff]
case h.hd f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t fg : f e = fun z => z ^ d * g (f e) d z ⊒ HasDerivAt (fun y => g (f e) d y) (deriv (g (f e) d) z) z
case h.hd f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t fg : f e = fun z => z ^ d * g (f e) d z ⊒ DifferentiableAt β„‚ (fun y => g (f e) d y) z
Please generate a tactic in lean4 to solve the state. STATE: case h.hd f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t fg : f e = fun z => z ^ d * g (f e) d z ⊒ HasDerivAt (fun y => g (f e) d y) (deriv (g (f e) d) z) z TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
exact ((s.ts m).ga _ m).differentiableAt
case h.hd f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t fg : f e = fun z => z ^ d * g (f e) d z ⊒ DifferentiableAt β„‚ (fun y => g (f e) d y) z
no goals
Please generate a tactic in lean4 to solve the state. STATE: case h.hd f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t fg : f e = fun z => z ^ d * g (f e) d z ⊒ DifferentiableAt β„‚ (fun y => g (f e) d y) z TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
funext
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t ⊒ f e = fun z => z ^ d * g (f e) d z
case h f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t x✝ : β„‚ ⊒ f e x✝ = x✝ ^ d * g (f e) d x✝
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t ⊒ f e = fun z => z ^ d * g (f e) d z TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
rw [(s.ts m).fg]
case h f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t x✝ : β„‚ ⊒ f e x✝ = x✝ ^ d * g (f e) d x✝
no goals
Please generate a tactic in lean4 to solve the state. STATE: case h f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m✝ : c ∈ u e z : β„‚ m : (e, z) ∈ t x✝ : β„‚ ⊒ f e x✝ = x✝ ^ d * g (f e) d x✝ TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
have ga : AnalyticAt β„‚ (uncurry fun c z ↦ g (f c) d z) (c, 0) := s.ga _ (s.s m).t0
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z ⊒ βˆ€αΆ  (p : β„‚ Γ— β„‚) in 𝓝 (c, 0), Complex.abs (p.2 * deriv (g (f p.1) d) p.2) < Complex.abs (↑d * g (f p.1) d p.2)
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z ga : AnalyticAt β„‚ (uncurry fun c z => g (f c) d z) (c, 0) ⊒ βˆ€αΆ  (p : β„‚ Γ— β„‚) in 𝓝 (c, 0), Complex.abs (p.2 * deriv (g (f p.1) d) p.2) < Complex.abs (↑d * g (f p.1) d p.2)
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z ⊒ βˆ€αΆ  (p : β„‚ Γ— β„‚) in 𝓝 (c, 0), Complex.abs (p.2 * deriv (g (f p.1) d) p.2) < Complex.abs (↑d * g (f p.1) d p.2) TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
apply ContinuousAt.eventually_lt
f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z ga : AnalyticAt β„‚ (uncurry fun c z => g (f c) d z) (c, 0) ⊒ βˆ€αΆ  (p : β„‚ Γ— β„‚) in 𝓝 (c, 0), Complex.abs (p.2 * deriv (g (f p.1) d) p.2) < Complex.abs (↑d * g (f p.1) d p.2)
case hf f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z ga : AnalyticAt β„‚ (uncurry fun c z => g (f c) d z) (c, 0) ⊒ ContinuousAt (fun x => Complex.abs (x.2 * deriv (g (f x.1) d) x.2)) (c, 0) case hg f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z ga : AnalyticAt β„‚ (uncurry fun c z => g (f c) d z) (c, 0) ⊒ ContinuousAt (fun x => Complex.abs (↑d * g (f x.1) d x.2)) (c, 0) case hfg f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z ga : AnalyticAt β„‚ (uncurry fun c z => g (f c) d z) (c, 0) ⊒ Complex.abs ((c, 0).2 * deriv (g (f (c, 0).1) d) (c, 0).2) < Complex.abs (↑d * g (f (c, 0).1) d (c, 0).2)
Please generate a tactic in lean4 to solve the state. STATE: f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z ga : AnalyticAt β„‚ (uncurry fun c z => g (f c) d z) (c, 0) ⊒ βˆ€αΆ  (p : β„‚ Γ— β„‚) in 𝓝 (c, 0), Complex.abs (p.2 * deriv (g (f p.1) d) p.2) < Complex.abs (↑d * g (f p.1) d p.2) TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
exact Complex.continuous_abs.continuousAt.comp (continuousAt_snd.mul ga.deriv2.continuousAt)
case hf f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z ga : AnalyticAt β„‚ (uncurry fun c z => g (f c) d z) (c, 0) ⊒ ContinuousAt (fun x => Complex.abs (x.2 * deriv (g (f x.1) d) x.2)) (c, 0)
no goals
Please generate a tactic in lean4 to solve the state. STATE: case hf f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z ga : AnalyticAt β„‚ (uncurry fun c z => g (f c) d z) (c, 0) ⊒ ContinuousAt (fun x => Complex.abs (x.2 * deriv (g (f x.1) d) x.2)) (c, 0) TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
exact Complex.continuous_abs.continuousAt.comp (continuousAt_const.mul ga.continuousAt)
case hg f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z ga : AnalyticAt β„‚ (uncurry fun c z => g (f c) d z) (c, 0) ⊒ ContinuousAt (fun x => Complex.abs (↑d * g (f x.1) d x.2)) (c, 0)
no goals
Please generate a tactic in lean4 to solve the state. STATE: case hg f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z ga : AnalyticAt β„‚ (uncurry fun c z => g (f c) d z) (c, 0) ⊒ ContinuousAt (fun x => Complex.abs (↑d * g (f x.1) d x.2)) (c, 0) TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
simp only [g0, MulZeroClass.zero_mul, Complex.abs.map_zero, Complex.abs.map_mul, Complex.abs_natCast, Complex.abs.map_one, mul_one, Nat.cast_pos]
case hfg f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z ga : AnalyticAt β„‚ (uncurry fun c z => g (f c) d z) (c, 0) ⊒ Complex.abs ((c, 0).2 * deriv (g (f (c, 0).1) d) (c, 0).2) < Complex.abs (↑d * g (f (c, 0).1) d (c, 0).2)
case hfg f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z ga : AnalyticAt β„‚ (uncurry fun c z => g (f c) d z) (c, 0) ⊒ 0 < d
Please generate a tactic in lean4 to solve the state. STATE: case hfg f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z ga : AnalyticAt β„‚ (uncurry fun c z => g (f c) d z) (c, 0) ⊒ Complex.abs ((c, 0).2 * deriv (g (f (c, 0).1) d) (c, 0).2) < Complex.abs (↑d * g (f (c, 0).1) d (c, 0).2) TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/BottcherNear.lean
df_ne_zero
[683, 1]
[708, 50]
exact (s.s m).dp
case hfg f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z ga : AnalyticAt β„‚ (uncurry fun c z => g (f c) d z) (c, 0) ⊒ 0 < d
no goals
Please generate a tactic in lean4 to solve the state. STATE: case hfg f : β„‚ β†’ β„‚ β†’ β„‚ d : β„• u : Set β„‚ t : Set (β„‚ Γ— β„‚) s : SuperNearC f d u t c : β„‚ m : c ∈ u df : βˆ€ (e z : β„‚), (e, z) ∈ t β†’ deriv (f e) z = ↑d * z ^ (d - 1) * g (f e) d z + z ^ d * deriv (g (f e) d) z ga : AnalyticAt β„‚ (uncurry fun c z => g (f c) d z) (c, 0) ⊒ 0 < d TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
by_contra bad
c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) ⊒ InjOn (bottcher d) (multibrotExt d)
c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) bad : Β¬InjOn (bottcher d) (multibrotExt d) ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) ⊒ InjOn (bottcher d) (multibrotExt d) TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
simp only [InjOn, not_forall, ← ne_eq] at bad
c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) bad : Β¬InjOn (bottcher d) (multibrotExt d) ⊒ False
c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) bad : βˆƒ x, βˆƒ (_ : x ∈ multibrotExt d), βˆƒ x_1, βˆƒ (_ : x_1 ∈ multibrotExt d) (_ : bottcher d x = bottcher d x_1), x β‰  x_1 ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) bad : Β¬InjOn (bottcher d) (multibrotExt d) ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
rcases bad with ⟨x, xm, y, ym, bxy, xy⟩
c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) bad : βˆƒ x, βˆƒ (_ : x ∈ multibrotExt d), βˆƒ x_1, βˆƒ (_ : x_1 ∈ multibrotExt d) (_ : bottcher d x = bottcher d x_1), x β‰  x_1 ⊒ False
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) bad : βˆƒ x, βˆƒ (_ : x ∈ multibrotExt d), βˆƒ x_1, βˆƒ (_ : x_1 ∈ multibrotExt d) (_ : bottcher d x = bottcher d x_1), x β‰  x_1 ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
generalize hb : potential d x = b
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y ⊒ False
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
have b1 : b < 1 := by rwa [← hb, potential_lt_one]
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b ⊒ False
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b b1 : b < 1 ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
set u := {c | potential d c ≀ b}
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b b1 : b < 1 ⊒ False
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b b1 : b < 1 ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
set t0 := u Γ—Λ’ u
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} ⊒ False
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
set t1 := {q : π•Š Γ— π•Š | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0}
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u ⊒ False
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
set t2 := {q : π•Š Γ— π•Š | q.1 β‰  q.2 ∧ q ∈ t1}
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} ⊒ False
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
clear x xm y ym bxy xy hb
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ⊒ False
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
have ue : u βŠ† multibrotExt d := by intro c m; rw [← potential_lt_one]; exact lt_of_le_of_lt m b1
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ⊒ False
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
have t01 : t1 βŠ† t0 := inter_subset_right _ _
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d ⊒ False
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
have t12 : t2 βŠ† t1 := inter_subset_right _ _
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 ⊒ False
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
have uc : IsClosed u := isClosed_le potential_continuous continuous_const
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 ⊒ False
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
have t0c : IsClosed t0 := uc.prod uc
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u ⊒ False
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
have t12' : closure t2 βŠ† t1 := by rw [← t1c.closure_eq]; exact closure_mono t12
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 ⊒ False
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
have t2c' : IsCompact (closure t2) := isClosed_closure.isCompact
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 ⊒ False
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
have t2ne' : (closure t2).Nonempty := t2ne.closure
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) ⊒ False
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
have pc : Continuous fun q : π•Š Γ— π•Š ↦ potential d q.1 := potential_continuous.comp continuous_fst
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty ⊒ False
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
rcases t2c'.exists_isMinOn t2ne' pc.continuousOn with ⟨⟨x, y⟩, m2, min⟩
case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 ⊒ False
case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 min : IsMinOn (fun q => potential d q.1) (closure t2) (x, y) ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
simp only [isMinOn_iff] at min
case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 min : IsMinOn (fun q => potential d q.1) (closure t2) (x, y) ⊒ False
case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 min : βˆ€ x_1 ∈ closure t2, potential d x ≀ potential d x_1.1 ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 min : IsMinOn (fun q => potential d q.1) (closure t2) (x, y) ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
generalize xp : potential d x = p
case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 min : βˆ€ x_1 ∈ closure t2, potential d x ≀ potential d x_1.1 ⊒ False
case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 min : βˆ€ x_1 ∈ closure t2, potential d x ≀ potential d x_1.1 p : ℝ xp : potential d x = p ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 min : βˆ€ x_1 ∈ closure t2, potential d x ≀ potential d x_1.1 ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
rw [xp] at min
case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 min : βˆ€ x_1 ∈ closure t2, potential d x ≀ potential d x_1.1 p : ℝ xp : potential d x = p ⊒ False
case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 min : βˆ€ x_1 ∈ closure t2, potential d x ≀ potential d x_1.1 p : ℝ xp : potential d x = p ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
have m1 := t12' m2
case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p ⊒ False
case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
have pb : p ≀ b := by rw [← xp]; exact m1.2.1
case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 ⊒ False
case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 pb : p ≀ b ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
have xm : x ∈ multibrotExt d := ue m1.2.1
case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 pb : p ≀ b ⊒ False
case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 pb : p ≀ b ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
have ym : y ∈ multibrotExt d := ue m1.2.2
case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d ⊒ False
case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d ym : y ∈ multibrotExt d ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
have yp : potential d y = p := by rw [← abs_bottcher, ← m1.1, abs_bottcher, xp]
case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d ym : y ∈ multibrotExt d ⊒ False
case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d ym : y ∈ multibrotExt d yp : potential d y = p ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d ym : y ∈ multibrotExt d ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
have p0i : p = 0 β†’ x = ∞ ∧ y = ∞ := by intro p0; rw [p0, potential_eq_zero] at xp yp; use xp, yp
case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d ym : y ∈ multibrotExt d yp : potential d y = p ⊒ False
case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d ym : y ∈ multibrotExt d yp : potential d y = p p0i : p = 0 β†’ x = ∞ ∧ y = ∞ ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d ym : y ∈ multibrotExt d yp : potential d y = p ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
by_cases xy : x β‰  y
case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d ym : y ∈ multibrotExt d yp : potential d y = p p0i : p = 0 β†’ x = ∞ ∧ y = ∞ ⊒ False
case pos c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d ym : y ∈ multibrotExt d yp : potential d y = p p0i : p = 0 β†’ x = ∞ ∧ y = ∞ xy : x β‰  y ⊒ False case neg c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d ym : y ∈ multibrotExt d yp : potential d y = p p0i : p = 0 β†’ x = ∞ ∧ y = ∞ xy : Β¬x β‰  y ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case intro.intro.intro.intro.intro.intro.mk.intro c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d ym : y ∈ multibrotExt d yp : potential d y = p p0i : p = 0 β†’ x = ∞ ∧ y = ∞ ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
simp only [not_not] at xy
case neg c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d ym : y ∈ multibrotExt d yp : potential d y = p p0i : p = 0 β†’ x = ∞ ∧ y = ∞ xy : Β¬x β‰  y ⊒ False
case neg c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d ym : y ∈ multibrotExt d yp : potential d y = p p0i : p = 0 β†’ x = ∞ ∧ y = ∞ xy : x = y ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case neg c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d ym : y ∈ multibrotExt d yp : potential d y = p p0i : p = 0 β†’ x = ∞ ∧ y = ∞ xy : Β¬x β‰  y ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
rw [← xy] at m1 m2 p0i
case neg c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d ym : y ∈ multibrotExt d yp : potential d y = p p0i : p = 0 β†’ x = ∞ ∧ y = ∞ xy : x = y ⊒ False
case neg c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, x) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, x) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d ym : y ∈ multibrotExt d yp : potential d y = p p0i : p = 0 β†’ x = ∞ ∧ x = ∞ xy : x = y ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case neg c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, y) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, y) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d ym : y ∈ multibrotExt d yp : potential d y = p p0i : p = 0 β†’ x = ∞ ∧ y = ∞ xy : x = y ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
clear xy ym yp y
case neg c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, x) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, x) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d ym : y ∈ multibrotExt d yp : potential d y = p p0i : p = 0 β†’ x = ∞ ∧ x = ∞ xy : x = y ⊒ False
case neg c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x : π•Š m2 : (x, x) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, x) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d p0i : p = 0 β†’ x = ∞ ∧ x = ∞ ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case neg c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x y : π•Š m2 : (x, x) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, x) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d ym : y ∈ multibrotExt d yp : potential d y = p p0i : p = 0 β†’ x = ∞ ∧ x = ∞ xy : x = y ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
have db : mfderiv I I (bottcher d) x = 0 := by contrapose m2; simp only [mem_closure_iff_frequently, Filter.not_frequently] refine ((bottcherHolomorphic d _ xm).local_inj m2).mp (eventually_of_forall ?_) intro ⟨x, y⟩ inj ⟨xy, e, _⟩; simp only at xy e inj; exact xy (inj e)
case neg c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x : π•Š m2 : (x, x) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, x) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d p0i : p = 0 β†’ x = ∞ ∧ x = ∞ ⊒ False
case neg c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x : π•Š m2 : (x, x) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, x) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d p0i : p = 0 β†’ x = ∞ ∧ x = ∞ db : mfderiv I I (bottcher d) x = 0 ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case neg c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x : π•Š m2 : (x, x) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, x) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d p0i : p = 0 β†’ x = ∞ ∧ x = ∞ ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
by_cases p0 : p β‰  0
case neg c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x : π•Š m2 : (x, x) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, x) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d p0i : p = 0 β†’ x = ∞ ∧ x = ∞ db : mfderiv I I (bottcher d) x = 0 ⊒ False
case pos c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x : π•Š m2 : (x, x) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, x) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d p0i : p = 0 β†’ x = ∞ ∧ x = ∞ db : mfderiv I I (bottcher d) x = 0 p0 : p β‰  0 ⊒ False case neg c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x : π•Š m2 : (x, x) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, x) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d p0i : p = 0 β†’ x = ∞ ∧ x = ∞ db : mfderiv I I (bottcher d) x = 0 p0 : Β¬p β‰  0 ⊒ False
Please generate a tactic in lean4 to solve the state. STATE: case neg c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) b : ℝ b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} t2ne : t2.Nonempty ue : u βŠ† multibrotExt d t01 : t1 βŠ† t0 t12 : t2 βŠ† t1 uc : IsClosed u t0c : IsClosed t0 t1c : IsClosed t1 t12' : closure t2 βŠ† t1 t2c' : IsCompact (closure t2) t2ne' : (closure t2).Nonempty pc : Continuous fun q => potential d q.1 x : π•Š m2 : (x, x) ∈ closure t2 p : ℝ min : βˆ€ x ∈ closure t2, p ≀ potential d x.1 xp : potential d x = p m1 : (x, x) ∈ t1 pb : p ≀ b xm : x ∈ multibrotExt d p0i : p = 0 β†’ x = ∞ ∧ x = ∞ db : mfderiv I I (bottcher d) x = 0 ⊒ False TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
rwa [← hb, potential_lt_one]
c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b ⊒ b < 1
no goals
Please generate a tactic in lean4 to solve the state. STATE: c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b ⊒ b < 1 TACTIC:
https://github.com/girving/ray.git
0be790285dd0fce78913b0cb9bddaffa94bd25f9
Ray/Dynamics/Multibrot/Isomorphism.lean
bottcher_inj
[51, 1]
[142, 42]
refine ⟨⟨x, y⟩, xy, bxy, ?_, ?_⟩
c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} ⊒ t2.Nonempty
case refine_1 c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} ⊒ (x, y).1 ∈ u case refine_2 c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} ⊒ (x, y).2 ∈ u
Please generate a tactic in lean4 to solve the state. STATE: c : β„‚ d : β„• inst✝ : Fact (2 ≀ d) x : π•Š xm : x ∈ multibrotExt d y : π•Š ym : y ∈ multibrotExt d bxy : bottcher d x = bottcher d y xy : x β‰  y b : ℝ hb : potential d x = b b1 : b < 1 u : Set π•Š := {c | potential d c ≀ b} t0 : Set (π•Š Γ— π•Š) := u Γ—Λ’ u t1 : Set (π•Š Γ— π•Š) := {q | bottcher d q.1 = bottcher d q.2 ∧ q ∈ t0} t2 : Set (π•Š Γ— π•Š) := {q | q.1 β‰  q.2 ∧ q ∈ t1} ⊒ t2.Nonempty TACTIC: