MHB Is Lambda a Convex Mapping?

  • Thread starter Thread starter Euge
  • Start date Start date
  • Tags Tags
    2016
Click For Summary
The discussion centers on proving that the mapping $\Lambda$ is convex based on the given inequality involving bounded measurable functions. Participants are tasked with demonstrating that the condition $\Lambda\left(\int_0^1 f(x)\, dx\right) \le \int_0^1 \Lambda(f(x))\, dx$ implies convexity. A correct solution has been provided by a user named Opalg, confirming the mapping's convex nature. The thread encourages further exploration of the properties of convex mappings in relation to measurable functions. The problem highlights the significance of understanding mappings in mathematical analysis.
Euge
Gold Member
MHB
POTW Director
Messages
2,072
Reaction score
245
Here is this week's POTW:

-----
Let $\Lambda :\Bbb R \to \Bbb R$ be a mapping such that for all bounded measurable mappings $f : [0,1]\to \Bbb R$,

$$\Lambda\left(\int_0^1 f(x)\, dx\right) \le \int_0^1 \Lambda(f(x))\, dx.$$

Show that $\Lambda$ is a convex mapping.

-----

Remember to read the http://www.mathhelpboards.com/showthread.php?772-Problem-of-the-Week-%28POTW%29-Procedure-and-Guidelines to find out how to http://www.mathhelpboards.com/forms.php?do=form&fid=2!
 
Physics news on Phys.org
Congratulations to Opalg for his correct solution! You can find it below.

Given $a < b$ in $\mathbb{R}$ and $0 < \lambda < 1$, apply the inequality $$\Lambda\left(\int_0^1 f(x)\, dx\right) \leqslant \int_0^1 \Lambda(f(x))\, dx $$ to the function $$f(x) = \begin{cases}a &(0\leqslant x \leqslant \lambda), \\b &(\lambda < x \leqslant 1).\end{cases}$$ On the left side, $$\int_0^1f(x)\,dx = \int_0^\lambda a\,dx + \int_\lambda^1 b\,dx = \lambda a + (1-\lambda)b. $$

On the right side, $$\int_0^1 \Lambda(f(x))\, dx = \int_0^\lambda \Lambda(f(x))\, dx + \int_\lambda^1 \Lambda(f(x))\, dx = \int_0^\lambda \Lambda(a)\, dx + \int_\lambda^1 \Lambda(b)\, dx = \lambda\Lambda(a) + (1-\lambda)\Lambda(b). $$

Putting those values into the given inequality gives $$\Lambda\bigl( \lambda a + (1-\lambda)b\bigr) \leqslant \lambda\Lambda(a) + (1-\lambda)\Lambda(b).$$ Since that holds whenever $a < b$ and $0 < \lambda < 1$, it follows that $\Lambda$ is convex.