What is the proof that M is a convex and closed subset of C[0,1]?

In summary, the conversation discusses the process of proving that a given subset of a space of functions is convex and closed. The first step is to show that the subset is closed, which can be done by proving that it contains all of its limit points. The second step is to show that the subset is convex, which can be done by proving that for any two functions in the subset and any value between 0 and 1, the resulting function is also in the subset. This can be done by using the definition of uniform convergence and the fact that the norm in this case is the supremum norm. The conversation also briefly touches on a related problem of finding the function with the smallest norm in the subset, and shows that such a function
  • #1
D_Miller
18
0
I am taking a self-study individual course on convex analysis but I'm having some troubles with the basics as I'm trying to do the exercises in my notes.

I'm asked to consider the space [tex]C[0,1][/tex] of continuous, complex-valued functions on [tex][0,1][/tex], equipped with the supremum norm [tex]\|\cdot\|_{\infty}[/tex]. Let [tex]M[/tex] be the subset of [tex]C[0,1][/tex] consisting of all those functions [tex]f[/tex] such that

[tex]\int_{0}^{\frac{1}{2}}f(x)dx-\int_{\frac{1}{2}}^{1}f(x)dx=1[/tex].

I now have to show that [tex]M[/tex] is convex and closed in [tex]C[0,1][/tex]. This is vastly different from anything else I've done in this course so far, and I really have no clue how to start. Any help would be greatly appreciated.
 
Last edited:
Physics news on Phys.org
  • #2


What have you tried so far? Can you write out what you have to prove?
 
  • #3


micromass said:
What have you tried so far? Can you write out what you have to prove?

Yeah, if I'm not mistaken I have to prove that for [tex]f,g\in M[/tex] and [tex]0<t<1[/tex], the fuction [tex]h_t=(1-t)f+tg[/tex] also lies in [tex]M[/tex]. Then I have to show that the complement of [tex]M[/tex] is open or, equivalently, that the closure of [tex]M[/tex] is equal to [tex]M[/tex] itself.
 
  • #4


Yes. So for convexity, you'll need to calculate

[tex]\int_0^{1/2}{h_t(x)dx}-\int_{1/2}^1{h_t(x)dx}[/tex]

and show that this equals 1.
 
  • #5


micromass said:
Yes. So for convexity, you'll need to calculate

[tex]\int_0^{1/2}{h_t(x)dx}-\int_{1/2}^1{h_t(x)dx}[/tex]

and show that this equals 1.

Of course. That makes sense and I have now done it. Any idea as to which of my closed set definitions would be easiest to use?
 
  • #6


Hmm, to me it looks easiest to work with sequences. Take a sequence fn in M such that [tex]f_n\rightarrow f[/tex]. You'll need to show that f is in M...
 
  • #7


I'm sorry but these kind of proofs always confuse me. I take it I'm supposed to use the result that a set is closed iff it contains all its limit points and then look at

[tex]\int_{0}^{\frac{1}{2}}f_t(x)dx-\int_{\frac{1}{2}}^{1}f_t(x)dx=1[/tex]

and prove it by letting limits pass through the integrals. I just have trouble getting the ball rolling.
 
  • #8


Well, can you come up with any theorems that allow you to exchange limit and integral? You should have seen those theorems. Remember that the convergence is uniform here...
 
  • #9


Perhaps I've overlooked something, but how can you be sure that the convergence is uniform? I was thinking about the convergence theorems of Lebesgue integration, but if the convergence is uniform, we can interchange the limit and the integral for Riemann integrals as well.
 
  • #10


Well, if I say [tex]f_n\rightarrow f[/tex]. In what metric space am I working then. More important: which norm am I using?
 
  • #11


Uniform convergence would be in [tex]\mathbb{R}[/tex], but the norm is stated in the assignment itself to be the sup-norm.
 
  • #12


Well, we have that a sequence of function converge for the sup-norm if and only if they converge uniformly on [tex]\mathbb{R}[/tex].

It's not all that hard to prove: just write out the definitions of both convergences and you'll see easily that they're the same...
 
  • #13


Yeah, it stands to reason that a sequence [tex]f_n:M\rightarrow \mathbb{R}[/tex] converges uniformly to [tex]f:M\rightarrow \mathbb{R}[/tex] iff [tex]\lim_{n\rightarrow\infty}\| f_n-f\|_S=0[/tex].

But is it enough to write that

[tex]\int_{0}^{\frac{1}{2}}f(x)dx-\int_{\frac{1}{2}}^{1}f(x)dx=\lim_{n\rightarrow \infty}\int_{0}^{\frac{1}{2}}f_ndx-\lim \int_{\frac{1}{2}}^{1}f_ndx=1[/tex]?
 
  • #14


Yes, it is enough to write that. You probably seen a theorem that allows you to exchange integrals and limits under uniform convergence. It's that theorem you use...
 
  • #15


Hmm. I do have a bad habit of over-complicating mathematics. Thanks for your help though.

There is a second part to the problem, which I'm not supposed to do. Apparently it's relevant to different course, but just for the heck of it, it asks me to show that [tex]M[/tex] does not contain a vector with the smallest norm.

I assume the result that every nonempty, closed, convex set in a Hilbert space contains a unique element of smallest norm is involved in one way or another. As I understand it, I have to see whether it's possible that [tex]\| f\|_{\infty}<1[/tex]. I have done the calculation that

[tex]\int_{0}^{1/2}fdx-\int_{1/2}^{1}fdx\leq \left|\int_{0}^{1/2}fdx\right|+\left|\int_{1/2}^{1}fdx\right| \leq \int_0^1 |f(x)|dx\leq \|f\|_{\infty}[/tex]

Which (I guess) shows that you can come arbitrarily close but not much else. Any idea as to how this proof could be done correctly? Bear in mind, this is not actual homework, so you don't need to be entirely sure that your proof is correct. I won't hold you responsible anyway ;).
 
  • #16


Well, your estimation shows us that [tex]\|f\|_\infty\geq 1[/tex]. Now it is possible that the equality holds, but the function that gives you equality is not unique.

Let f be the characteristic function on [0,1/2], then [tex]\|f\|_\infty=1[/tex].
But let g be the characteristic function on [1/2,1], then [tex]\|g\|_\infty=1[/tex] to.

So there is no unique function f such that [tex]\|f\|_\infty=1[/tex].
 
  • #17


Yes, but how does this eliminate the possibility that there are simply multiple vectors with the smallest norm? The task is to show that M doesn't contain any such vectors at all.
 
  • #18


I'm terribly sorry to kick this thread up the board when others probably have more urgent problems, but I'm very curious as to why/if micromass' previous argument (post #16) is enough to prove the stated problem. I'd appreciate it if anyone took the time to elaborate...
 
  • #19


D_Miller said:
I'm terribly sorry to kick this thread up the board when others probably have more urgent problems, but I'm very curious as to why/if micromass' previous argument (post #16) is enough to prove the stated problem. I'd appreciate it if anyone took the time to elaborate...

No. micromass' examples f and g aren't in M. They don't satisfy the integral condition. The function h=f-g does and has |h|_infinity=1. And it's essentially the only function with norm=1 that does. But it's not continuous. So it can't be in M.
 
  • #20


I'm sorry, my post 16 was rubbish.

Basically, you take a function f such that [tex]\|f\|_\infty=1[/tex].
Then, we can prove with the continuity of f, that f=1 on [0,1/2[ and f=0 on ]1/2,1]. Thus the minimum, if it exists, is unique...
 
  • #21


Dick said:
No. micromass' examples f and g aren't in M. They don't satisfy the integral condition. The function h=f-g does and has |h|_infinity=1. And it's essentially the only function with norm=1 that does. But it's not continuous. So it can't be in M.

I may be missing something completely obvious, but why is this true? Thanks for your time, guys.
 
  • #22


D_Miller said:
I may be missing something completely obvious, but why is this true? Thanks for your time, guys.

It is kind of obvious, isn't it? If |f|<=1, then the absolute value of both of the integrals are <=1/2. The only way you can have a-b=1 with |a|,|b|<=1/2 is a=1/2 and b=(-1/2).
 

Related to What is the proof that M is a convex and closed subset of C[0,1]?

1. What is convex analysis?

Convex analysis is a branch of mathematics that studies convex functions and convex sets. It involves the study of properties and optimization of convex functions, as well as geometric properties of convex sets.

2. What is the importance of convex analysis?

Convex analysis has a wide range of applications in fields such as optimization, economics, engineering, and computer science. It provides powerful tools for solving optimization problems and understanding the behavior of complex systems.

3. What are some key concepts in convex analysis?

Some key concepts in convex analysis include convex functions, convex sets, convexity conditions, subgradients, and duality. These concepts are essential for understanding and solving problems in convex analysis.

4. What are some real-world examples of convex analysis?

Convex analysis is used in a variety of real-world applications, such as portfolio optimization in finance, image and signal processing, machine learning, and control systems. It is also used in economic models, such as game theory and market equilibrium.

5. What skills are required for a course on convex analysis?

A course on convex analysis requires a solid background in calculus, linear algebra, and basic analysis. Familiarity with optimization and mathematical proofs is also helpful. Strong critical thinking and problem-solving skills are essential for success in this course.

Similar threads

  • Calculus and Beyond Homework Help
Replies
15
Views
1K
  • Calculus and Beyond Homework Help
Replies
8
Views
1K
  • Calculus and Beyond Homework Help
Replies
14
Views
212
  • Calculus and Beyond Homework Help
Replies
9
Views
845
  • Calculus and Beyond Homework Help
Replies
6
Views
1K
  • Calculus and Beyond Homework Help
Replies
2
Views
1K
  • Calculus and Beyond Homework Help
Replies
13
Views
569
  • Calculus and Beyond Homework Help
Replies
8
Views
2K
  • Calculus and Beyond Homework Help
Replies
3
Views
446
  • Calculus and Beyond Homework Help
Replies
1
Views
12
Back
Top