3.5.10Complex Numbers

De Moivre's theorem — statement, proof, applications

1,627 words7 min readdifficulty · medium6 backlinks

WHAT is the statement?

WHY does it look this way? Because cosθ+isinθ=eiθ\cos\theta+i\sin\theta = e^{i\theta} (Euler), so the LHS is (eiθ)n=einθ=cosnθ+isinnθ(e^{i\theta})^n = e^{in\theta} = \cos n\theta + i\sin n\theta. That's the "cheat" proof — but we should earn it from scratch.


HOW to prove it (from first principles)

Step 0 — the key multiplication fact

Take z1=cisαz_1 = \operatorname{cis}\alpha and z2=cisβz_2 = \operatorname{cis}\beta. Multiply: z1z2=(cosα+isinα)(cosβ+isinβ).z_1z_2 = (\cos\alpha + i\sin\alpha)(\cos\beta + i\sin\beta). Why expand? To collect real and imaginary parts. =(cosαcosβsinαsinβ)+i(sinαcosβ+cosαsinβ).= (\cos\alpha\cos\beta - \sin\alpha\sin\beta) + i(\sin\alpha\cos\beta + \cos\alpha\sin\beta). Why does this simplify? Those two brackets are exactly the angle-addition formulas: =cos(α+β)+isin(α+β)=cis(α+β).= \cos(\alpha+\beta) + i\sin(\alpha+\beta) = \operatorname{cis}(\alpha+\beta). So multiplying cis's adds the angles. This single fact powers everything.

Step 1 — positive integers by induction

Base case n=1n=1: (cisθ)1=cisθ=cis(1θ)(\operatorname{cis}\theta)^1 = \operatorname{cis}\theta = \operatorname{cis}(1\cdot\theta). ✔

Inductive step: assume (cisθ)k=cis(kθ)(\operatorname{cis}\theta)^k = \operatorname{cis}(k\theta). Then (cisθ)k+1=(cisθ)kcisθ=cis(kθ)cisθ.(\operatorname{cis}\theta)^{k+1} = (\operatorname{cis}\theta)^k \cdot \operatorname{cis}\theta = \operatorname{cis}(k\theta)\cdot\operatorname{cis}\theta. Why can I use Step 0 now? Because we're multiplying two cis's — so angles add: =cis(kθ+θ)=cis((k+1)θ). = \operatorname{cis}(k\theta + \theta) = \operatorname{cis}\big((k+1)\theta\big). \ \checkmark By induction it holds for all positive integers.

Step 2 — n=0n = 0

(cisθ)0=1=cos0+isin0=cis(0θ)(\operatorname{cis}\theta)^0 = 1 = \cos 0 + i\sin 0 = \operatorname{cis}(0\cdot\theta). ✔

Step 3 — negative integers

Let n=mn=-m with m>0m>0. Then (cisθ)m=1(cisθ)m=1cis(mθ)(\operatorname{cis}\theta)^{-m} = \dfrac{1}{(\operatorname{cis}\theta)^m} = \dfrac{1}{\operatorname{cis}(m\theta)}. Why is the reciprocal easy? Because cis(mθ)=1|\operatorname{cis}(m\theta)| = 1, so its inverse is its conjugate: 1cosmθ+isinmθ=cosmθisinmθcos2mθ+sin2mθ=cosmθisinmθ=cis(mθ).\frac{1}{\cos m\theta + i\sin m\theta} = \frac{\cos m\theta - i\sin m\theta}{\cos^2 m\theta + \sin^2 m\theta} = \cos m\theta - i\sin m\theta = \operatorname{cis}(-m\theta). So (cisθ)m=cis(mθ)=cis(nθ)(\operatorname{cis}\theta)^{-m} = \operatorname{cis}(-m\theta) = \operatorname{cis}(n\theta). ✔ Theorem holds for all integers.

Figure — De Moivre's theorem — statement, proof, applications

Applications

A) nn-th roots of a complex number

To solve zn=wz^n = w where w=rcisϕw = r\operatorname{cis}\phi: write z=ρcisψz = \rho\operatorname{cis}\psi. Then zn=ρncis(nψ)=rcisϕz^n = \rho^n\operatorname{cis}(n\psi) = r\operatorname{cis}\phi. Why add 2πk2\pi k? Because angles ϕ\phi and ϕ+2πk\phi+2\pi k label the same ww. Matching: ρ=r1/n,nψ=ϕ+2πk    ψ=ϕ+2πkn.\rho = r^{1/n}, \qquad n\psi = \phi + 2\pi k \implies \psi = \frac{\phi + 2\pi k}{n}. zk=r1/ncis ⁣(ϕ+2πkn),k=0,1,,n1.\boxed{\,z_k = r^{1/n}\operatorname{cis}\!\left(\frac{\phi + 2\pi k}{n}\right),\quad k = 0,1,\dots,n-1.\,} These are nn points equally spaced by 2π/n2\pi/n on a circle of radius r1/nr^{1/n}.

B) Multiple-angle identities

Expand (cosθ+isinθ)n(\cos\theta + i\sin\theta)^n with the binomial theorem, then equate real/imaginary parts to cosnθ\cos n\theta and sinnθ\sin n\theta.

C) Sums like coskθ\sum\cos k\theta via geometric series of ciskθ\operatorname{cis}k\theta.


Worked examples


Recall Feynman: explain to a 12-year-old

Imagine a clock hand of some length. Every time you "multiply" the hand by itself, you spin it by its own angle and stretch it. Do that nn times and the hand has spun nn times its angle and stretched nn-fold. That's the whole theorem: spinning adds up, stretching multiplies up. Going backwards (finding roots) means: to spin somewhere in nn steps, cut the angle into nn equal slices — and since a full turn (360°360°) lands you back home, there are exactly nn starting spots evenly around a circle.


Flashcards

De Moivre's theorem statement (integer nn)
(cosθ+isinθ)n=cosnθ+isinnθ(\cos\theta+i\sin\theta)^n = \cos n\theta + i\sin n\theta.
Key identity used in the proof's multiplication step
The angle-addition formulas: cisαcisβ=cis(α+β)\operatorname{cis}\alpha\cdot\operatorname{cis}\beta=\operatorname{cis}(\alpha+\beta).
How do modulus and argument behave under the nn-th power?
Modulus rn\to r^n (multiplies), argument nθ\to n\theta (adds).
Formula for the nn nn-th roots of rcisϕr\operatorname{cis}\phi
zk=r1/ncis ⁣(ϕ+2πkn), k=0,,n1z_k = r^{1/n}\operatorname{cis}\!\big(\frac{\phi+2\pi k}{n}\big),\ k=0,\dots,n-1.
Why exactly nn roots?
Adding 2πk2\pi k to the argument gives distinct angles only for k=0,,n1k=0,\dots,n-1 (then they repeat).
cos3θ\cos 3\theta in terms of cosθ\cos\theta
4cos3θ3cosθ4\cos^3\theta - 3\cos\theta.
sin3θ\sin 3\theta in terms of sinθ\sin\theta
3sinθ4sin3θ3\sin\theta - 4\sin^3\theta.
How to prove De Moivre for negative nn?
Take reciprocal; since cis(mθ)=1|\operatorname{cis}(m\theta)|=1, its inverse is its conjugate cis(mθ)\operatorname{cis}(-m\theta).
Value of (1+i)8(1+i)^8
1616.
Sum of the three cube roots of unity
00.

Connections

  • Polar form of complex numbers — the rcisθr\operatorname{cis}\theta representation this relies on.
  • Euler's formulaeiθ=cisθe^{i\theta}=\operatorname{cis}\theta makes De Moivre a one-liner.
  • Roots of unity — the cleanest application (equally spaced points).
  • Binomial theorem — used to extract multiple-angle identities.
  • Argand diagram — geometric picture of spin-and-stretch.
  • Trigonometric identities — angle-addition formulas power the proof.

Concept Map

Euler identity

multiply arrows

Step 0 key fact

uses

quick cheat proof

induction base and step

proves

n equals 0 case

proves

reciprocal via conjugate

proves

general form

Polar form arrow r at angle theta

cis theta equals e to i theta

Multiply lengths add angles

cis alpha times cis beta equals cis alpha plus beta

Angle-addition formulas

De Moivre's Theorem

Positive integers case

Zero power gives 1

Negative integers case

r cis theta to n equals r to n cis n theta

Hinglish (regional understanding)

Intuition Hinglish mein samjho

Dekho, complex number ko ek arrow samjho jo origin se nikalta hai — uski length hai modulus rr, aur uska angle hai argument θ\theta. De Moivre's theorem ka core idea bas itna hai: jab tum do complex numbers ko multiply karte ho, toh unki lengths multiply hoti hain aur angles add hote hain. Isliye jab kisi number ko power nn tak le jaate ho, toh length ban jaati hai rnr^n aur angle ban jaata hai nθn\theta. Yani (cisθ)n=cis(nθ)(\operatorname{cis}\theta)^n = \operatorname{cis}(n\theta).

Proof bhi seedha hai. Pehle prove karo ki cisα×cisβ=cis(α+β)\operatorname{cis}\alpha \times \operatorname{cis}\beta = \operatorname{cis}(\alpha+\beta) — yeh sirf cos(α+β)\cos(\alpha+\beta) aur sin(α+β)\sin(\alpha+\beta) wale trig formulas hain. Uske baad induction lagao: agar n=kn=k ke liye sach hai, toh ek aur cisθ\operatorname{cis}\theta multiply karke angle mein θ\theta add ho jaata hai, so n=k+1n=k+1 bhi ho gaya. Negative power ke liye reciprocal lo — modulus 1 hai isliye inverse conjugate ke barabar hota hai.

Application sabse mazedaar hai: roots nikalna. zn=wz^n = w solve karna ho toh length ka nn-th root lo aur angle ko nn se divide karo — lekin yaad rakho ek full circle 2π2\pi ghum ke wahi point aata hai, isliye angle mein 2πk2\pi k add karke nn alag-alag roots milte hain, jo circle par barabar-barabar (equally spaced) baithe hote hain. Isi se cube roots of unity aur cos3θ\cos 3\theta, sin3θ\sin 3\theta jaisi identities aasani se nikal aati hain. Exam mein yeh theorem gold hai — powers aur roots dono ek line mein ho jaate hain.

Go deeper — visual, from zero

Test yourself — Complex Numbers

Connections