|
|
|
|
determinant as a multilinear mapping
|
(Theorem)
|
|
|
Let $\mM = (M_{ij})$ be an $n\times n$ matrix with entries in a field $K$ . The matrix $\mM$ is really the same thing as a list of $n$ column vectors of size $n$ . Consequently, the determinant operation may be regarded as a mapping $$\det:\overbrace{K^n\times\ldots\times K^n}^{n \mbox{ times}}\rightarrow K$$ The determinant of a matrix $\mM$ is then defined to be $\det(\mM_1,\ldots,\mM_n),$ where $\mM_j\in K^n$ denotes the $j\supth$ column of $\mM$ .
Starting with the definition \begin{equation} \label{eq:detdef} \det(\mM_1,\ldots,\mM_n) = \sum_{\pi\in S_n} \mathrm{sgn}(\pi) M_{1\pi_1} M_{2\pi_2}\cdots M_{n\pi_n} \end{equation}the following properties are easily established:
- the determinant is multilinear;
- the determinant is anti-symmetric;
- the determinant of the identity matrix is $1$ .
These three properties uniquely characterize the determinant, and indeed can -- some would say should -- be used as the definition of the determinant operation.
Let us prove this. We proceed by representing elements of $K^n$ as linear combinations of $$ \be_1=\begin{pmatrix} 1\\0\\0\\\vdots\\0\end{pmatrix},\quad \be_2=\begin{pmatrix} 0\\1\\0\\\vdots\\0\end{pmatrix},\quad \ldots\quad \be_n=\begin{pmatrix} 0\\0\\0\\ \vdots\\1\end{pmatrix}, $$ the standard basis of $K^n$ . Let $\mM$ be an $n\times n$ matrix. The $j\supth$ column is represented as $\sum_i M_{ij}\be_i$ ; whence using multilinearity
The anti-symmetry assumption implies that the expressions $\det(\be_{i_1},\be_{i_2},\ldots,\be_{i_n})$ vanish if any two of the indices $i_1,\ldots,i_n$ coincide. If all $n$ indices are distinct, $$\det(\be_{i_1},\be_{i_2},\ldots,\be_{i_n}) = \pm \det(\be_1,\ldots,\be_n),$$ the sign in the above expression being determined by the number of transpositions required to rearrange the list $(i_1,\ldots,i_n)$ into the list $(1,\ldots,n)$ . The sign is therefore the parity of the permutation $(i_1,\ldots,i_n)$ . Since we also assume that $$\det(\be_1,\ldots,\be_n)=1,$$ we now recover the original definition ( ).
|
"determinant as a multilinear mapping" is owned by rmilson.
|
|
(view preamble | get metadata)
Cross-references: permutation, parity, transpositions, number, indices, vanish, expressions, implies, standard basis, linear combinations, elements, identity matrix, anti-symmetric, multilinear, properties, column, mapping, operation, determinant, size, column vectors, field, matrix
There are 2 references to this entry.
This is version 2 of determinant as a multilinear mapping, born on 2002-11-14, modified 2006-01-11.
Object id is 3595, canonical name is DeterminantAsAMultilinearMapping.
Accessed 4019 times total.
Classification:
| AMS MSC: | 15A15 (Linear and multilinear algebra; matrix theory :: Determinants, permanents, other special matrix functions) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|