3

show that: every function $h(x):R\to R$ can be written as $$h(x)=f(x)-g(x)$$ where $f(x),g(x)$ are satisfying the intermediate value property:

http://en.wikipedia.org/wiki/Intermediate_value_theorem

My try: since $f(x),g(x)$ are all such Intermediate value theorem

mean that:

so for $f(x)$,and for any $[a,b]$, there exsit $\xi\in(a,b)$,such $$f(\xi)=\eta,$$ where $f(a)<\eta<f(b)$

similar for $g(x)$,and for any $[c,d]$,there $\xi_{1}\in[c,d]$,such $$f(\xi_{1})=\eta_{1}$$ where $\eta_{1}\in (f(c),f(d))$

and Now How can for any function $h(x)$,then we always can $$h(x)=f(x)-g(x)$$ Thank you

math110
  • 93,304

2 Answers2

1

That is Sierpinski’s Theorem and you can find it on Beni Bogoşel blog over here.

(For your case, you need redefine $f_1$ and $f_2$ that mentioned there.)

Edit:

Theorem 3 in: Darboux functions - Beni Bogoşel.pdf

Salech Alhasov
  • 6,780
  • 2
  • 29
  • 47
0

Using the axiom of choice, you can achieve something stronger, namely that the image of any nonempty interval under $f$ and $g$ is all the real numbers.

Hint: Start by choosing a basis for $\mathbb R$ as a vector space over $\mathbb Q$. Then partition $\mathbb R$ into two dense locally continuum-sized sets $A$ and $B$, and make sure that $f$ will take all values on $(x,y)\cap A$ for any $x<y$ and $g$ will take all values on $(x,y)\cap B$ for any $x<y$. Then choose the values of $f$ on $B$ and $g$ on $A$ such that their difference is the desired $h$.