Uniqueness of Entire Functions Sharing One Set

Weiling Xiong, Yi Zhang, Wei-Chuan LinAnnals 2014 · DOI

This paper, published in Analele Ştiinţifice ale Universităţii “Al.I. Cuza” din Iaşi, contributes to a specialized branch of complex analysis known as Nevanlinna Theory (or value distribution theory). It investigates the conditions under which two mathematical functions are essentially the same based on how they distribute their values across the complex plane.

TL;DR

The researchers prove a new uniqueness theorem for "transcendental entire functions" (like $e^z$ or $\sin z$). They demonstrate that if two such functions—after undergoing specific algebraic transformations and derivatives—share a finite set of values, they must be identical up to a constant factor, significantly improving and generalizing previous mathematical bounds.

What Problem Does This Paper Address?

In complex analysis, the "uniqueness problem" asks: How much information do we need about the values a function takes to identify that function uniquely?

A classic result by Nevanlinna states that if two meromorphic functions share five values at the same points in the complex plane, the functions must be identical. Since then, mathematicians have tried to reduce the number of shared values or shared sets of values required to prove uniqueness.

This paper focuses on a specific scenario: two functions $f$ and $g$ that share a set of roots of unity (the set $S_m$). The challenge is to determine the minimum constraints (specifically on the exponents and derivatives used in the functions' transformations) required to guarantee that $f$ and $g$ are linearly related. Earlier works by mathematicians like Fang and Zhang-Lin established initial bounds, but this paper aims to provide a more general and "tighter" result that works even when we only partially count the multiplicity of the shared values.

Methods

The authors employ the rigorous toolkit of Nevanlinna Theory. Key techniques include:

  • The Second Fundamental Theorem: A cornerstone of the field used to relate the growth of a function to the frequency with which it takes on certain values.
  • Counting Functions ($N$ and $\overline{N}$): These are used to measure how often a function hits a specific value, with the paper specifically utilizing $E_p(S, f)$, a method that counts multiplicities only up to a certain integer $p$.
  • Auxiliary Functions: The authors define complex differential polynomials $F$ and $G$ based on $f$ and $g$. By analyzing the properties of a third function, $H_m$ (which measures the difference between $F$ and $G$), they can determine if $F$ and $G$ are identical.
  • Case-by-Case Algebraic Analysis: The proof proceeds through four major steps, systematically ruling out cases where the functions could be different until only the "identical" case remains.

Datasets

As a theoretical mathematics paper, no empirical datasets were used. The "data" consists of abstract mathematical objects (transcendental entire functions) and the proofs are derived through logical deduction from established axioms and lemmas.

Key Insights and Ideas

  • Refined Multiplicity Counting: Most previous research required functions to share values "CM" (counting multiplicities fully) or "IM" (ignoring multiplicities). This paper uses a "truncated" counting function ($E_p$), which is more flexible. It shows that you don't need to know everything about the multiplicity of a shared value to prove uniqueness—you only need to know it up to a certain threshold $p$.
  • The "n" Threshold: The paper identifies a specific lower bound for the exponent $n$ in the expression $f^n(f^l - 1)^t$. If $n$ is large enough relative to the derivative order $k$ and the multiplicity threshold $p$, uniqueness is guaranteed.
  • Unification of Previous Results: The authors show that as the threshold $p$ approaches infinity, their theorem naturally simplifies into several famous existing theorems, effectively acting as a "master theory" that encompasses earlier specialized results.

Key Results

The main result is Theorem 1. It states that for two transcendental entire functions $f$ and $g$, if they share the set $S_m$ under the transformation $[f^n(f^l - 1)^t]^{(k)}$, and if the exponent $n$ satisfies a specific (and complex) inequality:

$$n > \max\left\{\frac{p+1}{p-1} \left[\frac{4}{m} + 2k + tl + \frac{2tl}{p+1}\right], \frac{3t}{2}\right\}$$

Then the functions must satisfy $f(z) \equiv bg(z)$, where $b^l = 1$.

This result is significant because the bound for $n$ provided here is more efficient and covers more general cases than the previous state-of-the-art (Theorem D by Zhang and Xiong).

Limitations and Future Work

  • Entire vs. Meromorphic: The paper specifically deals with entire functions (functions with no poles/singularities in the finite complex plane). Extending these specific bounds to meromorphic functions (which can have poles, like $1/z$) remains a much more difficult challenge.
  • Sharpness of the Bound: While the authors improved the bound for $n$, they do not claim it is "sharp." In mathematics, a sharp bound is the absolute lowest possible value. There may still be room to lower the requirement for $n$ even further.
  • Complexity of the Set: The shared set $S_m$ is very specific (roots of unity). Future work could explore whether these results hold for more arbitrary finite sets of complex numbers.

Summary updated

Abstract

Abstract In this paper, we prove a uniqueness theorem for entire functions sharing values on a finite set. The result extends and improves some theorems obtained earlier by Fang, Zhang-Lin and Zhnag-Xiong.
BibTeX
@article{xiong2014uniqueness,
  author = {Weiling Xiong and Yi Zhang and Wei-Chuan Lin},
  title = {{Uniqueness of Entire Functions Sharing One Set}},
  journal = {Annals},
  year = {2014},
  doi = {10.2478/aicu-2013-0046},
}
Figure