Intersection of a closed convex set

In summary, the conversation discusses the definition of the set Lc, which consists of functions that are greater than or equal to zero on a closed convex subset of a real Banach Space. Using the Hahn--Banach theorem, it is shown that the set C is equal to the intersection of all x in X such that f(x) is greater than or equal to zero, where f belongs to Lc. A corollary of the Hahn--Banach theorem is used to prove this statement, which involves a sublinear functional and an open convex set. The proof also involves showing that the resulting functional is bounded.
  • #1
Funky1981
22
0
Let X be a real Banach Space, C be a closed convex subset of X.

Define Lc = {f: f - a ∈ X* for some real number a and f(x) ≥ 0 for all x ∈ C} (X* is the dual space of X)

Using a version of the Hahn - Banach Theorem to show that

C = ∩ {x ∈ X: f(x) ≥ 0} with the index f ∈ Lc under the intersection Could someone help me to solve this problem, i can't see how Hahn - Banach can imply the above statement ( I used the separation version to obtain g(x)<a<g(y) for some linear functional g)
 
Physics news on Phys.org
  • #2
You will need the following corollary of the Hahn--Banach theorem (with sublinear functional): if ##U## is a convex open set, and ##a\notin U## then there exists a non-zero linear functional ##f\in X^*## such that ##f(x)\le f(a)## for all ##x\in U##. To prove the corollary you first notice that because of translation invariance, you can assume without loss of generality that ##0\in U##.

Then you define a sublinear functional ##q## to be the Minkowski functional of ##U##, and define ##f_0## to be the linear functional on the one-dimensional space spanned by ##a## such that ##f_0(a)=1##. Extending ##f_0## by Hahn--Banach you get a functional ##f## such that ##f(x)\le q(x)## for all ##x\in X##. Then for all ##x\in U## $$ f(x) \le q(x) \le 1 = q(a),$$ so we get the desired inequality.
We still need to show that ##f\in X^*## (i.e. that ##f## is bounded), but that is easy: ##U## is open, so an open ball ##B_\varepsilon \subset U##, so ##q(x), q(-x)\le \frac1\varepsilon \|x\|## (##B_\varepsilon## is an open ball of radius ##\varepsilon## centered at ##0##), and therefore ##|f(x)|\le \frac1\varepsilon \|x\|##.

To get the statement you need, take ##a \notin C##. Then for some ##\varepsilon>0## the whole open ball ##x+B_\varepsilon## does not intersect ##C##, or, equivalently, the (open) set ##U:= C+B_\varepsilon## does not contain ##a##. Applying the above corollary yo get that there exists ##f\in X^*## such that
$$ f(x)\le f(a)$$ for all ##x\in U##, or, equivalently, $$f(x) \le f(a) + f(y) \qquad \forall x\in C, \ \forall y\in B_\varepsilon.$$ Noticing that for any non-zero ##f\in X^*## the point ##0## is an interior point of ##f(B_\varepsilon)## (in fact ##f(B_\varepsilon)## is an open set), we conclude that there exists real ##b## such that $$f(x) \le b <f(a) \qquad \forall x\in C.$$ The last statement means that ##C## contains the intersection of the half-spaces. The opposite inclusion is trivial.
 

Related to Intersection of a closed convex set

What is the definition of a closed convex set?

A closed convex set is a set of points in a vector space where any line segment connecting two points in the set lies entirely within the set. It is also a set where any convex combination of points in the set remains in the set. In simpler terms, it is a set that is completely closed and contains all the points within its boundaries.

How is the intersection of two closed convex sets defined?

The intersection of two closed convex sets is the set of all points that are common to both sets. In other words, it is the set of points that satisfy the properties of both sets, including being closed and convex. This intersection will also be a closed convex set.

Why is the intersection of closed convex sets important?

The intersection of closed convex sets is important because it allows us to find common solutions to problems involving multiple sets. In mathematics and science, many problems can be formulated as finding a point that satisfies certain conditions, and the intersection of closed convex sets can help us find these points efficiently.

Can the intersection of closed convex sets be empty?

Yes, the intersection of closed convex sets can be empty if the two sets do not share any common points. This can happen if the sets are disjoint or if they are parallel to each other.

How can the intersection of closed convex sets be calculated?

The intersection of closed convex sets can be calculated using algorithms such as the simplex method, which is commonly used in linear programming. Other methods include using projection operators or computing the convex hull of the sets.

Similar threads

  • Topology and Analysis
Replies
24
Views
2K
  • Topology and Analysis
Replies
9
Views
2K
  • Topology and Analysis
Replies
3
Views
266
  • Topology and Analysis
Replies
2
Views
323
  • Topology and Analysis
Replies
1
Views
382
  • Topology and Analysis
Replies
9
Views
2K
  • Topology and Analysis
Replies
2
Views
2K
  • Topology and Analysis
Replies
12
Views
4K
  • Topology and Analysis
Replies
5
Views
2K
Replies
9
Views
659
Back
Top