23.07.2012 Views

Linear Algebra

Linear Algebra

Linear Algebra

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

304 Chapter 4. Determinants<br />

conflict: here are two Gauss’ method reductions of the same matrix, the first<br />

without any row swap<br />

� � � �<br />

1 2 −3ρ1+ρ2 1 2<br />

−→<br />

3 4<br />

0 −2<br />

and the second with a swap.<br />

� �<br />

1 2 ρ1↔ρ2<br />

−→<br />

3 4<br />

� � � �<br />

3 4 −(1/3)ρ1+ρ2 3 4<br />

−→<br />

1 2<br />

0 2/3<br />

Following Definition 2.1 gives that both calculations yield the determinant −2<br />

since in the second one we keep track of the fact that the row swap changes<br />

the sign of the result of multiplying down the diagonal. But if we follow the<br />

supposition and change the second condition then the two calculations yield<br />

different values, −2 and 2. That is, under the supposition the outcome would not<br />

be well-defined — no function exists that satisfies the changed second condition<br />

along with the other three.<br />

Of course, observing that Definition 2.1 does the right thing in this one<br />

instance is not enough; what we will do in the rest of this section is to show<br />

that there is never a conflict. The natural way to try this would be to define<br />

the determinant function with: “The value of the function is the result of doing<br />

Gauss’ method, keeping track of row swaps, and finishing by multiplying down<br />

the diagonal”. (Since Gauss’ method allows for some variation, such as a choice<br />

of which row to use when swapping, we would have to fix an explicit algorithm.)<br />

Then we would be done if we verified that this way of computing the determinant<br />

satisfies the four properties. For instance, if T and ˆ T are related by a row swap<br />

then we would need to show that this algorithm returns determinants that are<br />

negatives of each other. However, how to verify this is not evident. So the<br />

development below will not proceed in this way. Instead, in this subsection we<br />

will define a different way to compute the value of a determinant, a formula,<br />

and we will use this way to prove that the conditions are satisfied.<br />

The formula that we shall use is based on an insight gotten from property (2)<br />

of the definition of determinants. This property shows that determinants are<br />

not linear.<br />

3.1 Example For this matrix det(2A) �= 2· det(A).<br />

� �<br />

2 1<br />

A =<br />

−1 3<br />

Instead, the scalar comes out of each of the two rows.<br />

�<br />

�<br />

� 4<br />

�−2 �<br />

2�<br />

�<br />

6�<br />

=2·<br />

�<br />

�<br />

� 2<br />

�−2 �<br />

1�<br />

�<br />

6�<br />

=4·<br />

�<br />

�<br />

� 2<br />

�−1 �<br />

1�<br />

�<br />

3�<br />

Since scalars come out a row at a time, we might guess that determinants<br />

are linear a row at a time.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!