-- File: optlib/Optlib/Algorithm/LASSO.lean
Theorem statement:
theorem extracted_formal_statement_3 {m : ℕ+} (x : EuclideanSpace ℝ (Fin ↑m)) (h_original_goal : ‖x‖ ^ 2 = x ⬝ᵥ x) :
  0 ≤ ∑ i, ‖x i‖ ^ 2 := sorry

Tactic state before:
m : ℕ+
x : EuclideanSpace ℝ (Fin ↑m)
⊢ ‖x‖ ^ 2 = x ⬝ᵥ x

Tactic: rw [EuclideanSpace.norm_eq, Real.sq_sqrt, dotProduct]

Tactic state after:
[m : ℕ+
 x : EuclideanSpace ℝ (Fin ↑m)
 ⊢ ∑ i, ‖x i‖ ^ 2 = ∑ i, x i * x i,
 m : ℕ+
 x : EuclideanSpace ℝ (Fin ↑m)
 ⊢ 0 ≤ ∑ i, ‖x i‖ ^ 2]

Premises used:
Real.sq_sqrt : ∀ {x : ℝ}, 0 ≤ x → √x ^ 2 = x
EuclideanSpace.norm_eq : ∀ {𝕜 : Type u_7} [inst : RCLike 𝕜] {n : Type u_8} [inst_1 : Fintype n]
  (x : EuclideanSpace 𝕜 n), ‖x‖ = √(∑ i, ‖x i‖ ^ 2)