Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Do there exist functions $F,G$ on $[0,1]$ with $0\le F,G< 1$, such that for all $x, y\in [0,1]$ with $x+y\le 1$, the following hold?
$G(x)\le x$,
$G(1)<1$,
$F(x)>0$ if $x>0$,
$\min(y,F(x)) \le G(x+y)-G(x)$.
$G(x)\le x$
$G(1)<1$
$F(x)>0$
$\min(y,F(x)) \le G(x+y)-G(x)$
$F(x)+G(x)<1$$G(1)<1$
$x>0, G(x)=0 \Longrightarrow F(x)>0$$F(x)>0$
If the answer is yes, I'd be more interested in a specific, simpler example, than in a large or complete, but more complex, class of solutions.
$F(x)+G(x)<1$
$x>0, G(x)=0 \Longrightarrow F(x)>0$