theorem extracted_formal_statement_18.{u_1} {E : Type u_1} [inst : NormedAddCommGroup E] [inst_1 : InnerProductSpace ℝ E]
  [inst_2 : CompleteSpace E] {f h : E → ℝ} {f' : E → E} {x0 : E} [p : Nesterov_second_fix_stepsize f h f' x0] (n : ℕ+) :
  (1 + (↑↑n + 1) - 2) * (1 + (↑↑n + 1)) ^ 2 / ((1 + (↑↑n + 1)) * ↑(Nesterov_second_fix_stepsize.l f h f' x0) * 2 ^ 2) ≤
    (1 + ↑↑n) ^ 2 / (↑(Nesterov_second_fix_stepsize.l f h f' x0) * 2 ^ 2) := sorry

State before:
E : Type u_1
inst✝² : NormedAddCommGroup E
inst✝¹ : InnerProductSpace ℝ E
inst✝ : CompleteSpace E
f✝ h✝ : E → ℝ
f'✝ : E → E
x0✝ : E
f h : E → ℝ
f' : E → E
x0 : E
p : Nesterov_second_fix_stepsize f h f' x0
n : ℕ+
⊢ (1 + (↑↑n + 1) - 2) * (1 + (↑↑n + 1)) ^ 2 / ((1 + (↑↑n + 1)) * ↑(Nesterov_second_fix_stepsize.l f h f' x0) * 2 ^ 2) ≤
    (1 + ↑↑n) ^ 2 / (↑(Nesterov_second_fix_stepsize.l f h f' x0) * 2 ^ 2)

Tactic: rw [← div_div, ← div_div, ← div_div]
    repeat apply div_le_div_of_nonneg_right _ (by positivity)
    rw [pow_two, ← mul_assoc, mul_div_assoc, div_self, mul_one]
    ·
  calc
    _ = n ^ 2 + (2 : ℝ) * n := by ring_nf
    _ ≤ 1 + (2 : ℝ) * n + n ^ 2 := by linarith
    _ = (1 + n) ^ 2 := by rw [add_pow_two]; simp
    · linarith

State after:

Relevant lemmas:
error