Best approximation in normed spaces

TheoremExistence of best approximations in finite-dimensional subspaces#βœ“fully proved

Every point of a normed space has a nearest point in a finite-dimensional subspace (proximinality). No completeness hypothesis on the ambient space is needed: completeness enters only through the finite-dimensional subspace, whose closed balls are compact.

theorem exists_bestApproximation_of_finiteDimensional {π•œ : Type*} [RCLike π•œ]
    {E : Type*} [NormedAddCommGroup E] [NormedSpace π•œ E]
    {F : Submodule π•œ E} [FiniteDimensional π•œ F] (x : E) :
    βˆƒ y ∈ F, βˆ€ z ∈ F, β€–x - yβ€– ≀ β€–x - zβ€–
Used by 1

TheoremUniqueness of best approximation in strictly convex spaces#βœ“fully proved

In a strictly convex real normed space, a convex set contains at most one point nearest to a given point: the midpoint of two distinct nearest points would be strictly closer, by norm_midpoint_lt_iff.

theorem eq_of_isBestApproximation_of_strictConvexSpace {E : Type*}
    [NormedAddCommGroup E] [NormedSpace ℝ E] [StrictConvexSpace ℝ E]
    {K : Set E} (hK : Convex ℝ K) {x y₁ yβ‚‚ : E} (hy₁ : y₁ ∈ K) (hyβ‚‚ : yβ‚‚ ∈ K)
    (h₁ : βˆ€ z ∈ K, β€–x - y₁‖ ≀ β€–x - zβ€–) (hβ‚‚ : βˆ€ z ∈ K, β€–x - yβ‚‚β€– ≀ β€–x - zβ€–) :
    y₁ = yβ‚‚
Used by 1

TheoremUnique best approximation in finite-dimensional subspaces#βœ“fully proved

Existence plus uniqueness: a finite-dimensional subspace of a strictly convex real normed space admits a unique best approximation to every point.

theorem exists_unique_bestApproximation_of_finiteDimensional {E : Type*}
    [NormedAddCommGroup E] [NormedSpace ℝ E] [StrictConvexSpace ℝ E]
    {F : Submodule ℝ E} [FiniteDimensional ℝ F] (x : E) :
    βˆƒ y ∈ F, (βˆ€ z ∈ F, β€–x - yβ€– ≀ β€–x - zβ€–) ∧
      βˆ€ y' ∈ F, (βˆ€ z ∈ F, β€–x - y'β€– ≀ β€–x - zβ€–) β†’ y' = y
Uses 2
3 fully proved

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.