Solving Determinants: Tips for Midterm Exam

  • Thread starter Thread starter salman213
  • Start date Start date
  • Tags Tags
    Determinant
salman213
Messages
301
Reaction score
1
Hi, I have a midterm tomorrow for my Lin Alg course and I was doing some review probs and I can't seem to understand this one..

http://img119.imageshack.us/img119/239/39786409wb4.jpg

Can someone help me and explain how to do this one!

I know I can just find the whole vector

x1,x2,x3,x4 by just multiplying by A^-1 but on a midterm I don't thinK I will want to waste time and find the inverse of such a matrix if there is another way to approach this problem.
 
Last edited by a moderator:
Physics news on Phys.org
IF you knew A-1, then x3 would just be third row of A-1 time that vector- in other words, since the given vector has a 1 in the second place, zeros elsewhere, it would be the number in the third row, second column of A-1. Can you think of a way of finding that number only? (Especially since you are given the determinant!)
 
thanks a lot

Cof (a) (2,3)
------------ = would be that specific element
det a

right?
!
 
I'm not sure what you mean by "cof(2,3)", but, since you're given a Cramer system AX = B (A is a regular matrix), the solution is X = (x1, x2, x3, x4), where xi = Dj / D, where Dj is the determinant of the matrix which is created by substituting the j-th column of the matrix A with B, and D = det A.
 
Yea somone asked that question today in morning cause exam is in afternoon and he said to do it that way ur saying.. so i guess i get what u said thanks!

but i treid what i was saying and it gives same answer since basically Cofactor of A of the 2,3 term divided by determinant of A is exactly the 3,2 term in the A^-1 and therefore thas waht we want. It gives same answer so I guess you can do it etiehr way but I am sure he would want us to use cramers rule to get like ur saying

det A with 3rd column replaced with 0,1,0,0 over determinant of A

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