2
$\begingroup$

Rudin ask:

If $g$ is a positive function on $(0,1)$ such that $g(x)\rightarrow \infty$ as $x\rightarrow 0$. Then there is a convex function $h$ on $(0,1)$ such that $h\le g$ and $h(x)\rightarrow \infty$ as $x\rightarrow 0$. True or False? Is the problem changed if $(0,1)$ is replaced by $(0,\infty)$ and $x\rightarrow 0$ replaced by $x\rightarrow \infty$?

I thought about using piece-wise linear functions $f_{n}$ to approximate $g$, and use convex functions $h_{ni}$ to approximate $f_{n}$. The selecting $h_{nn}$ we would be able to approximate $g$. But this missed a point; $g$ can be arbitrally strange. For example if we work with a basis for $\mathbb{R}/\mathbb{Q}$, then $g$ can even be dense in $\mathbb{R}$ in any subset of $(0,1)$. So a piecewise approximation is impossible. But is an approximation by convex functions still possible?

  • 0
    I think this is impossible.2012-12-25
  • 0
    $g$ cannot have a dense range on every subinterval because it tends to $\infty $ . Begin by defining $f(x)$ to be the infimum of $g$ on $ (0,x)$ - this is a monotone function.2012-12-25
  • 0
    This is a duplicate of http://math.stackexchange.com/questions/50549/given-a-real-function-g-satisfying-certain-conditions-can-we-construct-a-conv?rq=12012-12-25

1 Answers 1

1

Following Pavel M's suggestion, let us define $f(x)=\inf_{(0,x)}g(x)$. Then $f(x)$ is monotonely decreasing and $f(x)

Since $f$ is monotonely decreasing, during the interval $[a,b]$ $f(x)$'s value has to be between $f(a)$ and $f(b)$. So it is possible to make a convex function such that $f_{n}(x)\le f(b)-\frac{1}{2^{n}}$ on $[a,b]$.

We now define $f_{n}$ by a step by step process, with $f_{1}$ defined on $[1/4,3/4]$, $f_{2}$ defined on $[1/8,1/4]\cup [1/4, 3/4]\cup [3/4,7/8]$ and so on, with a convex "bump" function between neighboring intervals. Eventually we defined $\lim_{n\rightarrow \infty} f_{n}$ on the whole $(0,1)$. By our construction $f_{n}$ is convex for all $n$, and $f_{n}\le f\le g$, $\lim_{x\rightarrow 0}f_{n}(x)=\infty$ as desired.

  • 1
    Sorry, this solution does not look complete. It's not clear how $f_n$ are patched together to form a single convex function. "Convex bump between neighboring intervals" is much too vague. Note that you were not asked to "approximate" $g$, just to have growth near zero. I would let $h=\sup h_n$ where each $h_n$ is convex and piecewise linear of the form $h_n(x)=\max(M_n-k_n x,0)$. Then adjust $M_n,k_n$ so that $h_n\le f$ (one could work directly with $g$, too) and $M_n\to \infty$.2012-12-25
  • 0
    I think we can define the bump function step by step when we glue two linear functions, and then induct on to any of them. I will read your comment carefully.2012-12-26