Assign 2 PDF
Assign 2 PDF
(3) Show that the following analogue of the mean value theorem is false for C-differentiable
functions: Suppose f is C-differentiable on an open subset U ⊂ C and l is a
line-segment which lies fully within U . Call the end-points of l as a, b; then, in
particular a, b are a pair of points of U . Show that the assertion/statement that
there exists a point c on the line-segment l such that
is false.
Show that the radius of convergence of this series is 1 and recall that taking
w = x real, just gives the usual Taylor series of log(1 + x) studied in one-
variable Calculus or Real Analysis. Prove then that
exp(f (z − 1)) = z
for all z in D1 (1), the disc centered at the point 1 with radius 1. Conclude
therefore that
∞ n
n−1 (z − 1)
X
f (z − 1) = (−1)
n=1
n
(ii) Let z0 ∈ C∗ . Let ζ be any complex number such that exp(ζ) = z0 . For z in
the disc D|z0 | (z0 ) define
z z − z0
g(z) = f −1 +ζ =f + ζ.
z0 z0
Prove that exp ◦ g is the identity function on D|z0 | (z0 ). Remark: f (z) and
g(z) may well differ by a constant (indeed, such a constant would be an in-
teger multiple of 2πi and that’s the most that can go ‘wrong’), if the discs
D1 (1) and D|z0 | (z0 ) intersect and z is a point in their intersection. Finally
prove that g and thereby every right inverse of the exponential map which is
given by a power series, centered at some point in C∗ is infinitely many times
C-differentiable.
(5) Partial fraction expansion – a simple case of decomposition of functions: While we’ve
been discussing ways of constructing new-functions out-of-old, systematically, more
and more complex(!), it’s important in applications to perform the reverse i.e.,
break down complex functions into simple ones. The FTA (fundamental theorem
of algebra) already does this for an arbitrary non-constant polynomials by leading
to their expression as a product of powers of linear polynomials. Derive out of
this, the following decomposition result for rational functions. Let R = P1 /P2 be
any rational function which we may well assume to be in reduced form i.e., P1 , P2
are polynomials with P2 6≡ 0 and with gcd(P1 , P2 ) = 1. Prove that there exists a
polynomial Q(z) and constants ck,j ∈ C, integers nj for j = 1, . . . , N := deg(R2 ),
such that
N X nj
X ck,j
R(z) = Q(z) +
j=1 k=1
(z − zj )k
Thus: every rational fraction can be decomposed into a (finite) sum of powers-of-
simple-rational functions, upto a polynomial Q; here, by a simple non-polynomial
rational function we mean a function of the form r(z) = 1/(z − ζ) for some fixed
ζ ∈ C. Such partial fraction decompositions (PFDs) have many applications:
within mathematics, for instance in computing integrals in basic calculus of a
single real variable; while this itself is of use in real world applications of basic
calculus, PFDs also help solving certain differential equations that arise in engi-
neering problems using the Laplace transform and its inverse.
(Hint: First argue that you may assume a0 (z) = 1; then solve for f by a formal
power series. Then, show that this formal power series converges).
(12) Show that the real and imaginary parts u, v of a C-differentiable function f = u+iv
on a domain D ⊂ C satisfy the Laplace equation, assuming that they are C 2 -
smooth – recall that, we say that a f satisfies the Laplace equation if
∂ 2f ∂ 2f
∆f := + ≡0
∂x2 ∂y 2
ASSIGNMENT – 2 5
It’s implicitly assumed here that the partial derivatives appearing in the above all
exist on the domain (open + connected subset of R2 ) where f is defined.
Next, for each of the following functions, show that either a C-differentiable func-
tion f exists with the given function being its real part (in which case, determine
f ) on some domain or prove that none exists:
(i):
x2 + y 2
u1 (x, y) =
1 + 2x + x2 + y 2
(ii):
x(1 + x2 + y 2 )
u2 (x, y) = .
1 − 2x2 − 2y 2 + (x2 + y 2 )2