Proving e^ix = cos x + i sin x

  • Thread starter Thread starter Hyperreality
  • Start date Start date
  • Tags Tags
    Cos Sin
Hyperreality
Messages
201
Reaction score
0
How can I proof the identity

e^ix = cos x + i sin x?
 
Mathematics news on Phys.org
Consider the infinite sums:
e^x = 1 + x/1! + x^2/2! + x^3/3! + ...
sin(x) = x/1! - x^3/3! + x^5/5! -x^7/7! + ...
cos(x) = 1 - x^2/2! + x^4/4! -x^6/6! + ...

e^ix = 1 + ix/1! + (ix)^2/2! + (ix)^3/3!...
Notice the patterns with the powers of i and rearrange the terms to see how they relate to sin and cos.
 
or check that both functions satisfy the same de and same initial conditions,

i.e. f'' + f = 0 and f(0) = 1, f'(0) = i.
 
Hyperreality said:
How can I proof the identity

e^ix = cos x + i sin x?

You could use the function z = cos(x) + i*sin(x) with z(0)=1 and dz/dx = -sin(x) + i*cos(x) = i*cos(x) + i^2*sin(x) = i*(cos(x)+i*sin(x)) = iz. Which gives dz/dx = iz <=> dz/z = i dx integration gives \int \frac{dz}{z} = \int i \ dx which gives ln(z) + C = ix + D => ln(z) = ix+E => z = e^(ix+E). Now we have that cos(x)+i*sin(x) = e^(ix+E), and with z(0)=1 it gives that e^(i*0+E)=e^E=1 => E=0 which yields e^(ix)=cos(x)+i*sin(x).

Edit: E = D - C
 
In other words, there are a number of different proofs, depending on what you already know and how you are defining the different functions.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Back
Top