# Prove that set is convex

• Dostre
In summary: The easiest way to deal with questions like the one you asked is to proceed in small steps: (1) prove that a half-space a_1 x_1 + a_2 x_2 + \cdots + a_n x_n \leq b is a convex set in (x_1, x_2, \ldots, x_n)-\text{space} (where the a_i, b are constants); then prove (2): the intersection of convex sets is convex. With hardly any work at all you then can ...
Dostre
Let $\alpha$>0 and $\gamma$>0 and $\beta$>0 be real numbers. Let M={x∈R$^{2}_{+}$ ∶$\alpha$x$_{1}$+$\gamma$x$_{2}$$\leq$$\beta$}. Prove M is a convex set. Prove that M is bounded. What does this set resemble (in economics)?

I have a little idea of how to show that this set is convex, although, I know the condition for a convex set (ax1+(1-a)x2, 0<a<1). It is clear to me that this set resembles PPF, so can you just show me how to prove that it is convex, please.

Last edited:
pick any two points in your set, x=(x1,x2), y=(y1,y2), prove that a*x+(1-a)*y is also in that set for any 0<a<1.

sunjin09 said:
pick any two points in your set, x=(x1,x2), y=(y1,y2), prove that a*x+(1-a)*y is also in that set for any 0<a<1.

And how do I prove these arbitrary point s are in the set? Should I make some kind of inequality?

You know that (x1,x2) and (y1,y2) satisfy the inequality that defines M. Write down those conditions. Then write down the inequality that the convex combination of these points has to satisfy, and prove that this inequality is true by using the two inequalities that you know are true.

The proof is basically three lines, if you write everything down and try some algebra and it doesn't work post what you've done and we can help you

Office_Shredder said:
You know that (x1,x2) and (y1,y2) satisfy the inequality that defines M. Write down those conditions. Then write down the inequality that the convex combination of these points has to satisfy, and prove that this inequality is true by using the two inequalities that you know are true.

The proof is basically three lines, if you write everything down and try some algebra and it doesn't work post what you've done and we can help you

I wrote that proof, but I am unable to make this inequality work out. Thats what I got:
u=(u$_{1}$,u$_{2}$), f(u)=$\alpha$u$_{1}$+$\gamma$u$_{2}$-$\beta$

v=(v$_{1}$,v$_{2}$), f(v)=$\alpha$v$_{1}$+$\gamma$v$_{2}$-$\beta$

Inequality that the convex function has to satisfy is:

$\lambda$f(u)+(1-$\lambda$)f(v)$\geq$f[$\lambda$u+(1-$\lambda$)v]

or

$\lambda$($\alpha$u$_{1}$+$\gamma$u$_{2}$-$\beta$)+(1-$\lambda$)($\alpha$v$_{1}$+$\gamma$v$_{2}$-$\beta$)$\geq$$\alpha$($\lambda$u$_{1}$+(1-$\lambda)$v$_{1}$)+$\gamma$($\lambda$u$_{2}$+(1-$\lambda$)v$_{2}$)-$\beta$

So I cannot make this inequality work out. What I get is that 0$\geq$0. Does it mean that the inequality is satisfied since it is bigger or EQUAL?

Last edited:
I don't understand why you are introducing convex functions to the problem. Set convexity and function convexity are related but distinct concepts.

If $(x_1,x_2)\ , (y_1,y_2) \in M$ we get
$$\alpha x_1 + \gamma x_2 \leq \beta$$
$$\alpha y_1 + \gamma y_2 \leq \beta$$

Now for any 0<a<1 we want to prove
$$\alpha( a x_1 + (1-a) y_1)) + \gamma ( a x_2 + (1-a) y_2 ) \leq \beta$$
There are two things that you should do: understand why this is what we need to prove, and then prove it using the first two inequalities that I posted

Oh I did not actually realize these are two different concepts.

Alright, I got the solution. To prove this inequality I first expanded the LHS and rearranged the terms:(instead of $\alpha$ I will use $\lambda$ to avoid confusion)

$$\lambda ( a x_1 + (1-a)y_1) + \gamma( ax_2+(1-a)y_2) = \lambda ax_1 + \gamma ax_2 + \lambda( 1-a) y_1 + \gamma( 1-a) y_2\ = a(\lambda x_1+\gamma x_2) + (1-a)(\lambda y_1 + \gamma y_2)$$

Now I need to show that the last expression above is less than β. To do that I used the two inequalities that I know are true.

$$\alpha x_1 + \gamma x_2 \leq \beta$$
$$\alpha y_1 + \gamma y_2 \leq \beta$$

Multiply the first one by a and we get:
$$a(\alpha x_1 + \gamma x_2) \leq a\beta$$

Multiply the second one by (1-a) and we get:
$$(1-a)(\alpha y_1 + \gamma y_2) \leq (1-a) \beta$$

Add them up and we get:
$$a(\lambda x_1+\gamma x_2) + (1-a)(\lambda y_1 + \gamma y_2) \leq a\beta + (1-a) \beta$$

The LHS looks exactly like the LHS of the inequality we need to prove.
So now If we expand the RHS we get β and the inequality looks like:
$$a(\lambda x_1+\gamma x_2) + (1-a)(\lambda y_1 + \gamma y_2) \leq \beta$$

Exactly like the inequality we need to prove and did so. Since we know that the two inequalities with points (x1,x2) and (y1,y2) are true adding them up will be also true and after we added them up the resultant inequality looks exactly like the one we needed to prove after we rearranged terms.

Last edited:
This set resembles a budget constraint (not PPF) and is bounded by:
at x$_{2}$=0, x$_{1}\leq$$\frac{\beta}{\alpha}$
at x$_{1}$=0, x$_{2}\leq$$\frac{\beta}{\gamma}$

Dostre said:
This set resembles a budget constraint (not PPF) and is bounded by:
at x$_{2}$=0, x$_{1}\leq$$\frac{\beta}{\alpha}$
at x$_{1}$=0, x$_{2}\leq$$\frac{\beta}{\gamma}$

By far, the easiest way to deal with questions like the one you asked is to proceed in small steps: (1) prove that a half-space $a_1 x_1 + a_2 x_2 + \cdots + a_n x_n \leq b$ is a convex set in $(x_1, x_2, \ldots, x_n)-\text{space}$ (where the $a_i, b$ are constants); then prove (2): the intersection of convex sets is convex. With hardly any work at all you then can say that the set of $(x_1,x_2,\ldots,x_n)$ that satisfy the equalities and inequalities
$$\begin{array}{l} a_{11} x_1 + a_{12} x_2 + \cdots + a_{1n} x_n \leq b_1,\\ a_{21} x_1 + a_{22} x_2 + \cdots + a_{2n} x_n \leq b_2, \\ \vdots\\ a_{r1} x_1 + a_{r2} x_2 + \cdots + a_{rn} x_n \leq b_r,\\ c_{11} x_1 + c_{12} x_2 + \cdots + c_{1n} x_n = d_1, \\ \vdots\\ c_{s1} x_1 + c_{s2} x_2 + \cdots + c_{sn} x_n = d_s \end{array}$$
is convex if it is not empty.

RGV

## 1. What is a convex set?

A convex set is a set of points in a space where, for any two points in the set, the line segment connecting the two points lies entirely within the set. In other words, a convex set is a set that is "bent outwards" and does not have any indentations or holes.

## 2. How do you prove that a set is convex?

To prove that a set is convex, you must show that for any two points in the set, the line segment connecting the two points lies entirely within the set. This can be done by using the definition of convexity and mathematical proofs such as induction or contradiction.

## 3. Can a set be both convex and concave?

No, a set cannot be both convex and concave. A set is either convex or concave, depending on whether it has an outward or inward curvature. A set that has both inward and outward curvature is considered neither convex nor concave.

## 4. Are all polygons convex?

No, not all polygons are convex. A polygon is convex if and only if all its interior angles are less than 180 degrees. If a polygon has one or more interior angles that are greater than 180 degrees, it is considered concave.

## 5. Why is it important to prove that a set is convex?

It is important to prove that a set is convex because convexity is a fundamental concept in mathematics and has many applications in fields such as optimization, geometry, and economics. By proving that a set is convex, we can use various mathematical tools and techniques to analyze and solve problems related to the set.

• Calculus and Beyond Homework Help
Replies
1
Views
956
• Calculus and Beyond Homework Help
Replies
6
Views
1K
• Calculus and Beyond Homework Help
Replies
6
Views
1K
• Calculus and Beyond Homework Help
Replies
8
Views
1K
• Calculus and Beyond Homework Help
Replies
1
Views
1K
• Calculus and Beyond Homework Help
Replies
2
Views
996
• Calculus and Beyond Homework Help
Replies
20
Views
2K
• Calculus and Beyond Homework Help
Replies
8
Views
2K
• Calculus and Beyond Homework Help
Replies
14
Views
519
• Calculus and Beyond Homework Help
Replies
18
Views
2K