2
$\begingroup$

Good day to everyone. I am interested in the geometric intuition for the following statement:

Let $f:\mathbb{R} \mapsto \mathbb{R}$ be a monotonically increasing, invertible function and $c,d \in \mathbb{R}$. Then for any $y \in \mathbb{R}$ we have \begin{equation} \Big(f(y) - c\Big) \Big( y - d \Big) \geq \Big(f(d) - c\Big) \Big( f^{-1}(c) - d \Big). \end{equation}

It is a lemma which I have encountered in the article (Lemma 3.1):
T. Kerkhoven and J. W. Jerome. $L_\infty$ stability of finite element approximations of elliptic gradient equations. Numerische Mathematik, 57:561, 1990.

The lemma is proven in the paper. The proof is analytic and it is rather elementary. However, it seems to me that this statement is releated to some geometric property of graphs of real increasing functions. And I am interested in this geometric intuition. Perhaps it is a standard argument, but I cannot see it. Thus my question is:

What are the geometrical reasons for the statement cited above?


Some thoughts:
It is maybe relevant to multiply the inequality by (-1), reversing its direction. It is so, because if we take $f(x):=x$, then also $f^{-1}(x) = x$ and we obtain $LHS:=(y-c)(y-d) \geq -(d-c)^2=:RHS$, so RHS is negative for all $c \neq d$. Thus if LHS is positive, then the signs differ and probably no geometrical argument can be given. So the interesting case would be when LHS is also negative.

2 Answers 2

2

I get very confused thinking geometrically with $y$ on the horizontal axis, so let us call the variable $x$ instead, and let $y = f(x)$. Also, let's say $x_1 = f^{-1}(c)$, $y_1 = c$, and $x_2 = d$, $y_2 = f(d)$, so that the points $(x_1,y_1)$ and $(x_2,y_2)$ lie on the monotonically increasing curve $y=f(x)$. The inequality becomes $(y-y_1)(x-x_2)\ge(y_2-y_1)(x_1-x_2).$ As $f$ is increasing, $y_2-y_1$ has the same sign as $x_2-x_1$, so the right-hand side is always negative. If $x$ is outside the interval between $x_1$ and $x_2$, the left-hand side is positive, so the inequality holds. The interesting part is when $x$ lies between $x_1$ and $x_2$, and here we will look at it geometrically.

Negate the inequality to obtain $(y-y_1)(x_2-x)\le(y_2-y_1)(x_2-x_1).$ Assuming $x_1, the right-hand side is the area of the rectangle $[x_1,x_2]\times[y_1,y_2]$, while the left-hand side is the area of $[x,x_2]\times[y_1,y]$. The latter rectangle is a subset of the former, so the inequality holds. If $x_1>x_2$, negate all four terms and you again get the positive areas of two rectangles, and the same reasoning applies.

  • 0
    Yes, I guess I didn't need to discard cases before moving to the geometrical argument. Thanks for your nice observation.2012-08-03
1

Put $f^{-1}(c)=:u$. Then we have to prove that $\bigl(f(y)-f(u)\bigr)(y-d)\geq\bigl(f(d)-f(u)\bigr)(u-d)$ or $\bigl(f(y)-f(u)\bigr)(d-y)\leq\bigl(f(d)-f(u)\bigr)(d-u)\ .$ Here the RHS is positive. When $y<\min\{u,d\}$ or $y>\max\{u,d\}$ then the LHS is negative. When $y$ is between $u$ and $d$ then the LHS is also positive, but both factors are less in absolute value than the coresponding factors on the RHS.

  • 0
    Christian: feel free to use the diagram linked in my previous comment.2012-08-03