1 Introduction and main results

Throughout this paper, the term ‘meromorphic’ will always mean meromorphic in the complex plane ℂ. Considering a meromorphic function f, we shall assume that readers are familiar with the fundamental results and the standard notations of the Nevanlinna value distribution theory of meromorphic functions such as m(r,f), N(r,f), T(r,f), the first and second main theorems, lemma on the logarithmic derivatives etc. of Nevanlinna theory (see Hayman [1], Yang [2] and Yi and Yang [3]). We also use ρ(f), μ(f), λ(f) and λ( 1 f ) to denote the order, the lower order, the exponent of convergence of zeros and the exponent of convergence of poles of f(z), respectively, and S(r,f) to denote any quantity satisfying S(r,f)=o(T(r,f)) for all r outside a possible exceptional set of finite logarithmic measure lim r [ 1 , r ) E d t t <.

Recently, there have been a number of papers focusing on the growth of solutions of difference equations, value distribution and uniqueness of differences analogues of Nevanlinna’s theory (including [49]). Based on these results given in [1012], people obtained many interesting theorems in the fields of complex analysis.

In 2003, Silvennoinen [13] studied the growth and existence of meromorphic solutions of functional equations of the form f(p(z))=R(z,f(z)) and obtained the following result.

Theorem 1.1 [13]

Let f be a non-constant meromorphic solution of the equation

f ( p ( z ) ) =R ( z , f ( z ) ) = i = 0 m 1 a i ( z ) f ( z ) i j = 0 n 1 b j ( z ) f ( z ) j ,

where p(z) is an entire function, a i , b j are small meromorphic functions with respect to f. Then p(z) is a polynomial.

In 2012, Gao [14] studied the problem when the above equation is replaced by the following system of function equations:

{ f 1 ( p ( z ) ) = R 1 ( z , f 2 ( z ) ) = i = 0 m 1 a i ( z ) f 2 ( z ) i j = 0 n 1 b j ( z ) f 2 ( z ) j , f 2 ( p ( z ) ) = R 2 ( z , f 1 ( z ) ) = i = 0 m 1 c i ( z ) f 1 ( z ) i j = 0 n 1 d j ( z ) f 1 ( z ) j ,
(1)

where p(z) is an entire function, R 1 (z, f 2 (z)), R 2 (z, f 1 (z)) are irreducible rational functions, the coefficients are small functions; and he obtained the following.

Theorem 1.2 [[14], Theorem 1]

Let ( f 1 , f 2 ) be a non-constant meromorphic solution of system (1). Then p(z) is a polynomial.

After his works, Gao [15, 16], Xu et al. [17] further investigated the growth and existence of meromorphic solutions of some types of systems of complex functional equations and obtained a series of results (see [15, 16, 18, 19]). Inspired by the ideas of Refs. [1416, 20, 21], we investigate some properties of solutions of some types of systems of complex functional equations and obtain the following results.

The first theorem is about meromorphic solutions with few zeros and poles of a type of system of complex functional equations.

Theorem 1.3 Let c j C{0} and suppose that f 1 , f 2 are a pair of non-rational meromorphic solutions of the system

{ j = 1 n 1 f 1 ( z + c j ) = a 0 ( z ) + a 1 ( z ) f 2 ( z ) + + a p 2 ( z ) f 2 ( z ) p 2 b 0 ( z ) + b 1 ( z ) f 2 ( z ) + + b q 2 ( z ) f 2 ( z ) q 2 , j = 1 n 2 f 2 ( z + c j ) = e 0 ( z ) + e 1 ( z ) f 1 ( z ) + + e p 1 ( z ) f 1 ( z ) p 1 d 0 ( z ) + d 1 ( z ) f 1 ( z ) + + d q 1 ( z ) f 1 ( z ) q 1 ,
(2)

with the coefficients a i (z), b i (z), e i (z), d i (z) being small functions with respect to f 1 , f 2 and a p 2 (z) b q 2 (z) e p 1 (z) d q 1 (z)0. If

max { λ ( f t ) , λ ( 1 / f t ) } <ρ( f t ),t=1,2,
(3)

then system (2) is of the form

{ j = 1 n 1 f 1 ( z + c j ) = c 2 ( z ) f 2 ( z ) s 2 , j = 1 n 2 f 2 ( z + c j ) = c 1 ( z ) f 1 ( z ) s 1 ,

where c 1 (z), c 2 (z) are meromorphic functions, T(r, c 1 )+T(r, c 2 )=S(r, f 1 )+S(r, f 2 ), s 1 , s 2 Z.

Theorem 1.4 Suppose that ( f 1 , f 2 ) are a pair of transcendental meromorphic solutions of the system of q-shift difference equations

{ j = 1 n a j 1 ( z ) f 1 ( q j z + c j ) = i = 0 d 1 b i 1 ( z ) f 2 ( z ) i , j = 1 n a j 2 ( z ) f 2 ( q j z + c j ) = i = 0 d 2 b i 2 ( z ) f 1 ( z ) i ,
(4)

where c j C{0}, qC, |q|>1, d 1 d 2 2 and the coefficients a j t (z), b i t (z) (t=1,2) are rational functions. If f t (t=1,2) are entire or have finitely many poles, then there exist constants K t >0 (t=1,2) and r 0 >0 such that for all r r 0 ,

logM(r, f t ) K t ( d 1 d 2 ) log r 2 n log | q | ,t=1,2.

Theorem 1.5 Suppose that ( f 1 , f 2 ) are a pair of transcendental meromorphic solutions of the system of q-shift difference equations

{ j = 1 n 1 a j 1 ( z ) f 1 ( q j z + c j ) = P 2 ( z , f 2 ( z ) ) Q 2 ( z , f 2 ( z ) ) , j = 1 n 2 a j 2 ( z ) f 2 ( q j z + c j ) = P 1 ( z , f 1 ( z ) ) Q 1 ( z , f 1 ( z ) ) ,
(5)

where c j C{0}, qC, |q|>1, the coefficients a j t (z), t=1,2, are rational functions, and P t , Q t are relatively prime polynomials in f t over the field of rational functions satisfying p t = deg f t P t , l t = deg f t Q t , d t = p t l t 2, t=1,2. If f t (t=1,2) have infinitely many poles, then for sufficiently large r,

n(r, f t ) K t ( d 1 d 2 ) log r ( n 1 + n 2 ) log | q | ,t=1,2,

and

μ( f 1 )+μ( f 2 ) 2 ( log d 1 + log d 2 ) ( n 1 + n 2 ) log | q | .

Remark 1.1 Since system (4) is a particular case of system (5), from the conclusions of Theorem 1.5, we can get the following result.

Under the assumptions of Theorem 1.4. If f t (t=1,2) have infinitely many poles, then there exist constants K t >0 (t=1,2) and r 0 >0 such that for all r r 0 ,

n(r, f t ) K t ( d 1 d 2 ) log r 2 n log | q | ,t=1,2,

and

μ( f 1 )+μ( f 2 ) log d 1 + log d 2 n log | q | .

Example 1.1 The function ( f 1 (z), f 2 (z))=( e z z , e z z ) satisfies the system of the form

{ j = 1 n 2 j z + c j e c j z 2 j f 1 ( 2 j z + c j ) = j = 1 n f 2 ( z ) 2 j , j = 1 n ( 2 j z + c j ) e c j z 2 j f 2 ( 2 j z + c j ) = j = 1 n f 1 ( z ) 2 j ,

with rational coefficients, where |q|=2>1, d 1 = d 2 = 2 n and c j C. Since n< 2 n = d 1 = d 2 for all n N + , we have logM(r, f t )=rlogr 1 2 r= 1 2 ( d 1 d 2 ) log r 2 n log | q | (r) and μ( f t )=σ( f t )=1= log ( d 1 d 2 ) 2 n log | q | for t=1,2. This shows that the conclusion of Theorem 1.4 is sharp and the equality in the consequent result μ( f 1 )+μ( f 2 ) 2 ( log d 1 + log d 2 ) ( n 1 + n 2 ) log | q | of Remark 1.1 can be arrived.

Let q, c j be stated as in Theorem 1.5, set

F 1 ( z ; f 1 , n 1 , q , c j ) = λ 1 I 1 d λ 1 ( z ) f 1 ( q z + c 1 ) i λ 1 1 f 1 ( q 2 z + c 2 ) i λ 2 1 f 1 ( q n 1 z + c n 1 ) i λ n 1 1 μ 1 J 1 e μ 1 ( z ) f 1 ( q z + c 1 ) j μ 1 1 f 1 ( q 2 z + c 2 ) j μ 2 1 f 1 ( q n 1 z + c n 1 ) j μ n 1 1 , F 2 ( z ; f 2 , n 2 , q , c j ) = λ 2 I 2 d λ 2 ( z ) f 2 ( q z + c 1 ) i λ 1 2 f 2 ( q 2 z + c 2 ) i λ 2 2 f 2 ( q n 2 z + c n 2 ) i λ n 2 2 μ 2 J 2 e μ 2 ( z ) f 2 ( q z + c 1 ) j μ 1 2 f 2 ( q 2 z + c 2 ) j μ 2 2 f 2 ( q n 2 z + c n 2 ) j μ n 2 2 .

Now, we will investigate the lower order of meromorphic solutions of a type of system of complex function equations and obtain a result as follows.

Theorem 1.6 Suppose that ( f 1 , f 2 ) are a pair of transcendental meromorphic solutions of the system of q-difference equations

{ F 1 ( z ; f 1 , n 1 , q , c j ) = j = 0 s 1 a j 1 ( z ) f 2 ( z ) j j = 0 l 1 b j 1 ( z ) f 2 ( z ) j , F 2 ( z ; f 2 , n 2 , q , c j ) = j = 0 s 2 a j 2 ( z ) f 1 ( z ) j j = 0 l 2 b j 2 ( z ) f 1 ( z ) j ,
(6)

where I t ={( i λ 1 t , i λ 2 t ,, i λ n t t )}, J t ={ j μ 1 t , j μ 2 t ,, j μ n t t } are finite index sets satisfying

max λ t , μ t { i λ 1 t + i λ 2 t ++ i λ n t t , j μ 1 t + j μ 2 t ++ j μ n t t }= σ t ,t=1,2,

and d t =max{ s t , l t }2, t=1,2, and all coefficients of (6) are of growth S(r, f 1 ), S(r, f 2 ). If

d 1 d 2 >4 n 1 n 2 σ 1 σ 2 ,
(7)

then for sufficiently large r,

T(r, f t ) K t ( d 1 d 2 4 n 1 n 2 σ 1 σ 2 ) log r ( n 1 + n 2 ) log | q | ,t=1,2,

where K t >0 are constants. Thus, the lower order of f 1 , f 2 satisfy

μ( f 1 )+μ( f 2 ) 2 ( log d 1 d 2 log 4 n 1 n 2 σ 1 σ 2 ) ( n 1 + n 2 ) log | q | .

Example 1.2 The functions ( f 1 (z), f 2 (z))=( e z 2 , e z 2 ) satisfy the system of function equations

{ f 2 ( 4 z + c 2 ) + f 2 ( 2 z + c 1 ) f 2 ( 4 z + c 2 ) f 2 ( 2 z + c 1 ) = a 1 f 1 ( z ) 4 + a 0 f 1 ( z ) 16 , f 1 ( 2 z + c 1 ) + f 1 ( 2 z + c 1 ) f 1 ( 4 z + c 2 ) f 1 ( 4 z + c 2 ) = b 1 f 2 ( z ) 16 + b 0 f 2 ( z ) 4 ,

with small function coefficients

a 1 = e 8 z c 2 4 z c 1 e c 2 2 c 1 2 , a 0 = e 8 z c 2 c 2 2 , b 1 = e 4 z c 1 + c 1 2 8 z c 2 c 2 2 , b 0 = e 4 z c 1 + c 1 2 ,

where q= n 1 = n 2 = σ 1 = σ 2 =2, d 1 = d 2 =16, d 1 d 2 =256>4 n 1 n 2 σ 1 σ 2 , c 1 , c 2 C and a 1 , a 0 , b 1 , b 0 are small functions of f 1 , f 2 . We have μ( f t )=σ( f t )=2, t=1,2 and

μ( f 1 )+μ( f 2 )=4>1= 2 ( log d 1 d 2 log 4 n 1 n 2 σ 1 σ 2 ) ( n 1 + n 2 ) log | q | .

This shows that Theorem 1.6 may hold.

2 The proof of Theorem 1.3

Denote G t (z)= j = 1 n t f t (z+ c j ), t=1,2. By applying Valiron-Mohon’ko theorem [22] to (2), we have

T ( r , G 1 ) = max { p 2 , q 2 } T ( r , f 2 ) + S ( r , f 1 ) + S ( r , f 2 ) , T ( r , G 2 ) = max { p 1 , q 1 } T ( r , f 1 ) + S ( r , f 1 ) + S ( r , f 2 ) .
(8)

From (3), we can take constants ξ t , δ t such that

max { λ ( f t ) , λ ( 1 / f t ) } < ξ t < δ t <ρ( f t ),t=1,2,

then we have

T ( r , f t f t ) = N ¯ (r, f t )+ N ¯ ( r , 1 f t ) +S(r, f t )=O ( r ξ t ) +S(r, f t ),t=1,2.

From (8) and the definitions of G t (t=1,2), similar to the above argument, we have

T ( r , G t G t ) = N ( r , G t G t ) + m ( r , G t G t ) n t N ¯ ( r + C , f t ) + n t N ¯ ( r , 1 f t ) + S ( r , f 1 ) + S ( r , f 2 ) = O ( r ξ t ) + S ( r , f 1 ) + S ( r , f 2 ) ,

where C:=max{| c i |,| c j |,i=1,2,, n 1 ;j=1,2,, n 2 }. From (3), we know that zeros and poles are Borel exceptions of f t (t=1,2), and from [[23], Satz 13.4], we have that f t (t=1,2) is of regular growth. Hence, there exists r 0 >0 such that T(r, f t )> r δ t for r> r 0 . So, we can get that

T ( r , G t G t ) =S(r, f 1 )+S(r, f 2 ),T ( r , f t f t ) =S(r, f 1 )+S(r, f 2 ),t=1,2.

Now, we rewrite system (2) as

{ b p 2 ( z ) a p 2 ( z ) G 1 ( z ) = P 2 ( z , f 2 ) Q 2 ( z , f 2 ) = u 2 ( z , f 2 ) , d p 1 ( z ) e p 1 ( z ) G 2 ( z ) = P 1 ( z , f 1 ) Q 1 ( z , f 1 ) = u 1 ( z , f 1 ) ,
(9)

without loss of generality, assume that P t , Q t are monic polynomials in f t with coefficients of growth S(r, f 1 ), S(r, f 2 ). Set F t := f t f t , U t := u t u t , t=1,2. From (9), we have T(r, U t )=S(r, f 1 )+S(r, f 2 ). And because

{ P 2 Q 2 P 2 Q 2 Q 2 2 = u 2 = U 2 u 2 = U 2 P 2 Q 2 , P 1 Q 1 P 1 Q 1 Q 1 2 = u 1 = U 1 u 1 = U 1 P 1 Q 1 ,

it follows that

{ P 2 Q 2 P 2 Q 2 = U 2 P 2 Q 2 , P 1 Q 1 P 1 Q 1 = U 1 P 1 Q 1 .

Substituting f t = F t f t , t=1,2, to the above equalities and comparing the leading coefficients, we can get

( p t q t ) F t = U t ,t=1,2.

Solving the above equations, we get

u t = π t ( f t ( z ) ) p 2 q 2 , π t C,t=1,2.
(10)

From (9) and (10), it follows that

{ G 1 ( z ) = π 2 a p 2 ( z ) b p 2 ( z ) ( f 2 ( z ) ) p 2 q 2 , G 2 ( z ) = π 1 e p 1 ( z ) d p 1 ( z ) ( f 1 ( z ) ) p 1 q 1 .

Thus, we complete the proof of Theorem 1.3.

3 Proofs of Theorems 1.4 and 1.5

3.1 The proof of Theorem 1.4

Because the coefficients a j t (z), b i t (z) (t=1,2) are rational functions, we can rewrite (4) as follows:

{ j = 1 n A j 1 ( z ) f 1 ( q j z + c j ) = i = 0 d 1 B i 1 ( z ) f 2 ( z ) i , j = 1 n A j 2 ( z ) f 2 ( q j z + c j ) = i = 0 d 2 B i 2 ( z ) f 1 ( z ) i ,
(11)

where the coefficients A j t (z), B i t (z) (t=1,2) are polynomials. We will consider two cases as follows.

Case 1. Since ( f 1 , f 2 ) are a pair of solutions of system (4) or (11) and f t , t=1,2, are transcendental entire, set p i t =deg A j t (j=1,2,,n), q i t =deg B i t (i=0,1,, d i ), t=1,2, and C:=max{| c i |,| c j |,i=1,2,, n 1 ;j=1,2,, n 2 }. Taking m t =max{ p 1 t ,, p n t }+1, and from |q|>1 and M(r, f t ( q j z+ c j ))M( | q | j r+| c j |, f t ), we have that

{ M ( r , i = 0 d 1 B i 1 ( z ) f 2 ( z ) i ) = M ( r , j = 1 n A j 1 ( z ) f 1 ( q j z + c j ) ) n r m 1 M ( | q | n r + C , f 1 ) , M ( r , i = 0 d 2 B i 2 ( z ) f 1 ( z ) i ) = M ( r , j = 1 n A j 2 ( z ) f 2 ( q j z + c j ) ) n r m 2 M ( | q | n r + C , f 2 ) ,
(12)

when r is sufficiently large. Since B i t (i=0,1,, d t ; t=1,2) are polynomials and f t (t=1,2) are transcendental entire functions, we have M(r, i = 0 d 1 1 B i 1 f 2 ( z ) i )=o(M(r, f 2 ( z ) d 1 )) and M(r, i = 0 d 2 1 B i 2 f 1 ( z ) i )=o(M(r, f 1 ( z ) d 2 )). Then, for sufficiently large r, it follows that

{ M ( r , i = 0 d 1 B i 1 ( z ) f 2 ( z ) i ) 1 2 M ( r , B d 1 1 f 2 ( z ) d 1 ) , M ( r , i = 0 d 2 B i 2 ( z ) f 1 ( z ) i ) 1 2 M ( r , B d 2 2 f 1 ( z ) d 2 ) .
(13)

From (12) and (13), for sufficiently large r it follows that

{ log M ( | q | n r + C , f 1 ) d 1 log M ( r , f 2 ) + g 1 ( r ) , log M ( | q | n r + C , f 2 ) d 2 log M ( r , f 1 ) + g 2 ( r ) ,
(14)

where | g t (r)|< K t logr, t=1,2, for some constants K t >0. From (14), for sufficiently large r, we get

logM ( | q | 2 n r + C + C | q | n , f 1 ) d 1 d 2 logM(r, f 1 )+ g 1 ( | q | n r + C ) + d 1 g 2 (r).
(15)

Iterating (15), we have

logM ( | q | 2 n k r + C ν = 0 2 k 1 | q | ν n , f 1 ) ( d 1 d 2 ) k logM(r, f 1 )+ E k 1 (r)+ E k 2 (r)(kN),
(16)

where

| E k 1 ( r ) | = | ( d 1 d 2 ) k 1 g 1 ( | q | n r + C ) + + g 1 ( | q | ( 2 k 1 ) n r + C ν = 0 2 k 2 | q | ν n ) | K 1 ( d 1 d 2 ) k 1 j = 0 k 1 log | q | ( 2 j + 1 ) n r + C ν = 0 2 j 1 log | q | ν n ( d 1 d 2 ) j K 1 ( d 1 d 2 ) k 1 j = 0 log | q | ( 2 j + 1 ) n r + C ν = 0 2 j 1 log | q | ν n ( d 1 d 2 ) j ,

and

| E k 2 ( r ) | = | d 1 ( d 1 d 2 ) k 1 g 2 ( r ) + + d 1 g 2 ( | q | ( 2 k 2 ) n r + C ν = 0 2 k 3 | q | ν n ) | K 2 d 1 ( d 1 d 2 ) k 1 j = 0 k 1 log | q | 2 ( j 1 ) n r + C ν = 0 2 j 3 | q | ν n ( d 1 d 2 ) j K 2 d 1 ( d 1 d 2 ) k 1 j = 0 log | q | 2 ( j 1 ) n r + C ν = 0 2 j 3 | q | ν n ( d 1 d 2 ) j .

Observe that |q|>1, then for sufficiently large r, we have

log | q | ( 2 j + 1 ) n r + C ν = 0 2 j | q | ν n log | q | ( 2 j + 1 ) n + log r + log ( 2 j + 1 ) C + log | q | 2 j n 2 j ( 2 j + 1 ) n 2 ( log | q | ) 2 log j log C log r .

And since d 1 d 2 2, it follows that the series i = 0 2 j ( 2 j + 1 ) n 2 ( log | q | ) 2 log j ( d 1 d 2 ) i is convergent. Thus, for sufficiently large r, we have

| E k t ( r ) | K t ( d 1 d 2 ) k logr,t=1,2,
(17)

where K t >0 (t=1,2) are some constants. Since f 1 is a transcendental entire function, for sufficiently large r, we have

logM(r, f 1 )3 K logr,
(18)

where K >max{ K 1 , K 2 }. Hence, from (16)-(17), there exists r 0 e such that for r r 0 , we have

logM ( | q | 2 n k r + C ν = 0 2 k 1 | q | ν n , f 1 ) K ( d 1 d 2 ) k logr.
(19)

Thus, for each sufficiently large R, there exists kN such that

R[ | q | 2 n k r 0 +C ν = 0 2 k 1 | q | ν n , | q | 2 n ( k + 1 ) r 0 +C ν = 0 2 k + 1 | q | ν n ),

i.e.,

k> log R + log ( | q | n 1 ) log r 0 log C 4 n log | q | 2 n log | q | .
(20)

From (19) and (20), we have

log M ( R , f 1 ) log M ( | q | 2 n k r 0 + C ν = 0 2 k 1 | q | ν n , f 1 ) K ( d 1 d 2 ) k log r 0 K ( d 1 d 2 ) log R 2 n log | q | ,
(21)

where

K = K ( d 1 d 2 ) log ( | q | n 1 ) log r 0 log C 4 n log | q | 2 n log | q | .

Similar to the above argument, we can get that there exist constants K>0 and r 0 >0 such that for all r r 0 ,

logM(r, f 2 )K ( d 1 d 2 ) log r 2 n log | q | .
(22)

Case 2. Suppose that ( f 1 , f 2 ) are a pair of solutions of system (4) and f t (t=1,2) are meromorphic with finitely many poles. Then there exist polynomials P t (z) such that g t (z)= P t (z) f t (z) (t=1,2) are entire functions. Substituting f t (z)= g t ( z ) P t ( z ) into (11) and again multiplying away the denominators, we can get a system similar to (11). By using the same argument as in the above, we can get that for sufficiently large r,

logM(r, f t )=logM(r, g t )+O(1) ( K t ε ) ( d 1 d 2 ) log r 2 n log | q | K t ( d 1 d 2 ) log r 2 n log | q | ,

where K t (>0) (t=1,2) are some constants.

From Case 1 and Case 2, this completes the proof of Theorem 1.4.

3.2 The proof of Theorem 1.5

Since the coefficients of P t (z, f t (z)), Q t (z, f t (z)) are rational functions, we can choose a sufficiently large constant R (>0) such that the coefficients of P t (z, f t (z)), Q t (z, f t (z)) (t=1,2) have no zeros or poles in {zC:|z|>R}. Assume that ( f 1 , f 2 ) is a solution of system (5) and f t (t=1,2) are transcendental, since f t (t=1,2) have infinitely many poles. Thus, without loss of generality, we choose a pole z 0 of f 1 of multiplicity μ1 satisfying | z 0 |>R. Since d 1 = s 1 t 1 2, then the right-hand side of the second equation in (5) has a pole of multiplicity d 1 μ at z 0 . Therefore, there exists at least one index j 1 {1,2,, n 2 } such that q j 1 z 0 + c j 1 is a pole of f 2 of multiplicity μ 1 d 1 μ. If | q j 1 z 0 + c j 1 |R, this process will be terminated and we have to choose another pole z 0 of f 1 in the way we did above. If | q j 1 z 0 + c j 1 |>R, since d 2 = s 2 t 2 2, then the right-hand side of the first equation in (5) has a pole of multiplicity d 2 μ 1 d 1 d 2 μ. Therefore, there exists at least one index j 1 {1,2,, n 1 } such that q j 1 ( q j 1 z 0 + c j 1 )+ c j 1 is a pole of f 1 of multiplicity μ 1 d 2 μ 1 d 1 d 2 μ.

We proceed to follow the step above, we can get a sequence

{ ζ k } k = 1 := { i = 1 k q j i + j i z 0 + s = 1 k i = s + 1 k q j i + j i ( q j s c j s + c j s ) } k = 1 ,

where ζ k is a pole of f 1 with multiplicity μ k , j s {1,2,, n 2 } and j s {1,2,, n 1 }. From the above discussion, we can get μ k ( d 1 d 2 ) k μ. Obviously, we have | ζ k | as k. Then there exists a positive integer k 0 N + such that for sufficiently large k ( k 0 ),

μ ( d 1 d 2 ) k μ [ 1 + d 1 d 2 + + ( d 1 d 2 ) k ] n ( | ζ k | , f 1 ) n ( | q | ( n 1 + n 2 ) k | z 0 | + C ( | q | n 1 + 1 ) i = 0 k 1 | q | i ( n 1 + n 2 ) , f 1 ) ,
(23)

where C:=max{| c i |,| c j |,i=1,2,, n 1 ;j=1,2,, n 2 }. Thus, for each sufficiently large r, there exists k N + such that r[ η k , η k + 1 ), where η k := | q | ( n 1 + n 2 ) k | z 0 |+C( | q | n 1 +1) i = 0 k 1 | q | i ( n 1 + n 2 ) , it follows that

k> log r log | z 0 | log C log ( | q | n 1 + 1 ) ( n 1 + n 2 ) log | q | + log ( | q | n 1 + n 2 1 ) ( n 1 + n 2 ) log | q | .
(24)

From (23) and (24), we have

n ( r , f 1 ) μ ( d 1 d 2 ) k μ ( d 1 d 2 ) log r log | z 0 | log C log ( | q | n 1 + 1 ) ( n 1 + n 2 ) log | q | + log ( | q | n 1 + n 2 1 ) ( n 1 + n 2 ) log | q | K 5 d log r ( n 1 + n 2 ) log | q | ,

where

K 5 =μ ( d 1 d 2 ) log | z 0 | log C log ( | q | n 1 + 1 ) ( n 1 + n 2 ) log | q | + log ( | q | n 1 + n 2 1 ) ( n 1 + n 2 ) log | q | .

And there exists r 0 >0 and for all r r 0 , we have

K 5 ( d 1 d 2 ) log r ( n 1 + n 2 ) log | q | n(r, f 1 ) 1 log 2 T(2r, f 1 ).

Similar to the above discussion, we can get that there exists r 0 >0 and for all r r 0 , we have

K 5 ( d 1 d 2 ) log r ( n 1 + n 2 ) log | q | n(r, f 2 ) 1 log 2 T(2r, f 2 ).

From these inequalities, we can get μ( f 1 )+μ( f 2 ) 2 ( log d 1 + log d 2 ) ( n 1 + n 2 ) log | q | easily.

Thus, the proof of Theorem 1.5 is completed.

4 Proof of Theorem 1.6

Lemma 4.1 [[21], Lemma 2]

Let f 1 , f 2 ,, f n be meromorphic functions. Then

T ( r , λ I f 1 i λ 1 f 2 i λ 2 f n i λ n ) σ i = 1 n T(r, f i )+logs,

where I={ i λ 1 , i λ 2 ,, i λ n } is an index set consisting of s elements, and σ= max λ I { i λ 1 + i λ 2 ++ i λ n }.

Proof of Theorem 1.6 From |q|>1, c j C and [[24], p.249], we have T(r, f t ( q j z+ c j ))=T( | q | j r+| c j |, f t )+O(1), t=1,2. For any given ε (0<ε< d 1 d 2 4 n 1 n 2 σ 1 σ 2 d 1 d 2 + 4 n 1 n 2 σ 1 σ 2 ), applying Valiron-Mohon’ko theorem [22] and Lemma 4.1 to (6), it follows that

{ d 1 ( 1 ε ) T ( r , f 2 ) d 1 T ( r , f 2 ) + S ( r , f 2 ) 2 σ 1 j = 1 n 1 T ( | q | j r + C , f 1 ) + S ( r , f 1 ) d 1 ( 1 ε ) T ( r , f 2 ) 2 n 1 σ 1 ( 1 + ε ) T ( | q | n 1 r + C , f 1 ) , d 2 ( 1 ε ) T ( r , f 1 ) d 2 T ( r , f 1 ) + S ( r , f 1 ) 2 σ 2 j = 1 n 2 T ( | q | j r + C , f 2 ) + S ( r , f 2 ) d 2 ( 1 ε ) T ( r , f 1 ) 2 n 2 σ 2 ( 1 + ε ) T ( | q | n 2 r + C , f 2 ) ,
(25)

outside of a possible exceptional set of finite linear measure. Then from (25) there exists r 0 >0 such that

{ T ( | q | n 1 + n 2 r + C ( | q | n 1 + 1 ) , f 1 ) d 1 d 2 ( 1 ε ) 2 4 n 1 n 2 σ 1 σ 2 ( 1 + ε ) 2 T ( r , f 1 ) , T ( | q | n 1 + n 2 r + C ( | q | n 2 + 1 ) , f 2 ) d 1 d 2 ( 1 ε ) 2 4 n 1 n 2 σ 1 σ 2 ( 1 + ε ) 2 T ( r , f 2 ) ,
(26)

holds for all r> r 0 . Iterating (26), for any k N + and r r 0 , we have

{ T ( | q | ( n 1 + n 2 ) k r + C ( | q | n 1 + 1 ) i = 0 k 1 | q | i ( n 1 + n 2 ) , f 1 ) ( d 1 d 2 ( 1 ε ) 2 4 n 1 n 2 σ 1 σ 2 ( 1 + ε ) 2 ) k T ( r , f 1 ) , T ( | q | ( n 1 + n 2 ) k r + C ( | q | n 2 + 1 ) i = 0 k 1 | q | i ( n 1 + n 2 ) , f 2 ) ( d 1 d 2 ( 1 ε ) 2 4 n 1 n 2 σ 1 σ 2 ( 1 + ε ) 2 ) k T ( r , f 2 ) .

By employing the same argument as in the proof of Theorem 1.5, for sufficiently large ϱ, from the above inequalities, we can get

{ T ( ϱ , f 1 ) K 6 T ( r 0 , f 1 ) ( d 1 d 2 ( 1 ε ) 2 4 n 1 n 2 σ 1 σ 2 ( 1 + ε ) 2 ) log ϱ ( n 1 + n 2 ) log | q | , T ( ϱ , f 2 ) K 6 T ( r 0 , f 2 ) ( d 1 d 2 ( 1 ε ) 2 4 n 1 n 2 σ 1 σ 2 ( 1 + ε ) 2 ) log ϱ ( n 1 + n 2 ) log | q | ,
(27)

where

K 6 = ( d 1 d 2 ( 1 ε ) 2 4 n 1 n 2 σ 1 σ 2 ( 1 + ε ) 2 ) log | z 0 | log C log ( | q | n 1 + 1 ) ( n 1 + n 2 ) log | q | + log ( | q | n 1 + n 2 1 ) ( n 1 + n 2 ) log | q | , K 6 = ( d 1 d 2 ( 1 ε ) 2 4 n 1 n 2 σ 1 σ 2 ( 1 + ε ) 2 ) log | z 0 | log C log ( | q | n 2 + 1 ) ( n 1 + n 2 ) log | q | + log ( | q | n 1 + n 2 1 ) ( n 1 + n 2 ) log | q | .

Letting ε0, from (27) we have

{ T ( ϱ , f 1 ) K 7 ( d 1 d 2 4 n 1 n 2 σ 1 σ 2 ) log ϱ ( n 1 + n 2 ) log | q | , T ( ϱ , f 2 ) K 7 ( d 1 d 2 4 n 1 n 2 σ 1 σ 2 ) log ϱ ( n 1 + n 2 ) log | q | ,
(28)

where K 6 , K 6 are constants satisfying

K 7 = T ( r 0 , f 1 ) ( d 1 d 2 4 n 1 n 2 σ 1 σ 2 ) log | z 0 | log C log ( | q | n 1 + 1 ) ( n 1 + n 2 ) log | q | + log ( | q | n 1 + n 2 1 ) ( n 1 + n 2 ) log | q | , K 7 = T ( r 0 , f 2 ) ( d 1 d 2 4 n 1 n 2 σ 1 σ 2 ) log | z 0 | log C log ( | q | n 2 + 1 ) ( n 1 + n 2 ) log | q | + log ( | q | n 1 + n 2 1 ) ( n 1 + n 2 ) log | q | .

Thus, from (28) the lower order of f 1 , f 2 satisfy

μ( f 1 )+μ( f 2 ) 2 log ( d 1 d 2 ) 2 log ( 4 n 1 n 2 σ 1 σ 2 ) ( n 1 + n 2 ) log | q | .

Hence, we complete the proof of Theorem 1.6. □