Problem-solving recipes
A step-by-step procedure for every problem type this course teaches — what to do first, what to do next, and how to tell which case you're in.
What are you being asked to do?
Start with what you're actually being asked to produce.
Convert a complex number between rectangular and exponential form — the readiness recipe.
Factor a polynomial completely over \mathbb C, or count its roots — the fundamental-theorem-of-algebra recipe.
Given one harmonic function, find its harmonic conjugate — the Cauchy-Riemann recipe.
Evaluate \exp(z) or \operatorname{Log}(z) for a specific z — the two elementary-function recipes; the logarithm one is also where branch-cut subtleties like \operatorname{Log}(z^2) vs. 2\operatorname{Log}(z) get resolved.
Evaluate a contour integral — parametrize and integrate directly, unless an antiderivative exists on the whole domain, in which case the antiderivative recipe is faster; unless the integrand is a quotient with a power in the denominator, in which case the Cauchy derivative-formula recipe applies instead of either.
Need a Laurent series on one specific named annulus, not just anywhere it happens to converge — the Laurent-in-an-annulus recipe.
Given an isolated singularity, need to know removable, pole, or essential — the singularity-classification recipe; once it's confirmed to be a pole, the residue-at-a-pole recipe finds \operatorname{Res}_{z=z_0}f from that classification.
Need a real improper integral over the whole line, or a real integral of sine and cosine over one period — the semicircular- contour recipe for the first shape, the unit-circle-substitution recipe for the second.
Given two points in the unit disk, need a pseudo-hyperbolic distance or an automorphism-recognition verdict — the Schwarz-Pick recipe; given three points and where each one should land instead, the three-point Mobius-construction recipe.
Evaluate \Gamma(z) — the defining-integral recipe for \operatorname{Re}(z)>0 directly; the functional-equation recipe for values reached by recursion or the reflection formula instead.
Readiness
Elementary complex functions
Complex integration
Evaluate a contour integral using an antiderivative
Use when: you're asked for \int_C f(z)\,dz and you can write down a candidate F with F'(z)=f(z)
Goal: the contour integral's value as F(z_1)-F(z_0), in one step, with no parametrization or integration along C required
Antiderivatives and path independence
Faster than direct parametrization when an antiderivative exists on the whole domain.
Evaluate a contour integral with the derivative formula
Use when: the integrand has a single point z_0 raised to a power in the denominator, \dfrac{f(z)}{(z-z_0)^{k}}, with f analytic and z_0 strictly inside a simple closed contour C
Goal: the integral's exact value, obtained from a derivative of f at one point instead of any integration
The derivative formula
For a quotient with a power in the denominator, once Cauchy's theorem applies.
Laurent series and singularities
Find the residue at a pole of finite order
Use when: you've confirmed z_0 is a pole of finite order m and need \operatorname{Res}_{z=z_0}f
Goal: the residue \operatorname{Res}_{z=z_0}f, computed from a finite number of derivatives instead of a full Laurent expansion
The pole order and residue shortcut formula
Needs the classification recipe above first, to confirm z0 is a pole and find its order.
Applications of residues
Mobius transformations and conformal mapping
The gamma function
Evaluate Gamma(z) using the functional equation
Use when: you need \Gamma(z) at an integer, a half-integer, or any point reached from a known value by whole-integer shifts, especially where \operatorname{Re}(z)\le0 so the defining integral doesn't converge
Goal: \Gamma(z)'s value, or confirmation that z is a pole with no finite value, built from a known starting value using only algebra, no integration
The functional equation and the reflection formula
A genuinely different technique (algebraic recursion and reflection) from the defining-integral recipe above, not an extension of it.