A region in the complex plane is a non - empty, open, connected set. The following are all regions.
Any open disc
Any open half plane
The complement
of any closed disc![]()
Any open annulus
The set
itself
Any open rectangle, triangle, pentagon or similar shape
Any open, connected set with a finite number of points excluded
Proving the last of these is a set is quite easy.
Theorem
If
is a region and
then
is also a region.
Proof
Since R is a region it contains an open disc centred on
so
is non – empty. Also![]()
is closed in
so
is open and
is open as the intersection of two open sets.
Suppose that
Since
and
is a region, we can join
and
by a path
in
and the path also lies in
if![]()
If however
lies on
then choose an open disc
(possible since R is a region) and modify
inside this disc to avoid![]()

The resulting path joins
and
in
so
is connected and
is a region.
We can apply this region recursively to exclude any finite number of points![]()