MHB E1.4b Determinant with zero column

karush
Gold Member
MHB
Messages
3,240
Reaction score
5
$$\left[\begin{array}{rrrrr}
1 &0 &2 &1\\
1 &1 &0 &1\\
1 &3 &4 &1\\
-1 &-3 &-4 &-1
\end{array}\right]=\color{red}{0}$$Answer (red) via W|Aok I did not do any operations on this
Since by observation the 4th column can become all zero'showever didn't see anything in the book to support this
only that the co-factor expansion would result in multiplying zeros throughoutany suggestions?
 
Physics news on Phys.org
Surely in your textbook there is the rule "If two rows or columns of a matrix are equal" (or the more general "if one row or column is a multiple of another") "then the determinant is 0". One way to evaluate the determinant of matrix is to use "row operations" to reduce the matrix to a simpler matrix. The row operations are "multiply an entire row by a constant", "swap two rows", and "add a multiple of on row to another". The first multiplies the determinant by that constant. The second multiplies the determinant by -1. The third does not change the determinant.

In particular, if two rows of a matrix are the same, adding -1 times one of those rows to the other gives a matrix having all "0"s in one row. "Expanding" on that row gives 0 as the determinant 0.

(Of course you can replace "row" by "column" thoughout.)
 
##\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...

Similar threads

Replies
2
Views
971
Replies
7
Views
1K
Replies
5
Views
1K
Replies
2
Views
1K
Replies
3
Views
2K
Replies
10
Views
2K
Replies
8
Views
2K
Back
Top