Proof of de Moivre's formula from Euler's formula
Builds on Euler's formulaProduct of exponentialsComplex exponentialSine and cosine
Proof
- Let be real. Since is real, the power series of and are the real sine and cosine. So Euler's formula gives for every real .
- In the series for the complex exponential at , every term with is . So .
- Claim: for each integer and each real . We argue by induction on .
- For , both sides equal , by step 2.
- Assume the claim for . By the product of exponentials, . This proves the claim.
- By the product of exponentials and step 2, . So and . Thus negative powers of are defined.
- Let with a positive integer. Then , by step 6.
- Step 3, applied to the real number , gives . So for every integer .
- By step 1 for and for , .
Idea
Euler's formula turns into . Powers of an exponential multiply the exponent, because exponentials turn sums into products. Negative powers work since is the inverse of .
Reading path
To understand this page from the ground up, read these 111 pages in order. The foundations come first. The path takes the proofs Proof of the limit of a sum of sequences, Proof of the approximation property of the supremum, Proof that a complex number times its conjugate is the square of its modulus, Proof of the equality of complex numbers, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof that subsequences of a convergent sequence converge to the same limit, Proof of the limit of a product of sequences, Proof that the absolute value is multiplicative, Proof of the squeeze theorem for sequences, Proof of the existence of square roots of nonnegative reals, Proof of Pascal's rule from the recursive definition, Proof that i squared is minus one, Proof of the triangle inequality for real numbers, Proof of the epsilon-N definition of the limit of a sequence, Proof that the modulus is multiplicative, Proof of the factorial formula for binomial coefficients by induction, Proof of the product of exponentials by the Cauchy product, Proof that the complex numbers form a field, Proof of the binomial theorem by induction, Proof that convergent sequences are bounded, Proof of the monotone convergence theorem for sequences, Proof of Euler's formula by power series, Proof that a series of nonnegative terms converges iff its partial sums are bounded, Proof that the Cauchy product of absolutely convergent series converges absolutely to the product.
- Binomial coefficient definition
- Complex numbers object
- Complex numbers as pairs of reals concept
- Construction of the reals from Cauchy sequences concept
- Element definition
- Factorial definition
- Group concept
- Imaginary unit object
- Integers object
- Mathematical induction concept
- Ordered field definition
- Proposition concept
- Rational numbers object
- Real numbers object
- Sequence definition
- Set bounded above definition
- Proof of Pascal's rule from the recursive definition proof
- Complex exponential definition
- Power series in the complex plane definition
- Real and imaginary parts definition
- Proof that i squared is minus one proof
- Set definition
- Ring definition
- Ring of integers statement
- Implication definition
- Predicate definition
- The reals form a field statement
- Real sequence definition
- Subsequence definition
- Supremum definition
- Pascal's rule statement
- Complex conjugate definition
- i squared is minus one statement
- Ordered pair definition
- Commutative ring definition
- Unit of a ring definition
- Universal quantifier definition
- The rationals form a field statement
- Bounded sequence definition
- Limit of a sequence definition
- Monotone sequence definition
- Series definition
- Completeness axiom statement
- Proof of the factorial formula for binomial coefficients by induction proof
- Cartesian product definition
- Proof of the equality of complex numbers proof
- Field definition
- Subset definition
- The rationals form an ordered field statement
- Convergent sequence definition
- Cauchy product definition
- Partial sum definition
- Power series definition
- Factorial formula for binomial coefficients statement
- Binary relation definition
- Equality of complex numbers statement
- Order on the reals definition
- Convergent series definition
- Sine and cosine definition
- Antisymmetric relation definition
- Proof of the binomial theorem by induction proof
- Reflexive relation definition
- Transitive relation definition
- Proof that the complex numbers form a field proof
- Sum of a series definition
- Absolute convergence definition
- Binomial theorem statement
- Preorder definition
- The complex numbers form a field statement
- Partial order definition
- Total order definition
- Proof that the reals form an ordered field, with the Cauchy sequence construction proof
- The reals form an ordered field statement
- Absolute value definition
- Proof of the approximation property of the supremum proof
- Proof of the existence of square roots of nonnegative reals proof
- Proof of the triangle inequality for real numbers proof
- Proof that the absolute value is multiplicative proof
- Proof of the epsilon-N definition of the limit of a sequence proof
- Existence of square roots of nonnegative reals statement
- Approximation property of the supremum statement
- Triangle inequality statement
- Absolute value is multiplicative statement
- Square root definition
- Epsilon-N definition of the limit of a sequence statement
- Proof of the limit of a sum of sequences proof
- Proof of the squeeze theorem for sequences proof
- Modulus of a complex number definition
- Proof that convergent sequences are bounded proof
- Proof that subsequences of a convergent sequence converge to the same limit proof
- Proof of the monotone convergence theorem for sequences proof
- Proof that a complex number times its conjugate is the square of its modulus proof
- Limit of a sum of sequences statement
- Convergent sequences are bounded statement
- Squeeze theorem statement
- Subsequences of a convergent sequence converge to the same limit statement
- Monotone convergence theorem for sequences statement
- A complex number times its conjugate statement
- Proof of the limit of a product of sequences proof
- Proof that a series of nonnegative terms converges iff its partial sums are bounded proof
- Proof that the modulus is multiplicative proof
- Limit of a product of sequences statement
- A series of nonnegative terms converges iff its partial sums are bounded statement
- Modulus is multiplicative statement
- Proof of Euler's formula by power series proof
- Proof that the Cauchy product of absolutely convergent series converges absolutely to the product proof
- Euler's formula statement
- Cauchy product of absolutely convergent series statement
- Proof of the product of exponentials by the Cauchy product proof
- Product of exponentials statement
- Proof of de Moivre's formula from Euler's formula proof
Where this leads
30 pages build on this one.
- de Moivre's formula
- The nth roots of unity
- exp(2 pi i/n) is a primitive root of unity
- Impossibility of doubling the cube
- Number of nth roots of unity
- Impossibility of trisecting the angle
- Quadratic formula
- The constructible numbers form a field closed under square roots
- Wedderburn's little theorem
- Irreducibility of the cyclotomic polynomials over the rationals
- The degree of a constructible number is a power of two
- Impossibility of squaring the circle
- Gauss–Wantzel theorem
- Existence of nth roots of complex numbers
- Proof of Wedderburn's little theorem by the class equation and cyclotomic polynomials
- Proof of the impossibility of doubling the cube
- Proof of the impossibility of squaring the circle
- Proof of the description of the nth roots of unity
- Finite Desarguesian planes are Pappian
- Proof that the constructible numbers form the smallest subfield of the complex numbers closed under square roots
- Proof that exp(2 pi i/n) is a primitive root of unity
- Cyclotomic field
- Proof that there are exactly n nth roots of unity
- Proof that the degree of a constructible number is a power of two
- Proof of the irreducibility of the cyclotomic polynomials by reduction modulo primes
- Proof of the existence of nth roots of complex numbers
- Veblen–Young theorem
- Proof of the impossibility of trisecting the angle
- Proof of the Gauss–Wantzel theorem
- Impossibility of the classical construction problems
Further reading
- Web https://en.wikipedia.org/wiki/De_Moivre%27s_formula, Relation to Euler's formula
About this page
| Tag | 21PKVV5S4Y |
|---|---|
| URI | m2://21PKVV5S4Y |
| Kind | proof |
| Writing | W0 stub |
| MSC | 33B10 |
| Proves | de Moivre's formula |
| Uses | Euler's formula, Product of exponentials, Complex exponential, Sine and cosine |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.