Complex Analysis/Open mapping theorem

From testwiki
Revision as of 12:27, 7 January 2025 by imported>Eshaa2024 (Translation and Version Control)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Open Mapping (and Connectedness) Theorem

Let U be a open and connected set, and let f:U be a holomorphic, non-constant function. Then, f(U) is a

  • open and
  • connected set.

Remark 1 - Real valued functions - Calculus

This theorem is not true in real values . For example f:U with f(x)=x2 and U= the function f is differentiable and U= is open and connected. The connectness is true for f(U)=[0,+), but f(U) is not an open set.

Remark 2 - Open Mapping Theorem

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

Proof

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

  • is connected, and
  • is open.

The proof is divided into these two parts.

Proof 1: Connectedness

We show that if f is continuous and U is connected, then f(U) is also connected.

Proof 2: Connectedness

Let w1,w2f(U) be arbitrarily chosen. Then, there exist z1,z2U such that f(z1)=w1 and f(z2)=w2. Since U is connected, there exists a path γ:[a,b]U such that γ(a)=z1 and γ(b)=z2.

Proof 3: Connectedness

Because f is continuous and γ:[a,b]U is a continuous path in U, the composition γf:=fγ is a continuous path in f(U), for which:

γf(a)=f(γ(a))=f(z1)=w1 and γf(b)=f(γ(b))=f(z2)=w2.

Proof 4: Openness

It remains to show that f(U) is open. Let w0f(U) and z0U such that f(z0)=w0. Now, consider the set of w0-preimages:

S(f,w0):=zU | f(z)=w0

Proof 5: Openness - Identity Theorem

According to the Identity Theorem, the set S(f,w0):=zU | f(z)=w0 cannot have accumulation points in f(U). If S(f,w0)f(U) had accumulation points in f(U), the holomorphic function f:U would be constant with f(z)=w0 for all zU.

Proof 6: Openness - Neighborhoods

If the set S(f,w0) of w0-preimages of f has no accumulation points, one can choose a neighborhood VU of z0 where z0 is the only w0-preimage. Let r>0 be such that D¯r(z0)V.

Proof 7: Openness

We then define the smallest lower bound for the distance of f(z) to w0, where z lies on the boundary of the disk Dr(z0):

ε:=infzDr(z0)|f(z)w0|>0

Here, ε>0, because f is continuous and attains a minimum on the compact set Dr(z0). Since D¯r(z0)V, no w0-preimages can lie on the boundary.

Proof 8: Openness - Maximum Principle

We show that Dε3(w0)f(U). Let |ww0|<ε3. We prove by contradiction that this arbitrary wDε3(w0) is in the image of f.

Proof 9: Openness - Maximum Principle

Assume f(z)w for all zD¯r(z0). Then, |g(z)| with g(z):=f(z)w attains a nonzero minimum on Dr(z0). Since f is not constant, this minimum must lie on Dr(z0) (otherwise h(z):=1f(z)w would be constant by the Maximum Principle. If h were constant, f would also have to be constant—a contradiction to the assumption).

Proof 9: Openness

Since w0f(U) was chosen arbitrarily, and for every w0f(U), there exists a ϵ3-neighborhood Dϵ3(w0)f(U), we obtain f(U)=w0f(U)Dϵ3(w0) as an Norms, metrics, topology, and thus f(U) is open.

See also

Page Information

You can display this page as Wiki2Reveal slides

Wiki2Reveal

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

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


de:Kurs:Funktionentheorie/Satz von der Gebietstreue