Linear Algebra -finding determinant of a matrix

Unusualskill
Messages
35
Reaction score
1
the first row 1 0 0 2
the 2nd row 0 1 2 0
the 3rd row 0 2 1 0
the 4th row 2 0 0 1

I would like to ask which is the most efficient way of solving this ques.Though i can solve but is long method, I know there must have some quick 1, appreciate if u can share it. thank you
 
Physics news on Phys.org
Expansion using minors is your best approach.
 
SteamKing said:
Expansion using minors is your best approach.
minors?
 
Unusualskill said:
minors?
If aij is an element in matrix A, the minor of this element, Aij, is the submatrix that contains all of the elements of A that are not in row i or in column j.
For example, a11 in your matrix is 1. The minor of this element is A11, which is
\begin{bmatrix} 1 & 2 & 0 \\ 2 & 1 & 0 \\ 0 & 0 & 1\end{bmatrix}

For more details of how this works to calculate the determinant, do a web search for "determinant minor".
 
Expanding by minors on the first row:
\left|\begin{array}{cccc}1 & 0 & 0 & 2 \\ 0 & 1 & 2 & 0 \\ 0 & 2 & 1 & 0 \\ 2 & 0 & 0 & 1 \end{array}\right|= 1\left|\begin{array}{ccc} 1 & 2 & 0 \\ 2 & 1 & 0 \\ 0 & 0 & 1\end{array}\right|- 2 \left|\begin{array}{ccc}0 & 0 & 2 \\ 1 & 2 & 0 \\ 2 & 1 & 0 \end{array}\right|.
You could then expand the first of those two determinants on the last row and the second on the first row.

You can also use "row reduction" to reduce the underlying matrix to a triangular matrix. The determinant of a triangular matrix is just the product of the numbers on the diagonal and "row reduction" changes the determinant is a regular way. The basic "row operation" are
1) multiply every number on a row by the same number. This multiplies the determinant by that number.
2) swap two rows. This multiplies the determinant by -1.
3) add a multiple of a row to another row. This does not change the determinant- and it is always possible to reduce a matrix to a triangular matrix using only this.

Here, if you add -2 times the first row to the last row you get \begin{bmatrix}1& 0 & 0 & 2 \\ 0 & 1 & 2 & 0 \\ 0 & 2 & 1 & 0 \\ 0 & 0 & 0 & -3\end{bmatrix}.

Now, add -2 times the second row to the third row: \begin{bmatrix}1 & 0 & 0 & 2 \\ 0 & 1 & 2 & 0 \\ 0 & 0 & -3 & 0 \\ 0 & 0 & 0 & -3\end{bmatrix}

Since we used only "add a multiple of one row to another" that matrix has the same determinant as the original.
 
  • Like
Likes jasonRF
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top