You are not logged in.
Pages: 1
Hi, I'm new to this forum and I found it very interesting. So, as a first post I present this problem.
"Prove that the set X={(x,y) : ax+by <= c} is convex for any given a, b, and c."
How can I do that using only the axioms of vector spaces?
Thanks
Offline
This is doubly interesting because you have to prove this along the straight line, that is has no dents, and you have to prove there are no holes in the area out toward infinity, a weird subject.
igloo myrtilles fourmis
Offline
A convex set is a set X included in a vector space E where [a,b]={(1-t)a+tb : 0<=t<=1} and a,b in X implies [a,b] in X
Offline
Here is a little proof:
Offline
No! You cant subtract inequalities this way.
DOES NOT IMPLY
You can add inequalities normally, but you can subtract them like that.
Last edited by JaneFairfax (2007-09-20 08:25:17)
Offline
The way to complete the proof is as follows.
Adding [1] and [2] should give you what you are looking for.
Offline
You are right!!
And what about this one:
Thanks a lot!!
Offline
The way to complete the proof is as follows.
Adding [1] and [2] should give you what you are looking for.
Thanks:D
Offline
Youre welcome.
Offline
Pages: 1