| Thread Closed |
convex sets |
Share Thread | Thread Tools |
| Oct22-05, 04:07 PM | #1 |
|
|
convex sets
Hello! I've got some questions concerning convex sets.
We've had a lecture about convex sets this week, and got a some basic problems to solve. I think I can't use the material in the lecture to solve the problem. I'm just not sure about whether I fully understand the concept and can use it properly. In the lecture the prof presented a proof for the fact that for every [latex]t\in\matbb{R}[/latex] the interval [latex]I=[0,t]:=\{s|s\in\mathbb{R},0\le{s}\le{t}\}[/latex] is convex. The proof went like this. Let [latex]s_1,s_2\in[0,t][/latex] and [latex]\lambda\in[0,1][/latex]. The following holds: [latex]0\le{s_1}[/latex] and [latex]s_2\le{t}[/latex]. [latex]\lambda{s_1}+(1-\lambda){s_2}\le\lambda{t}+(1-\lambda)t=t[/latex]. Hence, the interval is convex. Now, the first question. Why cannot we simply check whether the condition holds for [latex]\lambda=0[/latex] or [latex]\lambda=1[/latex] ? It's [latex]\lambda\cdot{0}+(1-\lambda)t[/latex]. Then for [latex]\lambda=0[/latex] t is in I and for [latex]\lambda=1[/latex] 0 is in I. It's now asked to show that a hyperplane [latex]E\subseteq\mathbb{R}^n[/latex], [latex]E:=\{(x_1,...,x_n)\in\mathbb{R}^n|a_1{x_1}+...+a_n{x_n}=b\}[/latex], where [latex]a_1,...,a_n,b\in\mathbb{R}[/latex] and [latex](a_1,...,a_n)\neq(0,...,0)[/latex] is a convex set. Here, equally, it seems too easy just to put in two elements, say [latex]x_1[/latex] and [latex]x_n[/latex] and let [latex]\lambda[/latex] be either 0 or 1. If it's wrong to take this way, how can I show that E is convex differently? |
| Oct22-05, 08:12 PM | #2 |
|
|
Suppose you were asked to prove that the set [0, 1)union(1,2] was not convex. What would you do? |
| Oct23-05, 06:27 AM | #3 |
|
|
Thanks for your reply!
OK, for the union [latex]I=[0,1)\cup(1,2][/latex] is it right if I do it this way?: Let [latex]s_1,s_2\in{I}[/latex] be two elements, such that [latex]0\le{s_1}<1[/latex] and [latex]1<s_2\le{2}[/latex]. If the union is convex, then the following holds: [latex]0\le\lambda{s_1}+(1-\lambda)s_2\le{2}[/latex]. We have [latex]0\le\lambda{s_1}<1[/latex], but at the same time [latex]1<(1-\lambda)s_2\le{2}[/latex] does not hold for all [latex]\lambda\in[0,1][/latex], since [latex]0\le(1-\lambda)s_2<1[/latex] for some [latex]\lambda\in[0,1][/latex]. This means that [latex]s_2\notin{I}[/latex] for some [latex]\lambda\in[0,1][/latex], which contradicts the assumption. Now to the hyperplane. So you mean that given two points [latex](x_1,...,x_n)[/latex] and [latex](y_1,...,y_n)[/latex] [latex]\lambda(x_1,...,x_n)+(1-\lambda)(y_1,...,y_n)[/latex] must be in the set, because [latex]a_1(\lambda{x_1}+(1-\lambda)y_1)+...+a_n(\lambda{x_n}+(1-\lambda)y_n)=b[/latex] for any two such points? As it seems from what you said we don't have to prove this last statement about the sum. Why? I mean it's clear that for every [latex]a_1,...,a_n,\in\mathbb{R}[/latex], [latex](a_1,...,a_n)\neq(0,...,0)[/latex] there is always a real number b, is it really enough for the proof? What about half space [latex]H: =\{(x_1,...,x_n)\in\mathbb{R}^n|a_1{x_1}+...+a_n{x_n}\ge{b}\}[/latex], where [latex]a_1,...,a_n,b\in\mathbb{R}[/latex] and [latex](a_1,...,a_n)\neq(0,...,0)[/latex], which is one part of the space split by the hyperplane? Does the check for convexity of the hyperplane automatically yield the same result for this halfspace, i.e. the fact that it is convex too, or is there anything more to be done here? |
| Thread Closed |
| Thread Tools | |
Similar Threads for: convex sets
|
||||
| Thread | Forum | Replies | ||
| Having trouble proving a property of convex sets: | Calculus & Beyond Homework | 3 | ||
| finding sets, listing sets (discrete math) | Calculus & Beyond Homework | 2 | ||
| Properties of Open Sets (and what are Indexing Sets?) | Calculus & Beyond Homework | 11 | ||
| Convex Set | General Math | 13 | ||