-- File: optlib/Optlib/Algorithm/LASSO.lean
Theorem statement:
theorem extracted_formal_statement_42 {n m : ℕ+} {b : Fin ↑m → ℝ} {A : Matrix (Fin ↑m) (Fin ↑n) ℝ}
  (x : EuclideanSpace ℝ (Fin ↑n)) (ε : ℝ) (εpos : ε > 0) (y : EuclideanSpace ℝ (Fin ↑n)) (a : ‖x - y‖ ≤ ε)
  (h_original_goal : ‖Aᵀ *ᵥ b ⬝ᵥ (y - x) - inner (Aᵀ *ᵥ b) (y - x)‖ ≤ ε * ‖x - y‖) :
  ‖Aᵀ *ᵥ b ⬝ᵥ (y - x) - (WithLp.equiv 2 (Fin ↑n → ℝ)) (y - x) ⬝ᵥ star ((WithLp.equiv 2 (Fin ↑n → ℝ)) (Aᵀ *ᵥ b))‖ ≤
    ε * ‖x - y‖ := sorry

Tactic state before:
case right
n m : ℕ+
b : Fin ↑m → ℝ
A : Matrix (Fin ↑m) (Fin ↑n) ℝ
x : EuclideanSpace ℝ (Fin ↑n)
ε : ℝ
εpos : ε > 0
y : EuclideanSpace ℝ (Fin ↑n)
a✝ : ‖x - y‖ ≤ ε
⊢ ‖Aᵀ *ᵥ b ⬝ᵥ (y - x) - inner (Aᵀ *ᵥ b) (y - x)‖ ≤ ε * ‖x - y‖

Tactic: rw [EuclideanSpace.inner_eq_star_dotProduct]

Tactic state after:
[case right
 n m : ℕ+
 b : Fin ↑m → ℝ
 A : Matrix (Fin ↑m) (Fin ↑n) ℝ
 x : EuclideanSpace ℝ (Fin ↑n)
 ε : ℝ
 εpos : ε > 0
 y : EuclideanSpace ℝ (Fin ↑n)
 a✝ : ‖x - y‖ ≤ ε
 ⊢ ‖Aᵀ *ᵥ b ⬝ᵥ (y - x) - (WithLp.equiv 2 (Fin ↑n → ℝ)) (y - x) ⬝ᵥ star ((WithLp.equiv 2 (Fin ↑n → ℝ)) (Aᵀ *ᵥ b))‖ ≤
     ε * ‖x - y‖]

Premises used:
EuclideanSpace.inner_eq_star_dotProduct : ∀ {ι : Type u_1} {𝕜 : Type u_3} [inst : RCLike 𝕜] [inst_1 : Fintype ι]
  (x y : EuclideanSpace 𝕜 ι), inner x y = (WithLp.equiv 2 (ι → 𝕜)) y ⬝ᵥ star ((WithLp.equiv 2 (ι → 𝕜)) x)