0

Let's start off with a simple function say $y = x$. Can it be written in terms of the natural logarithm? If so, are there any functions that cannot?

User3910
  • 2,390

2 Answers2

1

For any $x$ we have that

$$y=x \iff y=\ln e^x$$

and more in general

$$y=f(x) \iff y=\ln e^{f(x)}$$

Otherwise if we are interested in a $\log-\log$ identity

$$y=f(x) \implies \ln y = \ln (f(x))$$

is true only for $f(x)>0$.

user
  • 154,566
0

There are plenty of functions which cannot. For example, consider Ackermann's Function. It can be rigorously shown that $A(x)$ is not expressible in any way save recursively. You could add an $\ln$ to the definition, but it would still not be expressible in closed form.

  • I'm not sure what "it can be rigorously shown that $A(x)$ is not expressible in any way save recursively" means. It's true that the Ackermann function isn't primitive recursive, but I don't see why that implies what you've written. – Noah Schweber Nov 14 '18 at 15:21