So, I'm trying to see if my approach can show that the set $S$ is not affine and is convex with a similar argument for both cases
$S = \left\{ \alpha \in \mathbb{R}^3 : \alpha_1 + \alpha_2 e^{-t} + \alpha_3 e^{-2t}\le 1.1 \right\} \\ \text{where } t \ge 1 $
My first observation is that, given $x \in S$ I can write it as:
$$ x \cdot \gamma(t) \le 1.1 $$
Where $ \gamma(t)^T = \left[ 1, e^{-t} , e^{-2t} \right]$.
With that, I can write an arbitrary pair $x$ and $y$ from S as the combination:
$$ \left[ \theta x + (1-\theta)y \right]\cdot \gamma(t) $$
If $\theta \in \mathbb{R} $ the combination is affine and if $0 \le \theta \le 1 $ the combination is convex. In my understanding, since $\theta x + (1-\theta)y$ is real and $x,y \in S$ I can bound them by 1.1.
How can I refine my argument to prove that:
- S is convex when I construct the vector $\theta x + (1-\theta)y$ when $0 \le \theta \le 1 $
- S is not affine when $\theta \in \mathbb{R} $
The reason for my thinking is that the difference of the conditions upon $\theta$ that helps me see each case, no?