1
$\begingroup$

This question was motivated by trying to generalise the derivative of $\ln x$ to a homomorphism.

Let $f: \mathbb R^+ \to \mathbb R$ be such that $f(xy)=f(x)+f(y)$ for all positive real numbers $x$ and $y$.

We can show that $f(1)=0$ by considering $f(1\cdot y)=f(1)+f(y)$.

Assume that, for example, $f(2)=0$. We can show that $f(2^q)=0$ for all rational numbers $q$.

My first instinct was that $f(x)=0$ for all $x>0$, but I'm probably wrong.

QUESTION: If $f$ is continuous for all $x>0$ then does it follow that $f(x) \equiv 0$? If not, then how about $f$ being differentiable?

EDIT: I know about the logarithm. This question was motivated by trying to find the derivative of a function that satisfies the "laws of logs". Finding the derivative of a log function requires that it be one-to-one. So I asked myself: what if it is not one-to-one? We must have $f(1)=0$, so I assumed that $f(2)=0$ and it implied that $f(2^q)=0$ for all $q \in \mathbb Q$. I then thought that perhaps, if $f$ is continuous then $f(x) \equiv 0$.


Proof that $f(2^q)=0$ for all $q \in \mathbb Q$.

We can show that $f(2^{1/k})=0$ for all positive integers $k$:

$$0 \ \ = \ \ f(2^1) \ \ = \ \ f(\underbrace{2^{1/k}\cdots 2^{1/k}}_{k \ \mathrm{times}}) \ \ = \ f(2^{1/k})+\cdots+f(2^{1/k}) \ \ = \ \ k\cdot f(2^{1/k})$$

It follows that $f(2^{-1/k})=0$ for all positive integers $k$: $$0 \ \ = \ \ f(1) \ \ = \ \ f\left(\frac{1}{2^{1/k}} \cdot 2^{1/k}\right)\ \ = \ \ f\left(\frac{1}{2^{1/k}}\right)+f\left(2^{1/k}\right) \ \ = \ \ f\left(\frac{1}{2^{1/k}}\right)+0$$

We can show that $f(2^q)=0$ for all positive rational numbers $q=s/t$:

$$f(2^{s/t}) \ \ = \ \ f([2^{1/t}]^s) \ \ = \ \ f(\underbrace{2^{1/t} \cdots 2^{1/t}}_{s \ \mathrm{times}}) \ \ = \ \ s \cdot f(2^{1/t}) \ \ = \ \ s \cdot 0 \ \ = \ \ 0$$

It follows that $f(2^{-q})=0$ for all positive rational numbers $q=s/t$: $$0 \ \ = \ \ f(1) \ \ = \ \ f\left(\frac{1}{2^{s/t}} \cdot 2^{s/t}\right)\ \ = \ \ f\left(\frac{1}{2^{s/t}}\right)+f\left(2^{s/t}\right) \ \ = \ \ f\left(\frac{1}{2^{s/t}}\right)+0$$

Hence $f(2^q)=0$ for all rational numbers $q$.

  • 0
    notice that $\mathbb R^+$ is isomorphic to $\mathbb R$ via the map $f(x)=\ln(x)$.2017-01-06
  • 0
    "Continuous, and vanishes for some $a \neq 1$" suffices. Without continuity, there's a vast amount of flexibility. (Presumably you're aware of a famous non-trivial homomorphism between the multiplicative group of positive reals and the additive group of reals...?)2017-01-06
  • 0
    So investigating the group homomorphisms $\mathbb R^+ \rightarrow \mathbb R$ is the same as investigating the group endomorphisms of $\mathbb R$, and there is a ton of these.2017-01-06
  • 0
    @AndrewD.Hwang The motivation for the question was a generalisation of the derivative of $\log_b(x)$ from first principles. I was hoping to know the least possible restrictions to give $f(x) \equiv 0$ when adding the fact that $f(2)=0$.2017-01-06

4 Answers 4

3

The endomorphisms of $\mathbb R$ are vast, they are already a lot if you consider the linear functions $\mathbb R \rightarrow \mathbb R$ when looking at $\mathbb R $ as a vector space over $\mathbb Q$, and each of these is a group homomorphism.

The homomorfisms from $\mathbb R^+ $ to $\mathbb R$ are also a lot, since if $\varphi$ is an isomorphicm on $\mathbb R$ you always have the morfism obtained via the following composition:

$\mathbb R^+ \overbrace{\rightarrow}^{\ln} \mathbb R \overbrace{\rightarrow}^\varphi \mathbb R $


Suppose $f$ is continuous and $f(2)=0$. We can compose $f$ with the function $g(x)=e^x$. This gives us a homomorphims $f\circ g :\mathbb R \rightarrow \mathbb R$ that vanishes at some point $\alpha\neq 0$. Using the fact that $x$ is a homomorphism we can prove that $f(\alpha/n)=0$ for all $n$ and then prove that $f(m\alpha/n)=0$ also. Since this set is dense in $\mathbb R$ and the function is continuous we get that $f(x)=0$ for all $x$. Since $g$ is surjective it follows that $f$ is $0$ at every point.

In fact it suffices for $f$ to be measurable and vanish at some point, proving this is slightly harder and uses the Steinhaus theorem in measure theory.

  • 0
    Thanks for your reply, but I'm not sure that this answers my question. Given that $f(2^q)=0$ for all $q \in \mathbb Q$ it is tempting to think that $f(x)=0$ for all $x>0$ under some minor assumptions, e.g. continuity or differentiability. If $f$ is continuous, or differentiable, then does $f(x)=0$ for all $x>0$?2017-01-06
  • 0
    @FlybyNight I added a section on that.2017-01-06
1

If $$f(2^q)=0, \forall q \in \mathbb{Q}$$ then $$f(2^r)=0, \forall r \in \mathbb{R}$$ if $f$ is continous.

Proof: If $r \in \mathbb{R}$ then there is a sequence $(q_n,n=1,2,\ldots)$ such that $q_n \to r$ and therefore $f(q_n) \to f(r)$ becuase $f$ is continous. But $8f(q_n)=0$ and so $f(r)=0$.

$\blacksquare$

But the function $$\phi(t):t \to 2^t$$ is is a strictly increasing function from $\mathbb{R}$ to $\mathbb{R^+}$ and so $\phi$ is bijective from $\mathbb{R}$ to $\mathbb{R^+}$ . Therefore $f \equiv 0$

0

Not necessary zero. Take, for instance, $$f(x):=\ln x$$.

  • 0
    $\ln(2) \neq 0$.2017-01-06
  • 0
    @Fly by Night: Where, in definition/properties of your function, is saying that $f(2)$ must be zero?2017-01-06
  • 0
    Line 4: "Assume that, for example, $f(2)=0$. We can show that $f(2^q)=0$ for all rational numbers $q$." Then there are the several lines where I prove that $f(2^q)=0$.2017-01-06
  • 0
    @Fly by Night: That is my point. You mentioned "..for example..". It is not clear that $f(2)=0$ should be considered as a definitive property of your function in the first place.2017-01-06
  • 0
    @RobArthan See my edit to my question. I'm not sure that it wastes anyone's time: answering questions is optional.2017-01-06
  • 0
    @RobArthan I see that, and the point of my question is that assuming $f(2)=0$ gives $f(2^q)=0$ for all $q \in \mathbb Q$. The question is: is that enough to ensure that $f(x) = 0$ for all $x>0$? It's the details that I came here for.2017-01-07
  • 0
    @FlybyNight: your question was far from clear, but I believe I now understand what you were asking. I hope the answer I have just posted is useful.2017-01-07
-1

The multiplicative group $(\Bbb{R}^{+}, \times)$ is isomorphic to the additive group $(\Bbb{R}, +)$ via the mapping $x \mapsto \ln(x)$. So your problem is equivalent to one about additive homomorphisms: functions $h : \Bbb{R} \to \Bbb{R}$ such that $h(x + y) = h(x) + h(y).$ If such an $h$ is continuous, then it must be given by $h(x) = \lambda x$ for some $\lambda \in \Bbb{R}$ (which you can see by thinking about the values $h(m/n)$ for integer $m$ and $n$ using the homomorphism property and then using continuity). This means that if your $f$ is continuous and has $f(2) = 0$ then $f(x) = 0$ for all $x$. If you don't assume continuity, then information about $f(2)$ will not determine $f(x)$ for all values of $x$.