Linear Algebra Existence of the determinant. Expansion according to a row.

Similar documents
SOLVED EXAMPLES. Ex.1 If f(x) = , then. is equal to- Ex.5. f(x) equals - (A) 2 (B) 1/2 (C) 0 (D) 1 (A) 1 (B) 2. (D) Does not exist = [2(1 h)+1]= 3

page 11 equation (1.2-10c), break the bar over the right side in the middle

National Quali cations

Chapter 3 Fourier Series Representation of Periodic Signals

Quantum Mechanics & Spectroscopy Prof. Jason Goodpaster. Problem Set #2 ANSWER KEY (5 questions, 10 points)

COLLECTION OF SUPPLEMENTARY PROBLEMS CALCULUS II

IIT JEE MATHS MATRICES AND DETERMINANTS

Walk Like a Mathematician Learning Task:

Integration by Guessing

PURE MATHEMATICS A-LEVEL PAPER 1

Statistics 3858 : Likelihood Ratio for Exponential Distribution

ASSERTION AND REASON

Chapter 2 Infinite Series Page 1 of 11. Chapter 2 : Infinite Series

Emil Olteanu-The plane rotation operator as a matrix function THE PLANE ROTATION OPERATOR AS A MATRIX FUNCTION. by Emil Olteanu

National Quali cations

Some Common Fixed Point Theorems for a Pair of Non expansive Mappings in Generalized Exponential Convex Metric Space

Lectures 2 & 3 - Population ecology mathematics refresher

ERDOS-SMARANDACHE NUMBERS. Sabin Tabirca* Tatiana Tabirca**

TOPIC 5: INTEGRATION

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture:

Vtusolution.in FOURIER SERIES. Dr.A.T.Eswara Professor and Head Department of Mathematics P.E.S.College of Engineering Mandya

Limits Indeterminate Forms and L Hospital s Rule

CONTINUITY AND DIFFERENTIABILITY

CHAPTER 5d. SIMULTANEOUS LINEAR EQUATIONS

Session : Plasmas in Equilibrium

Chapter 9 Infinite Series

DETERMINANT. = 0. The expression a 1. is called a determinant of the second order, and is denoted by : y + c 1

Solution to 1223 The Evil Warden.

Chapter 8 Approximation Methods, Hueckel Theory

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

On the Energy Complexity of LDPC Decoder Circuits

(HELD ON 22nd MAY SUNDAY 2016) MATHEMATICS CODE - 2 [PAPER -2]

1985 AP Calculus BC: Section I

Minimum Spanning Trees

Multi-Section Coupled Line Couplers

Last time: introduced our first computational model the DFA.

IX. Ordinary Differential Equations

Q.28 Q.29 Q.30. Q.31 Evaluate: ( log x ) Q.32 Evaluate: ( ) Q.33. Q.34 Evaluate: Q.35 Q.36 Q.37 Q.38 Q.39 Q.40 Q.41 Q.42. Q.43 Evaluate : ( x 2) Q.

z 1+ 3 z = Π n =1 z f() z = n e - z = ( 1-z) e z e n z z 1- n = ( 1-z/2) 1+ 2n z e 2n e n -1 ( 1-z )/2 e 2n-1 1-2n -1 1 () z

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1

Instructions for Section 1

Remarks: (a) The Dirac delta is the function zero on the domain R {0}.

On the approximation of the constant of Napier

NEW VERSION OF SZEGED INDEX AND ITS COMPUTATION FOR SOME NANOTUBES

CIVL 8/ D Boundary Value Problems - Rectangular Elements 1/7

terms of discrete sequences can only take values that are discrete as opposed to

Chapter Five. More Dimensions. is simply the set of all ordered n-tuples of real numbers x = ( x 1

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan

How much air is required by the people in this lecture theatre during this lecture?

Time : 1 hr. Test Paper 08 Date 04/01/15 Batch - R Marks : 120

Ordinary Differential Equations

(A) 1 (B) 1 + (sin 1) (C) 1 (sin 1) (D) (sin 1) 1 (C) and g be the inverse of f. Then the value of g'(0) is. (C) a. dx (a > 0) is

1. Stefan-Boltzmann law states that the power emitted per unit area of the surface of a black

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.

07 - SEQUENCES AND SERIES Page 1 ( Answers at he end of all questions ) b, z = n

Thomas J. Osler. 1. INTRODUCTION. This paper gives another proof for the remarkable simple

Law of large numbers

A general N-dimensional vector consists of N values. They can be arranged as a column or a row and can be real or complex.

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

Section 5.1/5.2: Areas and Distances the Definite Integral

LINEAR 2 nd ORDER DIFFERENTIAL EQUATIONS WITH CONSTANT COEFFICIENTS

Review of the Riemann Integral

Chapter System of Equations

Lectures 9 IIR Systems: First Order System

EEE 303: Signals and Linear Systems

. Determine these to one correct decimal accuracy using the bisection method: (a) 2. The following equations all have a root in the interval ( 0,1.

1 Introduction to Modulo 7 Arithmetic

Math 1272 Solutions for Fall 2004 Final Exam

LE230: Numerical Technique In Electrical Engineering

EEO 401 Digital Signal Processing Prof. Mark Fowler

Canonical Form and Separability of PPT States on Multiple Quantum Spaces

Problem Session (3) for Chapter 4 Signal Modeling

EXERCISE - 01 CHECK YOUR GRASP

FOURIER SERIES. Series expansions are a ubiquitous tool of science and engineering. The kinds of

Practice Final Exam. 3.) What is the 61st term of the sequence 7, 11, 15, 19,...?

The total number of permutations of S is n!. We denote the set of all permutations of S by

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

Robust Estimation for ARMA models

Chapter 2 Reciprocal Lattice. An important concept for analyzing periodic structures

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

Statistics for Financial Engineering Session 1: Linear Algebra Review March 18 th, 2006

1- I. M. ALGHROUZ: A New Approach To Fractional Derivatives, J. AOU, V. 10, (2007), pp

0.1. Exercise 1: the distances between four points in a graph

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Advanced Engineering Mathematics, K.A. Stroud, Dexter J. Booth Engineering Mathematics, H.K. Dass Higher Engineering Mathematics, Dr. B.S.

Lecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.

Section 3: Antiderivatives of Formulas

H2 Mathematics Arithmetic & Geometric Series ( )

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2

NET/JRF, GATE, IIT JAM, JEST, TIFR

Floating Point Number System -(1.3)

This Week. Computer Graphics. Introduction. Introduction. Graphics Maths by Example. Graphics Maths by Example

Floating Point Number System -(1.3)

 n. A Very Interesting Example + + = d. + x3. + 5x4. math 131 power series, part ii 7. One of the first power series we examined was. 2!

f(t)dt 2δ f(x) f(t)dt 0 and b f(t)dt = 0 gives F (b) = 0. Since F is increasing, this means that

Transcription:

Lir Algbr 2270 1 Existc of th dtrmit. Expsio ccordig to row. W dfi th dtrmit for 1 1 mtrics s dt([]) = (1) It is sy chck tht it stisfis D1)-D3). For y othr w dfi th dtrmit s follows. Assumig th dtrmit is dfid lrdy for ( 1) ( 1) mtrics, for y A R dfi dt(a) usig xpsio ccordig to th i-th row: dt(a) = j=1 ( 1) i+j i j dt(a i j ) (2) whr A i j is ( 1) ( 1) mtrix tht is mtrix A without th i-th row d j-th colum. For xmpl (usig xmpl from th txtbook t pg 165), if Notic tht th formul for th dtrmit of 2 2 mtrix, which ws prstd i th lctur: is comptibl with xpsio ccordig to th first row: dt(a) = dt ([ 1 1 1 1 2 1 2 2 ]) = 1 1 2 2 1 2 2 1 (3) ( 1) 1+1 1 1 dt(a 1 1 ) + ( 1) 1+2 1 2 dt(a 1,2 ) = 1 1 dt([ 2 2 ]) 2 1 dt([ 1,2 ]) = 1 1 2 2 1 2 2 1 (4) whr t th lst stp w usd th dfiitio of th dtrmit for 1 1 mtrics. This dfiitio is lso comptibl with xpsio ccordig to th scod row: ( 1) 2+1 2 1 dt(a 2 1 ) + ( 1) 2+2 2 2 dt(a 2,2 ) = 2 1 dt([ 1 2 ]) + 2 2 dt([ 1,1 ]) = 1 1 2 2 1 2 2 1 (5) I th lctur w hv prov tht formul (3) stisfis D1)-D3), so it givs vlid dfiitio of th dtrmit for 2 2 mtrics. Our clcultio shows tht o c us xpsio ccordig to row to clcult th dtrmit. To udrstd how xpsio ccordig to row works, lt s us xmpl from th txtbook for 3 3 mtrix d xpsio ccordig to th first row: 1

Lt us ow prov th dfiitio of th dtrmit usig th xpsio ccordig to row is vlid. So ssum tht th dtrmit is dfid for ( 1) ( 1) mtrics d for thos mtrics it stisfis D1) D3) (d s cosquc DP1) DP5)). W will prov tht o mttr which row is usd, xpsio (2) stisfis D1) D3). D1): lirity wrt y colum. Cosidr k-th colum. Cosidr trm i th sum (2): ( 1) i+j i j dt(a i j ) For j k, th i j dos ot dpd o th k-th colum d dt(a i j ) dpds lirly o th k-th colum (s th dtrmit for ( 1) ( 1) mtrics stisfis D1)). If j = k th i j dpds lirly o th k-th colum d dt(a i j ) dos ot dpd o th k-th colum. I y cs our trm dpds lirly o th k-th colum. Sic dt(a) is sum of such trms, it dpds lirly o th k-th colum. D2): If two djct colums r qul, th th dtrmit is qul to 0. Suppos two djct colums of A r qul, mly k = k+1. Agi cosidr trm i th sum (2): ( 1) i+j i j dt(a i j ) If j is ot qul to k d k + 1, th th mtrix A i j hs two djct colums qul, d hc its dtrmit is qul to 0. Thus th trm corrspodig to idx j ot qul to k d k + 1 givs zro cotributio to dt(a). Th othr two trms c b writt s ( 1) i+k i k dt(a i k ) + ( 1) i+k+1 i k+1 dt(a i k+1 ) Th two mtrics A i k d A i k+1 r qul bcus of our ssumptio tht th k-th colum of A is qul to th (k + 1)-th colum. Similrly i k = i k+1. Hc ths two trms ccl s thy hv th opposit sigs. D3): dt(i) = 1 Lt A b th idtity mtrix. Th i j = 0 ulss i = j, i which cs i i = 1. Thus th oly trm is th sum which givs o-zro cotributio is ( 1) i+i i i dt(a i i ) = dt(a i i ) As A i i is th ( 1) ( 1) idtity mtrix, its dtrmit is qul to 1, s th dtrmit for ( 1) ( 1) mtrics stisfis D3). Thus o c us xpsio to y row to dfi th dtrmit of mtrix d such dtrmit stisfis D1) D3). As thr is oly o fuctio stisfyig D1) D3) (prov i th lctur) thos xpsios hv to giv th sm rsults. W hv prov tht if th dtrmit is dfid for ( 1) ( 1) mtrics, th w my dfi it for mtrics. Formlly it is dfiitio usig mthmticl iductio, which my b xplid s follows. As th dtrmit is dfid for 1 1 mtrics, dfi it for 2 2 mtrics usig th xpsio ccordig to row, th dfi it for 3 3 mtrics usig th xpsio ccordig to row d its dfiitio for 2 2 mtrics. Th dfi it for 4 4 mtrics usig xpsio ccordig to row d its dfiitio for 3 3 mtrics. Th dfi it for 5 5 mtrics... 2

2 Expsio ccordig to colum. Dtrmit of A T. W hv prov tht th dtrmit stisfyig D1) D5) xists d w hv lso prov (i th lctur) tht it is uiqu. W hv two lgorithms to fid th dtrmit. O usig xpsio ccordig to row d othr usig colum oprtios (or row oprtios o A T ). W will prov ow tht o could lso us xpsio ccordig to colum. Lt A R. Expsio ccordig to th j-th colum is dfid s Thorm 2.1 Lt A R dt c j(a) = i=1 ( 1) i+j i j dt(a i j ) (6) dt c j(a) = dt A (7) Proof For = 1 thr is o xpsio. For = 2, th fct tht dt c 1(A) = dt c 2(A) = dt A is sy to show. For proof by iductio, ssum tht if A R ( 1) ( 1), th (7) is stisfid. W will prov tht th (7) is stisfid for y j d for y A R. To prov it, w will show tht for y j, th fuctio dt c j ctig o mtrics stisfis D1), D2), D3) d tht implis tht it hs to b qul to th dtrmit. Proofs tht D1) d D3) r stisfid by dt c j r similr to thos for xpsio by row, so w will skip thm. Lt us focus o D2) which sys tht if two djct colums r th sm, th dt c j(a) = 0. Lt k = k+1. For xpsio ccordig th j-th colums, whr j is ot qul to k or k + 1, ch trm dt(a i j ) hs two djct colums tht r qul, so dt(a i j ) = 0. Thus th sum is qul to zro. Cosidr j = k. Usig th iductio ssumptio, s A i k R ( 1) ( 1), w hv dt c k (A i k) = dt(a i k ). I fct w r prformig othr xpsio ccordig to th k-th colum of A i k, which corrspods to th (k + 1)-th colum of A: dt c k (A) = ( 1) i+k i k dt(a i k ) = i=1 i=1 = ( 1) i+k i k i=1 l=1,l i l=1,l i ( 1) p l+k l k+1 dt((a i j ) pl k) ( 1) i+k ( 1) p l+k i k l k+1 dt((a i j ) pl k) whr p l = l if l < i d p l = l 1 if l > i. Ech mtrix (A i j ) pl k is th mtrix A without two rows d without two colums k, k + 1. Cosidr two rows i 1, i 2 whr i 1 < i 2. Lt A (i1,i 2 ) (k,k+1) dot mtrix A without rows i 1, i 2 d without colums k, k + 1. Exprssio dt(a (i1,i 2 ) (k,k+1)) pprs i th sum (8) xctly twic, s dt((a i1 k) i2 1 k) d s dt((a i2 k) i1 k). As rsult oc it is multiplid by d th scod tim it is multiplid by ( 1) i 1+k ( 1) i 2 1+k i1 k i2 k+1 = ( 1) i 1+i 2 1 i1 k i2 k (8) ( 1) i 2+k ( 1) i 1+k i2 k i1 k+1 = ( 1) i 1+i 2 1 i1 k i2 k As rsult thos two trms sum up to 0. This implis tht th whol sum i (8) is qul to 0. Th proof for th cs of xpsio ccordig to th j = k + 1 colum is similr. This implis tht D2) is stisfid for. Togthr with D1),D3) (ot show hr) it ms tht if (7) is tru for y A R ( 1) ( 1), th D1), D2), D3) stisfid by fuctio dt c j for mtrics. As thr is oly o fuctio stisfyig D1),D2),D3), it hs to b tht for A R (7) is stisfid. Usig mthmticl iductio, w hv prov tht (7) for y squr mtrix A R. This llows us to cosidr othr tool for fidig th dtrmit, but lso llows us to prov tht: Thorm 2.2 Lt A R, th dt(a T ) = dt(a) (9) 3

Proof Proof is by iductio. For A R 1 1 it is trivil rsult, s th A T = [] T = [] = A Lt us ssum tht (9) is stisfid for y ( 1) ( 1) mtrix. W shll prov tht it must b stisfid for y mtrix. Lt Dfi B s 1 1 1 2... 1 A = 2 1 2 2... 2 1 2... b 1 1 b 1 2... b 1 1 1 2 1... 1 b B = 2 1 b 2 2... b 2 = A T = 1 2 2 2... b 1 b 2... b 1 2... Lt us prform xpsio ccordig to th first row of B = A T : Notic tht dt(a T ) = dt(b) = j=1 B 1 j = (A T ) 1 j = (A j 1 ) T ( 1) 1+j b 1 j dt(b 1 j ) (10) Ad s (A j 1 ) is ( 1) ( 1) mtrix, w ssumd tht (9) is stisfid for it, so Additiolly b 1 j = j 1 d thus (10) is qul to dt((a j 1 ) T ) = dt(a j 1 ) j=1 ( 1) j+1 j 1 dt(a j 1 ) which is th xpsio ccordig to th 1st colum for A. Thorm 2.1 sys it hs to b qul to dt(a). As rsult s th rows of A r colums of A, w obti tht D1) D2) d DP1) DP5) r tru for colums s wll. Thus o c do row oprtios to fid th dtrmit. 3 Dtrmit of th product of two mtrics Thorm 3.1 Lt A, B R, th dt(a B) = dt(a) dt(b) Proof W will us, wht ws prov i clss, tht for y mtrix A R, w hv Lt C = A B 1 1 1 2... 1 dt(a) = dt 2 1 2 2... 2 = dt 1 2... 1 2... =... i1 1 i2 2... i dt i 1 =1 i 2 =1 i =1 i1 i2... i (11) 4

Lt us prform som clcultios for = 3 first. C = 1 b 1 1 + 2 b 2 1 + 3 b 3 1 1 b 1 2 + 2 b 2 2 + 3 b 3 2 1 b 1 3 + 2 b 2 3 + 3 b 3 3 s rsult, usig lirity of th dtrmit with rspct to th ch colum, w obti: dt(c) = i 1 =1 b i1 1 dt i1 1 b 1 2 + 2 b 2 2 + 3 b 3 2 1 b 1 3 + 2 b 2 3 + 3 b 3 3 = b i1 1 b i2,2 dt i 1 =1 i 2 =1 i1 i2 1 b 1 3 + 2 b 2 3 + 3 b 3 3 = b i1 1 b i2,2 b i3,3 dt i 1 =1 i 2 =1 i 3 =1 i1 i2 i3 = b i1 1 b i2,2 b i3,3 dt i 1 =1 i 2 =1 i 3 =1 i1 i2 i3 A similr clcultio for mtrics shows tht dt(c) =... b i1 1 b i2,2... b i, dt i 1 =1 i 2 =1 i 3 =1 i1 i2... i (12) Now otic tht if y two colums of i1 i2... i r qul th dtrmit of this mtrix is zro. So th oly o-zro cotributio coms from thos trms, whr this mtrix hs th sm colums s mtrix, but i diffrt ordr. By prformig colum itrchgs, o c trsform this mtrix to mtrix A. As rsult dt i1 i2... i = ( 1) k dt 1 2... = ( 1) k dt(a) (13) whr k is th umbr of colums itrchgs dd. Notic tht th sm colums itrchgs will trsform mtrix i1 i2... i to mtrix 1 2... = I Thus w obti: dt i1 i2... i = ( 1) k dt(i) = ( 1) k 1 = ( 1) k Usig th bov, (13) o c rwrit (12) s dt(c) = i 1 =1 i 2 =1 = dt(a)... i 1 =1 i 3 =1 i 2 =1 b i1 1 b i2,2... b i, dt i1 i2... i dt(a)... b i1 1 b i2,2... b i, dt i 3 =1 i1 i2... i 5

which, usig (11) for mtrix B, yilds dt(c) = dt A dt B 6