Determinant Expansions: Intuitive Understanding & Proofs

  • Thread starter Thread starter heshbon
  • Start date Start date
  • Tags Tags
    Determinant
heshbon
Messages
27
Reaction score
0
Hi, I can't understand why any determinant expansion is the same via any row/column.
My lecturer says the proof is too technical to go over,
Does anyone have a good way to think about it intuitavely or know a site which has a full proof?
thnx
 
Physics news on Phys.org
This is a bit of a vague argument, but I think it is the underlying thought:
The determinant is not so much a property of a matrix, but actually a property of the map which that matrix represents (and usually as such can be assigned a geometric meaning). Therefore, it should not depend on details like which basis we happen to write the matrix in.

I'm not sure we can offer you much rigor without actually going into the proof :smile:

I think the proof is here by the way, at least for expansion along the first row and column. You can just do a basis transformation (permute the basis vectors) to get any row/column you want as the first one.
 
Last edited:
##\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