-- File: optlib/Optlib/Algorithm/GD/GradientDescent.lean
Theorem statement:
theorem extracted_formal_statement_38.{u_1} {E : Type u_1} [inst : NormedAddCommGroup E] [inst_1 : InnerProductSpace ℝ E]
  [inst_2 : CompleteSpace E] {f : E → ℝ} {f' : E → E} {xm x₀ : E} {alg : Gradient_Descent_fix_stepsize f f' x₀}
  (hfun : ConvexOn ℝ univ f)
  (step₂_1 : Gradient_Descent_fix_stepsize.a f f' x₀ ≤ 1 / ↑(Gradient_Descent_fix_stepsize.l f f' x₀))
  (step₂ : ↑(Gradient_Descent_fix_stepsize.l f f' x₀) ≤ 1 / Gradient_Descent_fix_stepsize.a f f' x₀)
  (this_1 : LipschitzWith (Gradient_Descent_fix_stepsize.l f f' x₀) f')
  (this : Gradient_Descent_fix_stepsize.l f f' x₀ > 0) (x : E)
  (t1 : 1 / (2 * Gradient_Descent_fix_stepsize.a f f' x₀) * (2 * Gradient_Descent_fix_stepsize.a f f' x₀) = 1)
  (t2₁ :
    ‖x - Gradient_Descent_fix_stepsize.a f f' x₀ • f' x - xm‖ ^ 2 =
      ‖x - xm‖ ^ 2 - 2 * Gradient_Descent_fix_stepsize.a f f' x₀ * ⟪f' x, x - xm⟫_ℝ +
        ‖Gradient_Descent_fix_stepsize.a f f' x₀ • f' x‖ ^ 2) :
  Gradient_Descent_fix_stepsize.a f f' x₀ ^ 2 * (Gradient_Descent_fix_stepsize.a f f' x₀)⁻¹ =
    Gradient_Descent_fix_stepsize.a f f' x₀ := sorry

Tactic state before:
case h
E : Type u_1
inst✝² : NormedAddCommGroup E
inst✝¹ : InnerProductSpace ℝ E
inst✝ : CompleteSpace E
f : E → ℝ
f' : E → E
xm x₀ : E
alg : Gradient_Descent_fix_stepsize f f' x₀
hfun : ConvexOn ℝ univ f
step₂✝ : Gradient_Descent_fix_stepsize.a f f' x₀ ≤ 1 / ↑(Gradient_Descent_fix_stepsize.l f f' x₀)
step₂ : ↑(Gradient_Descent_fix_stepsize.l f f' x₀) ≤ 1 / Gradient_Descent_fix_stepsize.a f f' x₀
k : ℕ
this✝ : LipschitzWith (Gradient_Descent_fix_stepsize.l f f' x₀) f'
this : Gradient_Descent_fix_stepsize.l f f' x₀ > 0
x : E
t1 : 1 / (2 * Gradient_Descent_fix_stepsize.a f f' x₀) * (2 * Gradient_Descent_fix_stepsize.a f f' x₀) = 1
t2₁ :
  ‖x - Gradient_Descent_fix_stepsize.a f f' x₀ • f' x - xm‖ ^ 2 =
    ‖x - xm‖ ^ 2 - 2 * Gradient_Descent_fix_stepsize.a f f' x₀ * ⟪f' x, x - xm⟫_ℝ +
      ‖Gradient_Descent_fix_stepsize.a f f' x₀ • f' x‖ ^ 2
⊢ Gradient_Descent_fix_stepsize.a f f' x₀ ^ 2 * (Gradient_Descent_fix_stepsize.a f f' x₀)⁻¹ =
    Gradient_Descent_fix_stepsize.a f f' x₀

Tactic: rw [pow_two, mul_self_mul_inv alg.a]

Tactic state after:

Premises used:
pow_two : ∀ {M : Type u_2} [inst : Monoid M] (a : M), a ^ 2 = a * a
mul_self_mul_inv : ∀ {G₀ : Type u_2} [inst : GroupWithZero G₀] (a : G₀), a * a * a⁻¹ = a