What is the Identity Property of Determinants and its Relation to Linearity?

twoflower
Messages
363
Reaction score
0
Hi all,

I don't understand one thing about linearity of determinants. In the book I have:

<br /> \det \left( \begin{array}{ccc} . &amp; . &amp; . \\ . &amp; . &amp; . \\ \mbox{<i>} \\ . &amp; . &amp; . \\ . &amp; . &amp; . \\ . &amp; . &amp; . \\ \mbox{[j]} \end{array} \right) = \det \left( \begin{array}{ccc} . &amp; . &amp; . \\ . &amp; . &amp; . \\ \mbox{<i>} \\ . &amp; . &amp; . \\ . &amp; . &amp; . \\ . &amp; . &amp; . \\ \mbox{[j+i]} \end{array} \right) <br /> </i></i>

And the explanation is:

<br /> \det \left( \begin{array}{ccc} . &amp; . &amp; . \\ . &amp; . &amp; . \\ \mbox{<i>} \\ . &amp; . &amp; . \\ . &amp; . &amp; . \\ . &amp; . &amp; . \\ \mbox{[j+i]} \end{array} \right) = \det \left( \begin{array}{ccc} . &amp; . &amp; . \\ . &amp; . &amp; . \\ \mbox{<i>} \\ . &amp; . &amp; . \\ . &amp; . &amp; . \\ . &amp; . &amp; . \\ \mbox{[j]} \end{array} \right) + \det \left( \begin{array}{ccc} . &amp; . &amp; . \\ . &amp; . &amp; . \\ \mbox{<i>} \\ . &amp; . &amp; . \\ . &amp; . &amp; . \\ . &amp; . &amp; . \\ \mbox{<i>} \end{array} \right)<br /> </i></i></i></i>

But I can't see how these two matrixes (I mean now left and right side of the bottom equation) can be identical, because when I sum the two matrixes on the right, I won't get the matrix on the left...

Thank you for the explanation.
 
Physics news on Phys.org
You shouldn't add the bottom right matrices, since they are determinants. The last determinant is zero because two rows are equal.
To see why the equality is true, expand the first along the last row.
 
Galileo said:
You shouldn't add the bottom right matrices, since they are determinants. The last determinant is zero because two rows are equal.
To see why the equality is true, expand the first along the last row.

This property of determinant is before expaning along rows/columns, so I think it should be possible to see it even simplier.

I know they are determinants, but I suppose that if

A = B + C
then det(A) = det(B) + det(C)
 
Here's a special case that might help:

\vec A\times (\vec B +\vec A) = \vec A\times\vec B +\vec A\times \vec A= \vec A\times\vec B

twoflower said:
I know they are determinants, but I suppose that if

A = B + C
then det(A) = det(B) + det(C)

This is generally false.
Let B=\left(\begin{array}{cc} 1 &amp; 0 \\ 0 &amp;0 \end{array} \right) and C=\left(\begin{array}{cc} 0&amp; 0 \\ 0 &amp;1 \end{array} \right). These have zero determinant... so the sum of the determinants is zero. However, the matrix sum has determinant 1.
 
Thank you, I think I have it. I just have to write the expression for the determinant of the matrix on the left side and I can split it into two determinants equal to the ones on the right side. Thanks.
 
##\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