If for two matrices m and n N[3|2|2|-1] product m×n [-1|4] find m
Answers
Answer:
Determinant of a Square Matrix
A determinant could be thought of as a function from Fn� n to F: Let A = (aij) be an n� n matrix. We define its determinant, written as
,
by
.
where Sn is the group of all n! permutations on the symbols{1,2,3,4,...,n} and sgn (s ) for a permutation s Î Sn is defined as follows: Let s written as a function be
.
Let Ni (1 � i < n) denote the number of indices j > i, for which s (j) < s (i), and let N(s ) = S 1� i<n Ni. Ni is called the number of inversions in the permutation s corresponding to the index i, and N is called the total number of inversions in the permutation s . Finally, we define sgn (s ) by the relation sgn (s) � (-1)N(s ) . Thus, sgn (s ) is +1, or -1 according as N(s ) is even, or odd, and accordingly, we call the permutation itself to be even, or odd permutation.
The above notion of determinant remains useful in many more situations, e.g., when the entries of A are from a commutative ring G with identity (e.g, the ring F [x] of polynomials over a field F). In the sequel, however, unless otherwise specified we restrict to the case of matrices over a field.
Theorem. If A is a square block upper triangular matrix over a ring G, in which the diagonal blocks are square, then the determinant of A equals the product of the determinants of its diagonal blocks.
Proof: Suppose the n� n A is partitioned into m2 blocks Apq, where Apq is square if p = q and Apq = 0 if p > q, 1 � p, q � m:
Let Sp denote the set of row or column numbers pertaining to the block App and let c(Sp) denote the number of elements in Sp. Consider the right hand side of
.
If s Î Sn is such that for some i, the (i,s (i))-th entry of A lies in the (p,q)-th block with q > p, then for some j Î Sk with k � p, s -1(j) Î Sr for an r > p, so that A being block upper triangular the contribution of the permutation s to |A| is zero. This is because if {j : s (j) Î È t� p St} Ì È t� p St, then i Î Sp and s (i) Î Sq is contradicted. Hence the only surviving terms in |A| correspond to those s Î Sn which may be written as a product s = s 1s 2�s m, where s p(i) = i if i Ï Sp, i.e., s p permutes withing Sp only, 1 � p � m. Using sgn s = sgn s 1 sgn s 2 ... sgn s m, we thus have
.