Documentation

IntroductoryLecturesOnConvexOptimization_Nesterov_2004.Chap03.Definition_3_32

Statements

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

Definition 3.32 is a recall-only item in the chapter's finite weighted-sum domain. Primary domain: - finite weighted sums of sampled scalar values. Sampled owner-style declarations: - mathlib dotProduct, the canonical owner for finite sums of entrywise products; - mathlib notation α ⬝ᵥ fy, the idiomatic display form of that owner; - hatf in Chap03/Lemma_3_24, the local weighted-sum notation built from dotProduct for the chapter's sampled primal values; - project gapFunctionCertificate_apply in Chap03/Lemma_3_24, the nearby textbook-style expansion from the dotProduct owner back to an explicit finite sum. Best owner abstraction: - dotProduct α (f ∘ y), equivalently α ⬝ᵥ (f ∘ y). Primitive data: - a horizon N : ℕ; - sample points y : Fin (N + 1) → X; - coefficients α : Fin (N + 1) → ℝ; - the sampled scalar family f ∘ y : Fin (N + 1) → ℝ. Derived API: - the textbook display α ⬝ᵥ (f ∘ y) = ∑ k, α k * f (y k), which is just the defining expansion of dotProduct; - nearby sampled weighted-gap owners built from the same dotProduct abstraction. Source/core/bridge triage: - source-facing: the textbook quantity \hat f_N = ∑_{k=0}^N α_k f(y_k); - core/canonical: dotProduct α (f ∘ y); - bridge/view: the explicit finite-sum display of that dot product. This file therefore recalls the mathlib owner directly instead of keeping a parallel local weighted-sum wrapper.

recall dotProduct

Lean source

Source context
open scoped BigOperators
universe u
variable {X : Type u}
#check α ⬝ᵥ (f ∘ y)

Lean source

Source context
open scoped BigOperators
universe u
variable {X : Type u}
variable {N : ℕ} (y : Fin (N + 1) → X) (α : Fin (N + 1) → ℝ) (f : X → ℝ)
#check
  (show α ⬝ᵥ (f ∘ y) = ∑ k, α k * f (y k) from by
    simp [dotProduct])

Lean source

Source context
open scoped BigOperators
universe u
variable {X : Type u}
variable {N : ℕ} (y : Fin (N + 1) → X) (α : Fin (N + 1) → ℝ) (f : X → ℝ)

Module source