0% found this document useful (0 votes)
355 views

Complex Analysis

The document summarizes key aspects of bilinear transformations in complex analysis. It defines a bilinear transformation as a Möbius transformation of the form w = T(z) = az+b/cz+d where ad-bc ≠ 0. It states that every bilinear transformation is bijective and invertible, with the inverse also being a bilinear transformation. It further describes that the composition of two bilinear transformations is also a bilinear transformation. The document also proves that any bilinear transformation has at most two fixed points, unless it is the identity transformation.

Uploaded by

Arshad Khan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
355 views

Complex Analysis

The document summarizes key aspects of bilinear transformations in complex analysis. It defines a bilinear transformation as a Möbius transformation of the form w = T(z) = az+b/cz+d where ad-bc ≠ 0. It states that every bilinear transformation is bijective and invertible, with the inverse also being a bilinear transformation. It further describes that the composition of two bilinear transformations is also a bilinear transformation. The document also proves that any bilinear transformation has at most two fixed points, unless it is the identity transformation.

Uploaded by

Arshad Khan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 40

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/301296003

Bilinear Transformations(Complex Analysis)

Research · April 2016


DOI: 10.13140/RG.2.1.3807.5284

CITATIONS READS

0 16,437

1 author:

Bhowmik Subrata
Tripura University
40 PUBLICATIONS   20 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Modal Logic View project

Complex Analysis View project

All content following this page was uploaded by Bhowmik Subrata on 15 April 2016.

The user has requested enhancement of the downloaded file.


Complex Analysis
Lecture Note-1

Bilinear Transformation

1
!
a b
Definition 1.1. Let a, b, c, d ∈ C, det = ad − bc 6= 0.
c d
We define a bilinear transformation or a Möbius Transformation
T : C∞ → C∞ as:

for c 6= 0,

az+b
 cz+d ,


 z ∈ C \ {− dc }
T (z) = ac z=∞

z = − dc

∞,

and for c = 0,

 az+b , z∈C
T (z) = d
∞, z=∞

In general we will write a bilinear transformation T : C∞ → C∞


as w = T (z) = az+b
cz+d , ad − bc 6= 0 without any ambiguity.
2
Example: T (z) = 2z+3i
iz+5 , S(z) = iz−6 , T (z) = 2z + 3, T (z) =
3z 1 2
2z, S1(z) = 3z etc.

3
Note: If we define another transformation S : C∞ → C∞ as
z = S(w) = −dw+b
cw−a and since (−d)(a) − bc = ad − bc 6= 0, S is
again a biliniear transformation.

If you check, you can see that S ◦ T = T ◦ S = I the iden-


tity transformation of C∞,i.e. I(z) = z, which is also a bilinear
transformation since I(z) = 1z+0
0z+1 and 1.1 − 0.0 = 1 6= 0. So T is
invertible i.e. bijective and T −1 = S, similarly S is also invertible
and S −1 = T .

Note 1.3. Every bilinear transformation is bijective and hence


invertible, i.e. inverse exists which is again a blininear transfor-
mation. The inverse of a bilinear transformation T (z) = az+bcz+d is
given by T −1 = −dz+b
cz−a

4
Class Task 1.4. Show that the composition of two bilinear
transformation is a bilinear transformation.

Hint: Take two bilinear transformations T (z) = az+b


cz+d , ad − bc 6=
0 and S(z) = αz+β
γz+δ , αδ − βγ 6= 0. Now find (T ◦ S)(z) = T (S(z))
Az+B
and express in the form of Cz+D and show AD − BC 6= 0.

5
Definition 1.2.(Elementary bilinear transformations)

(i) Translation: We define a translation as T (z) = z+a, where


1z+a
a is a finite complex number, i.e. a ∈ C. since T (z) = 0z+1 and
1.1 − a.0 = 1 6= 0, so T is a bilinear transformation.

(ii) Inversion: We define inversion T (z) = 1z . since T (z) =


0z+1
1z+0 and 0.0 − 1.1 = −1 6= 0, so T is a bilinear transformation.

(iii) Rotation: We define a rotation as T (z) = eiθ z, θ ∈ R\{0}.


eiθ z+0
since T (z) = 0z+1 and eiθ .1 − 0.0 = eiθ 6= 0, so T is a bilinear
transformation.

(iv) Magnification: We define a magnification T (z) = rz,


rz+0
r ∈ R+. since T (z) = 0z+1 and r.1 − 0.0 = r 6= 0, so T is a
bilinear transformation.

6
(v) Dilation: = magnification+Rotation, i.e. we define dila-
tion T (z) = αz, α ∈ C \ {0}. since T (z) = αz+0
0z+1 and α.1 − 0.0 =
α 6= 0, so T is a bilinear transformation. Here note that α = reiθ ,
r 6= 0, i.e. T (z) = reiθ z, i.e. dilation is mix of magnification and
rotation.
Theorem 1.1. Every bilinear transformation is a composi-
tion of elementary bilinear transformations, i.e. composition of
translation, inversion and dilation(one or two of them may be
missing).

7
Proof: Let us consider a bilinear transformation T : C∞ → C∞
defined as T (z) = az+b
cz+d , where a, b, c, d ∈ C and ad − bc 6= 0

Case-I: c = 0.

Hence ad 6= 0, i.e. a 6= 0 6= d and

T (z) = az+b
d

= ad z + db

= T1(z) + db , (where T1(z) = ad z and ad 6= 0, i.e. T1 is a dilation)

T2(T1(z)), (where T2(z) = z + db z a translation).

Hence T = T2 ◦ T1.

8
Case-II: c 6= 0.

Now, T (z) = az+b


cz+d − a+a
c c

=( bc−ad
2 ) 1 + a , (Here bc−ad 6= 0)
c2
c z+ dc
c

=( bc−ad
c2 ) 1 + a , (where T (z) = z + d a translation)
T (z) c 1 c
1

=( bc−ad
c2 )T2 (T1 (z)) + a , (where T (z) = 1 is the inversion)
c 2 z

=T3(T2(T1(z))) + ac , (where T3(z) = bc−ad


c2
z is a dilation)

=T4(T3(T2(T1(z)))), (where T4(z) = z + ac is a translation).

Hence T = T4 ◦ T3 ◦ T2 ◦ T1.

Hence the proof.


9
Definition 1.3. Let X be a non-empty set, and f : X → X.
a ∈ X is said to be a fixed point of f if f (a) = a.

Example(i) If f : R → R be the mapping defined as f (x) = x2,


0 and 1 are fixed points of f .

(ii) If f : R → R be the mapping defined as f (x) = x3, 0 and


±1 are fixed points of f .

(iii) If f : R → R be the mapping defined as f (x) = sin(x), 0 is


the only fixed points of f .

Note: For f : X → X, the fixed points can be find out by


solving the equation f (x) = x on X.

10
Example: Find all fixed points of the bilinear transformation
T (z) = 3z+2
z−5 .

Solution: Here T (∞) = 3


1 = 3 6= ∞, ∞ is not a fixed point of
T.

So, all possible fixed points are finite complex numbers and
they are given by the solution of the equation z = T (z) in C, i.e.

z = 3z+2
z−5

i.e. z 2 − 8z − 2 = 0


and the solutions are 4 ± 3 2.


Hence the fixed points of T are 4 ± 3 2.

11
Exercise: Find all fixed points of the bilinear transformations:

iz−2 , (ii) S(z) = 3z + 4i, (iii) w =


(i) T (z) = 4z+3i 5 , (iv)
3z−4i
T (z) = 2z, (v) T (z) = z , (vi) T (z) = z, (vii) T (z) = 2i
1
z , (viii)
z−1 , T (z) = z + 3i.
w = z+3

12
Note: Have you notice that: In all the examples we are not
getting more than two fixed points for a bilinear transformation
except the identity transformation.

Is it true for any bilinear transformation?

13
Theorem 1.2. Any bilinear transformation has at most two
fixed points unless it is the identity transformation.

14
Proof: Let us consider a bilinear transformation T : C∞ → C∞
defined as T (z) = az+b
cz+d , where a, b, c, d ∈ C and ad − bc 6= 0

Case-I: c = 0.

Hence ad 6= 0, i.e. a 6= 0 6= d and

T (z) = az+b
d = az + b .
d d

Here ab 6= 0 a finite complex number.

So T (∞) = ∞, i.e. ∞ is a fixed point in this case.

The other possible fixed points of T are given by the solution


of the equation z = T (z), i.e. z = ad z + db in C.

15
Now three subcases arise here:

Subcase IA: a = d, b = 0;

Subcase IB: a = d, b 6= 0 and

Subcase IC : a 6= d.

16
Subcase IA: a = d, b = 0;

In this subcase T = I, the identity transformation, i.e. every


point of C is also its fixed point.

Hence in this subcase every point of C∞ is a fixed point of T .

17
Subcase IB: a = d, b 6= 0

Here the equation z = T (z) has no solution in C.

Hence in this subcase there is only one fixed point of T which


is ∞.

18
Subcase IC : a 6= d.

b is the only fixed point of T in C.


Here z = d−a

Hence in this subcase there are two fixed points and the fixed
b .
points of T are ∞ and d−a

19
Case-II c 6= 0.

Now T (∞) = ac 6= ∞. So ∞ is not a fixed point of T .

So all possible fixed points of T are in C and they are given


by the solution of the equation z = T (z) i.e. z = az+b
cz+d , i.e.
cz 2 + (d − a)z − b = 0 in C. .....(i)

Fundamental theorem of algebra says this equation has at most


two solutions in C, i.e. in this case T has at most two fixed points
and the are given by the solutions of the equation (i) in C.

20
Thus every bilinear transformation has at most two fixed points
unless it is the identity transformation.

21
Corollary: If a bilinear transformation have three fixed points
(or more than two fixed points), then it is the identity transfor-
mation.

22
2
The general equation of circle in C is αr | z | +βzp
+ βz + γ,
|β|2 −γ |β|2 −γ
α, γ ∈ R and β ∈ C, α 6= 0 also the radius α2
= |α|
> 0,
i.e. | β |2> γ.

The general equation of straight line in C is βz + βz + γ, γ ∈ R


and β ∈ C, β 6= 0.

A straight line meets at ∞ in C∞, so a straight line or circle


in C is called circle in the extended complex plane C∞.

Thus the general equation of circle in C∞ is α | z |2 +βz+βz+γ,


α, γ ∈ R and β ∈ C; α and β are not simultaneously zero, if α 6= 0
| β |2> γ.

23
Example: Find the image of the circle | z |= r, r 6= 1 under
z−i . What happen if r = 1?
the bilinear transformation T (z) = z+i
Which point will map onto 1+i?

z−i , so z = iw+i . .... (i)


Solution: Let w = z+i −w+1

Now, | z |= r iff | z |2= r2, i.e. z.z = r2

iw+i −iw−i |w|2 +w+w+1


2
i.e. −w+1 . −w+1 = r , i.e. |w|2−w−w+1 = r2

i.e. (1 − r2) | w |2 +(1 + r2)w + (1 + r2)w + (1 − r2) = 0 .......(ii)

1+r2 2r |,
i.e. | w − 1−r2 |=| 1−r 2

which is a equation of circle, thus the circle | z |= r, r 6= 1


1+r2 2r |.
mapped onto the circle of center 1−r2 + i0 and radius | 1−r 2

24
If r = 1 we get from the equation (ii) that w + w = 0, i.e
Re(w) = 0, i.e. the unit circle | z |= 1 mapped onto the straight
line of imaginary axis.

If w = 1 + i we have from (i) z = −2 − i, i.e. the point −2 − i


mapped onto the point 1 + i.
z−1 . (a)
Exercise:(i)Consider the bilinear transformation w = z+1
Show that it maps the upper half plane onto the interior of
the unit circle. (b) Where does it map the unit circle and the
imaginary axis? (c) where does it maps the 1st and 3rd quadrant
of the complex plane? (d) What is the image of the point i − 1
and ∞? (e) Which point mapped onto i and ∞?

1−z . (a) Find


(ii) Consider the bilinear transformation T (z) = i 1+z
the region which mapped onto the upper half plane. (b) Where
does it map the unit circle | z |= 1?

(iii) Find the image of the region Re(z) ≤ 0 under the bilinear
transformation w = 2z+i
iz−1 .

z+i
(iv) Consider the bilinear transformation T (z) = i 2z−1 . (a)
Find the image of the unit circle | z |= 1? (b) Find the image
of the first quadrant? (c) Find the image of the point 12 (1 + i).
(d) Which point mapped onto the point i?
25
Class Task: Find the general form of a bilinear transformation
for which

(i)∞ is a fixed point,

(ii) 1 and -1 are the only fixed points.

26
Definition 1.4.(Cross Ratio:) Let z2, z3, z4 ∈ C∞ be three
distinct points. Consider T : C∞ → C∞ as

z−z3 z2 −z3


 z−z / z −z , z2 , z3 , z4 ∈ C

 4 2 4
 z−z3 z2 = ∞


T (z) = z−z4
 1 / 1 , z3 = ∞
z−z4 z2 −z4




z − z /z − z ,

z4 = ∞
3 2 3

T is a bilinear transformation.

The image of a point z1 ∈ C∞ under T is called the cross ratio


of z1, z2, z3 and z4 written as (z1, z2, z3, z4), i.e. (z1, z2, z3, z4)=T (z1) ∈
C∞ .

Hence T (z) = (z, z2, z3, z4), z ∈ C∞

27
Note:

T (z2) = (z2, z2, z3, z4) = 1

T (z3) = (z3, z2, z3, z4) = 0

T (z4) = (z4, z2, z3, z4) = ∞

28
Theorem 1.3. Cross ratio preserved under any bilinear trans-
formation.

29
Proof: Let T be any bilinear transformation and z2, z3, z4 ∈ C∞
be three distinct points. Consider the bilinear transformations T1
and T2 as

T1(z) = (z, z2, z3, z4) and T2(z) = (z, T (z2), T (z3), T (z4)).

Now, S = T2 ◦ T ◦ T1−1, then S is a bilinear transformation.

We see that:

S(1) = 1, S(0) = 0 and S(∞) = ∞, i.e the bilinear transfor-


mation S has three fixed points.

So S = I, i.e. T2 ◦ T ◦ T1−1 = I, i.e. T2 ◦ T = T1

Hence for any z ∈ C∞, T2(T (z)) = T1(z),

Thus (T (z), T (z2), T (z3), T (z4)) = (z, z2, z3, z4), i.e. T pre-
serves the cross ratio.
30
Example: Find the bilinear transformation which map 1, i, -1
onto 1 + i, 0, 1 − i respectively.

Solution: Let T be the bilinear transformation such that

T (1) = 1 + i, T (i) = 0, T (−1) = 1 − i.

Let w = T (z).

Since any bilinear transformation preserves the cross ratio, so

(T (z), T (1), T (i), T (−1)) = (z, 1, i, −1)

i.e., (w, 1 + i, 0, 1 − i) = (z, 1, i, −1)

w−0 / (1+i)−0
or, w−(1−i) (1+i)−(1−i)

i.e. w =?.
31
Exercise: Find the bilinear transformation which map

(i) −1, 0, 1 onto 0, i, 3i,

(ii) i, 1, −1 onto 1, 0, ∞,

(iii) 1, i, −1 onto i, 0, −i. Find image of the (a) unit circle


|z| = 1 and the unit disc |z| ≤ 1, (b) |z| = r, r > 1.

(iv) i, 1, ∞ onto ∞, i, 0.

32
Theorem 1.5. Let {z2, z3, z4} ⊂ C∞ and {w2, w3, w4} ⊂ C∞
be two set of three distinct points. Then there exists a unique
bilinear transformation T such that T (zk = wk ), k = 2, 3, 4.

33
Proof: Consider two bilinear transformations T1 and T2 as

T1(z) = (z, z2, z3, z4) and T2(z) = (z, w2, w3, w4).

Now T = T2 ◦ T1−1 is a bilinear transformation. We see that


T (z2) = w2, T (z3) = w3 and T (z4) = w4.

Thus we have a bilinear transformation T such that T (zk ) =


wk , k = 2, 3, 4.

To show the uniqueness we consider any bilinear transforma-


tion S such that S(zk ) = wk , k = 2, 3, 4.

Now S ◦ T −1 is also a bilinear transformation and wee see that

S ◦ T −1(z2) = z2, S ◦ T −1(z3) = z3 and S ◦ T −1(z4) = z4.

So we have a bilinear transformation S ◦ T −1 which has 3 fixed


points, so S ◦ T −1 = I, i.e. S = T . Hence the proof.
34
Theorem 1.6. Four distinct points z1, z2, z3, z4 ∈ C∞ lies on
a circle of C∞ iff the cross ratio (z1, z2, z3, z4) is a real number.

35
Corollary Any bilinear transformation maps a circle of C∞ on
a circle of C∞

36
References
1. Complex Analysis: S. Punnuswamy, Narosa Publication,
New Delhi.

2. Function of one complex variable: J. B. Conway, Narosa


Publication, New Delhi.

View publication stats


37

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy