Just wondering about the structure of a determinant

Dosmascerveza
Messages
23
Reaction score
0
Just wondering about the "structure" of a determinant...

How much can a determinant tell you about the entries of a matrix? How much more if you know the size of the aforementioned matrix? How much more if you know that the matrix is symmetric?(perhaps a silly question). How much more if you know the cofactors across the ith row or jth column?
 
Physics news on Phys.org


Very little. An n by n matrix contains n^2 entries and taking the determinant reduces all that information to one number. You will have lost an immense amount of information that you cannot get back just knowing the determinant.

The one thing you can be sure about, just by knowing the determinant of a matrix, is whether it is invertible or not.
 


The determinant is the factor by which volumes are multiplied under the linear transformation that the matrix represents. That is all it tells you.
 


In a complex vector space the determinant is just the product of the eigenvalues. Sometimes that is helpful, often times not. Likewise, the fact that the trace of a matrix is the sum of the eigenvalues is also sometimes of use.
 
##\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