MHB Linear Algebra Conditions: Solving for ab≠1

Terry_Destefano
Messages
3
Reaction score
0
View attachment 6404
The answers is b) ab≠1, but I have no clue how to get to that answer... Can someone help me? :D
 

Attachments

  • wfusN4S.png
    wfusN4S.png
    5.6 KB · Views: 120
Physics news on Phys.org
foxsborisnaumo said:
The answers is b) ab≠1, but I have no clue how to get to that answer... Can someone help me? :D

One answer to this is that, in order that a system of linear equations have a unique solution is that the determinant of coefficient, here $$\left|\begin{array}{cc}1 & b \\ 2a & 2 \end{array}\right|= 2- 2ab$$ be non-zero. (This is the answer you got to your post of this question on another board.)

More fundamentally, what happens if you try to solve the equations? To solve x+ by= -1, 2ax+ 2y= 5, we might start by multiplying the first equation by 2, 2x+ 2by= -2. Multiply the second equation by b, 2abx+ 2by= 5b. Now, since both equations have "2by", subtracting one equation from the other (2- 2ab)x= -2- 5b. Finally, divide the both sides by 2- 2ab: x= (-2- 5b)/(2- 2ab). Given that value for x, we could put it into either of the two original equations to solve for y.

Under what conditions can we not do that? Every step above is easy to do for all values of a and b except "divide both sides by 2- 2ab". We cannot do that if 2- 2ab= 0 because we cannot divide by 0. There is a unique solution for all a or b except a and b so that 2- 2ab= 2(1- ab)= 0. That is the same as ab= 1. The given system of equations has a unique solution if and only if ab is not equal to 1.
 
Thanks HallsofIvy!
I put my question at many forums and even payed for homework help but you gave me the most detailed response.
 
foxsborisnaumo said:
Thanks HallsofIvy!
I put my question at many forums and even payed for homework help but you gave me the most detailed response.

There's no need to link to the commercial site you used. Thanks! :D
 
##\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

Back
Top