Why a Certain Entire Function Must Be Constant When Its Imaginary Part is Bounded

In this blog entry, we’ll explore a fascinating result from complex analysis, similar to the one we discussed previously about the real part of an entire function. This time, we’ll focus on the imaginary part and show that if it is bounded, the function must be constant.

Here’s the statement we aim to prove:

If f(z)f(z) is an entire function on the complex plane, and Im⁡(f(z))\operatorname{Im}(f(z)) (the imaginary part of f(z)f(z)) is bounded above, then f(z)f(z) must be constant.

As before, we’ll break the proof into manageable steps and reference key theorems and ideas to make it easy to follow, even for those with just a basic background in complex analysis.

Step 1: Understanding the Problem

An entire function is a function that is holomorphic (analytic) everywhere on the complex plane. For f(z)f(z), we’re given that its imaginary part Im⁡(f(z))\operatorname{Im}(f(z)) is bounded above, meaning there exists a real number MM such that:

Im⁡(f(z))≤Mfor all z∈C.\operatorname{Im}(f(z)) \leq M \quad \text{for all } z \in \mathbb{C}.

Our task is to show that this condition implies f(z)f(z) is constant. The result follows from Liouville's Theorem and the harmonic properties of Im⁡(f(z))\operatorname{Im}(f(z)).

Step 2: Define a New Function

To take advantage of boundedness, define the following function:

G(z)=eif(z).G(z) = e^{i f(z)}.

Why this choice? The exponential function ensures that both the real and imaginary parts of f(z)f(z) contribute in a manageable way, while its modulus can be analyzed to reveal important properties.

Step 3: Show That G(z)G(z) is Entire

Since f(z)f(z) is entire, the composition eif(z)e^{i f(z)} is also entire. This follows from the fact that the exponential function is entire, and the composition of two entire functions is entire. Thus, G(z)G(z) is holomorphic on C\mathbb{C}.

Step 4: Analyze ∣G(z)∣|G(z)|

The modulus of G(z)G(z) is given by:

∣G(z)∣=∣eif(z)∣=e−Im⁡(f(z)).|G(z)| = \left| e^{i f(z)} \right| = e^{-\operatorname{Im}(f(z))}.

Since Im⁡(f(z))≤M\operatorname{Im}(f(z)) \leq M for all zz, it follows that:

∣G(z)∣=e−Im⁡(f(z))≥e−M.|G(z)| = e^{-\operatorname{Im}(f(z))} \geq e^{-M}.

Thus, ∣G(z)∣|G(z)| is bounded below by e−M>0e^{-M} > 0. Furthermore, because Im⁡(f(z))\operatorname{Im}(f(z)) is bounded above, ∣G(z)∣|G(z)| is also bounded above. Therefore, ∣G(z)∣|G(z)| is bounded on C\mathbb{C}.

Step 5: Apply Liouville's Theorem

By Liouville's Theorem, any bounded entire function must be constant. Since G(z)G(z) is bounded and entire, G(z)G(z) is constant. Let’s denote this constant by cc:

G(z)=cfor all z∈C.G(z) = c \quad \text{for all } z \in \mathbb{C}.

Step 6: Conclude That f(z)f(z) is Constant

Recall that G(z)=eif(z)G(z) = e^{i f(z)}. If G(z)=cG(z) = c, then:

eif(z)=c.e^{i f(z)} = c.

Taking the logarithm (using the complex logarithm), we have:

if(z)=ln⁡(c),i f(z) = \ln(c),

where ln⁡(c)\ln(c) is a constant (since cc is constant and nonzero).

Dividing through by ii, we find:

f(z)=−iln⁡(c).f(z) = -i \ln(c).

Thus, f(z)f(z) is constant.

Step 7: Final Thoughts

This result complements our earlier proof about the real part of an entire function. It demonstrates how boundedness of either the real or imaginary part of an entire function forces the function to be constant. This is a testament to the rigidity of analytic functions over the complex plane.

Thanks for reading! If you have questions or comments, feel free to leave them below. Let’s keep exploring the beauty of complex analysis together!

Comments

Post a Comment

Popular posts from this blog

What is Mathematical Fluency?

What does it really mean for students to be mathematically fluent? If you’ve been in any math PD over the past few years, you’ve likely heard the phrase everywhere. We talk about fluency as something students should develop, strengthen, and demonstrate, but it can still feel abstract when we try to describe it in observable, classroom-ready terms. This post breaks down mathematical fluency into the two simplest frames we can use as teachers: what it looks like and what it sounds like . These descriptions can guide instruction, assessment, student goal-setting, and even walkthrough conversations with colleagues or administrators. What Mathematical Fluency Looks Like In a classroom where students are developing mathematical fluency, you see students making choices about strategies rather than following steps robotically. They use representations—number lines, diagrams, tables, graphs, manipulatives, symbolic expressions—and switch between them to make sense of a problem. They move ...
Read more

Unlocking the Group: Cosets, Cayley’s Theorem, and Lagrange’s Theorem

Mathematics is full of elegant ideas that take simple definitions and build deep, powerful structures. In group theory, three such concepts—cosets, Cayley's Theorem, and Lagrange’s Theorem—form a foundational trio that unveils the internal symmetry of algebraic systems. Let’s explore what they mean and why they matter. What’s a Coset, Really? Imagine you have a group and a smaller subgroup inside it. Now, pick any element from the big group and use it to shift every element in the subgroup by multiplying on the left. The resulting set is called a left coset . You can also do this multiplication on the right, forming a right coset . These cosets aren’t usually groups themselves—but they do break the original group into equal-sized, non-overlapping pieces. Intuitively , cosets act like “shifts” of the subgroup across the whole group. Think of tiling a floor: each tile is a copy of the same shape (the subgroup) placed in different locations (cosets). Lagrange’s Theorem: Size Matt...
Read more

Verifying the Binomial Formula with Mathematical Induction

The binomial formula states: ( z 1 + z 2 ) n = ∑ k = 0 n ( n k ) z 1 n − k z 2 k (z_1 + z_2)^n = \sum_{k=0}^n \binom{n}{k} z_1^{n-k} z_2^k where ( n k ) = n ! k ! ( n − k ) ! \binom{n}{k} = \frac{n!}{k!(n-k)!} and n = 1 , 2 , … n = 1, 2, \ldots . This is a powerful formula in algebra, expressing the expansion of ( z 1 + z 2 ) n (z_1 + z_2)^n as a sum of terms involving powers of z 1 z_1 and z 2 z_2 . We’ll verify this formula using mathematical induction . Mathematical induction is a logical method to prove that a statement holds for all positive integers n n . The process involves two steps: Base Case : Verify the formula for the smallest value of n n , typically n = 1 n = 1 . Inductive Step : Assume the formula holds for some n = k n = k , and then prove it holds for n = k + 1 n = k+1 . Step 1: Base Case ( n = 1 n = 1 ) For n = 1 n = 1 , the formula becomes: ( z 1 + z 2 ) 1 = ∑ k = 0 1 ( 1 k ) z 1 1 − k z 2 k (z_1 + z_2)^1 = \sum_{k=0}^1 \binom{1}{k} z_1^{1-k} z_2^k L...
Read more