Lecture_6 - Lecture Note 6 Dr. Jeff Chak-Fu WONG Department...

Info iconThis preview shows pages 1–10. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Lecture Note 6 Dr. Jeff Chak-Fu WONG Department of Mathematics Chinese University of Hong Kong [email protected] MAT 2310 Linear Algebra and Its Applications Fall, 2007 Produced by Jeff Chak-Fu WONG 1 D ETERMINANTS 1. Definition and Properties 2. Cofactor Expansion and Applications DETERMINANTS 2 Our aim is: 1. to know the notion of a determinant, 2. to study some of its properties, and 3. to calculate the determinant of the given matrix via the reduction to triangular form. DETERMINANTS 3 D EFINITION AND P ROPERTIES 1. Permutation 2. Definition of Determinant 3. Properties of Determinants DEFINITION AND PROPERTIES 4 Definition: Let S = { 1 , 2 ,...,n } be the set of integers from 1 to n , arranged in ascending order. A rearrangement j 1 j 2 ...j n of the elements of S is called a permutation of S . For example, let S = { 1 , 2 , 3 , 4 } . Then 4123 is a permutation of S . It corresponds to the function f : S → S defined by f (1) = 4 f (2) = 1 f (3) = 3 f (4) = 2 . DEFINITION AND PROPERTIES 5 We can put • any one of the n elements of S in the first position, • any one of the remaining n- 1 elements in the second position • any one of the remaining n- 2 element in the third position, and so on, • until the n th position can be filled by last remaining element. Thus, there are n ( n- 1) ( n- 2) ··· 2 · 1 (1) permutations of S ; we denote the set of all permutations of S by S n . The expression in Equation (1) is denoted n ! , n factoral DEFINITION AND PROPERTIES 6 We have 1! = 1 = 1 2! = 2 · 1 = 2 3! = 3 · 2 · 1 = 6 4! = 4 · 3 · 2 · 1 = 24 5! = 5 · 4 · 3 · 2 · 1 = 120 6! = 6 · 5 · 4 · 3 · 2 · 1 = 720 7! = 7 · 6 · 5 · 4 · 3 · 2 · 1 = 5040 8! = 8 · 7 · 6 · 5 · 4 · 3 · 2 · 1 = 40 , 320 9! = 9 · 8 · 7 · 6 · 5 · 4 · 3 · 2 · 1 = 362 , 880 . DEFINITION AND PROPERTIES 7 Example 1 • S 1 consists of only 1! = 1 permutation of the set { 1 } , namely, 1; • S 2 consists of 2! = 2 · 1 = 2 permutations of the set { 1 , 2 } , namely, 12 and 21 ; • S 3 consists of 3! = 3 · 2 · 1 = 6 permutations of the set { 1 , 2 , 3 } , namely 123 , 231 , 312 , 132 , 213 and 321 . A permutation j 1 j 2 ··· j n of S = { 1 , 2 , ··· ,n } is said to an inversion if a large integer j r precedes a smaller j s . A permutation is called even or odd according to whether the total number of inversions in it is even or odd. Thus, the permutation 4132 of S = { 1, 2, 3, 4} has four inversions: 4 before 1, 4 before 3, 4 before 2, and 3 before 2. It is then an even permutation. Remark: 0 inversion is even. DEFINITION AND PROPERTIES 8 Example 2 In S 2 , • the permutation 12 is even, since it has no inversions; • the permutation 21 is odd, since it has one inversion....
View Full Document

This note was uploaded on 05/18/2010 for the course MATHEMATIC MAT2310 taught by Professor Dr.jeffchak-fuwong during the Spring '06 term at CUHK.

Page1 / 114

Lecture_6 - Lecture Note 6 Dr. Jeff Chak-Fu WONG Department...

This preview shows document pages 1 - 10. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online