Problem 2 - Complex Analysis

Question

Let \(z_{0}, \ldots, z_{N} \in \mathbb{C}(N \in \mathbb{N}) .\) Define the segments connecting \(z_{\nu}\) to \(z_{\nu+1},(\nu=\) \(0,1, \ldots, N-1)\), by $$ \alpha_{\nu}:[\nu, \nu+1] \longrightarrow \mathbb{C} \text { with } \alpha_{\nu}(t)=z_{\nu}+(t-\nu)\left(z_{\nu+1}-z_{\nu}\right) $$ Then \(\alpha:=\alpha_{1} \oplus \alpha_{2} \oplus \cdots \oplus \alpha_{N-1}\) defines a curve \(\alpha:[0, N] \rightarrow \mathbb{C} . \alpha\) is a polygonal path, which connects \(z_{0}\) to \(z_{N}\) (through \(\left.z_{1}, z_{2}, \ldots, z_{N-1}\right)\). Show: An open set \(D \subseteq \mathbb{C}\) is connected (and thus a domain) if and only if any two points of \(D\) can be connected by a polygonal path \(\alpha\) inside \(D\) (i.e. Image \(\alpha \subset D)\).

Step-by-Step Solution

Answer

A set \(D\) is connected if any two points in \(D\) can be connected by a polygonal path within \(D\).

Step 1: Definition of Connectedness

A set \( D \subseteq \mathbb{C} \) is connected if there are no two non-empty disjoint open sets \( U, V \subseteq D \) such that \( D = U \cup V \). This means there is no separation into two distinct parts.

Step 2: Implication from Connectedness to Polygonal Path

Assume \( D \) is connected. Take any two points \( p, q \in D \). Since \( D \) is connected, there exists at least one path \( \gamma : [a, b] \to D \) such that \( \gamma(a) = p \) and \( \gamma(b) = q \). We can approximate any such path with a polygonal path by subdividing it into segments connecting a finite series of points in \( D \), each an image under \( \gamma \).

Step 3: Construction of Polygonal Path

Construct these segments as follows: choose subdivisions \( a = t_0 < t_1 < \cdots < t_N = b \) such that each segment \( \gamma([t_{n}, t_{n+1}]) \approx z_nz_{n+1} \) is small. Then define a polygonal path \( \alpha : [0, N] \rightarrow D \). This path will lie entirely in \( D \) because \( \gamma([a, b]) \subset D \).

Step 4: Reverse Implication from Polygonal Path to Connectedness

Assume any two points in \( D \) can be connected by a polygonal path contained within \( D \). If \( D \) were not connected, it could be separated into two non-empty open sets \( U \) and \( V \). Choose \( p \in U \) and \( q \in V \); a polygonal path connecting them must leave one set to enter the other, contradicting the open set properties. Thus, no such separation exists, confirming that \( D \) is connected.

Key Concepts

Polygonal Path

In complex analysis, a polygonal path is a series of straight line segments connected end to end.
Each segment is a path itself, defined by a function that linearly interpolates between two points in the complex plane. If you have points \( z_0, z_1, \ldots, z_N \) in \( \mathbb{C} \), you can construct a polygonal path \( \alpha \) connecting these points.
The path is made of segments \( \alpha_{u} \) defined as:

• \( \alpha_{u}(t) = z_{u} + (t - u)(z_{u+1} - z_{u}) \)

This formula describes how to travel between successive points, creating a line segment from \( z_u \) to \( z_{u+1} \).
The complete polygonal path \( \alpha \) is then the sum of all these segments.
Essentially, a polygonal path in the complex plane allows us to approximate more complex paths by a series of straight lines.

Open Set

In the context of the complex plane, an open set is a crucial concept.
It means that for every point within this set, you can find a small disk around it that is entirely contained within the set.
This ensures that no point on the boundary is part of the set, providing a sort of ‘breathing room’ around each interior point. For example, consider a circle without its border in the complex plane. This is an open set because around every point, you can find a tiny circle that lies completely within the larger circle.

• Open sets are foundational in topology, allowing mathematicians to understand properties like continuity and boundary behavior.
• In the study of connectedness, open sets help determine if a space can be split into separate, non-interacting parts.

By understanding open sets, students can better grasp how points in complex spaces interact and connect.

Complex Plane

The complex plane is a two-dimensional plane used to represent complex numbers graphically.
Each complex number \( z = x + yi \) corresponds to a unique point in the plane, where:

• \( x \) is the real part, represented along the horizontal axis.
• \( y \) is the imaginary part, shown along the vertical axis.

This representation allows complex numbers to be handled in much the same way as vectors in 2D space.
The complex plane is crucial for visualizing operations like addition, subtraction, and multiplication of complex numbers.
In complex analysis, it is the stage where lives the fascinating actions of paths, regions, and transformations, all critical in proving concepts like connectedness and path-connectedness.
This is because everything in complex analysis typically occurs within this plane, making it the playground for investigating deeper mathematical properties.

Segments in Complex Numbers

When examining segments in complex numbers, think of these as straight lines connecting pairs of complex points.
In mathematical terms, each segment is described by a linear function that maps a real interval to the complex plane. Given two points \( z_u \) and \( z_{u+1} \), the segment connecting them has a function:

• \( \alpha_{u}(t) = z_u + (t - u)(z_{u+1} - z_u) \)

This formula gives us a simple method to travel across points in the complex space between \( z_u \) and \( z_{u+1} \).
Segments serve as the building blocks of a polygonal path, bridging discrete complex numbers to form continuous paths.
Understanding these segments aids in grasping how complex numbers can be effectively visualized and traversed in practices like integration and path analysis.