Can any two bounded functions be transformed into a maximum of two functions?

  • MHB
  • Thread starter Ackbach
  • Start date
In summary, it is possible to transform any two bounded functions into a maximum of two functions through various mathematical operations. This transformation has advantages such as simplifying calculations and understanding the behavior of the functions. However, it may not always be possible and the conditions for this transformation depend on the properties and behavior of the original functions. Furthermore, the overall behavior of the functions may change due to the transformation and there may be limitations depending on the properties of the original functions.
  • #1
Ackbach
Gold Member
MHB
4,155
92
Here is this week's POTW:

-----

Prove that, for any two bounded functions $g_1, g_2: \mathbb{R} \to [1, \infty)$, there exist functions $h_1, h_2: \mathbb{R} \to \mathbb{R}$ such that, for every $x \in \mathbb{R},$
$$
\sup_{s \in \mathbb{R}} (g_1(s)^x g_2(s)) = \max_{t \in \mathbb{R}} (x h_1(t) + h_2(t)).
$$

-----

Remember to read the https://mathhelpboards.com/showthread.php?772-Problem-of-the-Week-%28POTW%29-Procedure-and-Guidelines to find out how to https://mathhelpboards.com/forms.php?do=form&fid=2!
 
Physics news on Phys.org
  • #2
My apologies for not getting to this last week - I do have an excuse, actually: I was at NIWeek. In any case, no one answered last week's POTW, which was Problem B-5 in the 2012 Putnam Archive. The solution, attributed to Kiran Kedlaya and associates, follows.

[sp]Define the function
\[\newcommand{\RR}{\mathbb{R}}
f(x) = \sup_{s \in \RR} \{x \log g_1(s) + \log g_2(s)\}.
\]
As a function of $x$, $f$ is the supremum of a collection of affine functions, so it is convex. The function $e^{f(x)}$ is then also convex, as may be checked directly from the definition: for $x_1, x_2 \in \RR$ and $t \in [0,1]$, by the weighted AM-GM inequality
\begin{align*}
t e^{f(x_1)} + (1-t) e^{f(x_2)}&\geq e^{t f(x_1) + (1-t)f(x_2)} \\
&\geq e^{f(t x_1 + (1-t)x_2)}.
\end{align*}
For each $t \in \RR$, draw a supporting line to the graph of $e^{f(x)}$ at $x=t$; it has the form $y = x h_1(t) + h_2(t)$ for some $h_1(t), h_2(t) \in \RR$. For all $x$, we then have
\[
\sup_{s \in \RR} \{g_1(s)^x g_2(s) \} \geq x h_1(t) + h_2(t)
\]
with equality for $x = t$. This proves the desired equality (including the fact that the maximum on the right side is achieved).
[/sp]
 

FAQ: Can any two bounded functions be transformed into a maximum of two functions?

Can any two bounded functions be transformed into a maximum of two functions?

Yes, it is possible to transform any two bounded functions into a maximum of two functions through various mathematical operations such as addition, subtraction, multiplication, and division.

What are the advantages of transforming two functions into a maximum of two functions?

Transforming two functions into a maximum of two functions can simplify mathematical calculations and make it easier to analyze and understand the behavior of the functions.

Is it always possible to transform two functions into a maximum of two functions?

No, it may not always be possible to transform two functions into a maximum of two functions. The conditions for this transformation depend on the properties and behavior of the original functions.

Can the transformation of two functions into a maximum of two functions change the overall behavior of the functions?

Yes, depending on the operations used for transformation, the overall behavior of the functions may change. For example, if the transformation involves taking the derivative of the functions, it may change the rate of change of the functions.

Are there any limitations to transforming two functions into a maximum of two functions?

Yes, there may be limitations depending on the properties of the original functions. For example, if the original functions are discontinuous, the resulting functions may also be discontinuous. Additionally, some operations may not be possible for certain types of functions, such as complex-valued functions.

Back
Top