Pascal-like Determinants are Recursive

Save this PDF as:

Size: px
Start display at page:

Transcription

1 Pascal-like Determinants are Recursive Helena Zakrajšek Faculty of Mechanical Engineering University of Ljubljana, Slovenia Marko Petkovšek Faculty of Mathematics and Physics University of Ljubljana, Slovenia Abstract Let P = [p i,j ] i,j 0 be an infinite matrix whose entries satisfy p i,j = µp i,j 1 + λp i 1,j + νp i 1,j 1 for i, j 1, and whose first column resp row satisfy linear recurrences with constant coefficients of orders ρ resp σ Then we show that its principal minors d n satisfy d n = δ j=1 c j ω jn d n j where c j are constants, ω = λµ + ν, and δ = ( ρ+σ 2) ρ 1 This implies a recent conjecture of Bacher [2] 1 Introduction The problem of symbolic evaluation of determinants has rightly received considerable attention in the literature (see [5] for an excellent survey) Nevertheless, we are still lacking a uniform mechanism for determinant evaluation akin to the well-known Zeilberger s algorithm for evaluating hypergeometric sums [9] Given the summand, Zeilberger s algorithm constructs a recurrence (wrt a parameter) which is satisfied by the sum in question This recurrence is very useful as it can often be used to evaluate the sum in closed form, or to prove its properties by induction There have been attempts to emulate this approach in the determinant calculus, notably by using Dodgson s recurrence satisfied by the minors of a matrix (see [10] and [1]) However, this recurrence is nonlinear, and furthermore, once unfolded, it involves all the contiguous minors of the starting matrix, which is unfortunate if only some of them (eg, the principal ones) have a nice evaluation For matrices defined by simple linear recurrences with constant coefficients, R Bacher has recently conjectured ([2, Conjecture 33]; see also [6]) that the sequence of their principal minors satisfies such a recurrence as well More precisely, let P = [p i,j ] i,j 0 be an infinite matrix with the following properties: 1

2 1 The elements of the first column (p i,0 ) i 0 satisfy a homogeneous linear recurrence with constant coefficients of order at most ρ, and the elements of the first row (p 0,j ) j 0 satisfy a homogeneous linear recurrence with constant coefficients of order at most σ 2 The remaining elements of P satisfy Pascal s rule p i,j = p i 1,j + p i,j 1 Let d n be the principal minor of P consisting of the elements in its first n + 1 rows and columns Then Bacher conjectured that the sequence (d n ) n 0 satisfies a homogeneous linear recurrence with constant coefficients whose order is at most ( ) ρ+σ 2 ρ 1 In [2], he proved this conjecture in the case ρ = σ = 2 In the same paper, Bacher conjectured some evaluations of determinants whose entries satisfy the modified Pascal s rule p i,j = p i 1,j + p i,j 1 + xp i 1,j 1 These conjectured evaluations were later proved by Krattenthaler [6] In this paper we prove a generalization of Bacher s conjecture on principal minors of Pascal-like matrices We allow that the matrix entries are defined recursively by p i,j = µp i,j 1 + λp i 1,j + νp i 1,j 1 We show that when the elements of the first row and column (except, maybe, a few starting elements) satisfy homogeneous linear recurrence equations with constant coefficients then the sequence of the principal minors 1 is eventually zero if λµ + ν = 0, 2 satisfies a homogeneous linear recurrence with constant coefficients if λµ+ν = 1 (which implies Bacher s conjecture where µ = λ = 1, ν = 0), 3 satisfies a homogeneous linear recurrence with exponential coefficients if λµ + ν 0, 1 In the latter case, a simple substitution converts the recurrence into one with constant coefficients, so in all three cases it is possible to obtain a closed-form evaluation of the n-th principal minor Our proof, like Bacher s in the case ρ = σ = 2, proceeds in two main steps: first we transform our Pascal-like matrix by determinant-preserving transformations to banddiagonal form Then we show that the principal minors of every band-diagonal matrix satisfy a nontrivial linear recurrence To avoid explicit summations in matrix products, we use generating functions In Section 2 we show how to compute the generating function of a matrix product from the generating functions of its factors (Theorem 1), and characterize Pascal-like matrices through the type of their generating function We also define (r, s)- banded matrices as band-diagonal matrices of bandwidth r + s + 1, with r subdiagonals and s superdiagonals In Section 3 we show that the principal minors of any (r, s)-banded matrix M satisfy a homogeneous linear recurrence of order at most ( ) r+s r (Theorem 2) If M is constant along diagonals this recurrence has constant coefficients In Section 4 we transform a Pascal-like matrix to a (ρ 1, σ 1)-banded matrix while preserving the values of its principal minors (Theorem 3) Finally, in Section 5, we give our main result (Corollary 4) which implies an algorithm for evaluation of Pascal-like determinants in closed form (Remark 3), and present several examples of its use, and of applications of our methods to some other determinant evaluations 2

3 2 Preliminaries We work with infinite matrices of the form A = [a i,j ] i,j 0 and their generating functions F A (x, y) = i,j 0 a i,j x i y j, regarded as formal power series in x and y First we show how to compute the generating function of a matrix product from the generating functions of its factors Definition 1 Let f(u, v) = i,j 0 a i,j u i v j be a formal power series in u and v Its diagonal is the univariate series diag f = (diag f)(t) = k 0 a k,k t k Theorem 1 Let A = [a i,j ] i,j 0 and B = [b i,j ] i,j 0 be such that the sum k 0 a i,k b k,j has only finitely many nonzero terms for all i, j 0 Then F AB (x, y) = g(1) where g(t) = (diag f)(t) and f(u, v) = F A (x, u)f B (v, y) Proof: Write a k (x) = i 0 a i,k x i and b k (y) = j 0 b k,j y j Then F AB (x, y) = a i,k b k,j x i y j = a i,k x i b k,j y j = a k (x)b k (y) i,j,k 0 k 0 i 0 j 0 k 0 As f(u, v) = F A (x, u)f B (v, y) = a i,k x i u k b m,j v m y j i,k 0 m,j 0 = u k v m a i,k x i b m,j y j = k,m 0 i 0 j 0 k,m 0 a k (x)b m (y)u k v m, it follows that (diag f)(t) = k 0 a k (x)b k (y)t k, hence F AB (x, y) = (diag f)(1) as claimed Corollary 1 Let A and B be infinite matrices satisfying the assumptions of Theorem 1 and having rational generating functions Write G(t, z) = F A (x, t/z)f B (z, y)/z Then (i) F AB (x, y) = g(1) where g(t) = i Res z=zi (t)g(t, z), and the sum of residues ranges over those poles z = z i (t) of G(t, z) for which lim t 0 z i (t) = 0, (ii) F AB (x, y) is algebraic Proof: Item (i) follows from Theorem 1 and [4, Theorem 1] (see also [8, p 182]), and (ii) is an immediate consequence of (i) Remark 1 Note that since the diagonals of f(u, v) and f(v, u) coincide, we may also take G(t, z) = F A (x, z)f B (t/z, y)/z in Corollary 1 3

4 L = R = Figure 1: Matrices L and R Next we assign to each linear recurrence operator with constant coefficients a lower triangular matrix in a natural way Let E denote the shift operator acting on sequences x = (x n ) n 0 by (Ex) n = x n+1 Define E 1 by (E 1 x) n = x n 1 for n 1, (E 1 x) 0 = 0 Clearly E 1 is a right inverse of E Let p(t) = r k=0 c k t k be a polynomial Then p(e 1 ) = r c k E k k=0 is a linear recurrence operator acting on the space of sequences Define M(p(E 1 )) = [m i,j ] i,j 0 to be the lower triangular, band-diagonal matrix with elements m i,j = { ci j, 0 i j r, 0, otherwise Note that M(p(E 1 )) is the matrix representing p(e 1 ) in the canonical basis (e (j) ) j 0 where = δ j,n for all j, n 0 It is straightforward to compute its generating function e (j) n F M(p(E 1 ))(x, y) = p(x) 1 xy Proposition 1 Denote L = M(E 1 ) and R = L T (see Fig 1) Then F L k(x, y) = x k /(1 xy), F R k(x, y) = y k /(1 xy), and RL = I Let A be an infinite matrix Then LA is A with a new first row of zeros, AL is A without its first column, AR is A with a new first column of zeros, RA is A without its first row, F L A(x, y) = x k F k A (x, y), and F AR k(x, y) = y k F A (x, y) Also, LA = AL iff A is lower triangular and constant along diagonals (ie, a i,j depends only on i j), and AR = RA iff A is upper triangular and constant along diagonals We omit the straightforward proof Definition 2 An infinite matrix P = [p i,j ] i,j 0 is Pascal-like with parameters λ, µ, ν if its entries satisfy the recurrence p i,j = λp i 1,j + µp i,j 1 + νp i 1,j 1 for i, j 1, (1) and the generating functions of its first column and row, denoted α(x) = i 0 p i,0 x i and β(y) = j 0 p 0,j y j, respectively, are rational functions of x and y 4

5 Proposition 2 A matrix P is Pascal-like with parameters λ, µ, ν if and only if its generating function is of the form f(x) + g(y) F P (x, y) = (2) 1 λx µy νxy where f(x) and g(y) are univariate rational functions Proof: Let P be Pascal-like with parameters λ, µ, ν Recurrence (1) is clearly equivalent to the matrix equation P = λlp + µp R + νlp R + C (3) where c 0,0 = p 0,0, c i,0 = p i,0 λp i 1,0 for i 1, c 0,j = p 0,j µp 0,j 1 for j 1, and c i,j = 0 for i, j 1 From (3) we obtain, by Proposition 1, F P (x, y) = λxf P (x, y) + µyf P (x, y) + νxyf P (x, y) + F C (x, y) which implies where F P (x, y) = F C (x, y) 1 λx µy νxy (4) F C (x, y) = (1 λx)α(x) + (1 µy)β(y) p 0,0 (5) Conversely, if F P (x, y) = i,j 0 p i,j x i y j is of the form (2) then, by equating the coefficients of like powers of x and y in (2), we obtain (1) The generating functions F P (x, 0) = (f(x) + g(0))/(1 λx) and F P (0, y) = (f(0) + g(y))/(1 µy) of the first column and row of P, respectively, are obviously rational Note that (4) also immediately follows from [3, Equation (18)] Corollary 2 Any submatrix S = [p i,j ] i i0,j j 0 of a Pascal-like matrix P = [p i,j ] i,j 0 with parameters λ, µ, ν is again Pascal-like with the same parameters Proof: The entries of S clearly satisfy (1) By Proposition 2, the generating function F P (x, y) is rational, hence so are the generating functions of any of its rows and columns In particular, the generating functions of the first row and column of S, which are truncations of row i 0 and column j 0 of P, respectively, are rational Unless noted otherwise, we use the following notation in the rest of the paper: P = [p i,j ] i,j 0 is a Pascal-like matrix with parameters λ, µ, ν, α(x) = a 1 (x)/a(x) = i 0 p i,0 x i where a 1 and a are polynomials and a(0) = 1, β(y) = b 1 (y)/b(y) = j 0 p 0,j y j where b 1 and b are polynomials and b(0) = 1, ρ = deg a, σ = deg b, d n = det [p i,j ] 0 i,j n, 5

6 ω = λµ + ν Definition 3 Let r and s be nonnegative integers An infinite matrix A = [a i,j ] i,j 0 is (r, s)-banded if a i,j = 0 unless s i j r Note that an (r, s)-banded matrix is band-diagonal with bandwidth at most r + s + 1 In particular, an (r, r)-banded matrix is (2r + 1)-diagonal Definition 4 Infinite matrices A = [a i,j ] i,j 0 and B = [b i,j ] i,j 0 are equimodular if the sequences of their principal minors agree, ie, det[a i,j ] 0 i,j n = det[b i,j ] 0 i,j n for all n 0 For example, if A is lower triangular with unit diagonal, then P, AP, and P A T equimodular matrices are 3 A recurrence for band-diagonal determinants In this section we show that the sequence of principal minors of an (r, s)-banded matrix satisfies a homogeneous linear recurrence of order δ = ( ) r+s r This is a generalization of the well-known three-term recurrence satisfied by the principal minors of tridiagonal matrices, and also of [2, Theorem 71] which proves this result for matrices M satisfying m i,j = m i p,j p (p-periodic matrices) Definition 5 A rational function f(x 1,, x n ) is homogeneous of order k if f(tx 1,, tx n ) = t k f(x 1,, x n ) where t is another indeterminate Theorem 2 Let A = [a i,j ] i,j 0 be an (r, s)-banded matrix and δ = ( ) r+s r Denote by dn the principal minor of A consisting of the elements in rows 0, 1,, n and columns 0, 1,, n of A Then for n δ the sequence (d n ) n 0 satisfies a nontrivial homogeneous linear recurrence of the form d n = δ k=1 R k d n k where each R k is a homogeneous rational function of order k of entries a n i,n j (0 i δ 1, s j r + δ 1) Proof: Denote by ( ) c0, c 1,, c n A r 0, r 1,, r n the submatrix of A consisting of the elements in rows r 0, r 1,, r n and columns c 0, c 1,, c n For 1 j 1 < j 2 < < j r r + s, define A (j 1,j 2,,j r) A ( ) 0,1,,n r,n r+j 1,n r+j 2,,n r+j r 0,1,,n, n r, n = A ( ) n r+j r n,n r+j r n+1,,n r+j r 0,1,,n, n < r, and d (j 1,j 2,,j r) n = det A (j 1,j 2,,j r) n Note that j s s, so n r + j r n 0 Also, d (1,2,,r) n = d n Let n δ To obtain a system of recurrences satisfied by d (j 1,j 2,,j r) n, expand d (j 1,j 2,,j r) n wrt its last row There are two cases to distinguish: 6

7 a) If j r = r + s, the expansion has only a single nonzero term: b) If j r < r + s, we obtain the expansion d (j 1,j 2,,j r) where a n,j = 0 if j < 0 d (j 1,j 2,,j r) n = a n,n+s d (1,j 1+1,j 2 +1,,j r 1 +1) n 1 (6) n = ( 1) r a n,n r d (j 1+1,j 2 +1,,j r+1) n 1 r + ( 1) r+i a n,n r+ji d (1,j 1+1,,j i 1 +1,j i+1 +1,,j r+1) i=1 n 1 (7) Let S 1, S 2,, S δ be an enumeration of all r-subsets of {1, 2,, r + s}, such that S 1 = {1, 2,, r} If S i = {j 1, j 2,, j r }, denote Then (6) and (7) can be written uniformly as d (i) n = d (i) n = d (j 1,j 2,,j r) n δ k=1 c i,k (n) d (k) n 1 (1 i δ) (8) where each nonzero c i,k (n) is one of a n,n j ( s j r) or its negative By shifting (8) down δ 1 times wrt n we obtain δ 2 linear equations d (i) n j+1 = δ k=1 c i,k (n j + 1) d (k) n j (1 i δ, 1 j δ) (9) The entries of A involved are a n i,n j (0 i δ 1, s j r + δ 1), where entries with a negative index are taken to be zero We claim that these equations for the unknowns d (i) n j, 1 i δ, 0 j δ, are linearly independent To prove this, assume that a linear combination L of them vanishes identically As each d (i) n, 1 i δ, appears in a single equation, and its coefficient in that equation equals 1, all the coefficients in L corresponding to these δ equations (which have j = 1) must vanish But now each d (i) n 1, 1 i δ, appears in a single equation as well, and its coefficient in that equation equals 1, so again all the coefficients in L corresponding to these δ equations (which have j = 2) must vanish Inductively, we see that all the coefficients in L vanish, which proves the claim It follows that from (9) we can eliminate (by Gaussian elimination, say) the δ 2 1 unknowns d (i) n j, 2 i δ, 0 j δ This leaves us with a nontrivial linear equation involving the unknowns d (1) n j, 0 j δ, which is the desired recurrence satisfied by the sequence (d (1) n ) n 0 = (d n ) n 0 It remains to show that this recurrence has the promised form Call a linear equation E of the form δ σj=0 k=1 R j,k d (k) n j = 0 uniform if each coefficient R j,k is a rational function of the matrix entries, homogeneous of degree j + t E where t E depends only on E Equations (8) are clearly uniform in this sense, and Gaussian elimination preserves uniformity of equations Hence the final equation (involving only d n j for 0 j δ) is uniform as well Division by the highest nonzero coefficient, and some shifts if necessary, put it into the desired form 7

8 Remark 2 The asymmetry in the ranges of row and column indices of entries a n i,n j which appear in the coefficients of the recurrence obtained in Theorem 2 ( 0 i δ 1 vs s j r + δ 1) seems to be an artefact of our proof Had we expanded d (j 1,j 2,,j r) n wrt its last column rather than row (or equivalently, if we wrote down the recurrence for the transposed matrix A T, then rewrote the coefficients in terms of the entries of A), the ranges would be r i s + δ 1 and 0 j δ 1 But since elimination can be performed in such a way that the obtained recurrence is of minimal order, both recurrences should be the same This argument, if made rigorous (which we believe could be done), would imply that the actual ranges are 0 i, j δ 1, and that the recurrence is invariant under transposition a i,j a j,i Both claims are supported by the example below Example 1 We wrote a Mathematica program based on the proof of Theorem 2 which computes a recurrence satisfied by the sequence of principal minors of an (r, s)-banded matrix For a generic tridiagonal matrix (r = s = 1), we obtain for n 2 d n = a n,n d n 1 a n 1,n a n,n 1 d n 2 (10) This recurrence is well known in numerical linear algebra where it is used in certain methods for computing eigenvalues of symmetric matrices For a generic pentadiagonal matrix (r = s = 2), we obtain for n 6 d n 6 a n 5,n 3 a n 4,n 2 a n 3,n 5 a n 3,n 1 a n 2,n 4 a n 1,n 3 (a n 2,n 1 a n 1,n a n,n 2 a n 2,n a n 1,n 2 a n,n 1 ) + d n 5 a n 4,n 2 a n 3,n 1 a n 2,n 4 a n 1,n 3 (a n 3,n 1 a n 2,n 3 a n 1,n a n,n 2 a n 3,n 3 a n 2,n 1 a n 1,n a n,n 2 a n 3,n 2 a n 2,n a n 1,n 3 a n,n 1 + a n 3,n 3 a n 2,n a n 1,n 2 a n,n 1 ) d n 4 a n 3,n 1 a n 1,n 3 (a n 3,n 2 a n 2,n 1 a n 2,n a n 1,n 3 a n,n 2 a n 3,n 1 a n 2,n 3 a n 2,n a n 1,n 2 a n,n 2 + a n 3,n 1 a n 2,n 3 a n 2,n 2 a n 1,n a n,n 2 a n 3,n 2 a n 2,n 3 a n 2,n 1 a n 1,n a n,n 2 a n 3,n 2 a n 2,n 2 a n 2,n a n 1,n 3 a n,n 1 + a n 3,n 2 a n 2,n 3 a n 2,n a n 1,n 2 a n,n 1 ) d n 3 (a n 3,n 2 a n 1,n 3 a n 1,n a n,n 2 a 2 n 2,n 1 a n 3,n 2 a n 2,n a n 1,n 3 a n 1,n 1 a n,n 2 a n 2,n 1 a n 3,n 1 a n 2,n 2 a n 1,n 3 a n 1,n a n,n 2 a n 2,n 1 + a n 3,n 1 a n 2,n 3 a n 2,n a n 1,n 2 a n 1,n 1 a n,n 2 a n 3,n 1 a n 2,n 3 a n 2,n a 2 n 1,n 2 a n,n 1 + a n 3,n 1 a n 2,n 2 a n 2,n a n 1,n 3 a n 1,n 2 a n,n 1 ) d n 2 (a n 3,n 1 a n 2,n 1 a n 1,n 3 a n 1,n a n,n 2 a n 3,n 1 a n 2,n 3 a n 1,n 1 a n 1,n a n,n 2 a n 3,n 1 a n 2,n a n 1,n 3 a n 1,n 2 a n,n 1 + a n 3,n 2 a n 2,n a n 1,n 3 a n 1,n 1 a n,n 1 a n 3,n 2 a n 2,n 1 a n 1,n 3 a n 1,n a n,n 1 + a n 3,n 1 a n 2,n 3 a n 1,n 2 a n 1,n a n,n 1 ) d n 1 (a n 3,n 1 a n 2,n 3 a n 1,n a n,n 2 a n 3,n 2 a n 2,n a n 1,n 3 a n,n 1 + a n 3,n 2 a n 2,n 1 a n 1,n 3 a n,n a n 3,n 1 a n 2,n 3 a n 1,n 2 a n,n ) + d n (a n 3,n 2 a n 2,n 1 a n 1,n 3 a n 3,n 1 a n 2,n 3 a n 1,n 2 ) = 0 8

9 The recurrence is simpler when the matrix A is constant along diagonals Writing a n+2,n = a, a n+1,n = b, a n,n = c, a n,n+1 = d, and a n,n+2 = e, we obtain for n 6 d n 6 a 3 e 3 d n 5 a 2 c e 2 d n 4 a e (a e b d) d n 3 (e b 2 + a d 2 2 a c e) + d n 2 (b d a e) d n 1 c + d n = 0 (11) If, in addition, the matrix A is symmetric (ie, a = e and b = d), the order of the recurrence decreases by one In this case we obtain for n 5 d n 5 a 5 + d n 4 a 3 (a c) + d n 3 a (b 2 a c) d n 2 (b 2 a c) d n 1 (a c) d n = 0 (12) 4 Transformation to band-diagonal form In this section we show how to transform a Pascal-like matrix P to a band-diagonal matrix by a sequence of determinant-preserving elementary row and column operations Following Bacher s proof of his conjecture in the case ρ = σ = 2, we do this in two steps At the first step, we multiply P with operator matrices corresponding to annihilators of its first column and row from the left and from the right, respectively Lemma 1 Let A = M(a(E 1 )) and B = M(b(E 1 )) Then F AP B T (x, y) = F ACB T (x, y) 1 λx µy νxy (13) where F ACB T (x, y) = (1 λx)a 1 (x)b(y) + (1 µy)a(x)b 1 (y) p 0,0 a(x)b(y) (14) is a polynomial in x and y Proof: Multiply (3) by A from the left and by B T from the right Proposition 1 implies that AL = LA and RB T = B T R, hence AP B T = λlap B T + µap B T R + νlap B T R + ACB T, which gives (13) Now we compute F ACB T (x, y) using Corollary 1, Remark 1, and Equation (5) The rational function F A (x, t/z)f C (z, y) z = a(x) z xt ((1 λz)α(z) + (1 µy)β(y) p 0,0) has a single pole z = xt satisfying z 0 as t 0, hence F AC (x, y) = a(x)f C (x, y) Similarly, from the residue of F AC (x, z)f B T (t/z, y)/z at z = yt we obtain F ACB T (x, y) = a(x)b(y)f C (x, y) which implies (14) It turns out that for each j there is a polynomial q j with deg q j j 1 such that for i j + ρ, the i-th element of the j-th column of AP B T equals q j (i)λ i An analogous 9

10 statement holds for the rows of AP B T Thus, at the second step, we annihilate these out-ofthe-band entries by multiplying AP B T with suitable lower resp upper triangular matrices from the left resp from the right Let S(c) = [s i,j ] i,j 0 denote the infinite matrix with entries { ( ) ( c) i j i s i,j = j, i j, 0, i < j, whose generating function is F S(c) (x, y) = Further, let S r (c) denote the block-diagonal matrix [ ] Ir 0 S r (c) = 0 S(c) cx xy (15) where I r is the identity matrix of order r Note that S r (c) is lower triangular with unit diagonal, and that F Sr(c)(x, y) = (1 x r y r )/(1 xy) + x r y r /(1 + cx xy) In particular, F S1 (c)(x, y) = 1 + cx 1 + cx xy (16) Lemma 2 Let P be a Pascal-like matrix with parameters λ, µ, ν whose first column is zero Then S(λ)P is an upper triangular matrix with zero diagonal Proof: By assumption, α(x) = 0 We use Corollary 1, (15), and (4) From the residue of F S(λ) (x, t/z)f P (z, y)/z = at z = xt/(1 + λx) we obtain Hence F S(λ)P (x, y) = f(y, xy) where F S(λ)P (x, y) = f(u, v) := 1 z(1 + λx) xt (1 µy)β(y) 1 λz µy νyz (1 µy)β(y) 1 µy ωxy (1 µu)β(u) 1 µu ωv Thus F S(λ)P (x, y) is a power series in y and xy, showing that S(λ)P is upper triangular, and the generating function of its diagonal is f(0, t) = β(0)/(1 ωt) = p 0,0 /(1 ωt) = 0 Lemma 3 Let P be a Pascal-like matrix with parameters λ, µ, ν whose first column and row have generating functions of the form α(x) = a 1 (x)/(1 λx) ρ and β(y) = b 1 (y)/(1 µy) σ, respectively, where deg a 1 < ρ and deg b 1 < σ Then F S(λ)P S(µ) T (x, y) = (1 + λx)ρ 1 a 1 (x/(1 + λx)) + (1 + µy) σ 1 b 1 (y/(1 + µy)) p 0,0 1 ωxy where ω = λµ + ν (17) 10

11 Proof: We use Corollary 1, Remark 1, (15), and (4) From the residue of F S(λ) (x, t/z)f P (z, y)/z at z = xt/(1 + λx) we have F S(λ)P (x, y) = (1 + λx)ρ 1 a 1 (x/(1 + λx)) + (1 µy) 1 σ b 1 (y) p 0,0 1 µy ωxy From the residue of F S(λ)P (x, z)f S(µ) T (t/z, y)/z at z = yt/(1 + µy) we obtain (17) Corollary 3 Let P satisfy the assumptions of Lemma 3 Then Q = S(λ)P S(µ) T is an (ρ 1, σ 1)-banded matrix, and the sequence of elements along each diagonal is geometric with quotient ω Proof: This follows from the shape of the denominator of (17), and from the fact that the numerator of (17) is a sum of two polynomials, one of degree ρ 1 and depending only on x, the other of degree σ 1 and depending only on y Now we have everything that we need to transform a general Pascal-like matrix to banddiagonal form Theorem 3 Let P be a Pascal-like matrix with deg a 1 < ρ + k and deg b 1 < σ + l where k and l are nonnegative integers If A = M(a(E 1 )) and B = M(b(E 1 )) then M := S ρ+k (λ)ap B T S σ+l (µ) T is an (ρ+k 1, σ +l 1)-banded matrix, and each diagonal sequence (m i,i+d ) i max{ρ+k,σ+l d} where (ρ + k) d σ + l is geometric with quotient ω Proof: By Lemma 1, F AP B T (x, y) = F ACB T (x, y) 1 λx µy νxy where F ACB T (x, y) is given in (14) The matrix Q := AP B T is, in general, not Pascal-like But it is only in the upper-left ((ρ + k) (σ + l))-corner that recurrence (1) is not satisfied, therefore we divide Q in blocks as follows: Q = [ Q1 Q 2 ] = [ Q 3 Q 4 ] = [ Q1,1 Q 1,2 Q 2,1 Q 2,2 where Q 1 has ρ+k rows, Q 3 has σ +l columns, and Q 1,1 is of order (ρ+k) (σ +l) Recalling that [ ] [ ] Iρ+k 0 S ρ+k (λ) =, S 0 S(λ) σ+l (µ) T Iσ+l 0 = 0 S(µ) T, we have M = S ρ+k (λ)qs σ+l (µ) T = [ Q1,1 Q 1,2 S(µ) T S(λ)Q 2,1 ] S(λ)Q 2,2 S(µ) T We are going to show that S(λ)Q 2,1 is upper triangular with zero diagonal, Q 1,2 S(µ) T is lower triangular with zero diagonal, and N := S(λ)Q 2,2 S(µ) T is (σ + l 1, ρ + k 1)-banded As n i,j = m i+ρ+k,j+σ+l, this will imply that M itself is (ρ + k 1, σ + l 1)-banded, ] 11

12 Clearly Q 2 = R ρ+k Q, Q 4 = QL σ+l, and Q 2,2 = Q 2 L σ+l = R ρ+k Q 4 From the residue of at z = t(λ + νy)/(1 µy) we have Similarly we obtain F Q2 (x, y) = z ρ+k F ACB T (t/z, y) (1 xz)((1 µy)z (λ + νy)t) ( ) ρ+k λ + νy F ACB T ((1 µy)/(λ + νy), y) 1 µy 1 λx µy νxy ( ) µ + νx σ+l F F Q4 (x, y) = ACB T (x, (1 λx)/(µ + νx)) 1 λx 1 λx µy νxy By Proposition 2, both Q 2 and Q 4 are Pascal-like matrices with parameters λ, µ, ν, and by Corollary 2, so is their common submatrix Q 2,2 If λ 0 then the generating function of the first column of Q 2 is, by (14) and (5), F Q2 (x, 0) = λ ρ+k F ACBT (1/λ, 0) 1 λx = λ ρ+k a(1/λ)f C(1/λ, 0) 1 λx = 0 It can be seen that F Q2 (x, 0) = 0 also when λ = 0 By Lemma 2, it follows that S(λ)Q 2 is upper triangular with zero diagonal The same is then also true of S(λ)Q 2,1, which is composed of the first σ + l columns of S(λ)Q 2 In an analogous way, it can be shown that Q 1,2 S(µ) T is lower triangular with zero diagonal The generating function of the first row of Q 2 is F Q2 (0, y) = ( ) ρ+k λ + νy F ACB T ((1 µy)/(λ + νy), y) 1 µy 1 µy From (14) it follows that f(y) := (λ + νy) ρ+k F ACB T ((1 µy)/(λ + νy), y) is a polynomial in y of degree at most ρ + k + σ + l If µ 0 then f(1/µ) = (ω/µ) ρ+k F ACB T (0, 1/µ) = (ω/µ) ρ+k a(0)b(1/µ)f C (0, 1/µ) = 0, so f(y) is divisible by 1 µy Hence F Q2 (0, y) = f 1 (y)/(1 µy) ρ+k where f 1 (y) is a polynomial in y of degree less than ρ + k + σ + l This can be seen to hold also when µ = 0 By applying Extended Euclidean Algorithm to the coprime polynomials (1 µy) ρ+k and y σ+l we can find polynomials p(y) and f 2 (y) such that deg p < σ + l, deg f 2 < ρ + k, and f 1 (y) = (1 µy) ρ+k p(y) + y σ+l f 2 (y) Hence F Q2 (0, y) = p(y) + y σ+l f 2 (y)/(1 µy) ρ+k where deg p < σ + l, so the generating function F Q2,2 (0, y) of the first row of Q 2,2 equals f 2 (y)/(1 µy) ρ+k where deg f 2 < ρ + k Similarly we can see that the generating function F Q2,2 (x, 0) of the first column of Q 2,2 is g 2 (x)/(1 λx) σ+l where deg g 2 < σ + l Therefore, by Corollary 3, S(λ)Q 2,2 S(µ) T is an (σ + l 1, ρ + k 1)-banded matrix whose diagonals are geometric sequences with quotient ω As already mentioned, this implies that M is (ρ + k 1, σ + l 1)-banded 12

13 5 Results and examples Corollary 4 Let P be a Pascal-like matrix with deg a 1 < ρ + k and deg b 1 < σ + l where k and l are nonnegative integers, and let δ = ( ) ρ+k+σ+l 2 ρ+k 1 Then the sequence of its principal minors (d n ) n 0 for n δ + max(ρ + k, σ + l) satisfies a nontrivial linear recurrence of the form d n = δ j=1 c j ω jn d n j where c j are constants Proof: By Theorem 3, P is equimodular with an (ρ + k 1, σ + l 1)-banded matrix M whose nonzero entries are of the form m n,n+d = m d ω n for n max(ρ + k, σ + l d) and (ρ + k) d σ + l, where m d depends only on d By Theorem 2 and Remark 2, the sequence (d n ) n 0 for n δ satisfies a nontrivial recurrence of the form d n = δ j=1 R j d n j where each R j is a rational function of m n u,n v (0 u, v δ 1) As R j is homogeneous of order j and m n u,n v = ω n m u v /ω u for n u ρ + k and n v σ + l, this can be written in the announced form Corollary 5 Let P and δ be as in Corollary 4 Then there are a nonnegative integer m δ, polynomials p 1 (n),, p m (n), and algebraic numbers γ 1,, γ m of degree at most δ such that d n = ω (n 2) m i=0 p i (n)γ n i, for all n max(ρ + k, σ + l) Proof: Let n δ+max(ρ+k, σ+l) By Corollary 4, d n = δ j=1 c j ω jn d n j Write d n = ω (n 2) en Then e n = δ j=1 b j e n j where b j = c j ω (j+1 2 ) The assertion now follows from the well-known theory of linear recurrences with constant coefficients ( Remark 3) Let P be Pascal-like with deg a 1 < ρ + k and deg b 1 < σ + l Denote δ = ρ+k+σ+l 2 ρ+k 1 and m = max(ρ + k, σ + l) The closed-form expression for its n-th principal minor d n as described in Corollary 5 can be obtained by the following algorithm: 1 For n = m, m + 1,, m + 2δ 1 evaluate e n = d n /ω (n 2) 2 Solve the Hankel system of δ linear algebraic equations for the unknown coefficients b 1, b 2,, b δ δ e n = b j e n j (m + δ n m + 2δ 1) j=1 3 Find a closed-form representation of the sequence η n which satisfies the recurrence δ η n = b j η n j (n m + δ) j=1 and initial conditions η n = e n, for n = m, m + 1,, m + δ 1 This step involves computation with algebraic numbers 4 If n < m then compute d n directly, else d n = η n ω (n 2) 13

14 Example 2 We illustrate the algorithm of Remark 3 on a random example Let P = [p i,j ] i,j 0 be the matrix defined by p 0,0 = 1, p 1,0 = 2, p 0,1 = 1, p i,0 = 3p i 1,0 p i 2,0 (i 2), p 0,j = p 0,j 1 + p 0,j 2 (j 2), p i,j = 2p i 1,j + 3p i,j 1 p i 1,j 1 (i, j 1) This is a Pascal-like matrix with λ = 2, µ = 3, ν = 1, ω = 5, ρ = σ = 2, k = l = 0, δ = ( ) 2 1 = 2 Let dn be its principal minor of order n + 1 and let e n = d n /5 (n 2) Then by Corollary 4, e n for n 4 satisfies a recurrence of order 2 with constant coefficients From its initial values 1, 5, 24, 111, 495, 2124, 8721, 33885, , , , we find the recurrence e n = 9e n 1 21e n 2 which happens to be valid for all n 2 We solve it and obtain the evaluation d n = 2 ( ) 21 n/2 ( ( )) π 3 5 n2 /2 cos n arctan (n 0) 9 We conclude by giving several determinant evaluations which imply or generalize some results and examples from the literature Example 3 As a special case, Lemma 3 implies [6, Theorem 3] where P is given by p i,j = p i,j 1 + p i 1,j + νp i 1,j 1, i, j 1, and p i,0 = p 0,i = i for i 0 Here ρ = σ = 2, λ = µ = 1, ω = 1+ν, a(x) = b(x) = (1 x) 2, and a 1 (x) = b 1 (x) = x By Lemma 3, F S(λ)P S(µ) T (x, y) = (x y)/(1 ωxy), so P is equimodular with the tridiagonal matrix ω 0 0 ω 0 ω ω 2 0 Hence, by (10), the sequence (d n ) n 0 of principal minors of P satisfies the recurrence d n = ω 2n 2 d n 2 for n 2 Together with d 0 = 0 and d 1 = 1 this gives d 2n = 0, d 2n 1 = ω 2n(n 1) Example 4 Let P be given by p i,j = p i,j 1 + p i 1,j + νp i 1,j 1, i, j 1, p 0,0 = 0, and p i,0 = p 0,i = q i 1 for i 1 where q is a constant Here µ = λ = 1, α(x) = β(x) = x/(1 qx), ρ = σ = k = l = 1, ω = 1 + ν, hence Theorem 3 implies that P is equimodular with a tridiagonal matrix whose diagonals (with the first two elements 14

15 deleted) are geometric with quotient ω In fact, following the proof of Theorem 3, this matrix turns out to be (ν + q) 0 0 ν + q 0 (ν + q)ω 0 0 (ν + q)ω 0 Hence, by (10), the sequence (d n ) n 0 of principal minors of P satisfies the recurrence d n = (ν + q) 2 ω 2n 4 d n 2 Together with initial conditions d 0 = 0, d 1 = 1 this implies d 2n = 0 and d 2n 1 = (ν + q) 2n 2 ω 2(n 1)2, in agreement with [6, Theorem 2] Example 5 Let P be given by p i,j = p i,j 1 + p i 1,j, i, j 1 with a 3-periodic sequence (p 0, p 1, p 2,, p k = p k 3, ) as its first row and column It is conjectured in [2, Example 35] that the sequence (d n ) n 0 of principal minors of P satisfies a certain recurrence of order 5 Indeed, Theorem 3 implies that P is equimodular with a pentadiagonal matrix which, starting with the third element, is constant along each diagonal In fact, following the proof of Theorem 3, this matrix turns out to be p 0 p 1 p p 1 2p 1 2p 1 + p 2 a 0 0 p 2 2p 1 + p 2 4p 1 + 2p 2 p 0 + 6p 1 + 2p 2 a 0 0 a p 0 + 6p 1 + 2p 2 c b a 0 0 a b c b a b c where a = p 0 + p 1 + p 2, b = 2p 0 + 7p 1 + 3p 2, c = p p 1 + 6p 2 Hence the sequence (d n ) n 0 satisfies recurrence (12) for n 9 (as it turns out, (12) holds for all n 5) The following is a generalization of [6, Theorem 1] (see also [2, Theorem 15]) Lemma 4 Let P be a matrix which satisfies (1), and whose first column has generating function of the form α(x) = p 0,0 /(1 qx) If A(q) = M(1 qe 1 ) then S 1 (λ)a(q)p is an upper triangular matrix with diagonal elements where ξ = p 0,0 ω + (p 0,1 µp 0,0 )(λ q) p 0,0, ξ, ξω, ξω 2, ξω 3 (18) 15

16 Proof: We use Corollary 1, Remark 1, (4), and (16) From the residue of at z = xt we obtain From the residue of at z = xt/(1 + λx) we obtain F A(q) (x, t/z)f P (z, y)/z = 1 qx z xt F C (z, y) 1 λz µy νzy F A(q)P (x, y) = (1 qx)f P (x, y) F S1 (λ)(x, t/z)f A(q)P (z, y)/z = (1 + λx)(1 qz) F P (z, y) z + λxz xt F S1 (λ)a(q)p (x, y) = (1 µy)β(y) + (λ q)x ((1 µy)β(y) p 0,0) 1 µy ωxy The numerator can be rewritten as (1 µy)β(y) + (λ q)xy ( k 0 p 0,k+1 y k µβ(y) ), hence F S1 (λ)a(q)p (x, y) = f(y, xy) where f(u, v) := (1 µu)β(u) + (λ q)v ( k 0 p 0,k+1 u k µβ(u) ) 1 µu ωv Thus F S1 (λ)a(q)p (x, y) is a power series in y and xy, showing that S 1 (λ)a(q)p is upper triangular The generating function of its main diagonal is which gives (18) f(0, t) = p 0,0 + (p 0,1 µp 0,0 )(λ q)t 1 ωt Remark 4 Note that in Lemma 4, the matrix P need not be Pascal-like (ie, the lemma holds regardless of the algebraic nature of the first row of P ) Corollary 6 Let P satisfy the assumptions of Lemma 4 Then d n = p 0,0 ξ n ω (n 2) Our methods can also be applied to evaluate some determinants whose entries do not necessarily satisfy recurrence (1) Lemma 5 Let M be a matrix whose i-th element of the j-th column is of the form q j (i), where q j is a polynomial with deg q j = j Then S(1)M is an upper triangular matrix with diagonal elements (j! lc(q j )) j 0, where lc(q j ) denotes the leading coefficient of q j Proof: Let N = S(1)M As row k of S(1) consists of the coefficients of operator (1 E 1 ) k, the entries n k,0, n k,1,, n k,k 1 all vanish, and n k,k = (1 E 1 ) k q k (i) i=k = k! lc(q k ) 16

17 Example 6 Let [( )] ai + bj + x M n (a, b, x; k) =, a, b, x C, k N j k 0 i,j n In [6, Theorem 4] it is shown that det(m n (2, 2, x; 0) M n (2, 2, x; 1)) = 2 (n+1 2 ) Using Lemma 5 this result can be extended As for each j N ( ) ai + bj + x j k is a polynomial in variable i of degree j k whose leading coefficient is a j k /(j k)! we obtain that { det M n (a, b, x; k) = a ( n+1 2 ), k = 0, 0, k > 0 Let M = l m=0 µ m M n (a m, b m, x m ; 0) be a linear combination of matrices of this type Obviously, column j of M is a polynomial in the row index of degree j with leading coefficient lm=0 µ m a j m/j!, therefore, by Lemma 5, ( l ) det µ m M n (a m, b m, x m ; 0) m=0 = ( n l ) µ m a j m j=0 m=0 Similarly, if M = l k=0 µ k M n (a k, b k, x k ; k) then column j of M is a polynomial in the row index of degree j with leading coefficient µ 0 a j 0/j!, thus Acknowledgement ( l ) det µ k M n (a k, b k, x k ; k) k=0 = µ n+1 0 a (n+1 2 ) 0 The second author wishes to express his thanks to Andrej Kmet for his help with Section 3 In particular, Andrej was the first to derive the seven-term recurrence (11) References [1] T Amdeberhan, D Zeilberger: Determinants through the looking glass, Adv Appl Math 27 (2001), [2] R Bacher: Determinants of matrices related to the Pascal triangle, J Théorie Nombres Bordeaux 14 (2002),

18 [3] M Bousquet-Mélou, M Petkovšek: Linear recurrences with constant coefficients: the multivariate case, Discrete Math 225 (2000), [4] M L J Hautus, D A Klarner: The diagonal of a double power series, Duke Math J 38 (1971), [5] C Krattenthaler: Advanced determinant calculus, Séminaire Lotharingien Combin 42 (2002), Article B42q, 67 pp [6] C Krattenthaler: Evaluations of some determinants of matrices related to the Pascal triangle, Séminaire Lotharingien Combin 47 (2002), Article B47g, 19 pp [7] R P Stanley: Generating functions, MAA Studies in Combinatorics (ed G C Rota), Mathematical Association of America, [8] R P Stanley: Enumerative Combinatorics, Vol 2, Cambridge University Press, Cambridge 1999 [9] D Zeilberger: The method of creative telescoping, J Symbolic Comput 11 (1991), [10] D Zeilberger: Reverend Charles to the aid of Major Percy and Fields-medalist Enrico, Amer Math Monthly 103 (1996),

Notes on Determinant

ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

Diagonal, Symmetric and Triangular Matrices

Contents 1 Diagonal, Symmetric Triangular Matrices 2 Diagonal Matrices 2.1 Products, Powers Inverses of Diagonal Matrices 2.1.1 Theorem (Powers of Matrices) 2.2 Multiplying Matrices on the Left Right by

MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix.

MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix. Inverse matrix Definition. Let A be an n n matrix. The inverse of A is an n n matrix, denoted

The Characteristic Polynomial

Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

(a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular.

Theorem.7.: (Properties of Triangular Matrices) (a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular. (b) The product

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

Cofactor Expansion: Cramer s Rule

Cofactor Expansion: Cramer s Rule MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Introduction Today we will focus on developing: an efficient method for calculating

Determinants. Dr. Doreen De Leon Math 152, Fall 2015

Determinants Dr. Doreen De Leon Math 52, Fall 205 Determinant of a Matrix Elementary Matrices We will first discuss matrices that can be used to produce an elementary row operation on a given matrix A.

DETERMINANTS. b 2. x 2

DETERMINANTS 1 Systems of two equations in two unknowns A system of two equations in two unknowns has the form a 11 x 1 + a 12 x 2 = b 1 a 21 x 1 + a 22 x 2 = b 2 This can be written more concisely in

1 Determinants. Definition 1

Determinants The determinant of a square matrix is a value in R assigned to the matrix, it characterizes matrices which are invertible (det 0) and is related to the volume of a parallelpiped described

2.1: Determinants by Cofactor Expansion. Math 214 Chapter 2 Notes and Homework. Evaluate a Determinant by Expanding by Cofactors

2.1: Determinants by Cofactor Expansion Math 214 Chapter 2 Notes and Homework Determinants The minor M ij of the entry a ij is the determinant of the submatrix obtained from deleting the i th row and the

LINEAR ALGEBRA W W L CHEN

LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,

Summary of week 8 (Lectures 22, 23 and 24)

WEEK 8 Summary of week 8 (Lectures 22, 23 and 24) This week we completed our discussion of Chapter 5 of [VST] Recall that if V and W are inner product spaces then a linear map T : V W is called an isometry

Lecture 11. Shuanglin Shao. October 2nd and 7th, 2013

Lecture 11 Shuanglin Shao October 2nd and 7th, 2013 Matrix determinants: addition. Determinants: multiplication. Adjoint of a matrix. Cramer s rule to solve a linear system. Recall that from the previous

Lecture 3: Finding integer solutions to systems of linear equations

Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture

Math 315: Linear Algebra Solutions to Midterm Exam I

Math 35: Linear Algebra s to Midterm Exam I # Consider the following two systems of linear equations (I) ax + by = k cx + dy = l (II) ax + by = 0 cx + dy = 0 (a) Prove: If x = x, y = y and x = x 2, y =

1.5 Elementary Matrices and a Method for Finding the Inverse

.5 Elementary Matrices and a Method for Finding the Inverse Definition A n n matrix is called an elementary matrix if it can be obtained from I n by performing a single elementary row operation Reminder:

1 Sets and Set Notation.

LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most

it is easy to see that α = a

21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

UNIT 2 MATRICES - I 2.0 INTRODUCTION. Structure

UNIT 2 MATRICES - I Matrices - I Structure 2.0 Introduction 2.1 Objectives 2.2 Matrices 2.3 Operation on Matrices 2.4 Invertible Matrices 2.5 Systems of Linear Equations 2.6 Answers to Check Your Progress

Matrix Inverse and Determinants

DM554 Linear and Integer Programming Lecture 5 and Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1 2 3 4 and Cramer s rule 2 Outline 1 2 3 4 and

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.

Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(

A matrix over a field F is a rectangular array of elements from F. The symbol

Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F) denotes the collection of all m n matrices over F Matrices will usually be denoted

Sign pattern matrices that admit M, N, P or inverse M matrices

Sign pattern matrices that admit M, N, P or inverse M matrices C Mendes Araújo, Juan R Torregrosa CMAT - Centro de Matemática / Dpto de Matemática Aplicada Universidade do Minho / Universidad Politécnica

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

MATH 304 Linear Algebra Lecture 4: Matrix multiplication. Diagonal matrices. Inverse matrix.

MATH 304 Linear Algebra Lecture 4: Matrix multiplication. Diagonal matrices. Inverse matrix. Matrices Definition. An m-by-n matrix is a rectangular array of numbers that has m rows and n columns: a 11

5.3 Determinants and Cramer s Rule

290 5.3 Determinants and Cramer s Rule Unique Solution of a 2 2 System The 2 2 system (1) ax + by = e, cx + dy = f, has a unique solution provided = ad bc is nonzero, in which case the solution is given

MATH 2030: SYSTEMS OF LINEAR EQUATIONS. ax + by + cz = d. )z = e. while these equations are not linear: xy z = 2, x x = 0,

MATH 23: SYSTEMS OF LINEAR EQUATIONS Systems of Linear Equations In the plane R 2 the general form of the equation of a line is ax + by = c and that the general equation of a plane in R 3 will be we call

INTRODUCTORY LINEAR ALGEBRA WITH APPLICATIONS B. KOLMAN, D. R. HILL

SOLUTIONS OF THEORETICAL EXERCISES selected from INTRODUCTORY LINEAR ALGEBRA WITH APPLICATIONS B. KOLMAN, D. R. HILL Eighth Edition, Prentice Hall, 2005. Dr. Grigore CĂLUGĂREANU Department of Mathematics

Facts About Eigenvalues By Dr David Butler Definitions Suppose A is an n n matrix An eigenvalue of A is a number λ such that Av = λv for some nonzero vector v An eigenvector of A is a nonzero vector v

Solution to Homework 2

Solution to Homework 2 Olena Bormashenko September 23, 2011 Section 1.4: 1(a)(b)(i)(k), 4, 5, 14; Section 1.5: 1(a)(b)(c)(d)(e)(n), 2(a)(c), 13, 16, 17, 18, 27 Section 1.4 1. Compute the following, if

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.

PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

Chapter 8. Matrices II: inverses. 8.1 What is an inverse?

Chapter 8 Matrices II: inverses We have learnt how to add subtract and multiply matrices but we have not defined division. The reason is that in general it cannot always be defined. In this chapter, we

Mathematics Notes for Class 12 chapter 3. Matrices

1 P a g e Mathematics Notes for Class 12 chapter 3. Matrices A matrix is a rectangular arrangement of numbers (real or complex) which may be represented as matrix is enclosed by [ ] or ( ) or Compact form

Refined enumerations of alternating sign matrices. Ilse Fischer. Universität Wien

Refined enumerations of alternating sign matrices Ilse Fischer Universität Wien 1 Central question Which enumeration problems have a solution in terms of a closed formula that (for instance) only involves

RESULTANT AND DISCRIMINANT OF POLYNOMIALS

RESULTANT AND DISCRIMINANT OF POLYNOMIALS SVANTE JANSON Abstract. This is a collection of classical results about resultants and discriminants for polynomials, compiled mainly for my own use. All results

The Cayley Hamilton Theorem

The Cayley Hamilton Theorem Attila Máté Brooklyn College of the City University of New York March 23, 2016 Contents 1 Introduction 1 1.1 A multivariate polynomial zero on all integers is identically zero............

9.2 Summation Notation

9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a

MATH 240 Fall, Chapter 1: Linear Equations and Matrices

MATH 240 Fall, 2007 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 9th Ed. written by Prof. J. Beachy Sections 1.1 1.5, 2.1 2.3, 4.2 4.9, 3.1 3.5, 5.3 5.5, 6.1 6.3, 6.5, 7.1 7.3 DEFINITIONS

1 Gaussian Elimination

Contents 1 Gaussian Elimination 1.1 Elementary Row Operations 1.2 Some matrices whose associated system of equations are easy to solve 1.3 Gaussian Elimination 1.4 Gauss-Jordan reduction and the Reduced

A note on companion matrices

Linear Algebra and its Applications 372 (2003) 325 33 www.elsevier.com/locate/laa A note on companion matrices Miroslav Fiedler Academy of Sciences of the Czech Republic Institute of Computer Science Pod

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize

CONTROLLABILITY. Chapter 2. 2.1 Reachable Set and Controllability. Suppose we have a linear system described by the state equation

Chapter 2 CONTROLLABILITY 2 Reachable Set and Controllability Suppose we have a linear system described by the state equation ẋ Ax + Bu (2) x() x Consider the following problem For a given vector x in

Systems of Linear Equations

Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and

University of Warwick, EC9A0: Pre-sessional Advanced Mathematics Course Peter J. Hammond & Pablo F. Beker 1 of 55 EC9A0: Pre-sessional Advanced Mathematics Course Slides 1: Matrix Algebra Peter J. Hammond

Direct Methods for Solving Linear Systems. Linear Systems of Equations

Direct Methods for Solving Linear Systems Linear Systems of Equations Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University

NON SINGULAR MATRICES. DEFINITION. (Non singular matrix) An n n A is called non singular or invertible if there exists an n n matrix B such that

NON SINGULAR MATRICES DEFINITION. (Non singular matrix) An n n A is called non singular or invertible if there exists an n n matrix B such that AB = I n = BA. Any matrix B with the above property is called

SOLVING LINEAR SYSTEMS

SOLVING LINEAR SYSTEMS Linear systems Ax = b occur widely in applied mathematics They occur as direct formulations of real world problems; but more often, they occur as a part of the numerical analysis

Matrix Algebra LECTURE 1. Simultaneous Equations Consider a system of m linear equations in n unknowns: y 1 = a 11 x 1 + a 12 x 2 + +a 1n x n,

LECTURE 1 Matrix Algebra Simultaneous Equations Consider a system of m linear equations in n unknowns: y 1 a 11 x 1 + a 12 x 2 + +a 1n x n, (1) y 2 a 21 x 1 + a 22 x 2 + +a 2n x n, y m a m1 x 1 +a m2 x

7 - Linear Transformations

7 - Linear Transformations Mathematics has as its objects of study sets with various structures. These sets include sets of numbers (such as the integers, rationals, reals, and complexes) whose structure

1 Determinants and the Solvability of Linear Systems

1 Determinants and the Solvability of Linear Systems In the last section we learned how to use Gaussian elimination to solve linear systems of n equations in n unknowns The section completely side-stepped

Mathematics of Cryptography

CHAPTER 2 Mathematics of Cryptography Part I: Modular Arithmetic, Congruence, and Matrices Objectives This chapter is intended to prepare the reader for the next few chapters in cryptography. The chapter

Unique Factorization

Unique Factorization Waffle Mathcamp 2010 Throughout these notes, all rings will be assumed to be commutative. 1 Factorization in domains: definitions and examples In this class, we will study the phenomenon

Topic 1: Matrices and Systems of Linear Equations.

Topic 1: Matrices and Systems of Linear Equations Let us start with a review of some linear algebra concepts we have already learned, such as matrices, determinants, etc Also, we shall review the method

Direct Methods for Solving Linear Systems. Matrix Factorization

Direct Methods for Solving Linear Systems Matrix Factorization Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011

Introduction to Algebraic Geometry. Bézout s Theorem and Inflection Points

Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a

2.5 Gaussian Elimination

page 150 150 CHAPTER 2 Matrices and Systems of Linear Equations 37 10 the linear algebra package of Maple, the three elementary 20 23 1 row operations are 12 1 swaprow(a,i,j): permute rows i and j 3 3

3. Let A and B be two n n orthogonal matrices. Then prove that AB and BA are both orthogonal matrices. Prove a similar result for unitary matrices.

Exercise 1 1. Let A be an n n orthogonal matrix. Then prove that (a) the rows of A form an orthonormal basis of R n. (b) the columns of A form an orthonormal basis of R n. (c) for any two vectors x,y R

1 Lecture: Integration of rational functions by decomposition

Lecture: Integration of rational functions by decomposition into partial fractions Recognize and integrate basic rational functions, except when the denominator is a power of an irreducible quadratic.

GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

2.5 Elementary Row Operations and the Determinant

2.5 Elementary Row Operations and the Determinant Recall: Let A be a 2 2 matrtix : A = a b. The determinant of A, denoted by det(a) c d or A, is the number ad bc. So for example if A = 2 4, det(a) = 2(5)

LINEAR ALGEBRA. September 23, 2010

LINEAR ALGEBRA September 3, 00 Contents 0. LU-decomposition.................................... 0. Inverses and Transposes................................. 0.3 Column Spaces and NullSpaces.............................

Solution of Linear Systems

Chapter 3 Solution of Linear Systems In this chapter we study algorithms for possibly the most commonly occurring problem in scientific computing, the solution of linear systems of equations. We start

1 VECTOR SPACES AND SUBSPACES

1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such

4. MATRICES Matrices

4. MATRICES 170 4. Matrices 4.1. Definitions. Definition 4.1.1. A matrix is a rectangular array of numbers. A matrix with m rows and n columns is said to have dimension m n and may be represented as follows:

Week 9-10: Recurrence Relations and Generating Functions

Week 9-10: Recurrence Relations and Generating Functions March 31, 2015 1 Some number sequences An infinite sequence (or just a sequence for short is an ordered array a 0, a 1, a 2,..., a n,... of countably

4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION

4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION STEVEN HEILMAN Contents 1. Review 1 2. Diagonal Matrices 1 3. Eigenvectors and Eigenvalues 2 4. Characteristic Polynomial 4 5. Diagonalizability 6 6. Appendix:

Lecture 6: The Group Inverse

Lecture 6: The Group Inverse The matrix index Let A C n n, k positive integer. Then R(A k+1 ) R(A k ). The index of A, denoted IndA, is the smallest integer k such that R(A k ) = R(A k+1 ), or equivalently,

CHARACTERISTIC ROOTS AND VECTORS

CHARACTERISTIC ROOTS AND VECTORS 1 DEFINITION OF CHARACTERISTIC ROOTS AND VECTORS 11 Statement of the characteristic root problem Find values of a scalar λ for which there exist vectors x 0 satisfying

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization

15.062 Data Mining: Algorithms and Applications Matrix Math Review

.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop

1 Limiting distribution for a Markov chain

Copyright c 2009 by Karl Sigman Limiting distribution for a Markov chain In these Lecture Notes, we shall study the limiting behavior of Markov chains as time n In particular, under suitable easy-to-check

Calculus and linear algebra for biomedical engineering Week 4: Inverse matrices and determinants

Calculus and linear algebra for biomedical engineering Week 4: Inverse matrices and determinants Hartmut Führ fuehr@matha.rwth-aachen.de Lehrstuhl A für Mathematik, RWTH Aachen October 30, 2008 Overview

The Hadamard Product Elizabeth Million April 12, 2007 1 Introduction and Basic Results As inexperienced mathematicians we may have once thought that the natural definition for matrix multiplication would

Solutions to Review Problems

Chapter 1 Solutions to Review Problems Chapter 1 Exercise 42 Which of the following equations are not linear and why: (a x 2 1 + 3x 2 2x 3 = 5. (b x 1 + x 1 x 2 + 2x 3 = 1. (c x 1 + 2 x 2 + x 3 = 5. (a

4. Factor polynomials over complex numbers, describe geometrically, and apply to real-world situations. 5. Determine and apply relationships among syn

I The Real and Complex Number Systems 1. Identify subsets of complex numbers, and compare their structural characteristics. 2. Compare and contrast the properties of real numbers with the properties of

1. For each of the following matrices, determine whether it is in row echelon form, reduced row echelon form, or neither.

Math Exam - Practice Problem Solutions. For each of the following matrices, determine whether it is in row echelon form, reduced row echelon form, or neither. (a) 5 (c) Since each row has a leading that

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible

Section 6.1 - Inner Products and Norms

Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,

PROBLEM SET 6: POLYNOMIALS

PROBLEM SET 6: POLYNOMIALS 1. introduction In this problem set we will consider polynomials with coefficients in K, where K is the real numbers R, the complex numbers C, the rational numbers Q or any other

Inner Product Spaces and Orthogonality

Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,

LINEAR ALGEBRA OF PASCAL MATRICES

LINEAR ALGEBRA OF PASCAL MATRICES LINDSAY YATES Abstract. The famous Pascal s triangle appears in many areas of mathematics, such as number theory, combinatorics and algebra. Pascal matrices are derived

MATH36001 Background Material 2015

MATH3600 Background Material 205 Matrix Algebra Matrices and Vectors An ordered array of mn elements a ij (i =,, m; j =,, n) written in the form a a 2 a n A = a 2 a 22 a 2n a m a m2 a mn is said to be

Chapter 7. Matrices. Definition. An m n matrix is an array of numbers set out in m rows and n columns. Examples. ( 1 1 5 2 0 6

Chapter 7 Matrices Definition An m n matrix is an array of numbers set out in m rows and n columns Examples (i ( 1 1 5 2 0 6 has 2 rows and 3 columns and so it is a 2 3 matrix (ii 1 0 7 1 2 3 3 1 is a

MATH 289 PROBLEM SET 1: INDUCTION. 1. The induction Principle The following property of the natural numbers is intuitively clear:

MATH 89 PROBLEM SET : INDUCTION The induction Principle The following property of the natural numbers is intuitively clear: Axiom Every nonempty subset of the set of nonnegative integers Z 0 = {0,,, 3,

The van Hoeij Algorithm for Factoring Polynomials

The van Hoeij Algorithm for Factoring Polynomials Jürgen Klüners Abstract In this survey we report about a new algorithm for factoring polynomials due to Mark van Hoeij. The main idea is that the combinatorial

Chapter 1 - Matrices & Determinants

Chapter 1 - Matrices & Determinants Arthur Cayley (August 16, 1821 - January 26, 1895) was a British Mathematician and Founder of the Modern British School of Pure Mathematics. As a child, Cayley enjoyed

VERTICES OF GIVEN DEGREE IN SERIES-PARALLEL GRAPHS

VERTICES OF GIVEN DEGREE IN SERIES-PARALLEL GRAPHS MICHAEL DRMOTA, OMER GIMENEZ, AND MARC NOY Abstract. We show that the number of vertices of a given degree k in several kinds of series-parallel labelled

Basics Inversion and related concepts Random vectors Matrix calculus. Matrix algebra. Patrick Breheny. January 20

Matrix algebra January 20 Introduction Basics The mathematics of multiple regression revolves around ordering and keeping track of large arrays of numbers and solving systems of equations The mathematical

Factoring Polynomials

Factoring Polynomials Sue Geller June 19, 2006 Factoring polynomials over the rational numbers, real numbers, and complex numbers has long been a standard topic of high school algebra. With the advent

1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form

1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and

Explicit inverses of some tridiagonal matrices

Linear Algebra and its Applications 325 (2001) 7 21 wwwelseviercom/locate/laa Explicit inverses of some tridiagonal matrices CM da Fonseca, J Petronilho Depto de Matematica, Faculdade de Ciencias e Technologia,

Linear Algebra Notes for Marsden and Tromba Vector Calculus

Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of