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/Multibrot/Iterates.lean | iter_error_le_of_z4 | [381, 1] | [416, 81] | calc (1 - (t33 - 1)⁻¹) * t11
_ ≥ (1 - (140 - 1)⁻¹) * 35 := by bound
_ ≥ 34.748 := by norm_num | c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
b2 : 3 ≤ t2
t2p : 0 ≤ t2
b6 : 12 ≤ t2 * 4
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
b11 : 35 ≤ t11
t33 : ℝ
hb33 : t11 * 4 = t33
b33 : 140 ≤ t33
h : 1 ≤ t33 - 1
⊢ 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
b2 : 3 ≤ t2
t2p : 0 ≤ t2
b6 : 12 ≤ t2 * 4
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
b11 : 35 ≤ t11
t33 : ℝ
hb33 : t11 * 4 = t33
b33 : 140 ≤ t33
h : 1 ≤ t33 - 1
⊢ 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_error_le_of_z4 | [381, 1] | [416, 81] | linarith | c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
b2 : 3 ≤ t2
t2p : 0 ≤ t2
b6 : 12 ≤ t2 * 4
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
b11 : 35 ≤ t11
t33 : ℝ
hb33 : t11 * 4 = t33
b33 : 140 ≤ t33
⊢ 1 ≤ t33 - 1 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
b2 : 3 ≤ t2
t2p : 0 ≤ t2
b6 : 12 ≤ t2 * 4
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
b11 : 35 ≤ t11
t33 : ℝ
hb33 : t11 * 4 = t33
b33 : 140 ≤ t33
⊢ 1 ≤ t33 - 1
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_error_le_of_z4 | [381, 1] | [416, 81] | bound | c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
b2 : 3 ≤ t2
t2p : 0 ≤ t2
b6 : 12 ≤ t2 * 4
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
b11 : 35 ≤ t11
t33 : ℝ
hb33 : t11 * 4 = t33
b33 : 140 ≤ t33
h : 1 ≤ t33 - 1
⊢ (1 - (t33 - 1)⁻¹) * t11 ≥ (1 - (140 - 1)⁻¹) * 35 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
b2 : 3 ≤ t2
t2p : 0 ≤ t2
b6 : 12 ≤ t2 * 4
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
b11 : 35 ≤ t11
t33 : ℝ
hb33 : t11 * 4 = t33
b33 : 140 ≤ t33
h : 1 ≤ t33 - 1
⊢ (1 - (t33 - 1)⁻¹) * t11 ≥ (1 - (140 - 1)⁻¹) * 35
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_error_le_of_z4 | [381, 1] | [416, 81] | norm_num | c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
b2 : 3 ≤ t2
t2p : 0 ≤ t2
b6 : 12 ≤ t2 * 4
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
b11 : 35 ≤ t11
t33 : ℝ
hb33 : t11 * 4 = t33
b33 : 140 ≤ t33
h : 1 ≤ t33 - 1
⊢ (1 - (140 - 1)⁻¹) * 35 ≥ 34.748 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
b2 : 3 ≤ t2
t2p : 0 ≤ t2
b6 : 12 ≤ t2 * 4
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
b11 : 35 ≤ t11
t33 : ℝ
hb33 : t11 * 4 = t33
b33 : 140 ≤ t33
h : 1 ≤ t33 - 1
⊢ (1 - (140 - 1)⁻¹) * 35 ≥ 34.748
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_error_le_of_z4 | [381, 1] | [416, 81] | norm_num | c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ 4 ^ (d - 1) - 1
b6 : 12 ≤ (4 ^ (d - 1) - 1) * 4
b11 : 35 ≤ (4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1
b33 : 140 ≤ ((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4
⊢ 3 ≤ 4 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ 4 ^ (d - 1) - 1
b6 : 12 ≤ (4 ^ (d - 1) - 1) * 4
b11 : 35 ≤ (4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1
b33 : 140 ≤ ((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4
⊢ 3 ≤ 4
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_error_le_of_z4 | [381, 1] | [416, 81] | norm_num | c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ 4 ^ (d - 1) - 1
b6 : 12 ≤ (4 ^ (d - 1) - 1) * 4
b11 : 35 ≤ (4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1
b33 : 140 ≤ ((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4
⊢ 0 ≤ 0.528 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ 4 ^ (d - 1) - 1
b6 : 12 ≤ (4 ^ (d - 1) - 1) * 4
b11 : 35 ≤ (4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1
b33 : 140 ≤ ((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4
⊢ 0 ≤ 0.528
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_error_le_of_z4 | [381, 1] | [416, 81] | norm_num | c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ 4 ^ (d - 1) - 1
b6 : 12 ≤ (4 ^ (d - 1) - 1) * 4
b11 : 35 ≤ (4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1
b33 : 140 ≤ ((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4
⊢ 0 ≤ 0.5023 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ 4 ^ (d - 1) - 1
b6 : 12 ≤ (4 ^ (d - 1) - 1) * 4
b11 : 35 ≤ (4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1
b33 : 140 ≤ ((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4
⊢ 0 ≤ 0.5023
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_error_le_of_z4 | [381, 1] | [416, 81] | norm_num | c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ 4 ^ (d - 1) - 1
b6 : 12 ≤ (4 ^ (d - 1) - 1) * 4
b11 : 35 ≤ (4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1
b33 : 140 ≤ ((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4
⊢ 11 ≤ 35 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ 4 ^ (d - 1) - 1
b6 : 12 ≤ (4 ^ (d - 1) - 1) * 4
b11 : 35 ≤ (4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1
b33 : 140 ≤ ((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4
⊢ 11 ≤ 35
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_error_le_of_z4 | [381, 1] | [416, 81] | norm_num | c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ 4 ^ (d - 1) - 1
b6 : 12 ≤ (4 ^ (d - 1) - 1) * 4
b11 : 35 ≤ (4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1
b33 : 140 ≤ ((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4
⊢ 3 ≤ 140 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ 4 ^ (d - 1) - 1
b6 : 12 ≤ (4 ^ (d - 1) - 1) * 4
b11 : 35 ≤ (4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1
b33 : 140 ≤ ((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4
⊢ 3 ≤ 140
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_error_le_of_z4 | [381, 1] | [416, 81] | positivity | c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ 4 ^ (d - 1) - 1
b6 : 12 ≤ (4 ^ (d - 1) - 1) * 4
b11 : 35 ≤ (4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1
b33 : 140 ≤ ((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4
⊢ 0 < 4 ^ (d - 1) - 1 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ 4 ^ (d - 1) - 1
b6 : 12 ≤ (4 ^ (d - 1) - 1) * 4
b11 : 35 ≤ (4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1
b33 : 140 ≤ ((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4
⊢ 0 < 4 ^ (d - 1) - 1
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_error_le_of_z4 | [381, 1] | [416, 81] | exact sub_pos.mpr (inv_lt_one (by linarith)) | case refine_1
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ 4 ^ (d - 1) - 1
b6 : 12 ≤ (4 ^ (d - 1) - 1) * 4
b11 : 35 ≤ (4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1
b33 : 140 ≤ ((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4
⊢ 0 < 1 - (((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4 - 1)⁻¹ | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case refine_1
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ 4 ^ (d - 1) - 1
b6 : 12 ≤ (4 ^ (d - 1) - 1) * 4
b11 : 35 ≤ (4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1
b33 : 140 ≤ ((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4
⊢ 0 < 1 - (((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4 - 1)⁻¹
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_error_le_of_z4 | [381, 1] | [416, 81] | linarith | c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ 4 ^ (d - 1) - 1
b6 : 12 ≤ (4 ^ (d - 1) - 1) * 4
b11 : 35 ≤ (4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1
b33 : 140 ≤ ((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4
⊢ 1 < ((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4 - 1 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ 4 ^ (d - 1) - 1
b6 : 12 ≤ (4 ^ (d - 1) - 1) * 4
b11 : 35 ≤ (4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1
b33 : 140 ≤ ((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4
⊢ 1 < ((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4 - 1
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_error_le_of_z4 | [381, 1] | [416, 81] | simp only [hb2, hb3, hb11, hb33] at b2 b3 b6 b11 b33 ⊢ | case refine_2
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ 4 ^ (d - 1) - 1
b6 : 12 ≤ (4 ^ (d - 1) - 1) * 4
b11 : 35 ≤ (4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1
b33 : 140 ≤ ((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4
⊢ 0.619 + 0.528 / (4 ^ (d - 1) - 1) +
0.5023 /
((1 - (((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4 - 1)⁻¹) * ((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1)) ≤
0.8095 | case refine_2
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ t2
b6 : 12 ≤ t2 * 4
b11 : 35 ≤ t11
b33 : 140 ≤ t33
⊢ 0.619 + 0.528 / t2 + 0.5023 / ((1 - (t33 - 1)⁻¹) * t11) ≤ 0.8095 | Please generate a tactic in lean4 to solve the state.
STATE:
case refine_2
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ 4 ^ (d - 1) - 1
b6 : 12 ≤ (4 ^ (d - 1) - 1) * 4
b11 : 35 ≤ (4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1
b33 : 140 ≤ ((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4
⊢ 0.619 + 0.528 / (4 ^ (d - 1) - 1) +
0.5023 /
((1 - (((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1) * 4 - 1)⁻¹) * ((4 ^ (d - 1) - 1) ^ d * 4 ^ (d - 1) - 1)) ≤
0.8095
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_error_le_of_z4 | [381, 1] | [416, 81] | exact le_trans (add_le_add (add_le_add_left
(div_le_div_of_nonneg_left (by norm_num) (by norm_num) b2) _)
(div_le_div_of_nonneg_left (by norm_num) (by norm_num) b10)) (by norm_num) | case refine_2
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ t2
b6 : 12 ≤ t2 * 4
b11 : 35 ≤ t11
b33 : 140 ≤ t33
⊢ 0.619 + 0.528 / t2 + 0.5023 / ((1 - (t33 - 1)⁻¹) * t11) ≤ 0.8095 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case refine_2
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ t2
b6 : 12 ≤ t2 * 4
b11 : 35 ≤ t11
b33 : 140 ≤ t33
⊢ 0.619 + 0.528 / t2 + 0.5023 / ((1 - (t33 - 1)⁻¹) * t11) ≤ 0.8095
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_error_le_of_z4 | [381, 1] | [416, 81] | norm_num | c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ t2
b6 : 12 ≤ t2 * 4
b11 : 35 ≤ t11
b33 : 140 ≤ t33
⊢ 0 ≤ 0.528 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ t2
b6 : 12 ≤ t2 * 4
b11 : 35 ≤ t11
b33 : 140 ≤ t33
⊢ 0 ≤ 0.528
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_error_le_of_z4 | [381, 1] | [416, 81] | norm_num | c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ t2
b6 : 12 ≤ t2 * 4
b11 : 35 ≤ t11
b33 : 140 ≤ t33
⊢ 0 < 3 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ t2
b6 : 12 ≤ t2 * 4
b11 : 35 ≤ t11
b33 : 140 ≤ t33
⊢ 0 < 3
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_error_le_of_z4 | [381, 1] | [416, 81] | norm_num | c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ t2
b6 : 12 ≤ t2 * 4
b11 : 35 ≤ t11
b33 : 140 ≤ t33
⊢ 0 ≤ 0.5023 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ t2
b6 : 12 ≤ t2 * 4
b11 : 35 ≤ t11
b33 : 140 ≤ t33
⊢ 0 ≤ 0.5023
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_error_le_of_z4 | [381, 1] | [416, 81] | norm_num | c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ t2
b6 : 12 ≤ t2 * 4
b11 : 35 ≤ t11
b33 : 140 ≤ t33
⊢ 0 < 34.748 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ t2
b6 : 12 ≤ t2 * 4
b11 : 35 ≤ t11
b33 : 140 ≤ t33
⊢ 0 < 34.748
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_error_le_of_z4 | [381, 1] | [416, 81] | norm_num | c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ t2
b6 : 12 ≤ t2 * 4
b11 : 35 ≤ t11
b33 : 140 ≤ t33
⊢ 0.619 + 0.528 / 3 + 0.5023 / 34.748 ≤ 0.8095 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z4 : 4 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
t3 : ℝ
hb3 : 4 ^ (d - 1) = t3
b3 : 4 ≤ t3
t2 : ℝ
hb2 : t3 - 1 = t2
t2p : 0 ≤ t2
t11 : ℝ
hb11 : t2 ^ d * t3 - 1 = t11
t33 : ℝ
hb33 : t11 * 4 = t33
b10 : 34.748 ≤ (1 - (t33 - 1)⁻¹) * t11
b2 : 3 ≤ t2
b6 : 12 ≤ t2 * 4
b11 : 35 ≤ t11
b33 : 140 ≤ t33
⊢ 0.619 + 0.528 / 3 + 0.5023 / 34.748 ≤ 0.8095
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | have dp : 0 < d := d_pos d | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | have d2 : 2 ≤ (d : ℝ) := two_le_cast_d d | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | have z1' : 1 < abs z := lt_of_lt_of_le (by norm_num) z3 | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | have z0' : 0 < abs z := by positivity | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | have iz1 : 1 / abs z < 1 := (div_lt_one z0').mpr z1' | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | have z0 : z ≠ 0 := Complex.abs.ne_zero_iff.mp (by positivity) | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | have cz_le : abs (c / z ^ d) ≤ 1 / abs z := by
have d1 : z^d = z^(d - 1 + 1) := by rw [Nat.sub_add_cancel (d_ge_one d)]
simp only [d1, map_div₀, Complex.abs.map_pow, pow_succ', Complex.abs.map_mul,
div_mul_eq_div_div]
bound | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | have l0s : 1 ≤ log (abs z) := by
rw [Real.le_log_iff_exp_le z0']; exact le_trans Real.exp_one_lt_3.le z3 | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | have l0 : 0 < log (abs z) := by positivity | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | have l1 : 0 < ↑d * log (abs z) := by positivity | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | have l1' : 1 < log (abs z) := by
rw [Real.lt_log_iff_exp_lt z0']; exact lt_of_lt_of_le Real.exp_one_lt_3 z3 | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | have l2 : |log (abs (1 + c / z ^ d))| ≤ -log (1 - 1 / abs z) := by
nth_rw 1 [← Complex.log_re]
apply le_trans (Complex.abs_re_le_abs _)
apply le_trans (Complex.abs_log_one_add_le (trans cz_le iz1))
exact Real.neg_log_one_sub_mono cz_le iz1 | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | have dl2 : 2 < d * log (abs z) := by
calc ↑d * log (abs z)
_ ≥ 2 * log (abs z) := by gcongr
_ > 2 * 1 := by gcongr
_ = 2 := by norm_num | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | have l3 : 0 < ↑d * log (abs z) + log (abs (1 + c / z ^ d)) := by
have i2 : 1/abs z ≤ 1/2 := one_div_le_one_div_of_le (by norm_num) (by linarith)
suffices h : -log (abs (1 + c / z ^ d)) < ↑d * log (abs z) by linarith
apply lt_of_le_of_lt (neg_le_neg_iff.mpr (abs_le.mp l2).1); simp only [neg_neg]
exact lt_of_le_of_lt (neg_log_one_sub_le_two i2) dl2 | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | rw [log_abs_add (z ^ d) c (pow_ne_zero _ z0) (f_ne_zero cz z3), Complex.abs.map_pow, Real.log_pow,
log_add _ _ l1 l3, Real.log_mul (Nat.cast_ne_zero.mpr (d_ne_zero d)) l0.ne'] | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
⊢ |(↑d).log + (Complex.abs z).log.log + (1 + (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log)).log -
(Complex.abs z).log.log -
(↑d).log| ≤
f_error d z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
⊢ |(Complex.abs (z ^ d + c)).log.log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | generalize hu : log (abs (1 + c / z ^ d)) / (d * log (abs z)) = u | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
⊢ |(↑d).log + (Complex.abs z).log.log + (1 + (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log)).log -
(Complex.abs z).log.log -
(↑d).log| ≤
f_error d z | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
⊢ |(↑d).log + (Complex.abs z).log.log + (1 + u).log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
⊢ |(↑d).log + (Complex.abs z).log.log + (1 + (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log)).log -
(Complex.abs z).log.log -
(↑d).log| ≤
f_error d z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | ring_nf | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
⊢ |(↑d).log + (Complex.abs z).log.log + (1 + u).log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
⊢ |(1 + u).log| ≤ f_error d z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
⊢ |(↑d).log + (Complex.abs z).log.log + (1 + u).log - (Complex.abs z).log.log - (↑d).log| ≤ f_error d z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | have inner : |u| ≤ -log (1 - 1/abs z) / (d * log (abs z)) := by
simp only [←hu, abs_div, abs_of_pos l1, div_le_iff l1]
apply le_trans l2; apply le_of_eq; field_simp | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
⊢ |(1 + u).log| ≤ f_error d z | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
⊢ |(1 + u).log| ≤ f_error d z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
⊢ |(1 + u).log| ≤ f_error d z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | have weak : -log (1 - 1/abs z) / (d * log (abs z)) < 1 := by
rw [div_lt_one l1]
refine lt_of_le_of_lt (neg_log_one_sub_le_two ?_) dl2
exact one_div_le_one_div_of_le (by norm_num) (by linarith) | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
⊢ |(1 + u).log| ≤ f_error d z | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
weak : -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log) < 1
⊢ |(1 + u).log| ≤ f_error d z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
⊢ |(1 + u).log| ≤ f_error d z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | apply le_trans (Real.abs_log_one_add_le (trans inner weak)) | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
weak : -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log) < 1
⊢ |(1 + u).log| ≤ f_error d z | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
weak : -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log) < 1
⊢ -(1 - |u|).log ≤ f_error d z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
weak : -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log) < 1
⊢ |(1 + u).log| ≤ f_error d z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | apply le_trans (Real.neg_log_one_sub_mono inner weak) | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
weak : -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log) < 1
⊢ -(1 - |u|).log ≤ f_error d z | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
weak : -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log) < 1
⊢ -(1 - -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)).log ≤ f_error d z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
weak : -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log) < 1
⊢ -(1 - |u|).log ≤ f_error d z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | rw [f_error] | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
weak : -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log) < 1
⊢ -(1 - -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)).log ≤ f_error d z | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
weak : -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log) < 1
⊢ -(1 - -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)).log ≤ f_error d z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | norm_num | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
⊢ 1 < 3 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
⊢ 1 < 3
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | positivity | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
⊢ 0 < Complex.abs z | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
⊢ 0 < Complex.abs z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | positivity | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
⊢ Complex.abs z ≠ 0 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
⊢ Complex.abs z ≠ 0
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | have d1 : z^d = z^(d - 1 + 1) := by rw [Nat.sub_add_cancel (d_ge_one d)] | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
⊢ Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
d1 : z ^ d = z ^ (d - 1 + 1)
⊢ Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
⊢ Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | simp only [d1, map_div₀, Complex.abs.map_pow, pow_succ', Complex.abs.map_mul,
div_mul_eq_div_div] | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
d1 : z ^ d = z ^ (d - 1 + 1)
⊢ Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
d1 : z ^ d = z ^ (d - 1 + 1)
⊢ Complex.abs c / Complex.abs z / Complex.abs z ^ (d - 1) ≤ 1 / Complex.abs z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
d1 : z ^ d = z ^ (d - 1 + 1)
⊢ Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | bound | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
d1 : z ^ d = z ^ (d - 1 + 1)
⊢ Complex.abs c / Complex.abs z / Complex.abs z ^ (d - 1) ≤ 1 / Complex.abs z | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
d1 : z ^ d = z ^ (d - 1 + 1)
⊢ Complex.abs c / Complex.abs z / Complex.abs z ^ (d - 1) ≤ 1 / Complex.abs z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | rw [Nat.sub_add_cancel (d_ge_one d)] | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
⊢ z ^ d = z ^ (d - 1 + 1) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
⊢ z ^ d = z ^ (d - 1 + 1)
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | rw [Real.le_log_iff_exp_le z0'] | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
⊢ 1 ≤ (Complex.abs z).log | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
⊢ exp 1 ≤ Complex.abs z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
⊢ 1 ≤ (Complex.abs z).log
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | exact le_trans Real.exp_one_lt_3.le z3 | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
⊢ exp 1 ≤ Complex.abs z | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
⊢ exp 1 ≤ Complex.abs z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | positivity | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
⊢ 0 < (Complex.abs z).log | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
⊢ 0 < (Complex.abs z).log
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | positivity | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
⊢ 0 < ↑d * (Complex.abs z).log | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
⊢ 0 < ↑d * (Complex.abs z).log
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | rw [Real.lt_log_iff_exp_lt z0'] | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
⊢ 1 < (Complex.abs z).log | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
⊢ exp 1 < Complex.abs z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
⊢ 1 < (Complex.abs z).log
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | exact lt_of_lt_of_le Real.exp_one_lt_3 z3 | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
⊢ exp 1 < Complex.abs z | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
⊢ exp 1 < Complex.abs z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | nth_rw 1 [← Complex.log_re] | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
⊢ |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
⊢ |(1 + c / z ^ d).log.re| ≤ -(1 - 1 / Complex.abs z).log | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
⊢ |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | apply le_trans (Complex.abs_re_le_abs _) | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
⊢ |(1 + c / z ^ d).log.re| ≤ -(1 - 1 / Complex.abs z).log | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
⊢ Complex.abs (1 + c / z ^ d).log ≤ -(1 - 1 / Complex.abs z).log | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
⊢ |(1 + c / z ^ d).log.re| ≤ -(1 - 1 / Complex.abs z).log
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | apply le_trans (Complex.abs_log_one_add_le (trans cz_le iz1)) | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
⊢ Complex.abs (1 + c / z ^ d).log ≤ -(1 - 1 / Complex.abs z).log | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
⊢ -(1 - Complex.abs (c / z ^ d)).log ≤ -(1 - 1 / Complex.abs z).log | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
⊢ Complex.abs (1 + c / z ^ d).log ≤ -(1 - 1 / Complex.abs z).log
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | exact Real.neg_log_one_sub_mono cz_le iz1 | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
⊢ -(1 - Complex.abs (c / z ^ d)).log ≤ -(1 - 1 / Complex.abs z).log | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
⊢ -(1 - Complex.abs (c / z ^ d)).log ≤ -(1 - 1 / Complex.abs z).log
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | calc ↑d * log (abs z)
_ ≥ 2 * log (abs z) := by gcongr
_ > 2 * 1 := by gcongr
_ = 2 := by norm_num | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
⊢ 2 < ↑d * (Complex.abs z).log | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
⊢ 2 < ↑d * (Complex.abs z).log
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | gcongr | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
⊢ ↑d * (Complex.abs z).log ≥ 2 * (Complex.abs z).log | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
⊢ ↑d * (Complex.abs z).log ≥ 2 * (Complex.abs z).log
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | gcongr | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
⊢ 2 * (Complex.abs z).log > 2 * 1 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
⊢ 2 * (Complex.abs z).log > 2 * 1
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | norm_num | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
⊢ 2 * 1 = 2 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
⊢ 2 * 1 = 2
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | have i2 : 1/abs z ≤ 1/2 := one_div_le_one_div_of_le (by norm_num) (by linarith) | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
⊢ 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
i2 : 1 / Complex.abs z ≤ 1 / 2
⊢ 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
⊢ 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | suffices h : -log (abs (1 + c / z ^ d)) < ↑d * log (abs z) by linarith | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
i2 : 1 / Complex.abs z ≤ 1 / 2
⊢ 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
i2 : 1 / Complex.abs z ≤ 1 / 2
⊢ -(Complex.abs (1 + c / z ^ d)).log < ↑d * (Complex.abs z).log | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
i2 : 1 / Complex.abs z ≤ 1 / 2
⊢ 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | apply lt_of_le_of_lt (neg_le_neg_iff.mpr (abs_le.mp l2).1) | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
i2 : 1 / Complex.abs z ≤ 1 / 2
⊢ -(Complex.abs (1 + c / z ^ d)).log < ↑d * (Complex.abs z).log | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
i2 : 1 / Complex.abs z ≤ 1 / 2
⊢ - - -(1 - 1 / Complex.abs z).log < ↑d * (Complex.abs z).log | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
i2 : 1 / Complex.abs z ≤ 1 / 2
⊢ -(Complex.abs (1 + c / z ^ d)).log < ↑d * (Complex.abs z).log
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | simp only [neg_neg] | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
i2 : 1 / Complex.abs z ≤ 1 / 2
⊢ - - -(1 - 1 / Complex.abs z).log < ↑d * (Complex.abs z).log | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
i2 : 1 / Complex.abs z ≤ 1 / 2
⊢ -(1 - 1 / Complex.abs z).log < ↑d * (Complex.abs z).log | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
i2 : 1 / Complex.abs z ≤ 1 / 2
⊢ - - -(1 - 1 / Complex.abs z).log < ↑d * (Complex.abs z).log
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | exact lt_of_le_of_lt (neg_log_one_sub_le_two i2) dl2 | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
i2 : 1 / Complex.abs z ≤ 1 / 2
⊢ -(1 - 1 / Complex.abs z).log < ↑d * (Complex.abs z).log | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
i2 : 1 / Complex.abs z ≤ 1 / 2
⊢ -(1 - 1 / Complex.abs z).log < ↑d * (Complex.abs z).log
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | norm_num | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
⊢ 0 < 2 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
⊢ 0 < 2
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | linarith | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
⊢ 2 ≤ Complex.abs z | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
⊢ 2 ≤ Complex.abs z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | linarith | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
i2 : 1 / Complex.abs z ≤ 1 / 2
h : -(Complex.abs (1 + c / z ^ d)).log < ↑d * (Complex.abs z).log
⊢ 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
i2 : 1 / Complex.abs z ≤ 1 / 2
h : -(Complex.abs (1 + c / z ^ d)).log < ↑d * (Complex.abs z).log
⊢ 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | simp only [←hu, abs_div, abs_of_pos l1, div_le_iff l1] | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
⊢ |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log) | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
⊢ |(Complex.abs (1 + c / z ^ d)).log| ≤
-(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log) * (↑d * (Complex.abs z).log) | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
⊢ |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | apply le_trans l2 | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
⊢ |(Complex.abs (1 + c / z ^ d)).log| ≤
-(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log) * (↑d * (Complex.abs z).log) | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
⊢ -(1 - 1 / Complex.abs z).log ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log) * (↑d * (Complex.abs z).log) | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
⊢ |(Complex.abs (1 + c / z ^ d)).log| ≤
-(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log) * (↑d * (Complex.abs z).log)
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | apply le_of_eq | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
⊢ -(1 - 1 / Complex.abs z).log ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log) * (↑d * (Complex.abs z).log) | case a
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
⊢ -(1 - 1 / Complex.abs z).log = -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log) * (↑d * (Complex.abs z).log) | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
⊢ -(1 - 1 / Complex.abs z).log ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log) * (↑d * (Complex.abs z).log)
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | field_simp | case a
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
⊢ -(1 - 1 / Complex.abs z).log = -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log) * (↑d * (Complex.abs z).log) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case a
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
⊢ -(1 - 1 / Complex.abs z).log = -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log) * (↑d * (Complex.abs z).log)
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | rw [div_lt_one l1] | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
⊢ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log) < 1 | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
⊢ -(1 - 1 / Complex.abs z).log < ↑d * (Complex.abs z).log | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
⊢ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log) < 1
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | refine lt_of_le_of_lt (neg_log_one_sub_le_two ?_) dl2 | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
⊢ -(1 - 1 / Complex.abs z).log < ↑d * (Complex.abs z).log | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
⊢ 1 / Complex.abs z ≤ 1 / 2 | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
⊢ -(1 - 1 / Complex.abs z).log < ↑d * (Complex.abs z).log
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | exact one_div_le_one_div_of_le (by norm_num) (by linarith) | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
⊢ 1 / Complex.abs z ≤ 1 / 2 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
⊢ 1 / Complex.abs z ≤ 1 / 2
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | norm_num | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
⊢ 0 < 2 | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
⊢ 0 < 2
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | f_approx | [423, 1] | [470, 15] | linarith | c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
⊢ 2 ≤ Complex.abs z | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
dp : 0 < d
d2 : 2 ≤ ↑d
z1' : 1 < Complex.abs z
z0' : 0 < Complex.abs z
iz1 : 1 / Complex.abs z < 1
z0 : z ≠ 0
cz_le : Complex.abs (c / z ^ d) ≤ 1 / Complex.abs z
l0s : 1 ≤ (Complex.abs z).log
l0 : 0 < (Complex.abs z).log
l1 : 0 < ↑d * (Complex.abs z).log
l1' : 1 < (Complex.abs z).log
l2 : |(Complex.abs (1 + c / z ^ d)).log| ≤ -(1 - 1 / Complex.abs z).log
dl2 : 2 < ↑d * (Complex.abs z).log
l3 : 0 < ↑d * (Complex.abs z).log + (Complex.abs (1 + c / z ^ d)).log
u : ℝ
hu : (Complex.abs (1 + c / z ^ d)).log / (↑d * (Complex.abs z).log) = u
inner : |u| ≤ -(1 - 1 / Complex.abs z).log / (↑d * (Complex.abs z).log)
⊢ 2 ≤ Complex.abs z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_approx | [473, 1] | [487, 45] | induction' n with n h generalizing z | c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
n : ℕ
⊢ |(Complex.abs ((f' d c)^[n] z)).log.log - (Complex.abs z).log.log - ↑n * (↑d).log| ≤ iter_error d c z | case zero
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
⊢ |(Complex.abs ((f' d c)^[0] z)).log.log - (Complex.abs z).log.log - ↑0 * (↑d).log| ≤ iter_error d c z
case succ
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c : ℂ
n : ℕ
h :
∀ {z : ℂ},
3 ≤ Complex.abs z →
Complex.abs c ≤ Complex.abs z →
|(Complex.abs ((f' d c)^[n] z)).log.log - (Complex.abs z).log.log - ↑n * (↑d).log| ≤ iter_error d c z
z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
⊢ |(Complex.abs ((f' d c)^[n + 1] z)).log.log - (Complex.abs z).log.log - ↑(n + 1) * (↑d).log| ≤ iter_error d c z | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
n : ℕ
⊢ |(Complex.abs ((f' d c)^[n] z)).log.log - (Complex.abs z).log.log - ↑n * (↑d).log| ≤ iter_error d c z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_approx | [473, 1] | [487, 45] | simp only [Nat.zero_eq, Function.iterate_zero, id_eq, sub_self, CharP.cast_eq_zero, zero_mul,
abs_zero, iter_error_nonneg d z3 cz] | case zero
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
⊢ |(Complex.abs ((f' d c)^[0] z)).log.log - (Complex.abs z).log.log - ↑0 * (↑d).log| ≤ iter_error d c z | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case zero
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
⊢ |(Complex.abs ((f' d c)^[0] z)).log.log - (Complex.abs z).log.log - ↑0 * (↑d).log| ≤ iter_error d c z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_approx | [473, 1] | [487, 45] | simp only [Finset.sum_range_succ, Function.iterate_succ_apply, Nat.succ_eq_add_one,
Nat.cast_add_one] | case succ
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c : ℂ
n : ℕ
h :
∀ {z : ℂ},
3 ≤ Complex.abs z →
Complex.abs c ≤ Complex.abs z →
|(Complex.abs ((f' d c)^[n] z)).log.log - (Complex.abs z).log.log - ↑n * (↑d).log| ≤ iter_error d c z
z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
⊢ |(Complex.abs ((f' d c)^[n + 1] z)).log.log - (Complex.abs z).log.log - ↑(n + 1) * (↑d).log| ≤ iter_error d c z | case succ
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c : ℂ
n : ℕ
h :
∀ {z : ℂ},
3 ≤ Complex.abs z →
Complex.abs c ≤ Complex.abs z →
|(Complex.abs ((f' d c)^[n] z)).log.log - (Complex.abs z).log.log - ↑n * (↑d).log| ≤ iter_error d c z
z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
⊢ |(Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs z).log.log - (↑n + 1) * (↑d).log| ≤ iter_error d c z | Please generate a tactic in lean4 to solve the state.
STATE:
case succ
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c : ℂ
n : ℕ
h :
∀ {z : ℂ},
3 ≤ Complex.abs z →
Complex.abs c ≤ Complex.abs z →
|(Complex.abs ((f' d c)^[n] z)).log.log - (Complex.abs z).log.log - ↑n * (↑d).log| ≤ iter_error d c z
z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
⊢ |(Complex.abs ((f' d c)^[n + 1] z)).log.log - (Complex.abs z).log.log - ↑(n + 1) * (↑d).log| ≤ iter_error d c z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_approx | [473, 1] | [487, 45] | have e : log (log (abs ((f' d c)^[n] (f' d c z)))) - log (log (abs z)) - (n+1) * log d =
(log (log (abs (f' d c z))) - log (log (abs z)) - log d) +
(log (log (abs ((f' d c)^[n] (f' d c z)))) - log (log (abs (f' d c z))) - n * log d) := by
ring | case succ
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c : ℂ
n : ℕ
h :
∀ {z : ℂ},
3 ≤ Complex.abs z →
Complex.abs c ≤ Complex.abs z →
|(Complex.abs ((f' d c)^[n] z)).log.log - (Complex.abs z).log.log - ↑n * (↑d).log| ≤ iter_error d c z
z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
⊢ |(Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs z).log.log - (↑n + 1) * (↑d).log| ≤ iter_error d c z | case succ
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c : ℂ
n : ℕ
h :
∀ {z : ℂ},
3 ≤ Complex.abs z →
Complex.abs c ≤ Complex.abs z →
|(Complex.abs ((f' d c)^[n] z)).log.log - (Complex.abs z).log.log - ↑n * (↑d).log| ≤ iter_error d c z
z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
e :
(Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs z).log.log - (↑n + 1) * (↑d).log =
(Complex.abs (f' d c z)).log.log - (Complex.abs z).log.log - (↑d).log +
((Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs (f' d c z)).log.log - ↑n * (↑d).log)
⊢ |(Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs z).log.log - (↑n + 1) * (↑d).log| ≤ iter_error d c z | Please generate a tactic in lean4 to solve the state.
STATE:
case succ
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c : ℂ
n : ℕ
h :
∀ {z : ℂ},
3 ≤ Complex.abs z →
Complex.abs c ≤ Complex.abs z →
|(Complex.abs ((f' d c)^[n] z)).log.log - (Complex.abs z).log.log - ↑n * (↑d).log| ≤ iter_error d c z
z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
⊢ |(Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs z).log.log - (↑n + 1) * (↑d).log| ≤ iter_error d c z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_approx | [473, 1] | [487, 45] | rw [e, iter_error_peel z3 cz] | case succ
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c : ℂ
n : ℕ
h :
∀ {z : ℂ},
3 ≤ Complex.abs z →
Complex.abs c ≤ Complex.abs z →
|(Complex.abs ((f' d c)^[n] z)).log.log - (Complex.abs z).log.log - ↑n * (↑d).log| ≤ iter_error d c z
z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
e :
(Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs z).log.log - (↑n + 1) * (↑d).log =
(Complex.abs (f' d c z)).log.log - (Complex.abs z).log.log - (↑d).log +
((Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs (f' d c z)).log.log - ↑n * (↑d).log)
⊢ |(Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs z).log.log - (↑n + 1) * (↑d).log| ≤ iter_error d c z | case succ
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c : ℂ
n : ℕ
h :
∀ {z : ℂ},
3 ≤ Complex.abs z →
Complex.abs c ≤ Complex.abs z →
|(Complex.abs ((f' d c)^[n] z)).log.log - (Complex.abs z).log.log - ↑n * (↑d).log| ≤ iter_error d c z
z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
e :
(Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs z).log.log - (↑n + 1) * (↑d).log =
(Complex.abs (f' d c z)).log.log - (Complex.abs z).log.log - (↑d).log +
((Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs (f' d c z)).log.log - ↑n * (↑d).log)
⊢ |(Complex.abs (f' d c z)).log.log - (Complex.abs z).log.log - (↑d).log +
((Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs (f' d c z)).log.log - ↑n * (↑d).log)| ≤
f_error d z + iter_error d c (f' d c z) | Please generate a tactic in lean4 to solve the state.
STATE:
case succ
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c : ℂ
n : ℕ
h :
∀ {z : ℂ},
3 ≤ Complex.abs z →
Complex.abs c ≤ Complex.abs z →
|(Complex.abs ((f' d c)^[n] z)).log.log - (Complex.abs z).log.log - ↑n * (↑d).log| ≤ iter_error d c z
z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
e :
(Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs z).log.log - (↑n + 1) * (↑d).log =
(Complex.abs (f' d c z)).log.log - (Complex.abs z).log.log - (↑d).log +
((Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs (f' d c z)).log.log - ↑n * (↑d).log)
⊢ |(Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs z).log.log - (↑n + 1) * (↑d).log| ≤ iter_error d c z
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_approx | [473, 1] | [487, 45] | have le : abs z ≤ abs (f' d c z) := le_self_iter d z3 cz 1 | case succ
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c : ℂ
n : ℕ
h :
∀ {z : ℂ},
3 ≤ Complex.abs z →
Complex.abs c ≤ Complex.abs z →
|(Complex.abs ((f' d c)^[n] z)).log.log - (Complex.abs z).log.log - ↑n * (↑d).log| ≤ iter_error d c z
z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
e :
(Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs z).log.log - (↑n + 1) * (↑d).log =
(Complex.abs (f' d c z)).log.log - (Complex.abs z).log.log - (↑d).log +
((Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs (f' d c z)).log.log - ↑n * (↑d).log)
⊢ |(Complex.abs (f' d c z)).log.log - (Complex.abs z).log.log - (↑d).log +
((Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs (f' d c z)).log.log - ↑n * (↑d).log)| ≤
f_error d z + iter_error d c (f' d c z) | case succ
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c : ℂ
n : ℕ
h :
∀ {z : ℂ},
3 ≤ Complex.abs z →
Complex.abs c ≤ Complex.abs z →
|(Complex.abs ((f' d c)^[n] z)).log.log - (Complex.abs z).log.log - ↑n * (↑d).log| ≤ iter_error d c z
z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
e :
(Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs z).log.log - (↑n + 1) * (↑d).log =
(Complex.abs (f' d c z)).log.log - (Complex.abs z).log.log - (↑d).log +
((Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs (f' d c z)).log.log - ↑n * (↑d).log)
le : Complex.abs z ≤ Complex.abs (f' d c z)
⊢ |(Complex.abs (f' d c z)).log.log - (Complex.abs z).log.log - (↑d).log +
((Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs (f' d c z)).log.log - ↑n * (↑d).log)| ≤
f_error d z + iter_error d c (f' d c z) | Please generate a tactic in lean4 to solve the state.
STATE:
case succ
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c : ℂ
n : ℕ
h :
∀ {z : ℂ},
3 ≤ Complex.abs z →
Complex.abs c ≤ Complex.abs z →
|(Complex.abs ((f' d c)^[n] z)).log.log - (Complex.abs z).log.log - ↑n * (↑d).log| ≤ iter_error d c z
z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
e :
(Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs z).log.log - (↑n + 1) * (↑d).log =
(Complex.abs (f' d c z)).log.log - (Complex.abs z).log.log - (↑d).log +
((Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs (f' d c z)).log.log - ↑n * (↑d).log)
⊢ |(Complex.abs (f' d c z)).log.log - (Complex.abs z).log.log - (↑d).log +
((Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs (f' d c z)).log.log - ↑n * (↑d).log)| ≤
f_error d z + iter_error d c (f' d c z)
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_approx | [473, 1] | [487, 45] | exact le_trans (abs_add _ _) (add_le_add (f_approx z3 cz)
(h (le_trans z3 le) (le_trans cz le))) | case succ
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c : ℂ
n : ℕ
h :
∀ {z : ℂ},
3 ≤ Complex.abs z →
Complex.abs c ≤ Complex.abs z →
|(Complex.abs ((f' d c)^[n] z)).log.log - (Complex.abs z).log.log - ↑n * (↑d).log| ≤ iter_error d c z
z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
e :
(Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs z).log.log - (↑n + 1) * (↑d).log =
(Complex.abs (f' d c z)).log.log - (Complex.abs z).log.log - (↑d).log +
((Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs (f' d c z)).log.log - ↑n * (↑d).log)
le : Complex.abs z ≤ Complex.abs (f' d c z)
⊢ |(Complex.abs (f' d c z)).log.log - (Complex.abs z).log.log - (↑d).log +
((Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs (f' d c z)).log.log - ↑n * (↑d).log)| ≤
f_error d z + iter_error d c (f' d c z) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case succ
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c : ℂ
n : ℕ
h :
∀ {z : ℂ},
3 ≤ Complex.abs z →
Complex.abs c ≤ Complex.abs z →
|(Complex.abs ((f' d c)^[n] z)).log.log - (Complex.abs z).log.log - ↑n * (↑d).log| ≤ iter_error d c z
z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
e :
(Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs z).log.log - (↑n + 1) * (↑d).log =
(Complex.abs (f' d c z)).log.log - (Complex.abs z).log.log - (↑d).log +
((Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs (f' d c z)).log.log - ↑n * (↑d).log)
le : Complex.abs z ≤ Complex.abs (f' d c z)
⊢ |(Complex.abs (f' d c z)).log.log - (Complex.abs z).log.log - (↑d).log +
((Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs (f' d c z)).log.log - ↑n * (↑d).log)| ≤
f_error d z + iter_error d c (f' d c z)
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Dynamics/Multibrot/Iterates.lean | iter_approx | [473, 1] | [487, 45] | ring | c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c : ℂ
n : ℕ
h :
∀ {z : ℂ},
3 ≤ Complex.abs z →
Complex.abs c ≤ Complex.abs z →
|(Complex.abs ((f' d c)^[n] z)).log.log - (Complex.abs z).log.log - ↑n * (↑d).log| ≤ iter_error d c z
z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
⊢ (Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs z).log.log - (↑n + 1) * (↑d).log =
(Complex.abs (f' d c z)).log.log - (Complex.abs z).log.log - (↑d).log +
((Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs (f' d c z)).log.log - ↑n * (↑d).log) | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
c✝ : ℂ
d✝ : ℕ
inst✝¹ : Fact (2 ≤ d✝)
d : ℕ
inst✝ : Fact (2 ≤ d)
c : ℂ
n : ℕ
h :
∀ {z : ℂ},
3 ≤ Complex.abs z →
Complex.abs c ≤ Complex.abs z →
|(Complex.abs ((f' d c)^[n] z)).log.log - (Complex.abs z).log.log - ↑n * (↑d).log| ≤ iter_error d c z
z : ℂ
z3 : 3 ≤ Complex.abs z
cz : Complex.abs c ≤ Complex.abs z
⊢ (Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs z).log.log - (↑n + 1) * (↑d).log =
(Complex.abs (f' d c z)).log.log - (Complex.abs z).log.log - (↑d).log +
((Complex.abs ((f' d c)^[n] (f' d c z))).log.log - (Complex.abs (f' d c z)).log.log - ↑n * (↑d).log)
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Hartogs/MaxLog.lean | max_exp_pos | [26, 1] | [27, 8] | bound | E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x : ℝ
⊢ 0 < max b.exp x | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x : ℝ
⊢ 0 < max b.exp x
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Hartogs/MaxLog.lean | le_maxLog | [29, 1] | [30, 57] | rw [maxLog, Real.le_log_iff_exp_le max_exp_pos] | E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x : ℝ
⊢ b ≤ maxLog b x | E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x : ℝ
⊢ b.exp ≤ max b.exp x | Please generate a tactic in lean4 to solve the state.
STATE:
E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x : ℝ
⊢ b ≤ maxLog b x
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Hartogs/MaxLog.lean | le_maxLog | [29, 1] | [30, 57] | bound | E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x : ℝ
⊢ b.exp ≤ max b.exp x | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x : ℝ
⊢ b.exp ≤ max b.exp x
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Hartogs/MaxLog.lean | maxLog_eq_b | [32, 1] | [32, 98] | simp [maxLog, max_eq_left h] | E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x : ℝ
h : x ≤ b.exp
⊢ maxLog b x = b | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x : ℝ
h : x ≤ b.exp
⊢ maxLog b x = b
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Hartogs/MaxLog.lean | maxLog_eq_log | [34, 1] | [35, 32] | simp [maxLog, max_eq_right h] | E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x : ℝ
h : b.exp ≤ x
⊢ maxLog b x = x.log | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x : ℝ
h : b.exp ≤ x
⊢ maxLog b x = x.log
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Hartogs/MaxLog.lean | maxLog_le | [37, 1] | [39, 41] | rw [maxLog, Real.log_le_iff_le_exp max_exp_pos] | E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x y : ℝ
yb : b ≤ y
xy : x ≤ y.exp
⊢ maxLog b x ≤ y | E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x y : ℝ
yb : b ≤ y
xy : x ≤ y.exp
⊢ max b.exp x ≤ y.exp | Please generate a tactic in lean4 to solve the state.
STATE:
E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x y : ℝ
yb : b ≤ y
xy : x ≤ y.exp
⊢ maxLog b x ≤ y
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Hartogs/MaxLog.lean | maxLog_le | [37, 1] | [39, 41] | apply max_le | E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x y : ℝ
yb : b ≤ y
xy : x ≤ y.exp
⊢ max b.exp x ≤ y.exp | case h₁
E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x y : ℝ
yb : b ≤ y
xy : x ≤ y.exp
⊢ b.exp ≤ y.exp
case h₂
E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x y : ℝ
yb : b ≤ y
xy : x ≤ y.exp
⊢ x ≤ y.exp | Please generate a tactic in lean4 to solve the state.
STATE:
E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x y : ℝ
yb : b ≤ y
xy : x ≤ y.exp
⊢ max b.exp x ≤ y.exp
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Hartogs/MaxLog.lean | maxLog_le | [37, 1] | [39, 41] | apply Real.exp_le_exp.mpr yb | case h₁
E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x y : ℝ
yb : b ≤ y
xy : x ≤ y.exp
⊢ b.exp ≤ y.exp
case h₂
E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x y : ℝ
yb : b ≤ y
xy : x ≤ y.exp
⊢ x ≤ y.exp | case h₂
E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x y : ℝ
yb : b ≤ y
xy : x ≤ y.exp
⊢ x ≤ y.exp | Please generate a tactic in lean4 to solve the state.
STATE:
case h₁
E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x y : ℝ
yb : b ≤ y
xy : x ≤ y.exp
⊢ b.exp ≤ y.exp
case h₂
E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x y : ℝ
yb : b ≤ y
xy : x ≤ y.exp
⊢ x ≤ y.exp
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Hartogs/MaxLog.lean | maxLog_le | [37, 1] | [39, 41] | exact xy | case h₂
E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x y : ℝ
yb : b ≤ y
xy : x ≤ y.exp
⊢ x ≤ y.exp | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
case h₂
E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x y : ℝ
yb : b ≤ y
xy : x ≤ y.exp
⊢ x ≤ y.exp
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Hartogs/MaxLog.lean | le_exp_maxLog | [41, 1] | [42, 47] | rw [maxLog, Real.exp_log max_exp_pos] | E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x : ℝ
⊢ x ≤ (maxLog b x).exp | E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x : ℝ
⊢ x ≤ max b.exp x | Please generate a tactic in lean4 to solve the state.
STATE:
E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x : ℝ
⊢ x ≤ (maxLog b x).exp
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Hartogs/MaxLog.lean | le_exp_maxLog | [41, 1] | [42, 47] | bound | E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x : ℝ
⊢ x ≤ max b.exp x | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x : ℝ
⊢ x ≤ max b.exp x
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Hartogs/MaxLog.lean | le_of_maxLog_le | [45, 1] | [46, 83] | rw [maxLog, Real.log_le_iff_le_exp max_exp_pos] at m | E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x y : ℝ
m : maxLog b x ≤ y
⊢ x ≤ y.exp | E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x y : ℝ
m : max b.exp x ≤ y.exp
⊢ x ≤ y.exp | Please generate a tactic in lean4 to solve the state.
STATE:
E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x y : ℝ
m : maxLog b x ≤ y
⊢ x ≤ y.exp
TACTIC:
|
https://github.com/girving/ray.git | 0be790285dd0fce78913b0cb9bddaffa94bd25f9 | Ray/Hartogs/MaxLog.lean | le_of_maxLog_le | [45, 1] | [46, 83] | exact le_of_max_le_right m | E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x y : ℝ
m : max b.exp x ≤ y.exp
⊢ x ≤ y.exp | no goals | Please generate a tactic in lean4 to solve the state.
STATE:
E : Type
inst✝¹ : NormedAddCommGroup E
inst✝ : NormedSpace ℂ E
b x y : ℝ
m : max b.exp x ≤ y.exp
⊢ x ≤ y.exp
TACTIC:
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.