What is the largest possible $c$ in $||a_1x_1+a_2x_2+...+a_nx_n||\ge c(|a_1|+|a_2|+...+|a_n|)$. if $X = \mathbb R^2 $and $x_1 = (1, 0)$, $x_2 = (0, I)$? If $X = \mathbb R^3$ and $x_1 = (1, 0, 0), x_2 = (0, 1,0), x_3 = (0, 0, I)$?
we have $||a_1x_1+a_2x_2+...+a_nx_n||\ge c(|a_1|+|a_2|+...+|a_n|)$
what we want to find is $c=\inf\{||a_1x_1+a_2x_2||:|a_1|+|a_2|=1,a_1,a_2 \in \mathbb R\}$
So this value will be the largest value for $c$.
we have $||a_1x_1+a_2x_2+...+a_nx_n||\ge c(|a_1|+|a_2|+...+|a_n|)$
what we want to find is $c=\inf\{||a_1x_1+a_2x_2||:|a_1|+|a_2|=1,a_1,a_2 \in \mathbb R\}$
So this value will be the largest value for $c$.