The paper aims to build the relationship between an entire function of restricted hyper-order with its linear c-shift operator.
Standard methodology for papers in difference and shift operators and value distribution theory have been used.
The relation between an entire function of restricted hyper-order with its linear c-shift operator was found under the periphery of sharing a set of two small functions IM (ignoring multiplicities) when exponent of convergence of zeros is strictly less than its order. This research work is an improvement and extension of two previous papers.
This is an original research work.
1. Introduction
By a meromorphic function f, we always mean that it is defined on . For such a meromorphic function, we recall some basic terminologies of value distribution theory such as the Nevanlinna characteristic function T(r, f), the proximity function m(r, f) and the counting function (reduced counting function) of a-points of (). For a = ∞, we use to denote counting (reduced counting) function of poles of f (see [1]). With the help of the standard notations, we also would like to recall the following useful terms, namely exponent of convergence of zeros, order and hyper-order of f respectively defined as follows:
Usually, S(r, f) denotes any quantity satisfying S(r, f) = o(T(r, f)) for all r outside of a possible exceptional set of finite linear measure. We denote by S(f) the set of all meromorphic functions a(z) such that T(r, a(z)) = S(r, f) and a(z) is called small function compared to f(z). Let a(z) ∈ S and S be a subset of S(f) ∪{∞} and Ef(S) = ∪a(z)∈S{z: f(z) − a(z) = 0}, where each zero is counted according to its multiplicity. If we do not count the multiplicity, then the set ∪a(z)∈S{z: f(z) − a(z) = 0} is denoted by .
If Ef(S) = Eg(S) () we say that f and g share the set S CM or counting multiplicities (IM or ignoring multiplicities).
For a nonzero complex constant c, the shift operator of f(z) is denoted by f(z + c). The terms Δcf and will be used to denote the difference and k-th order difference operators of f(z), defined respectively as
We introduce the more generalized linear c-shift operator Lcf by
where for j = 0, 1, 2, …, k with ak ≠ 0 (k ≥ 1).
The uniqueness problem of entire functions sharing set with their derivatives, shifts, different types of difference operators has been developed as an interesting direction of research in the realm of value distribution theory. In 1999, Li-Yang [2] made a pioneer work by considering the relation between an entire function and its derivative sharing a set with two elements. Following their footsteps, in 2005, Li [3] investigated the same type of problem for linear differential operator. Four years later, Liu [4] exhibited a similar result for an entire function f and its shift sharing a set with two small functions.
Let us start the discussion with another result of Liu [4] concerning difference operator.
[4] Let f be a transcendental entire function of finite order, and let a be a nonzero finite constant. If f and Δcf share the set {a, −a} CM, then Δcf = f.
After that Liu [4] posed a significant question:
What happens if {a, −a} is replaced by {a(z), b(z)} in the above theorem, where a(z), b(z) ∈ S(f) are nonvanishing periodic entire functions with period c?
Being motivated by this question, Li [5] investigated the following theorem in a different direction that evolved as a new trend. Actually, Li [5] first diverted the attention of the research germinated from Question 1.1, in terms of relation between exponent of convergence of zero and order. We recall the theorem by Li [5].
[5] Let f be a nonconstant entire function such that λ(f) < ρ(f) < ∞, ρ(f) ≠ 1, a, b be respectively two distinct entire functions such that ρ(a) < ρ(f) and ρ(b) < ρ(f). If f and Δcf share the set {a, b} CM, then Δcf = f for all .
By an example we can show that the restriction ρ(f) ≠ 1 in Theorem B can be removed.
Let . Then obviously Δcf = f. Clearly f and Δcf share the set {a, b} CM for two distinct entire functions a, b respectively such that ρ(a) < ρ(f) and ρ(b) < ρ(f) and also 0 = λ(f) < ρ(f) = 1.
After publication of Li’s [5] result, there was a long gap in research in this direction. Recently in 2019, concerning finite-order entire function, Qi-Wang-Gu [6] removed the restriction ρ(f) ≠ 1 in Theorem B. Not only that, they also ensured the particular form of f in the following manner:
[6] Let f be a nonconstant entire function with λ(f) < ρ(f) < ∞, let a, b be respectively two distinct entire functions such that ρ(a) < ρ(f), ρ(b) < ρ(f). If f and Δcf share the set {a, b} CM, then f(z) = Aeμz, where A, μ are two nonzero constants satisfying eμc = 2. Furthermore, Δcf = f.
2. Main results
In our paper, we have extended and improved Theorem C in the following three directions:
We replace the difference operator by its linear c-shift operator to accommodate a larger class of operators, namely Lcf that includes difference operator.
We consider an entire function of ρ2(f) < 1 instead of considering the same of finite order.
We relax the nature of the shared set {a, b} from CM to IM.
Thus, the following assertion extends and improves Theorem C in the way described above, and in fact it represents our main result in this paper.
Let f be a nonconstant entire function such that λ(f) < ρ(f) with ρ2(f) < 1 and let a, b be two distinct entire functions such that ρ(a) < ρ(f) and ρ(b) < ρ(f). Let f and Lcf (≢0) share the set {a, b} IM, then Lcf = f. In addition, if b = −a, then Lcf = −f. In both cases f takes the form f(z) = Ah(z)eμz, where A is a nonzero constant, h(z) is a polynomial and μ is a nonzero constant satisfying and − 1 respectively. Furthermore,
when Lcf = f, then one of the following can occur:
If a0 = 1, then k ≥ 2 and deg(h) ≤ (k − 2);
If a0 ≠ 1, then deg(h) ≤ (k − 1).
When Lcf = −f, then one of the following occur:
if a0 = −1, then k ≥ 2 and deg(h) ≤ (k − 2);
if a0 ≠ − 1, then deg(h) ≤ (k − 1).
In the above theorem, if we choose Lcf = Δcf, then k = 1, a1 = 1 and a0 = −1. Therefore conclusion (2) that means Δcf = −f is not possible. Thus from conclusion (1) we only have the form of the function as f(z) = Aeμz, where A and μ are nonzero constants satisfying eμc = 2 and also Δcf = f holds.
The following examples will successively show that in the above theorem, respectively for the cases k = 1, k = 2 and k = 3, all possible forms of the function exist.
First we consider the case k = 1.
Let f = Aeμz, A ≠ 0. Choosing coefficients of Lcf for k = 1 as and a0 ≠ 1 we have Lcf = f and . Next, choosing coefficients as and a0 ≠ − 1 we see that Lcf = −f and .
Next we shall show that for k = 2, the forms of the function can be obtained.
Let f = (Az + B)eμz, A ≠ 0. Choosing coefficients of Lcf for k = 2 as , , one can easily check that Lcf = f and . On the other hand, choosing coefficients as , , we easily can obtain Lcf = −f and .
Consider the function f in Example 2.1. Choose coefficients of Lcf for k = 2 as , , a0 = 2, then we have Lcf = f and . Next, choosing coefficients as , , a0 = 2, we see that Lcf = −f and .
For k = 3, all possible forms of the function are shown below.
Let f = (Az2 + Bz + C)eμz, A ≠ 0. Choosing coefficients of Lcf for k = 3 as , , , one can easily check that Lcf = f and . Also, choosing coefficients as , , , one can easily check that Lcf = −f and .
Consider the function f as in Example 2.2 and choosing the coefficients of Lcf as , , , a0 = 2, we can have Lcf = f and . On the other hand, choosing coefficients as , , , a0 = 2, we can get Lcf = −f and .
Consider the function f in Example 2.1. Choosing coefficients of Lcf for k = 3 as , , , a0 = 2, clearly Lcf = f and . On the other hand, choosing coefficients as , , , a0 = 2, we easily get Lcf = −f and .
Similar examples can be constructed for the case k ≥ 4 also.
In Examples 2.4, 2.5, let us take . Choosing eμc = 2 we see that though but . In a similar manner, for the function in Examples 2.4, 2.5, choosing we get but . But in Example 2.6, choosing eμc such that or − 1, we automatically have the respective conclusions or . From this observation naturally one can infer that the case needs special attention. In fact, we can conjecture that the degree of h could be zero that means h will be a nonzero constant.
In this respect, in Theorem 2.1 replacing Lcf by we can get the next corollary.
Under the same assumptions of Theorem 2.1 for the operator we have . In addition, if b = −a and k ≥ 2, then . In both cases f takes the form f(z) = Beμz, where B and μ are nonzero constants and μ satisfies and − 1 respectively.
Next we provide two examples to show that ρ2 < 1 is sharp.
Let . Here λ(f) < ρ(f) and ρ2(f) = 1. For a suitable choices of coefficients one can obtain . For example, for even integer k, choose ak + ⋯ + a2 + a0 = 0 and ak−1 + ⋯ + a3 + a1 = 1. Clearly f and Lcf share the set {a, −a} CM, where a is an entire function such that ρ(a) < ρ(f). Though Lcf = −f, the form of f does not satisfy the conclusion of our theorem.
Let . Here λ(f) < ρ(f) and ρ2(f) = 1. For a suitable choices of coefficients, one can easily obtain . For example, for even integer k, choose ak + ⋯ + a2 + a0 = 0 and ak−1 + ⋯ + a3 + a1 = 1. Clearly f and Lcf share the set CM, where a, b are two complex constants such that a − b = 1. Then neither Lcf = ±f nor the form of f satisfies the conclusion of our theorem.
3. Preparatory lemmas
In this section, some useful lemmas are quoted from references [1, 7, 9–12], which will be needed in the sequel.
[9] Let T: [0, + ∞) → [0, + ∞) be a nondecreasing continuous function, and let s ∈ (0, + ∞). If the hyper-order of T is strictly less than 1,that is,
Using the above two basic lemmas due to [9], we have the next lemma.
Let f(z) be a meromorphic function of ρ2(f) < 1 and . Then for any ϵ > 0,
Using Lemma 3.1, by a simple alteration of the result for finite-order meromorphic functions in [8], one can have the following lemma.
Let f(z) be a meromorphic function of ρ2(f) < 1, then we have
[7] Let f be a transcendental meromorphic function in the plane of order less than 1. Let h > 0. Then there exists an ϵ-set E such that
[1, 10] Let f(z) be a transcendental meromorphic solution of equation
(see [12], Theorem 1.51) Suppose that fi(z) (i = 1, 2, …, n) and gi(z) (i = 1, 2, …, n) (n ≥ 2) are entire functions satisfying
,
gj(z) − gk(z) are not constants for 1 ≤ j < k < n,
for 1 ≤ i ≤ n, 1 ≤ k < l ≤ n,
Then fi(z) ≡ 0 (i = 1, 2, …, n).
Now we recall the following lemma due to Lu-Lu-Li-Xu (see [11], Corollary 3.2).
[11] Let g (≢0) be a nonconstant meromorphic solution of the linear difference equation
4. Proof of the main theorem
According to our assumption λ(f) < ρ(f) and by Hadamard factorization theorem, let us assume that f(z) = h(z)eη(z), where h(z) (≢0) is an entire function and η(z) is a nonconstant entire function satisfying
Therefore T(r, h) = S(r, f) and S(r, eη) = S(r, f) = S(r). Here,
Let . Clearly q ≢ 0. Then placing f(z) = h(z)eη(z), in view of Lemma 3.4, we can deduce that
Since q and h are not equivalent to zero, one can easily write
Applying the Second Fundamental Theorem for small functions [1] on eη and then applying the First Fundamental Theorem [1] on eη − ω, we can obtain that
where ω (≢0) is a small function of eη.
Here a≢b. Without loss of generality, let us assume that a≢0. Let z0 be a zero of but q(z0) ≠ 0. Since f and Lcf that means heη and qeη share the set {a, b} IM, so in view of (4.2), z0 is a zero of or . Let us denote by the reduced counting function of those common zeros of and , which are not zeros of q. Similarly, we denote by the reduced counting function of those common zeros of and , which are not zeros of q. Therefore from (4.3) we have,
which shows that either or . Otherwise T(r, eη) = S(r). This is not possible because in view of (4.1), we can draw a contradiction. Now, we consider two cases:
Case 1. Suppose . For sake of convenience, we resolve the case step by step.
Step 1. In this step we will show that Lcf ≡ f.
Let z1 is a zero of and . It is obvious that z1 is a zero of . If , then
which is a contradiction. Therefore h = q that implies Lcf = f.
Step 2. In this step we show that η(z) is a polynomial.
Expanding Lcf = f we can write
Choosing bj = ajh(z + jc) for j = 1, 2, …, k and b0 = (a0 − 1)h(z) we get . Clearly ρ(bl) = ρ(h(z + lc)) = ρ(h) < ρ(f) for all l = 0, 1, …, k. So, bl′s are finite-order entire functions. We claim that ρ(eη(z + ic)−η(z + jc)) < ∞, for at least one pair of i, j; such that 0 ≤ i < j ≤ k. On the contrary, let us suppose, for all 0 ≤ i < j ≤ k, ρ(eη(z + ic)−η(z + jc)) = ∞. Then T(r, bl) = o{T(r, eη(z + jc)−η(z + ic))}, for 0 ≤ l ≤ k and 0 ≤ i < j ≤ k. Hence by Lemma 3.7, bl ≡ 0 for all l = 0, 1, …, k, which is not possible. Thereby ρ(eη(z + ic)−η(z + jc)) < ∞ implies that η(z + ic) − η(z + jc) is a polynomial. Let the degree of η(z + ic) − η(z + jc) be m. So, η(m+1)(z + ic) − η(m+1)(z + jc) = 0 that means η(m+1)(z + ic) is periodic entire function of period (j − i)c. If η(m+1)(z + ic) is nonconstant, then obviously ρ(η(m+1)(z + ic)) ≥ 1, which yields ρ(η) = ρ(η(z + ic)) = ρ(η(m+1)(z + ic)) ≥ 1. But ρ(η) < 1, a contradiction. Hence η(m+1)(z + ic) is a constant and so η(m+1)(z) is constant, which implies η(z) is polynomial.
Step 3. In this step we wish to show that the degree of η(z) is 1.
On the contrary, suppose the deg(η(z)) = n(say) ≥ 2. Then for j = 1, 2, …, k,
where Qj(z) is a (n − 2)-th degree polynomial and cn is the leading coefficient of η(z). Let . So, for j = 1, 2, …, k, . Clearly for all j = 1, 2, …, k − 1 and . Here we will draw a contradiction by deducing T(r, g) = S(r, g). Rewriting (4.4) we have
i.e.
As η(z) is a polynomial, so ρ2(h) ≤ ρ2(eη) = ρ(η) = 0, which implies ρ2(h) = 0. Since ρ(h) − 1 < ρ(f) − 1 = ρ(eη) − 1 = n − 1 = ρ(g), so by Lemma 3.3, for any ϵ > 0, , j = 0, 1, …, k − 1.
Let , where for j = 1, 2, …, k − 1 and . Thus, (4.5) can be written as gk−1g = H(z, g). Clearly total degree of H(z, g) is at most k − 1 and m(r, Cj) = S(r, g) for j = 0, 1, … k − 1. Hence by Lemma 3.6, m(r, g) = S(r, g) that means T(r, g) = S(r, g), a contradiction. Therefore deg(η(z)) = 1. Let us assume that η(z) = μz + C, where μ and C be two nonzero constants.
Step 4. In this step we deduce a necessary condition and actual form of the function.
Putting η(z) = μz + C in f(z) = h(z)eη(z), we have f(z) = Ah(z)eμz, where A = eC is a nonzero constant. Now, applying this, (4.4) can be written as
i.e.
Since ρ(h) < ρ(f) = ρ(eμz) = 1, so by Lemma 3.5, there exist ϵ-set E, as z ∉ E and z → ∞, such that . Thereby,
Since ρ(h) < 1, so by Lemma 3.8, we know that h(z) is a polynomial. Let us assume that h(z) = clzl + cl−1zl−1 + ⋯ + c1z + c0. Putting it into (4.6) and then comparing coefficients and doing a simple calculation, we have (4.7) and
Without loss of generality, we assume that all ai′ s for i = 1, 2, …, k are nonzero. Now, the above system of equations can be written as
where , and .
Let C be the corresponding augmented matrix. It is obvious that rank(A1) = min{l + 1, k}. Clearly rank(C) = min{l + 1, k + 1}.
Suppose a0 ≠ 1. So the nonhomogeneous system (4.8) has unique solution when l = k − 1, infinitely many solutions when l < k − 1 and no solutions when l > k − 1. Hence deg(h) ≤ (k − 1).
Next suppose a0 = 1. Then for k = 1, Lcf = f and (4.7) both implies a1 = 0, which is not possible. So in this case obviously k ≥ 2. Now, the homogeneous system A1X = 0 has solutions when l ≤ k − 2. Thus, we have our desired Conclusion 1.
Case 2. Suppose . Let z2 is a zero of and . It is obvious that z2 is a zero of . If , then
which is a contradiction. Therefore
Since a≢0, therefore b ≢ 0. Let z3 be a zero of but q(z0) ≠ 0. Since heη and qeη share the set {a, b} IM, so z3 is a zero of or . Let us denote by the reduced counting function of those common zeros of and , which are not zeros of q. similarly, we denote by the reduced counting function of those common zeros of and , which are not zeros of q. Therefore from (4.3) we have,
which shows that either or . Otherwise T(r, eη) = S(r), which is not possible in view of (4.1). Now, we consider two subcases:
Subase 2.1. Suppose . Then proceeding in a similar manner as used in starting portion of Case 2, we have . In view of (4.9) we get, a2 = b2. As a≢b, so obviously b = −a. Therefore we must have q = −h that implies Lcf = −f. Further following the same steps as done in Case 1, we can have the form of the function as f(z) = Ah(z)eμz satisfying
Next adopting the similar calculations as done in Step 4, for a0 ≠ − 1, we have deg(h) ≤ (k − 1) and for a0 = −1, we have k ≥ 2 and deg(h) ≤ (k − 2). Thus, we have corresponding desired conclusion (2).
Subcase 2.2. Suppose , which is similar to the Case 1 and so, we get the desired result.
Hence the proof is completed. □
To prove this corollary, it is sufficient to prove that deg(h) = 0, where h(z) = clzl + cl−1zl−1 + ⋯ + c1z + c0 (l ≤ k − 1), cl ≠ 0. We know for the operator , , where j = 0, 1, …, k.
From conclusion 1. of Theorem 2.1 we have, and f takes the form f = Ah(z)eμz, where A is a nonzero constant, h(z) is a polynomial and μ is a nonzero constant satisfying , that is, . Now putting f = A(clzl + cl−1zl−1 + ⋯ + c1z + c0)eμz into and then comparing coefficient of zk−1, we have
As c ≠ 0, cl ≠ 0 and and also we know , so we get
Clearly in view of , l must be 0.
From conclusion 2. of Theorem 2.1 we have, b = −a, and f takes the form f = Ah(z)eμz, where A is a nonzero constant, h(z) is a polynomial and μ is a nonzero constant satisfying , that is, . Here obviously k ≥ 2. Proceeding in a similar manner as in above, again we can have (4.11) and in view of , we can conclude l = 0. So in both cases l = 0 that means deg(h) = 0. Hence the corollary is proved. □
5. Observation and an open question
As we know λ(f) ≤ ρ(f) and since throughout the paper we have dealt with the case λ(f) < ρ(f), it will be interesting to inspect whether the same conclusions hold for the case λ(f) = ρ(f). In the next two examples we point out the fact that when λ(f) = ρ(f), the conclusion of Theorem 2.1 ceases to hold.
Let f = ez(e2z + 1). Choose c = πi and for even integer k, ak + ⋯ + a2 + a0 = 0 and ak−1 + ⋯ + a3 + a1 = 1. Then λ(f) = ρ(f) = 1 and Lcf = −ez(e2z + 1). Clearly Lcf and f share the set {a, −a} CM, where a is an entire function such that ρ(a) < ρ(f). Though Lcf = −f, the form of f does not satisfy the conclusion of Theorem 2.1.
Let f = −ez + 3 and . Then and λ(f) = ρ(f) = 1. Clearly and f share the set {1, 2} CM but .
In view of the above two examples, we can conclude that in Theorem 2.1, λ(f) < ρ(f) is sharp, but the conclusion of the same theorem under the case λ(f) = ρ(f) is still an enigma. So we place it as an open question:
Under the hypothesis λ(f) = ρ(f), what will be the answer of the Question 1.1 concerning or even Lcf?
The authors wish to thank the referee for a careful reading and valuable suggestions toward the improvement of the paper. The first author is thankful to DST-PURSE –II Programme for financial assistance. The second author is thankful to the Council of Scientific and Industrial Research (India) for their financial support under File No: 09/106 (0188)/2019- EMR-I.
