- 10,876
- 423
The conditions we've been discussing are 3\leq \|f-g\| and \|f-g\|\leq 6. The first condition implies that the distance between the graphs along a vertical line must at some point be ≥3. The second implies that the distance between the graphs along a vertical line must never be ≥6.bugatti79 said:So, you are implying for the condition 3 \ge ||f-g|| we must add and subtract 3 on f(x)?
What the condition says about a given function g is that 6 is an upper bound for the set \{|f(t)-g(t)|:t\in[0,1]\}, and that no upper bound for that set is less than 6. Since 6 is an upper bound, we have |f(t)-g(t)|\leq 6, which implies -6\leq f(t)-g(t)\leq 6 for all t in [0,1]. So for all t in [0,1], f(t)-6 ≤ g(t) ≤ f(t)+6.bugatti79 said:Why do you subtract as well as add for this condition? The condition just says <=6, hence you just add 6...
You don't seem to be thinking at all about what the notation means. \|f-g\| is a number, as mentioned a couple of times above. So even if you turn the first inequality sign the right way, you would still be asking about where a pair of inequalities "intersects". That doesn't make any sense.bugatti79 said:And then wherever 3 \ge ||f-g||\le 6 intersect, is where g lies?
Edit: We posted almost at the same time. I had obviously not seen the post below when I wrote this one. I think what I said in this one answers what you asked in the post below. I'll add one more thing here, a minor correction to this:
g doesn't have to go outside of the region between graphs 2 and 3 (the graphs of f+3 and f-3). It just has to touch one of those graphs at least once.Fredrik said:Plot the graphs of the functions
\begin{align}
& x\mapsto x^3+9\\
& x\mapsto x^3+6\\
& x\mapsto x^3\\
& x\mapsto x^3-3
\end{align} and label them 1,2,3,4 respectively. Every g in D is contained in the region between graphs 1 and 4, and goes outside of the region between graphs 2 and 3 at least once.
Last edited:
