Complex Analysis Theorem Cheatsheet (Midterm)
Complex Analysis Theorem Cheatsheet (Midterm)
Complex Analysis Theorem Cheatsheet (Midterm)
There-
fore, if hA has 3 xed points, then it is hI .
1. The set S is closed ⇐⇒ S is openc
5. Let T be a Möbius transformation and z1 , z2 , z3 , z4 ∈ C be
2. Let G ∈ C be an open set. The following denitions for distinct points. Then [z1 , z2 , z3, z4 ] = [T z1 , T z2 , T z3 , T z4 ].
connectivity are equivalent:
Therefore, if w1 , w2 , w3, w4 ∈ C are distinct, there exists a
(a) G cannot be decomposed into two disjoint open sets: Möbius transformation such that ∀1≤j≤4 T zj = wj
X ⊆ G is open and X \ G is open, then either X = G 6. Suppose a Möbius transformation operates on a clircle:
or X = ∅. C1 7−→ C2 . Then every pair of points symmetric to C1
(b) Let a, b ∈ G. So there exitsts a polygonal curve that is transformed to a pair of points symmetric to C2 .
starts at a and ends at b. 7. Suppose z2 , z3 , z4 are distinct and on the clircle C . Then
(c) For each locally constant f : G → C, f is necessarily [z1 ]C , z2 , z3 , z4 = [z1 , z2 , z3, z4 ].
∗
globally constant.
(d) Every continuous f : G → R veries the intermediate 8. zj , 1 ≤ j ≤ 4 are all on the same clircle if (z1 , z2 , z3 , z4 ) ∈ R.
value property: ∃α, β.f (α) = s, f (β) = t ⇒ [s, t] ⊆
Img (f ) Functions
1. Let G ⊆ C be a domain, u1 , u2 be branches of log. Then
Dierentiation u1 − u2 ≡ const.
1. If f is dierentiable at z0 , g is dierentiable at w0 = f (z0 ), 2. Let G ⊆ C be a domain, l : G → C be a branch of log. Then
then dtd g (f (z))z=z0 = g 0 (w0 ) f (z0 ). l is holomorphic and l0 (z) = z1 .
2. For each A ∈ GL2 , hA (z) transformations clircles to clircles. 5. Tauber's theorem: Suppose n |cn | n→∞→ P 0, and f (z) =
cn z n has a limit limR3n→1 f (x) = L, so cn = L.
P
3. If A, B ∈ GL2 , then hA ◦ hB = hAB . Therefore:
6. Abel's theorem: Suppose cn converges. Then if
P
(a) ∀λ 6= 0, hλA = hA . zn → 1 and sup 1−|z
n→∞ |zn −1|
< ∞ , then limn→∞ f (zn ) = cn .
P
n|
(b) hλdd¯ = hI .