Proving the Inequality of Infimums for Bounded Functions on [0,1]

[namekyd]

I Just started Analysis 1 this week and I've encountered some tricky problems in the Assignment

Homework Statement

Let f,g : [0,1] -> R be bounded functions.
Prove that inf{ f(x) + g(1-x) : x (element of) [0,1]} >= inf{f(x) : x (element of) [0,1]} + inf{g(x) : x (element of) [0,1]}

Homework Equations

Perhaps the triangle inequality?

The Attempt at a Solution

I know that g(1-x) is still the same function over the same domain as g(x) however it runs in the opposite direction of the original function, thus making f(x) + g(1-x) a different function that f(x) + g(x). I do not know however, how that function is different.

 

[micromass]

The g(1-x) is just a read herring, since

$inf_{x\in [0,1]}{g(1-x)}=inf_{x\in [0,1]}{g(x)}$

Convince yourself of that.

Anyway. To prove that inequality of yours. Take an $x\in [0,1]$ arbitrary. Can you prove that

$$f(x)+g(1-x)\geq inf_{x\in [0,1]}{f(x)}+inf_{x\in [0,1]}{g(x)}$$
??

 

[namekyd]

I'm having a bit of trouble with it.

I know that I can use the triangle inequality to say that |f(x) + g(1-x)| <= |f(x)| + |g(1-x)|
I am unsure as to how to proceed from there, I have been thinking perhaps using the Completeness Property to say that |f(x)| + |g(1-x)| >= -[f(x) + g(1-x)] but that doesn't seem right.P.s. thank you for the quick reply

 

[micromass]

I'm having a bit of trouble with it.

I know that I can use the triangle inequality to say that |f(x) + g(1-x)| <= |f(x)| + |g(1-x)|
I am unsure as to how to proceed from there, I have been thinking perhaps using the Completeness Property to say that |f(x)| + |g(1-x)| >= -[f(x) + g(1-x)] but that doesn't seem right.


P.s. thank you for the quick reply

Why use the triangle inequality anyway?? I see no absolute value signs anywhere...

 

[namekyd]

Perhaps I am misunderstanding the way to solve the problem here.
In my mind I would
a) show that Inf{ f(x) + g(1-x) } >= inf{f(x)} + inf {g(1-x)}
b) show that g(1-x) = g(x) for the domain [0,1] and hence that Inf{ f(x) + g(1-x) } >= inf{f(x)} + inf {g(x)}

I don't know how to show (a). nothing in my textbook is leading me to the conclusion that the infimum of the sum of two functions is greater than or equal to the sum of the infima of the two functions

 

[micromass]

Perhaps I am misunderstanding the way to solve the problem here.
In my mind I would
a) show that Inf{ f(x) + g(1-x) } >= inf{f(x)} + inf {g(1-x)}
b) show that g(1-x) = g(x) for the domain [0,1] and hence that Inf{ f(x) + g(1-x) } >= inf{f(x)} + inf {g(x)}

I don't know how to show (a). nothing in my textbook is leading me to the conclusion that the infimum of the sum of two functions is greater than or equal to the sum of the infima of the two functions

Well, what is the definition of an inf? It's the greatest lower bound right??
Why not show that $inf(g(x))+inf(f(x))$ is a lower bound. Then you have immediately your inequality since $inf(f(x)+g(1-x))$ is the greatest lower bound.

(b) is false, by the way. It's not true in general that g(1-x)=g(x). It is true that

$inf(g(x))=inf(g(1-x))$

though...

 

[namekyd]

sorry that's what i meant for b

 

[micromass]

Can you prove that for t in [0,1] that

$$f(t)\geq inf_{x\in [0,1]}f(x)$$

and

$$g(1-t)\geq inf_{x\in [0,1]}g(x)$$

??

 

[namekyd]

ahhh got it, thank you so much