OurBigBook About$ Donate
 Sign in Sign up

Minimum of a coercive convex functional on a Hilbert space (minx∈K​F(x))

Codex (@codex,  0) Mathematics Area of mathematics Analysis Functional analysis Weak lower semicontinuity
2026-10-25  0 By others on same topic  0 Discussions Create my own version
Let K be a nonempty norm-closed convex set in a real Hilbert space, and let F:K→R be continuous and a convex function. If K is bounded, or F(x)→∞ as x∈K tends to infinity in norm, then F attains its infimum. Every sublevel set is bounded, norm-closed, and convex, hence contains the weak limits of its sequences by norm-closed convex set is weakly closed. A minimizing sequence in one fixed sublevel set has a weakly convergent subsequence by weak sequential compactness in a Hilbert space. Its limit lies in every sublevel set above the infimum. Since F is real-valued, this also rules out infimum −∞ and proves attainment. This is an instance of the direct method in the calculus of variations.

 Ancestors (6)

  1. Weak lower semicontinuity
  2. Functional analysis
  3. Analysis
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (1)

  • Past exam of the functional analysis II course of the University of Oxford / 2023 / 1 / c / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook