What is the correct solution for Fourier transform of unit step signal? The unit step signal defined as

$$
 u[n]= \lbrace 1; n&gt;=0; \\
               \qquad0; n&lt;0 \rbrace
$$

has three possible solutions for its Fourier domain representation depending on the type of approach. These are as follows -


The widely followed approach (Oppenheim Textbook)- calculating the Fourier transform of the unit step function from the Fourier transform of the signum function.


$$
     F(u[n])=U(j\omega) = \pi\delta(\omega)+\frac{1}{j\omega}
$$


Fourier Transform calculated from the Z transform of the unit step function (Refer Proakis Textbook, Digital Signal Processing Algorithms and applications,  pages 267,268 section 4.2.8 )


$$
     U(j\omega) = \frac {e^{\frac{j\omega}{2}}}{2j\sin \frac{\omega}{2}};   \omega \neq 2\pi k; k=0,1,2,3...
$$


Fourier transform calculated by splitting into even and odd functions - followed in Proakis Textbook (Refer Proakis Textbook, Digital Signal Processing Algorithms and applications, page 618 section 8.1 )
$$
      U(j\omega) = \pi\delta(\omega)+\frac{1}{1-e^{-j\omega}}
$$


The 2nd representation can be ignored since it is not a well-behaved function. But the approaches followed by Proakis and Oppenheim are equally valid (they extend the Fourier transform to include impulses in the frequency domain)
But the confusion is that they provide different solutions.

Is there any mistake in my understanding? or am I missing any crucial point?? Kindly help me understand this and the correct form that can be used in all applications. (I found that the Oppenheim approach is used in deriving the Kramers-Kronig Relations and the Proakis approach used in the derivation of the Hilbert transform)
As Matt said, the second and third definition are the same except for the part with impulse. The impulse ($\pi\delta(\omega)$) account for the DC value of $u[n]$. Without that term (i.e., the second definition) it is actually the FT of $v[n]=\frac{1}{2}\operatorname{sgn}[n]$. We have $u[n]=v[n]+\frac{1}{2}$. And hence the FT of $u[n]$ has the additional term to account for the addition of $\frac{1}{2}$. Also, the discrete time FT (or DTFT) of $u[n]$ is properly written as $U(e^{j\omega})$.

The first definition, $U(j\omega)$ is the "continuous time" FT (or CTFT) of $u(t)$ (not $u[n]$) and hence different from the other two definitions.