0

I am having a hard time proving this statement. I usually have an intuition about the direction to take when doing a proof, but I am really having difficulty with this one. Could anyone give me a hint?

$\{(x_1, x_2)\in\mathbb R^2, x_1 \geq\ 0, x_2 \geq\ 0 \land x_1+x_2 \leq\ 1\}$

Thank you!

Update 1

This is what I have. Is this valid?

Step 1: Lower Bound

$\lambda \in \lbrack 0,1 \rbrack, 0 \leq x_i \leq 1$

The Sum of $x_1 + x_1' \leq 1$ and $x_1 \land x_1'$ are nonnegative. Since $(1 - \lambda)$ is the complement of $\lambda$ $\land \lambda \in \lbrack 0,1 \rbrack$, the sum of $x_1\lambda + (1-\lambda)x_1'$ must also be nonnegative.

Step 2: Upper Bound

Since $x_1 + x_1' \leq 1$, their sum is at most 1. If the sum is 1, then $x_1\lambda+(1-\lambda)x_1'$ is at most 1. Therefore, the upper bound is 1.

Step 3:

The same logic applies for $x_2 \land x_2'$.

Xavier
  • 151
  • The triangle is the intersection of 3 half-spaces 2) half-spaces are convex 3) intersection of any number of convex regions is convex.
  • – achille hui Sep 25 '15 at 14:37