Documentation

FirstOrderMethodsOptimization_Beck_2017.Chap01.Definition_1_18

Statements

Source excerpts; proofs omitted. recall restates an existing declaration; #check records an expression, not its inferred type.

Definition 1.18: when ℝ^n is endowed with the dot product, the associated Euclidean norm is the canonical l_2-norm on EuclideanSpace ℝ (Fin n), provided by EuclideanSpace.norm_eq.

#check (EuclideanSpace.norm_eq : ∀ x : EuclideanSpace ℝ (Fin n),
  ‖x‖ = Real.sqrt (∑ i, ‖x i‖ ^ (2 : ℕ)))

-- Proof sketch: start from `EuclideanSpace.norm_eq` and simplify the real coordinate terms using
-- `Real.norm_eq_abs`, so that `|x i|^2 = x i^2`.

Lean source

Source context
open Matrix
open scoped BigOperators
variable {n : ℕ}

Definition 1.18: for a positive definite matrix Q, the induced norm on ℝ^n is the source-facing Q-norm obtained from the owner Matrix.toNormedAddCommGroup.

#check Matrix.toNormedAddCommGroup

-- Proof sketch: rewrite the induced norm as `√⟪x, x⟫`, and then use the matrix
-- formula for the `Q`-inner product to identify `⟪x, x⟫` with `xᵀ Q x = dotProduct x (Q.mulVec x)`.

Lean source

Source context
open Matrix
open scoped BigOperators
variable {n : ℕ}

Module source

@[reducible, inline]
noncomputable abbrev Matrix.qNorm {n : ℕ} (Q : Matrix (Fin n) (Fin n) ℝ) (hQ : Q.PosDef) (x : Fin n → ℝ) :
ℝ

The source-facing Q-norm on ℝ^n induced by the canonical owner Matrix.toNormedAddCommGroup.

Instances For
    theorem euclideanSpace_norm_eq_sqrt_sum_sq {n : ℕ} (x : EuclideanSpace ℝ (Fin n)) :
    ‖x‖ = √(∑ i : Fin n, x.ofLp i ^ 2)

    The Euclidean norm on ℝ^n is the square root of the sum of the coordinate squares.

    theorem norm_eq_sqrt_dotProduct_mulVec_of_posDef {n : ℕ} (Q : Matrix (Fin n) (Fin n) ℝ) (hQ : Q.PosDef) (x : Fin n → ℝ) :
    have qSeminormed := Q.toSeminormedAddCommGroup ⋯; have qNormed := Q.toNormedAddCommGroup hQ; ‖x‖ = √(x ⬝ᵥ Q.mulVec x)

    If ℝ^n is endowed with the Q-inner product associated to a positive definite matrix Q, then the induced Euclidean norm is the Q-norm √(xᵀ Q x).

    theorem qNorm_sq_eq_qInner_self {n : ℕ} (Q : Matrix (Fin n) (Fin n) ℝ) (hQ : Q.PosDef) (x : Fin n → ℝ) :
    Q.qNorm hQ x ^ 2 = Q.qInner hQ x x

    In the Q-geometry, the squared Q-norm is the Q-inner self-pairing.