Given two functions in closed form such that f(x) is the same for all x for both functions, is there always a way to manipulate either function to make it so they are written exactly the same or can you have two functions that can be proven equivalent yet neither can be simplified to look the same as the other?
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top
Your question is equivalent to asking if there is some normal form for every closed form expression that we can reduce equivalent expressions to.
Now the answer depends on the kind of formal system you use, i.e. what exactly you call closed form. Surely when we're restricting ourselves to few enough operations, there is. Take e.g. arithmetic terms containing natural numbers, +, $\cdot$ and variables, we can completely simplify the terms, thus yielding a normal form.
However for some not too complicated systems like λ-calculus, which just consists of function creation and application, is has been proven that deciding whether two terms are equivalent is already undecidable, so there is no normal form.
For an explicit description of a situation where the identity problem is recursively unsolvable, see Richardson's Theorem.
Here the allowed operations are the constant function $\log 2$, the ordinary operations of arithmetic, $\exp$, $\sin$, absolute value, and composition of functions. There is no algorithm to determine whether an expression $f(x)$ built up using the single variable $x$ and the allowed operations is identically equal to $0$ on the reals.