Research Article Determinant and Inverse of Meet and Join Matrices

Transcription

1 Hindawi Publishing Corporation International Journal of Mathematics and Mathematical Sciences Volume 2007, Article ID 37580, 11 pages doi: /2007/37580 Research Article Determinant and Inverse of Meet and Join Matrices Ercan Altinisik, Naim Tuglu, and Pentti Haukkanen Received 2 March 2007; Accepted 18 April 2007 Recommended by Dihua Jiang We define meet and join matrices on two subsets X and Y ofalatticep, withrespect to a complex-valued function f on P by X,Y f = f x i y i and [X,Y] f = f x i y i, respectively. We present expressions for the determinant and the inverse of X,Y f and [X,Y] f, and as special cases we obtain several new and known formulas for the determinant and the inverse of the usual meet and join matrices S f and [S] f. Copyright 2007 Ercan Altinisik et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 1. Introduction Let S ={x 1,x 2,...,x n } be a set of distinct positive integers, and let f be an arithmetical function. Let S f denote the n n matrix having f evaluated at the greatest common divisor x i,x j ofx i and x j as its ij-entry, that is, S f = f x i,x j. Analogously, let [S] f denote the n n matrix having f evaluated at the least common multiple [x i,x j ]ofx i and x j as its ij-entry, that is, [S] f = f [x i,x j ]. The matrices S f an [S] f are referred to as the GCD and LCM matrices on S associated with f, respectively. The set S is said to be factor-closed if it contains every divisor of x for any x S, and the set S is said to be GCD-closed if x i,x j S whenever x i,x j S. Every factor-closed set is GCD-closed but the converse does not hold. Smith [1]calculateddetS f when S is factor-closed and det[s] f in a more special case. Since Smith, a large number of results on GCD and LCM matrices have been presented in the literature. For general accounts, see, for example, [2 5]. Let P, be a lattice in which every principal order ideal is finite. Let S={x 1,x 2,...,x n } be a subset of P, andlet f be a complex-valued function on P. Then the n n matrix S f = f x i x j is called the meet matrix on S associated with f and the n n matrix

2 2 International Journal of Mathematics and Mathematical Sciences [S] f = f x i x j is called the join matrix on S associated with f.ifp, = Z +,, then meet and join matrices, respectively, become GCD and LCM matrices. The set S is said to be lower-closed resp., upper-closed if for every x, y P with x S and y x resp., x y, we have y S. The set S is said to be meet-closed resp., join-closed if for every x, y S,wehavex y S resp., x y S. Meet matrices have been studied in many papers see, e.g., [3, 5 11]. Haukkanen [7] calculated the determinant of S f on arbitrary set S and obtained the inverse of S f on a lower-closed set S. Korkee and Haukkanen [12] obtained the inverse of S f on a meet-closed set S. Join matrices have previously been studied by Hong and Sun [13], Korkee and Haukkanen [5], and Wang [11]. Korkee and Haukkanen [5] present, among others, formulas for the determinant and inverse of [S] f on meet-closed, join-closed, lower-closed, and upper-closed sets S. Let X ={x 1,x 2,...,x n } and Y ={y 1, y 2,..., y n } be two subsets of P. We define the meet matrix on X and Y with respect to f as X,Y f = f x i y j. In particular, S,S f = S f. Analogously, we define the join matrix on X and Y with respect to f as [X,Y] f = f x i y j. In particular, [S,S] f = [S] f. In this paper we present expressions for the determinant and the inverse of X,Y f on arbitrary sets X and Y. IfX = Y = S, then we obtain the determinant formula for S f given in [7] and a formula for the inverse of S f on arbitrary set S.IfS is meet-closed or lower-closed, then the formula for the inverse of S f reduces to those given in [7, 12]. We also obtain a new expression for the inverse formulas of S f givenin[7, 12]. We also present expressions for the determinant and inverse of [X,Y] f when the function f is semimultiplicative for definition, see 6.1. As special cases, we obtain formulas for the determinant and inverse of [S] f on arbitrary set S. These formulas generalize the determinant and the inverse formulas of [S] f on meet-closed and lower-closed sets S presented in [5]. As special cases, we also obtain some new and known results on LCM matrices. Determinant and inverse formulas for S f and [S] f on join-closed and upper-closed sets S could be obtained applying duality to the results of this paper. We do not include the details of these results here. 2. Preliminaries Let P, be a lattice in which every principal order ideal is finite, and let f be a complexvalued function on P.LetX ={x 1,x 2,...,x n } and Y ={y 1, y 2,..., y n } be two subsets of P. Let the elements of X and Y be arranged so that x i x j i j and y i y j i j. Let D ={d 1,d 2,...,d m } be any subset of P containing the elements x i y j, i, j = 1,2,...,n.Let the elements of D be arranged so that d i d j i j. We define the function Ψ D, f on D inductively as Ψ D, f dk = f dk d v d k Ψ D, f dv 2.1

3 Ercan Altinisik et al. 3 or Then f d k = dv. 2.2 d v d k Ψ D, f Ψ D, f dk = f d v μd dv,d k, 2.3 d v d k where μ D is the Möbius function of the poset D,, see [14,SectionIV.1].IfD is meetclosed, then Ψ D, f dk = f wμw,z, 2.4 z d k z d t t<k where μ is the Möbius function of P,andifD is lower-closed, then Ψ D, f dk = f d v μ dv,d k, 2.5 d v d k where μ is the Möbius function of P. For proofs of 2.4 and2.5, see [7]. If P, = Z +, andd is factor-closed, then μ D d v,d k = μd k /d v see [15, Chapter 7], where μ is the number-theoretic Möbius function, and 2.3becomes Ψ D, f dk = f dk d v μ = f μ d k, 2.6 d d v v d k w z where is the Dirichlet convolution of arithmetical functions. Let EX = e ij X and EY = e ij Y denote the n m matrices defined by 1 ifd j x i, e ij X = 0 otherwise, 1 ifd j y i, e ij Y = 0 otherwise, 2.7 respectively. Note that EXandEYdependonD butforthesakeofbrevity,d is omitted from the notation. We also denote 3. A structure theorem Λ D, f = diag Ψ D, f d1,ψd, f d2,...,ψd, f dm. 2.8 In this section, we give a factorization of the matrix X,Y f = f x i y j. As special cases, we obtain the factorizations of S f given in [7, 9, 12]. A large number of similar factorizations are presented in the literature. The idea of this kind of factorization may be considered to originate from Pólya and Szegö[16].

4 4 International Journal of Mathematics and Mathematical Sciences Theorem 3.1. One has Proof. By 2.2, the ij-entry of X,Y f is X,Y f = EXΛ D, f EY T. 3.1 f x i y j = d v x i y j Ψ D, f Now, applying 2.7 and2.8to3.2, we obtain Theorem 3.1. dv. 3.2 Remark 3.2. The sets X and Y could be allowed to have distinct cardinalities in Theorems 3.1 and 6.1. However, in other results we must assume that these cardinalities coincide. 4. Determinant formulas In this section, we derive formulas for determinants of meet matrices. In Theorem 4.1, we present an expression for detx,y f on arbitrary sets X and Y. TakingX = Y = S = {x 1,x 2,...,x n } in Theorem 4.1, we could obtain a formula for the determinant of usual meet matrices S f on arbitrary set S see [7, Theorem 3], and further taking P, = Z +, we could obtain a formula for the determinant of GCD matrices on arbitrary set S see [17, Theorem 2]. In Theorems 4.2 and 4.4, respectively, we calculate dets f on meet-closed and lower-closed sets S. These formulas are also given in [7]. Theorem 4.1. i If n>m, then detx,y f = 0. ii If n m, then detx,y f = Proof. By Theorem 3.1, 1 k 1<k 2< <k n m detex k1,k 2,...,k n detey k1,k 2,...,k n Ψ D, f ΨD, f ΨD, f dkn. 4.1 detx,y f = det EXΛ D, f EY T. 4.2 Thus by the Cauchy-Binet formula, we obtain Theorem 4.1. Theorem 4.2. If S is meet-closed, then dets f = Ψ S, f xv = f wμw,z. 4.3 z x v w z z x t t<v Proof. We take X = Y = S in Theorem 4.1. SinceS is meet-closed, we may further take D = S.Thenm = n and detes k1,k 2,...,k n = detes 1,2,...,n = 1, and so we obtain the first equality in 4.3. The second equality follows from 2.4. Remark 4.3. Theorem 4.2 canalsobeprovedbytakingx = Y = S and D = S in Theorem 3.1.

5 Ercan Altinisik et al. 5 Theorem 4.4. If S is lower-closed, then dets f = Ψ S, f xv = f x u μ xu,x v. 4.4 x u x v Proof. The first equality in 4.4 follows from4.3. The second equality follows from 2.5. Corollary 4.5 [18, Theorem2]. Let S be a GCD-closed set of distinct positive integers, and let f be an arithmetical function. Then dets f = f μz. 4.5 z x v z x t t<v Corollary 4.6 [1]. Let S beafactor-closedsetofdistinctpositiveintegers,andlet f be an arithmetical function. Then 5. Inverse formulas dets f = f μ x v. 4.6 In this section, we derive formulas for inverses of meet matrices. In Theorem 5.1, we present an expression for the inverse of X,Y f on arbitrary sets X and Y,andinTheorem 5.2 we present an expression for the inverse of S f on arbitrary set S. TakingP, = Z +,, we could obtain a formula for the inverse of GCD matrices on arbitrary set S. Formulas for the inverse of meet or GCD matrices on arbitrary set have not previously been presented in the literature. In Theorems 5.3 and 5.5, respectively, we calculate the inverse of S f on meet-closed and lower-closed sets S. Similar formulas are given in [12, Theorem 7.1] and [7,Theorem6]. Theorem 5.1. Let X i = X \{x i } and Y i = Y \{y i } for i = 1,2,...,n.IfX,Y f is invertible, then the inverse of X,Y f is the n n matrix B = b ij,where 1i+j detx,y f Proof. It is well known that 1 k 1<k 2< <k n 1 m dete X j k 1,k 2,...,k n 1 dete Y i k 1,k 2,...,k n 1 Ψ D, f ΨD, f ΨD, f dkn α ji detx,y f, 5.2

6 6 International Journal of Mathematics and Mathematical Sciences where α ji is the cofactor of the ji-entry of X,Y f.itiseasytoseethatα ji = 1 i+j detx j, Y i f.bytheorem 4.1,weseethat det X j,y i f = 1 k 1<k 2< <k n 1 m dete X j k 1,k 2,...,k n 1 dete Y i k 1,k 2,...,k n 1 Ψ D, f ΨD, f ΨD, f dkn Combining the above equations, we obtain Theorem 5.1. Theorem 5.2. Let S i = S \{x i } for i = 1,2,...,n.IfS f is invertible, then the inverse of S f is the n n matrix B = b ij,where 1i+j dets f 1 k 1<k 2< <k n 1 m dete S j k 1,k 2,...,k n 1 dete S i k 1,k 2,...,k n 1 Ψ D, f ΨD, f ΨD, f dkn Proof. Taking X = Y = S in Theorem 5.1,weobtainTheorem 5.2. Theorem 5.3. Suppose that S is meet-closed. If S f is invertible, then the inverse of S f is the n n matrix B = b ij,where n 1 b i+j ij = dete S k i dete S k Ψ j, 5.5 S, f xk k=1 where ES k i is the n 1 n 1 submatrix of ES obtained by deleting the ith row and the kthcolumn ofes,or x i x j x k μ S where μ S is the Möbius function of the poset S,. xi,x k μs xj,x k Ψ S, f xk, 5.6 Proof. Since S is meet-closed, we may take D = S. ThenES is a square matrix with detes = 1. Further, ES T is the matrix associated with the zeta function of the finite poset S,. Thus the inverse of ES T is the matrix associated with the Möbius function of S,, that is, if U = u ij istheinverseofes T,thenu ij = μ S x i,x j, see [14,Section IV.1]. On the other hand, u ij = β ij / detes T = β ij,whereβ ij is the cofactor of the ij-entry of ES. Here β ij = 1 i+j detes j i. Thus 1 i+j dete S j i = μs xi,x j. 5.7 Now we apply Theorem 5.2 with D = S.Thenm = n, and using formulas4.3and5.7, we obtain Theorem 5.3. Remark 5.4. Equation 5.6 isgivenin[7, Theorem 6] and can also be proved by taking X = Y = S and D = S in Theorem 3.1 and then applying the formula S 1 f = ES T 1 Λ 1 S, f ES 1.

7 Ercan Altinisik et al. 7 Theorem 5.5. Suppose that S is lower-closed. If S f is invertible, then the inverse of S f is the n n matrix B = b ij,where Here μ is the Möbius function of P,. x i x j x k μ xi,x k μ xj,x k Ψ S, f xk. 5.8 Proof. Since S is lower-closed, we have μ S = μ on S, apply[14, Proposition 4.6]. Thus, Theorem5.5 follows from Theorem 5.3. Corollary 5.6 [18, Corollary1]. Let S beafactor-closedsetofdistinctpositiveintegers, and let f be an arithmetical function. If S f is invertible, then the inverse of S f is the n n matrix B = b ij,where [x i,x j] x k μ Here μ is the number-theoretic Möbius function. 6. Formulas for join matrices xk /x i μ xk /x j f μ x k. 5.9 Let f be a complex-valued function on P.Wesaythat f is a semimultiplicative function if f x f y = f x y f x y 6.1 for all x, y P see [5]. The notion of a semimultiplicative function arises from the theory of arithmetical functions. Namely, an arithmetical function f is said to be semimultiplicative if f r f s= f r,s f [r,s] for all r,s Z +. For semimultiplicative arithmetical functions, reference is made to the book by Sivaramakrishnan [19], see also [2]. Note that a semimultiplicative arithmetical function f with f 1 0 is referred to as a quasimultiplicative arithmetical function. Quasimultiplicative arithmetical functions with f 1 = 1 are the usual multiplicative arithmetical functions. In this section, we show that join matrices [X,Y] f with respect to semimultiplicative functions f possess properties similar to those given for meet matrices X,Y f with respect to arbitrary functions f in Sections 3, 4, and5. Throughout this section, f is a semimultiplicative function on P such that f x 0 for all x P. Theorem 6.1. One has or [X,Y] f = Δ X, f X,Y 1/f Δ Y, f 6.2 [X,Y] f = Δ X, f EXΛ D,1/f EY T Δ Y, f, 6.3

8 8 International Journal of Mathematics and Mathematical Sciences where Proof. By 6.1, the ij-entry of [X,Y] f is Δ X, f = diag f x 1, f x2,..., f xn. 6.4 f x i y j = f xi 1 f x i y j f y j. 6.5 We thus obtain 6.2, and applying Theorem 3.1 we obtain 6.3. From 6.2, weobtain det[x,y] f = f x v f yv detx,y 1/f, [X,Y] 1 f 6.6 = Δ 1 Y, f X,Y 1 1/f Δ 1 X, f. Now, using 6.6 and the formulas of Sections 4 and 5, we obtain formulas for join matrices. We first present formulas for the determinant of join matrices. In Theorem 6.2, we give an expression for det[x,y] f on arbitrary sets X and Y. Formulas for the determinant of join or LCM matrices on arbitrary sets have not previously been presented in the literature. In Theorems 6.3 and 6.4, respectively, we calculate det[s] f on meet-closed and lower-closed sets S. Similar formulas are given in [5, Section 5.3]. Theorem 6.2. i If n>m, then det[x,y] f = 0. ii If n m, then det[x,y] f = f x v f yv Theorem 6.3. if S is meet-closed, then 1 k 1<k 2< <k n m detex k1,k 2,...,k n detey k1,k 2,...,k n Ψ D,1/f ΨD,1/f ΨD,1/f dkn. det[s] f = f 2ψs,1/f x v xv = f 2 x v Theorem 6.4. If S is lower-closed, then z x v z x t t<v det[s] f = f 2ΨS,1/f x v xv = f 2 x v w z x u x v μ 6.7 μw,z f w. 6.8 xu,x v f x u. 6.9

9 Ercan Altinisik et al. 9 Corollary 6.5 [2, Theorem 3.2]. Let S be a GCD-closed set of distinct positive integers, and let f be a quasimultiplicative arithmetical function such that f r 0 for all r Z +. Then det[s] f = f 2 1 x v f μ z Corollary 6.6 [20, Theorem2]. Let S be a factor-closed set of distinct positive integers, and let f be a quasimultiplicative arithmetical function such that f r 0 for all r Z +. Then det[s] f = z x v z x t t<v f 2 1 x v f μ xv We next derive formulas for inverses of join matrices. In Theorem 6.7, wegiveanexpression for the inverse of [X,Y] f on arbitrary sets X and Y,andinTheorem 6.8 we give an expression for the inverse of [S] f on arbitrary set S. TakingP, = Z +, wecould obtain a formula for the inverse of LCM matrices on arbitrary set S. Formulas for the inverse of join or LCM matrices on arbitrary set have not previously been presented in the literature. In Theorems 6.9 and 6.10, respectively, we calculate the inverse of [S] f on meet-closed and lower-closed sets S. Similar formulas are given in [5, Section 5.3]. Theorem 6.7. Let X i = X \{x i } and Y i = Y \{y i } for i = 1,2,...,n.If[X,Y] f is invertible, then the inverse of [X,Y] f is the n n matrix B = b ij,where 1 b i+j ij = f f x v f yv x j f yi det[x,y]f dete X j k dete 1,k 2,...,k n 1 Y i k 1,k 2,...,k n 1 1 k 1<k 2< <k n 1 m Ψ D,1/f ΨD,1/f ΨD,1/f dkn Theorem 6.8. Let S i = S \{x i } for i = 1,2,...,n.If[S] f is invertible, then the inverse of [S] f is the n n matrix B = b ij,where 1 b i+j ij = f f 2 x v x i f xj det[s] f dete S i k dete 1,k 2,...,k n 1 S j k 1,k 2,...,k n 1 1 k 1<k 2< <k n 1 m Ψ D,1/f ΨD,1/f ΨD,1/f dkn

10 10 International Journal of Mathematics and Mathematical Sciences Theorem 6.9. Suppose that S is meet-closed. If [S] f is invertible, then the inverse of [S] f is the n n matrix B = b ij,where 1 f x i f xj x i x j x k μ S Here μ S is the Möbius function of the poset S,. xi,x k μs xj,x k Ψ S,1/f xk Theorem Suppose that S is lower-closed. If [S] f is invertible, then the inverse of [S] f is the n n matrix B = b ij,where 1 f x i f xj Here μ is the Möbius function of P,. x i x j x k μ xi,x k μ xj,x k Ψ S,1/f xk Corollary 6.11 [20, Theorem2]. Let S be a factor-closed set of distinct positive integers, and let f be a quasimultiplicative arithmetical function such that f r 0 for all r Z +.If [S] f is invertible, then the inverse of [S] f is the n n matrix B = b ij,where 1 f x i f xj [x i,x j] x k μ Here μ is the number-theoretic Möbius function. References xk /x i μ xk /x j 1/f μ xk [1] H. J. S. Smith, On the value of a certain arithmetical determinant, Proceedings of the London Mathematical Society, vol. 7, no. 1, pp , [2] P. Haukkanen and J. Sillanpää, Some analogues of Smith s determinant, Linear and Multilinear Algebra, vol. 41, no. 3, pp , [3] P. Haukkanen, J. Wang, and J. Sillanpää, On Smith s determinant, Linear Algebra and Its Applications, vol. 258, pp , [4] S. Hong, GCD-closed sets and determinants of matrices associated with arithmetical functions, Acta Arithmetica, vol. 101, no. 4, pp , [5] I. Korkee and P. Haukkanen, On meet and join matrices associated with incidence functions, Linear Algebra and Its Applications, vol. 372, pp , [6] E. Altinisik, B. E. Sagan, and N. Tuglu, GCD matrices, posets, and nonintersecting paths, Linear and Multilinear Algebra, vol. 53, no. 2, pp , [7] P. Haukkanen, On meet matrices on posets, Linear Algebra and Its Applications, vol. 249, no. 1 3, pp , [8] I. Korkee and P. Haukkanen, On a general form of meet matrices associated with incidence functions, Linear and Multilinear Algebra, vol. 53, no. 5, pp , [9] B. V. Rajarama Bhat, On greatest common divisor matrices and their applications, Linear Algebra and Its Applications, vol. 158, pp , [10] J. Sándor and B. Crstici, Handbook of Number Theory. II, Kluwer Academic Publishers, Dordrecht, The Netherlands, [11] B. Y. Wang, Explicit expressions of Smith s determinant on a poset, Acta Mathematica Sinica, vol. 17, no. 1, pp , 2001.

11 Ercan Altinisik et al. 11 [12] I. Korkee and P. Haukkanen, Bounds for determinants of meet matrices associated with incidence functions, Linear Algebra and Its Applications, vol. 329, no. 1 3, pp , [13] S. Hong and Q. Sun, Determinants of matrices associated with incidence functions on posets, Czechoslovak Mathematical Journal, vol. 54, no. 2, pp , [14] M. Aigner, Combinatorial Theory, vol. 234 of Fundamental Principles of Mathematical Sciences, Springer, New York, NY, USA, [15] P. J. McCarthy, Introduction to Arithmetical Functions, Universitext, Springer, New York, NY, USA, [16] G. Pólya and G. Szegö, Aufgaben und Lehrsätze aus der Analysis. Band II: Funktionentheorie, Nullstellen, Polynome Determinanten, Zahlentheorie. Vierte Auflage, Springer, Berlin, Germany, [17] Z. Li, The determinants of GCD matrices, Linear Algebra and Its Applications, vol. 134, pp , [18] K. Bourque and S. Ligh, Matrices associated with arithmetical functions, Linear and Multilinear Algebra, vol. 34, no. 3-4, pp , [19] R. Sivaramakrishnan, ClassicalTheoryof ArithmeticFunctions, vol. 126 of Monographs and Textbooks in Pure and Applied Mathematics, Marcel Dekker, New York, NY, USA, [20] K. Bourque and S. Ligh, Matrices associated with multiplicative functions, Linear Algebra and Its Applications, vol. 216, pp , Ercan Altinisik: Department of Mathematics, Faculty of Arts and Sciences, Gazi University, Teknikokullar, Ankara, Turkey address: ealtinisik@gazi.edu.tr Naim Tuglu: Department of Mathematics, Faculty of Arts and Sciences, Gazi University, Teknikokullar, Ankara, Turkey address: naimtuglu@gazi.edu.tr Pentti Haukkanen: Department of Mathematics, Statistics and Philosophy, University of Tampere, Tampere, Finland address: pentti.haukkanen@uta.fi

12 Mathematical Problems in Engineering Special Issue on Time-Dependent Billiards Call for Papers This subject has been extensively studied in the past years for one-, two-, and three-dimensional space. Additionally, such dynamical systems can exhibit a very important and still unexplained phenomenon, called as the Fermi acceleration phenomenon. Basically, the phenomenon of Fermi acceleration FA is a process in which a classical particle can acquire unbounded energy from collisions with a heavy moving wall. This phenomenon was originally proposed by Enrico Fermi in 1949 as a possible explanation of the origin of the large energies of the cosmic particles. His original model was then modified and considered under different approaches and using many versions. Moreover, applications of FA have been of a large broad interest in many different fields of science including plasma physics, astrophysics, atomic physics, optics, and time-dependent billiard problems and they are useful for controlling chaos in Engineering and dynamical systems exhibiting chaos both conservative and dissipative chaos. We intend to publish in this special issue papers reporting research on time-dependent billiards. The topic includes both conservative and dissipative dynamics. Papers discussing dynamical properties, statistical and mathematical results, stability investigation of the phase space structure, the phenomenon of Fermi acceleration, conditions for having suppression of Fermi acceleration, and computational and numerical methods for exploring these structures and applications are welcome. To be acceptable for publication in the special issue of Mathematical Problems in Engineering, papers must make significant, original, and correct contributions to one or more of the topics above mentioned. Mathematical papers regarding the topics above are also welcome. Authors should follow the Mathematical Problems in Engineering manuscript format described at Prospective authors should submit an electronic copy of their complete manuscript through the journal Manuscript Tracking System at mts.hindawi.com/ according to the following timetable: Guest Editors Edson Denis Leonel, Departamento de Estatística, Matemática Aplicada e Computação, Instituto de Geociências e Ciências Exatas, Universidade Estadual Paulista, Avenida 24A, 1515 Bela Vista, Rio Claro, SP, Brazil ; edleonel@rc.unesp.br Alexander Loskutov, Physics Faculty, Moscow State University, Vorob evy Gory, Moscow , Russia; loskutov@chaos.phys.msu.ru Manuscript Due December 1, 2008 First Round of Reviews March 1, 2009 Publication Date June 1, 2009 Hindawi Publishing Corporation