Jump to content

Complex Analysis/Open mapping theorem

From Wikiversity

Open Mapping (and Connectedness) Theorem

[edit | edit source]

Let be a open and connected set, and let be a holomorphic, non-constant function. Then, is a

  • open and
  • connected set.

Remark 1 - Real valued functions - Calculus

[edit | edit source]

This theorem is not true in real values . For example with and the function is differentiable and is open and connected. The connectness is true for , but is not an open set.

Remark 2 - Open Mapping Theorem

[edit | edit source]

The Open Mapping Theorem just addresses the openness of . The connectedness is an additional property that is true for all continuous functions . In the Open Mapping Theorem is holomorphic and therefor also continuous.

Proof

[edit | edit source]

According to the theorem of domain preservation, one must show that is a domain, i.e., the set

  • is connected, and
  • is open.

The proof is divided into these two parts.

Proof 1: Connectedness

[edit | edit source]

We show that if is continuous and is connected, then is also connected.

Proof 2: Connectedness

[edit | edit source]

Let be arbitrarily chosen. Then, there exist such that and . Since is connected, there exists a path such that and .

Proof 3: Connectedness

[edit | edit source]

Because is continuous and is a continuous path in , the composition is a continuous path in , for which:

and .

Proof 4: Openness

[edit | edit source]

It remains to show that is open. Let and such that . Now, consider the set of -preimages:

Proof 5: Openness - Identity Theorem

[edit | edit source]

According to the Identity Theorem, the set cannot have accumulation points in . If had accumulation points in , the holomorphic function would be constant with for all .

Proof 6: Openness - Neighborhoods

[edit | edit source]

If the set of -preimages of has no accumulation points, one can choose a neighborhood of where is the only -preimage. Let be such that .

Proof 7: Openness

[edit | edit source]

We then define the smallest lower bound for the distance of to , where lies on the boundary of the disk :

Here, , because is continuous and attains a minimum on the compact set . Since , no -preimages can lie on the boundary.

Proof 8: Openness - Maximum Principle

[edit | edit source]

We show that . Let . We prove by contradiction that this arbitrary is in the image of .

Proof 9: Openness - Maximum Principle

[edit | edit source]

Assume for all . Then, with attains a nonzero minimum on . Since is not constant, this minimum must lie on (otherwise would be constant by the Maximum Principle. If were constant, would also have to be constant—a contradiction to the assumption).

Proof 9: Openness

[edit | edit source]

Since was chosen arbitrarily, and for every , there exists a -neighborhood , we obtain as an Norms, metrics, topology, and thus is open.

See also

[edit | edit source]

Page Information

[edit | edit source]

You can display this page as Wiki2Reveal slides

Wiki2Reveal

[edit | edit source]

The Wiki2Reveal slides were created for the Complex Analysis' and the Link for the Wiki2Reveal Slides was created with the link generator.

Translation and Version Control

[edit | edit source]

This page was translated based on the following Wikiversity source page and uses the concept of Translation and Version Control for a transparent language fork in a Wikiversity:

https://de.wikiversity.org/wiki/Kurs:Funktionentheorie/Satz_von_der_Gebietstreue

  • Date: 12/26/2024