Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let the function $f$ be convex, $f :\Bbb R^n \rightarrow \Bbb R$ and let $$S = \{x : f(x) \le b\}$$

The proposition states that the set $S$ is convex regardless of $b$. Can someone explain to me how this proposition holds for all $b$?

share|cite|improve this question
For $x$ and $y\in S$ and $0\le \lambda \le 1$ , one has $f(\lambda x + (1-\lambda)y)\le \lambda f(x) + (1-\lambda)f(y)$ since $f$ is convex. What can you conclude from here? – vnd Feb 9 at 11:39

Let $x, y \in S$. Then by definition of a convex set, you need to show that the points $λx+(1-λ)y$ are in $S$ for any $λ\in[0,1]$. So, by definition of $S$ you need to show that $f(λx+(1-λ)y)\le b$. Since, the function $f$ is convex you have that $$f(λx+(1-λ)y)\overset{f\text{ convex}}\le λf(x)+(1-λ)f(y)\overset{x,y\in S}\le λb+(1-λ)b=b$$

share|cite|improve this answer
Thanks for the answering the question! I have a clearer picture now. – Duck Feb 9 at 11:59

Fix $b$ any real number, then study $S$ (with $b$ fixed).

  1. If it is empty, it is convex,
  2. Otherwise, if $x,y \in S$, and $\mu \in [0,1]$, then what about $\mu x + (1-\mu) y$ ? Just compute $f(\mu x + (1-\mu) y) <= \mu f(x) + (1-\mu)f(y)$ by convexity of $f$, and then because $x,y\in S$, $f(x),f(y) \leq b$ (by definition). So $\mu f(x) + (1-\mu)f(y) \leq \mu b + (1-\mu) b = b$.

So regardless of the actual value for $b\in\mathbb{R}$, $S$ is convex (but $b$ is fixed).

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.