Processing math: 100%
Research article

Monotonicity and inequalities related to complete elliptic integrals of the second kind

  • In the paper, the authors present some monotonicity properties of certain functions defined in terms of the complete elliptic integrals of the second kind and some elementary functions and, consequently, improve several known inequalities for the complete elliptic integrals of the second kind.

    Citation: Fei Wang, Bai-Ni Guo, Feng Qi. Monotonicity and inequalities related to complete elliptic integrals of the second kind[J]. AIMS Mathematics, 2020, 5(3): 2732-2742. doi: 10.3934/math.2020176

    Related Papers:

    [1] Naeem Ullah, Muhammad Imran Asjad, Jan Awrejcewicz, Taseer Muhammad, Dumitru Baleanu . On soliton solutions of fractional-order nonlinear model appears in physical sciences. AIMS Mathematics, 2022, 7(5): 7421-7440. doi: 10.3934/math.2022415
    [2] Khalid Khan, Amir Ali, Muhammad Irfan, Zareen A. Khan . Solitary wave solutions in time-fractional Korteweg-de Vries equations with power law kernel. AIMS Mathematics, 2023, 8(1): 792-814. doi: 10.3934/math.2023039
    [3] Aly R. Seadawy, Bayan Alsaedi . Contraction of variational principle and optical soliton solutions for two models of nonlinear Schrödinger equation with polynomial law nonlinearity. AIMS Mathematics, 2024, 9(3): 6336-6367. doi: 10.3934/math.2024309
    [4] Imran Siddique, Khush Bukht Mehdi, Sayed M Eldin, Asim Zafar . Diverse optical solitons solutions of the fractional complex Ginzburg-Landau equation via two altered methods. AIMS Mathematics, 2023, 8(5): 11480-11497. doi: 10.3934/math.2023581
    [5] Ghazala Akram, Maasoomah Sadaf, Mirfa Dawood, Muhammad Abbas, Dumitru Baleanu . Solitary wave solutions to Gardner equation using improved tan(Ω(Υ)2)-expansion method. AIMS Mathematics, 2023, 8(2): 4390-4406. doi: 10.3934/math.2023219
    [6] Ghazala Akram, Saima Arshed, Maasoomah Sadaf, Hajra Mariyam, Muhammad Nauman Aslam, Riaz Ahmad, Ilyas Khan, Jawaher Alzahrani . Abundant solitary wave solutions of Gardner's equation using three effective integration techniques. AIMS Mathematics, 2023, 8(4): 8171-8184. doi: 10.3934/math.2023413
    [7] Naher Mohammed A. Alsafri, Hamad Zogan . Probing the diversity of kink solitons in nonlinear generalised Zakharov-Kuznetsov-Benjamin-Bona-Mahony dynamical model. AIMS Mathematics, 2024, 9(12): 34886-34905. doi: 10.3934/math.20241661
    [8] Wafaa B. Rabie, Hamdy M. Ahmed, Taher A. Nofal, Soliman Alkhatib . Wave solutions for the (3+1)-dimensional fractional Boussinesq-KP-type equation using the modified extended direct algebraic method. AIMS Mathematics, 2024, 9(11): 31882-31897. doi: 10.3934/math.20241532
    [9] Jamshad Ahmad, Zulaikha Mustafa, Mehjabeen Anwar, Marouan Kouki, Nehad Ali Shah . Exploring solitonic wave dynamics in the context of nonlinear conformable Kairat-X equation via unified method. AIMS Mathematics, 2025, 10(5): 10898-10916. doi: 10.3934/math.2025495
    [10] Mohammad Alqudah, Safyan Mukhtar, Haifa A. Alyousef, Sherif M. E. Ismaeel, S. A. El-Tantawy, Fazal Ghani . Probing the diversity of soliton phenomena within conformable Estevez-Mansfield-Clarkson equation in shallow water. AIMS Mathematics, 2024, 9(8): 21212-21238. doi: 10.3934/math.20241030
  • In the paper, the authors present some monotonicity properties of certain functions defined in terms of the complete elliptic integrals of the second kind and some elementary functions and, consequently, improve several known inequalities for the complete elliptic integrals of the second kind.


    We denote by (x,y) (resp. [x,y]) the greatest common divisor (resp. least common multiple) of any given integers x and y. Let a,b and n be positive integers and S={x1,...,xn} be a set of n distinct positive integers. Let f be an arithmetic function and we denote by (f(S)) (resp. (f[S])) the n×n matrix having f evaluated at (xi,xj) (resp. [xi,xj]) as its (i,j)-entry. Particularly, the n×n matrix (Sa)=((xi,xj)a), having the ath power (xi,xj)a as its (i,j) -entry, is called the ath power GCD matrix on S. The n×n matrix [Sa]=([xi,xj]a), having the ath power [xi,xj]a as its (i,j)-entry, is called the ath power LCM matrix on S. These are simply called the GCD matrix and LCM matrix respectively if a=1. The set S is said to be factor closed (FC) if it contains every divisor of x for any xS. The set S is said to be gcd closed (resp. lcm closed) if for all i and j, (xi,xj) (resp. [xi,xj]) is in S. Evidently, an FC set is gcd closed but not conversely. In 1875, Smith [33] published his famous theorem stating that the determinant of the GCD matrix (S) defined on the set S={1,...,n} is the product nk=1φ(k), where φ is Euler's totient function. Since then many interesting generalizations of Smith's determinant and related results have been published (see, for example, [1,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32] and [34,35,36,37,38,39,40,41,42]).

    Divisibility is an important topic in the field of power GCD matrices and power LCM matrices. Bourque and Ligh [5] showed that if S is an FC set, then the GCD matrix (S) divides the LCM matrix [S] in the ring Mn(Z) of n×n matrices over the set Z of integers. That is, there exists an AMn(Z) such that [S]=(S)A or [S]=A(S). Hong [19] showed that such factorization is no longer true in general if S is gcd closed. Bourque and Ligh [8] extended their own result showing that if S is factor closed, then the power GCD matrix (Sa) divides the power LCM matrix [Sa] in the ring Mn(Z). The set S is called a divisor chain if there exists a permutation σ on {1,...,n} such that xσ(1)|...|xσ(n). Obviously a divisor chain is gcd closed but the converse is not true. For x,yS, and x<y, if x|y and the conditions x|d|y and dS imply that d{x,y}, then we say that x is a greatest-type divisor of y in S. For xS, we denote by GS(x) the set of all greatest-type divisors of x in S. By [19], we know that there is gcd-closed set S with maxxS{|GS(x)|}=2 such that (S)1[S]Mn(Z). In [26], Hong, Zhao and Yin showed that if S is gcd closed and maxxS{|GS(x)|}=1, then the GCD matrix (S) divides the LCM matrix [S] in Mn(Z). In [20], Hong showed that (f(S))|(f[S]) holds in the ring Mn(Z) when S is a divisor chain and f is an integer-valued multiplicative function satisfying that f(min(S))|f(x) for any xS.

    Hong [22] initiated the investigation of divisibility among power GCD matrices and among power LCM matrices. In fact, Hong [22] proved that the power GCD matrix (Sa) divides the power GCD matrix (Sb) if a|b and S is a divisor chain. Hong also showed that the power LCM matrix [Sa] divides the power LCM matrix [Sb] if a|b and S is a divisor chain. But such factorizations are not true if a|b and gcd(S)=1 as well |S|2, where by |S| and gcd(S) we denote the cardinality of the set S and the greatest common divisor of all the elements in S, respectively. We say that the set S consists of two coprime divisor chains if we can partition S as S=S1S2, where S1 and S2 are divisor chains and each element of S1 is coprime to each element of S2. Later on, Hong's results were extended by Tan et al. These results confirm partially Conjectures 4.2-4.4 of [22]. It was proved in [36] that if a|b, then (Sa)|(Sb), [Sa]|[Sb] and (Sa)|[Sb] hold in the ring Mn(Z) if and only if both xayb1xaya1 and xbya1xaya1 are integers, where S=S1S2 with S1 and S2 being divisor chains and x=min(S1) and y=min(S2). From this one can read that even though a|b and S consists of two coprime divisor chains, but if 1S, then the divisibility theorems among power GCD matrices and among power LCM matrices need not always hold. Meanwhile, Tan, Lin and Liu found surprisingly that the divisibility theorems among determinants of power GCD matrices and among determinants of power LCM matrices should always hold. That is, they showed that if a|b and S consists of two coprime divisor chains as well 1S, then det(Sa)|det(Sb), det[Sa]|det[Sb] and det(Sa)|det[Sb].

    The main aim of this paper is to generalize this interesting result to the matrices of the forms det(fa(S)) and det(fa[S]), where the arithmetic function fa is defined for any positive integer x by fa(x)=(f(x))a. We will study the divisibility among det(fa(S)) and det(fb(S)) and among det(fa[S]) and det(fb[S]) when a|b. We also investigate the divisibility among det(f(Sa)) and det(f(Sb)) and among det(f[Sa]) and det(f[Sb]) when a|b, where Sa:={xa|xS} is the ath power set of S. In particular, we show that if S consists of two coprime divisor chains with 1S and f is an integer-valued multiplicative function (see, for instance, [2]), then for any positive integer a, we have det(f(Sa))|det(f[Sa]). But it is unclear whether or not the n×n matrix (f[Sa]) is divisible by the n×n matrix (f(Sa)) in the ring Mn(Z) when S consists of two coprime divisor chains with 1S and f is integer-valued and multiplicative. This problem remains open. We guess that the answer to this question is affirmative.

    This paper is organized as follows. First of all, we recall in Section 2 Hong's formulas for det(f(S)) and det(f[S]) when S is gcd closed, and then use them to give formulae for the determinants of matrices associated with arithmetic functions on divisor chains. Consequently, in Section 3, we use these results to derive the formulae for the determinants of matrices associated with arithmetic functions on two coprime divisor chains. The final section is to present the main results and their proofs. Our results extend Hong's results[20,22] and the Tan-Lin-Liu results [36].

    In the close future, we will explore the divisibility among the power matrices associated with integer-valued arithmetic functions.

    In the present section, we provide formulas for the determinants of matrices associated with arithmetic functions on divisor chains. For this purpose, we need the concept of greatest-type divisor introduced by Hong in 1996 (see, for example, [16] and [17]). Notice that the concept of greatest-type divisor played central roles in Hong's solution [16,17] to the Bourque-Ligh conjecture [5], in Cao's partial answer [9] to Hong's conjecture [18] as well as in Li's partial answer [28] to Hong's conjecture [21]. We begin with the following formulas due to Hong.

    Lemma 2.1. ([21]) Let f be an arithmetic function and S be a gcd-closed set. Then

    det(f(S))=xSJGS(x)(1)|J|f(gcd(J{x})))

    and if f is multiplicative, then

    det(f[S])=xSf(x)2JGS(x)(1)|J|f(gcd(J{x})).

    We can now use Hong's formulae to deduce the formulae for det(Sa) and det[Sa] when S is a divisor chain.

    Theorem 2.2. Let f be an arithmetic function and S={x1,...,xn} be a divisor chain such that x1|...|xn and n2. Then

    det(f(S))=f(x1)ni=2(f(xi)f(xi1))

    and if f is multiplicative, then

    det(f[S])=(1)n1f(xn)ni=2(f(xi)f(xi1)).

    Proof. Since x1|x2|...|xn, we have GS(x1)=ϕ and GS(xi)={xi1} for 2in. Then Theorem 2.2 follows immediately from Lemma 2.1.

    This completes the proof of Theorem 2.2.

    In this section, we give the formulae calculating the determinants of matrices associated with arithmetic functions on two coprime divisor chains.

    Theorem 3.1. Let f be an arithmetic function and S={x1,...,xn,y1,...,ym}, where x1|...|xn, y1|...|ym and gcd(xn,ym)=1. Then

    det(f(S))=(f(x1)f(y1)f(1)2)(n1i=1(f(xi+1)f(xi)))(m1j=1(f(yj+1)f(yj)))

    and if f is multiplicative, then

    det(f[S])=(1)m+n1f(xn)f(ym)(f(x1)f(y1)1)(n1i=1(f(xi+1)f(xi)))(m1j=1(f(yj+1)f(yj))).

    Proof. Write Si:={x1,...,xi} and Tj:={y1,...,yj} for all integers i and j with 1in and 1jm. Then S=SnTm.

    First let n=1. Then

    det(f(S))=det(f(S1Tm))=det(f(x1)f(1)f(1)f(1)f(1)f(y1)f(y1)f(y1)f(1)f(y1)f(y2)f(y2)f(1)f(y1)f(y2)f(ym)).

    Let f(y1)=0. If m=1, then it is clear that

    det(f(S))=f(x1)f(y1)f(1)2

    as expected. If m2, then we can calculate that

    det(f(S))=f(1)2det(f(˜Tm1)),

    where ˜Tm1:=Tm{y1}. If m=2, then det(f(S))=f(1)2f(y2) since det(f(˜T1))=f(y2). If m3, then it follows from Theorem 2.2 that

    det(f(S))=f(1)2f(y2)m1j=2(f(yj+1)f(yj))

    as desired.

    Now let f(y1)0. Then replacing the first row by the sum of itself and f(1)f(y1) multiple of the second row and using Theorem 2.2, one arrives at

    det(f(S))=det(f(x1)f(1)2f(y1)000f(1)f(y1)f(y1)f(y1)f(1)f(y1)f(y2)f(y2)f(1)f(y1)f(y2)f(ym))=(f(x1)f(1)2f(y1))det(f(Tm))=(f(x1)f(1)2f(y1))f(y1)m1j=1(f(yj+1)f(yj))=(f(x1)f(y1)f(1)2)m1j=1(f(yj+1)f(yj))

    as required. Thus the first formula of Theorem 3.1 is true when n=1.

    Consequently, let n>1. Then we deduce that

    det(f(S))=det(f(SnTm))=det(f(x1)f(x1)f(x1)f(x1)f(1)f(1)f(1)f(x1)f(x2)f(x2)f(x2)f(1)f(1)f(1)f(x1)f(x2)f(xn1)f(xn1)f(1)f(1)f(1)f(x1)f(x2)f(xn1)f(xn)f(1)f(1)f(1)f(1)f(1)f(1)f(1)f(y1)f(y1)f(y1)f(1)f(1)f(1)f(1)f(y1)f(y2)f(y2)f(1)f(1)f(1)f(1)f(y1)f(y2)f(ym)).

    Replacing nth row by the sum of itself and (1) multiple of (n1)th row gives us that

    det(f(S))=det(f(x1)f(x1)f(x1)f(x1)f(1)f(1)f(1)f(x1)f(x2)f(x2)f(x2)f(1)f(1)f(1)f(x1)f(x2)f(xn1)f(xn1)f(1)f(1)f(1)000f(xn)f(xn1)000f(1)f(1)f(1)f(1)f(y1)f(y1)f(y1)f(1)f(1)f(1)f(1)f(y1)f(y2)f(y2)f(1)f(1)f(1)f(1)f(y1)f(y2)f(ym))=(f(xn)f(xn1))det(f(Sn1Tm))=(f(xn)f(xn1))(f(xn1)f(xn2))(f(x2)f(x1))det(f(S1Tm))=(f(x1)f(y1)f(1)2)(n1i=1(f(xi+1)f(xi)))(m1j=1(f(yj+1)f(yj)))

    as desired. This concludes the proof of the first part of Theorem 3.1.

    We are now in the position to show the second part of Theorem 3.1. Since f is multiplicative, one has f(1)=1 and

    f(gcd(xi,xj))f(lcm(xi,xj))=f(xi)f(xj).

    It then follows that

    (f[S])=Λ(1f(S))Λ,

    where

    Λ:=diag(f(x1),...,f(xn),f(y1),...,f(ym))

    is the (n+m)×(n+m) diagonal matrix with f(x1),...,f(xn),f(y1),...,f(ym) as its diagonal elements. Therefore

    det(f[S])=(ni=1f2(xi))(mj=1f2(yj))det(1f(S)).

    By the first part of Theorem 3.1, one derives that

    det(1f(S))=(1f(x1)f(y1)1f2(1))n1i=1(1f(xi+1)1f(xi))m1j=1(1f(yj+1)1f(yj))=1f(x1)f(y1)f(x1)f(y1)n1i=1(f(xi)f(xi+1))f(x1)f2(x2)f2(xn1)f(xn)m1j=1(f(yj)f(yj+1))f(y1)f2(y2)f2(ym1)f(ym).

    So we obtain that

    det(f[S])=(ni=1f2(xi))(mj=1f2(yj))×1f(x1)f(y1)f(x1)f(y1)n1i=1(f(xi)f(xi+1))f(x1)f2(x2)f2(xn1)f(xn)m1j=1(f(yj)f(yj+1))f(yj)f2(y2)f2(ym1)f(ym)=(1)m+n1f(xn)f(ym)(f(x1)f(y1)1)(n1i=1(f(xi+1)f(xi)))(m1j=1(f(yj+1)f(yj)))

    as desired.

    This ends the proof of Theorem 3.1.

    In this last section, we first study the divisibility among determinants of power matrices associated with integer-valued arithmetic functions. We begin with the following result that is the first main result of this section.

    Theorem 4.1. Let f be an integer-valued arithmetic function and let a and b be positive integers such that a|b. Let S consist of two coprime divisor chains with 1S. Then det(fa(S))|det(fb(S)). Furthermore, if f is multiplicative, then det(fa[S])|det(fb[S]) and det(fa(S))|det(fb[S]).

    Proof. Since S consists of two coprime divisor chains and 1S, without loss of any generality, we may let S={x1,...,xn,y1,...,ym}, where x1|...|xn, y1|...|ym and gcd(xn,ym)=1. Then with f replaced by fa and fb, Theorem 3.1 tells us that

    det(fa(S))=(fa(x1)fa(y1)f(1)2a)(n1i=1(fa(xi+1)fa(xi)))(m1j=1(fa(yj+1)fa(yj))),
    det(fb(S))=(fb(x1)fb(y1)f(1)2b)(n1i=1(fb(xi+1)fb(xi)))(m1j=1(fb(yj+1)fb(yj))),
    det(fa[S])=(1)m+n1fa(xn)fa(ym)(fa(x1)fa(y1)1)×(n1i=1(fa(xi+1)fa(xi)))(m1j=1(fa(yj+1)fa(yj)))

    and

    det(fb[S])=(1)m+n1fb(xn)fb(ym)(fb(x1)fb(y1)1)(n1i=1(fb(xi+1)fb(xi)))(m1j=1(fb(yj+1)fb(yj))).

    Now let det(fa(S))=0. Then fa(x1)fa(y1)f(1)2a=0, or fa(xi+1)fa(xi)=0 for some integer i with 1in1, or fa(yj+1)fa(yj))=0 for some integer j with 1jm1. Since a|b, one then deduces that fb(x1)fb(y1)f(1)2b=0, or fb(xi+1)fb(xi)=0 for some integer i with 1in1, or fb(yj+1)fb(yj))=0 for some integer j with 1jm1. Thus det(fb(S))=det(fb[S])=0 which infers that det(fa(S))|det(fb(S)), det(fa[S])|det(fb[S]) and det(fa(S))|det(fb[S]) as desired. Likewise, if det(fa[S])=0, then we can deduce that det(fb[S])=0. Hence det(fa[S])|det(fb[S]) as expected. So Theorem 4.1 holds in this case.

    In what follows, we let det(fa(S))0 and det(fa[S])0. Since a|b, we may let b=ka for some integer k. Therefore

    det(fb(S))det(fa(S))=(fb(x1)fb(y1)f(1)2b)(n1i=1(fb(xi+1)fb(xi)))(m1j=1(fb(yj+1)fb(yj)))(fa(x1)fa(y1)f(1)2a)(n1i=1(fa(xi+1)fa(xi)))(m1j=1(fa(yj+1)fa(yj)))=(fka(x1)fka(y1)f(1)2ka)(n1i=1(fka(xi+1)fka(xi)))(m1j=1(fka(yj+1)fka(yj)))(fa(x1)fa(y1)f(1)2a)(n1i=1(fa(xi+1)fa(xi)))(m1j=1(fa(yj+1)fa(yj)))=(kt=1(f(x1)f(y1))(kt)af2(t1)a(1))(n1i=1kt=1(f(xi+1))(kt)af(t1)a(xi))×(m1j=1kt=1(f(yj+1))(kt)af(t1)a(yj))Z.

    This implies that det(fa(S))|det(fb(S)).

    Similarly, if f is multiplicative and integer-valued, then one deduces that f(1)=1,

    det(fb[S])det(fa[S])=fb(xn)fb(ym)(fb(x1)fb(y1)1)(n1i=1(fb(xi+1)fb(xi)))(m1j=1(fb(yj+1)fb(yj)))fa(xn)fa(ym)(fa(x1)fa(y1)1)(n1i=1(fa(xi+1)fa(xi)))(m1j=1(fa(yj+1)fa(yj)))=(f(xn)f(ym))(k1)a(kt=1(f(x1)f(y1))(kt)a)(n1i=1kt=1(f(xi+1))(kt)af(t1)a(xi))×(m1j=1kt=1(f(yj+1))(kt)af(t1)a(yj))Z

    and

    det(fb[S])det(fa(S))=(1)m+n1×fb(xn)fb(ym)(fb(x1)fb(y1)1)(n1i=1(fb(xi+1)fb(xi)))(m1j=1(fb(yj+1)fb(yj)))(fa(x1)fa(y1)1)(n1i=1(fa(xi+1)fa(xi)))(m1j=1(fa(yj+1)fa(yj)))=(1)m+n1fb(xn)fb(ym)(kt=1(f(x1)f(y1))(kt)a)×(n1i=1kt=1(f(xi+1))(kt)af(t1)a(xi))(m1j=1kt=1(f(yj+1))(kt)af(t1)a(yj))Z

    as one requires. Thus Theorem 4.1 is true if det(fa(S))0 and det(fa[S])0.

    This finishes the proof of Theorem 4.1.

    We point out that the condition a|b in Theorem 4.1 is not necessary as the following example shows.

    Example 4.1. (ⅰ). Let f(x)=x+1, a=2,b=5 and S={2,4,3}. Then a|b. Clearly, one has

    (f2(S))=(99492544416) and (f5(S))=(2432433224331253232321024).

    So we can compute and get that

    det(f2(S))=2048 and det(f5(S))=714182656.

    Hence

    det(f5(S))det(f2(S))=348722Z.

    That is, one has det(f2(S))|det(f5(S)).

    (ⅱ). Let f(x)=φ(x), a=2,b=3 and S={2,4,7}. Then a|b and

    (φ2(S))=(1111411136),(φ2[S])=(1436441443614436)

    and

    (φ3[S])=(182168817282161728216).

    One can easily calculate and obtain that

    det(φ2(S))=105,det(φ2[S])=15120 and det(φ3[S])=2600640.

    Thus

    det(φ3[S])det(φ2(S))=24768Z and det(φ3[S])det(φ2[S])=172Z.

    In other words, we have det(φ2[S])|det(φ3[S]) and det(φ2(S))|det(φ3[S]).

    It is also remarked that the condition that f is multiplicative in Theorem 4.1 is necessary as the following example shows.

    Example 4.2. Letting f(x):=x+1, a:=1,b:=3 and S:={2,4,3} gives us that

    (f(S))=(332352224),(f[S])=(35755137134)

    and

    (f3(S))=(272782712588864),(f3[S])=(271253431251252197343219764).

    So we obtain that det(f(S))=16,det(f[S])=118,det(f3(S))=163072 and det(f3[S])=42578782. Thus

    det(f3(S))det(f(S))=10192Z,det(f3[S])det(f(S))=212893918Z and det(f3[S])det(f[S])=2128939159Z.

    So det(f(S))|det(f3(S)), det(f(S))|det(f3[S]) and det(f[S])|det(f3[S]).

    Subsequently, we explore the divisibility of determinants of the matrices associated to the integer-valued multiplicative function on the power set Sa. We present the second main result of this section as follows.

    Theorem 4.2. Let f be an integer-valued arithmetic function and let a and b be positive integers such that a|b. Let S consist of two coprime divisor chains with 1S. Then each of the following is true:

    (ⅰ). If f is multiplicative, then det(f(Sa))|det(f[Sa]).

    (ⅱ). If f is completely multiplicative, then we have det(f(Sa))|det(f(Sb)), det(f[Sa])|det(f[Sb]) and det(f(Sa))|det(f[Sb]).

    Moreover, there exist multiplicative functions f, positive integers a and b with a|b and b>a, and a set S consisting of two coprime divisor chains with 1S, such that det(f(Sa))det(f(Sb)), det(f[Sa])det(f[Sb]) and det(f(Sa))det(f[Sb]).

    Proof. We begin with the proof of the first part of Theorem 4.2.

    (ⅰ). Since S consists of two coprime divisor chains with 1S, the power set Sa consists of two coprime divisor chains with gcd(Sa)=1Sa. Furthermore, since f is multiplicative, one has either f(1)=0 or f(1)=1. If f(1)=0, then f is the zero function and so one has det(f(Sa))=det(f[Sa])=0. Thus det(f(Sa))|det(f[Sa]) as desired. Now let f(1)=1. Then by Lemma 3.1, we have

    (1)m+n1f(xan)f(yam)det(f(Sa))=(1)m+n1f(xan)f(yam)(f(xa1)f(ya1)1)(n1i=1(f(xai+1)f(xai)))(m1j=1(f(yaj+1)f(yaj)))=det(f[Sa])

    However, since f is integer valued, one has f(xan)f(yam)Z. Therefore the desired result det(f(Sa))|det(f[Sa]) follows. Part (ⅰ) is proved.

    (ⅱ). If f is complete multiplicative, then it is clear that f(xa)=fa(x) for any positive integers a and x. So one has

    (f(Sa))=(fa(S)),(f(Sb))=(fb(S)),(f[Sa])=(fa[S]) and (f[Sb])=(fb[S]).

    Since a|b and S consists of two coprime divisor chains with 1S, it then follows from Theorem 4.1 that det(fa(S))|det(fb(S)), det(fa[S])|det(fb[S]) and det(fa(S))|det(fb[S]). Thus the desired results det(f(Sa))|det(f(Sb)), det(f[Sa])|det(f[Sb]) and det(f(Sa))|det(f[Sb]) follow immediately. Part (ⅱ) is proved.

    Finally, we turn our attention to the proof of the second part of Theorem 4.2. Letting S:={2,4,3} and a:=2,b:=4 gives us that

    (S)=(221241113),(S2)=(4414161119),(S4)=(161611625611181)

    and

    [S]=(24644126123),[S2]=(416361616144361449),[S4]=(1625612962562562073612962073681).

    Therefore picking f=φ to be the Euler's totient function tells us that

    (f(S2))=(φ(S2))=(221281116),(f(S4))=(φ(S4))=(881812811154)

    and

    (f[S2])=(φ[S2])=(2812884812486),(f[S4])=(φ[S4])=(81284321281286912432691254).

    So one deduces that

    det(f(Sb))det(f(Sa))=det(φ(S4))det(φ(S2))=5172066=862011Z,
    det(f[Sb])det(f[Sa])=det(φ[S4])det(φ[S2])=3574886403168=124128011Z

    and

    det(f[Sb])det(f(Sa))=det(φ[S4])det(φ(S2))=35748864066=5958144011Z.

    So det(f(Sa))det(f(Sb)), det(f[Sa])det(f[Sb]) and det(f(Sa))det(f[Sb]) as desired.

    This concludes the proof of Theorem 4.2.

    Remark 4.3. (ⅰ). If S consists of at least three coprime divisor chains, then the divisibility result in Theorem 4.2 (i) may be false. For instance, letting S:={2,4,3,5} and a:=2 gives us that

    (φ(S2))=(22112811116111120) and (φ[S2])=(2812408848160124861204016012020).

    Hence

    det(φ[S2])det(φ(S2))=148320107Z.

    That is, det(φ(S2))|det(φ[S2]).

    On the other hand, the condition that f is multiplicative in Theorem 4.2 (i) is necessary. For example, let f(x):=x+1 and S:={2,4,3},a:=1. Then f is not multiplicative and

    det(f[S])det(f(S))=598Z.

    Hence det(f(S))|det(f[S]).

    (ⅱ). We remark that the condition a|b is not necessary for the divisibility result in Theorem 4.2 (ii). For example, letting f(x):=x,S:={2,6,5},a:=2 and b:=5 gives us that

    (S2)=(44143611125),(S5)=(323213277761113125)

    and

    [S2]=(436100363690010090025),[S5]=(3277761000007776777624300000100000243000003125).

    Then we compute and get that

    det((S5))det((S2))=244442Z,det([S5])det([S2])=659993400Z and det([S5])det((S2))=5939940600000Z.

    It follows immediately that det((S2))|det((S5)),det([S2])|det([S5]) and det((S2))|det([S5]).

    The authors would like to thank the anonymous referees for careful readings of the manuscript and helpful comments. S.F. Hong was supported partially by National Science Foundation of China Grant # 11771304.

    We declare that we have no conflict of interest.



    [1] H. Alzer and S.-L. Qiu, Monotonicity theorems and inequalities for the complete elliptic integrals, J. Comput. Appl. Math., 172 (2004), 289-312. doi: 10.1016/j.cam.2004.02.009
    [2] G. D. Anderson, S.-L. Qiu, M. K. Vamanamurthy, Elliptic integral inequalities, with applications, Constr. Approx., 14 (1998), 195-207. doi: 10.1007/s003659900070
    [3] G.-D. Anderson, S.-L. Qiu, M.-K. Vamanamurthy, et al. Generalized elliptic integrals and modular equations, Pacific J. Math., 192 (2000), 1-37. doi: 10.2140/pjm.2000.192.1
    [4] G.-D. Anderson, M.-K. Vamanamurthy, M. Vuorinen, Conformal Invariants, Inequalities, and Quasiconformal Maps, Canadian Mathematical Society Series of Monographs and Advanced Texts, John Wiley & Sons, New York, 1997.
    [5] S. András and Á. Baricz, Bounds for complete elliptic integrals of the first kind, Expo. Math., 28 (2010), 357-364. doi: 10.1016/j.exmath.2009.12.005
    [6] Á. Baricz, Turán type inequalities for generalized complete elliptic integrals, Math. Z., 256 (2007), 895-911. doi: 10.1007/s00209-007-0111-x
    [7] P. F. Byrd and M. D. Friedman, Handbook of Elliptic Integrals for Engineers and Scientists, Springer-Verlag, New York, 1971.
    [8] C.-P. Chen and F. Qi, The best bounds in Wallis' inequality, Proc. Amer. Math. Soc., 133 (2005), 397-401. doi: 10.1090/S0002-9939-04-07499-4
    [9] Y.-M. Chu, M.-K. Wang, Y.-P. Jiang, et al. Concavity of the complete elliptic integrals of the second kind with respect to Hölder means, J. Math. Anal. Appl., 395 (2012), 637-642. doi: 10.1016/j.jmaa.2012.05.083
    [10] B.-N. Guo and F. Qi, On the Wallis formula, Int. J. Anal. Appl., 8 (2015), 30-38.
    [11] B.-N. Guo and F. Qi, Some bounds for the complete elliptic integrals of the first and second kinds, Math. Inequal. Appl., 14 (2011), 323-334.
    [12] Y. Hua and F. Qi, A double inequality for bounding Toader mean by the centroidal mean, Proc. Indian Acad. Sci. Math. Sci., 124 (2014), 527-531. doi: 10.1007/s12044-014-0183-6
    [13] Y. Hua and F. Qi, The best bounds for Toader mean in terms of the centroidal and arithmetic means, Filomat, 28 (2014), 775-780. doi: 10.2298/FIL1404775H
    [14] W.-D. Jiang and F. Qi, A double inequality for the combination of Toader mean and the arithmetic mean in terms of the contraharmonic mean, Publ. Inst. Math. (Beograd) (N.S.), 99 (2016), 237-242. doi: 10.2298/PIM141026009J
    [15] V. Lampret, The perimeter of a flattened ellipse can be estimated accurately even from Maclaurin's series, Cubo, 21 (2019), 51-64. doi: 10.4067/S0719-06462019000200051
    [16] X.-Y. Ma, Y.-M. Chu, F. Wang, Monotonicity and inequalities for the generalized distortion function, Acta Math. Sci., 33 (2013), 1759-1766. doi: 10.1016/S0252-9602(13)60121-6
    [17] F. Qi, Limit formulas for ratios between derivatives of the gamma and digamma functions at their singularities, Filomat, 27 (2013), 601-604. doi: 10.2298/FIL1304601Q
    [18] F. Qi and R. P. Agarwal, On complete monotonicity for several classes of functions related to ratios of gamma functions, J. Inequal. Appl., 2019 (2019), 1-42. doi: 10.1186/s13660-019-1955-4
    [19] F. Qi, L.-H. Cui, S.-L. Xu, Some inequalities constructed by Tchebysheff's integral inequality, Math. Inequal. Appl., 2 (1999), 517-528.
    [20] F. Qi and B.-N. Guo, Lévy-Khintchine representation of Toader-Qi mean, Math. Inequal. Appl., 21 (2018), 421-431.
    [21] F. Qi and Z. Huang, Inequalities for complete elliptic integrals, Tamkang J. Math., 29 (1998), 165-169.
    [22] F. Qi and A.-Q. Liu, Completely monotonic degrees for a difference between the logarithmic and psi functions, J. Comput. Appl. Math., 361 (2019), 366-371. doi: 10.1016/j.cam.2019.05.001
    [23] F. Qi, D.-W. Niu, B.-N. Guo, Refinements, generalizations, and applications of Jordan's inequality and related problems, J. Inequal. Appl., 2009 (2019), 271923.
    [24] F. Qi, X.-T. Shi, F.-F. Liu, et al. A double inequality for an integral mean in terms of the exponential and logarithmic means, Period. Math. Hungar., 75 (2017), 180-189. doi: 10.1007/s10998-016-0181-9
    [25] F. Qi and A. Sofo, An alternative and united proof of a double inequality for bounding the arithmetic-geometric mean, Politehn. Univ. Bucharest Sci. Bull. Ser. A Appl. Math. Phys., 71 (2009), 69-76.
    [26] F. Qi, S.-W. Yao, B.-N. Guo, Arithmetic means for a class of functions and the modified Bessel functions of the first kind, Mathematics, 7 (2019), 60.
    [27] S.-L. Qiu, X.-Y. Ma, T. R. Huang, Some properties of the difference between the Ramanujan constant and beta function, J. Math. Anal. Appl., 446 (2017), 114-129. doi: 10.1016/j.jmaa.2016.08.043
    [28] S.-L. Qiu, M. K. Vamanamurthy, M. Vuorinen, Some inequalities for the Hersch-Pfluger distortion function, J. Inequal. Appl., 4 (1999), 115-139.
    [29] S.-L. Qiu and M. Vuorinen, Some properties of the gamma and psi functions with applications, Math. Comp., 74 (2004), 723-742. doi: 10.1090/S0025-5718-04-01675-8
    [30] S.-L. Qiu and M. Vuorinen, Special functions in geometric function theory, Handbook of Complex Analysis: Geometric Function Theory, 2 (2005), 621-659. doi: 10.1016/S1874-5709(05)80018-6
    [31] M. Vuorinen, Singular values, Ramanujan modular equations, and Landen transformations, Studia Math., 121 (1996), 221-230. doi: 10.4064/sm-121-3-221-230
    [32] F. Wang, J.-H. He, L. Yin, et al. Monotonicity properties and inequalities related to generalized Grötzsch ring functions, Open Math., 17 (2019), 802-812. doi: 10.1515/math-2019-0064
    [33] M.-K. Wang, Y.-M. Chu, Y.-F. Qiu, et al. An optimal power mean inequality for the complete elliptic integrals, Appl. Math. Lett., 24 (2011), 887-890. doi: 10.1016/j.aml.2010.12.044
    [34] M.-K. Wang, S.-L. Qiu, Y.-M. Chu, et al. Generalized Hersch-Pfluger distortion function and complete elliptic integrals, J. Math. Anal. Appl., 385 (2012), 221-229. doi: 10.1016/j.jmaa.2011.06.039
    [35] G.-D. Wang, X.-H. Zhang, Y.-M. Chu, Inequalities for the generalized elliptic integrals and modular functions, J. Math. Anal. Appl., 331 (2007), 1275-1283. doi: 10.1016/j.jmaa.2006.09.070
    [36] L. Yin, X.-L. Lin, and F. Qi, Monotonicity, convexity, and inequalities related to complete (p, q, r)- elliptic integrals and generalized trigonometric functions, Publ. Math. Debrecen, 97 (2020), in press.
    [37] L. Yin and F. Qi, Some inequalities for complete elliptic integrals, Appl. Math. E-Notes, 14 (2014), 192-199.
    [38] X.-H. Zhang, G.-D. Wang, Y.-M. Chu, Remark on generalized elliptic integrals, Proc. Roy. Soc. Edinburgh Sect. A, 139 (2009), 417-426. doi: 10.1017/S0308210507000327
  • Reader Comments
  • © 2020 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(4878) PDF downloads(317) Cited by(4)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog