MHB A challenging system of equations

Yankel
Messages
390
Reaction score
0
Hello all,

I am working on this system of equations, and I do not get the same results as they appear in the final solution in the book, need your assistance here...this is the question:

Discuss the solutions of the equation system:

\[\begin{matrix} ax_{1}+bx_{2}+2x_{3}=1\\ ax_{1}+(2b-1)x_{2}+3x_{3}=1\\ ax_{1}+bx_{2}+(b+3)x_{3}=2b-1 \end{matrix}\]

I have applied elementary row operations R2->R2-R1 and R3->R3-R1 and got this matrix:

\[\begin{pmatrix} a &b &2 &1 \\ 0 &b-1 &1 &0 \\ 0 &0 &b+1 &2b-2 \end{pmatrix}\]

However, in the book they say the matrix after elementary row operations is:

\[\begin{pmatrix} a &1 &1 &1 \\ 0 &b-1 &1 &0 \\ 0 &0 &b+1 &2(b-1) \end{pmatrix}\]

which is odd since I see no reason to touch the first row.

This is not the end of the troubles, the solution to the problem according to the book is:

"There are six cases:

b=1: infinite solution
b=5, a=0: infinite solution
b=5, a~=0: unique solution
b=-1: no solution
b~=+1 or -1 or 5, a~=0: unique solution
b~=1 or 5, a=0: no solution

(~= means not equal, gave up figuring it out in latex)

Where did they get the 5 from and where and how shall I see this in the matrix ?

Thanks !
 
Physics news on Phys.org
First off, the difference in matrices should not bother you, they just did one more step, subtracting row 2 from row 1.

If one actually calculates what we get from back substitution, we have:

$x_1 = \dfrac{-(b+1)(b - 5)}{a(b^2 - 1)}$

$x_2 = \dfrac{-2(b-1)}{b^2-1}$

$x_3 = \dfrac{2(b-1)}{b+1}$.

This tells us straight off the bat we need to look at the cases where $a = 0$ and $b = -1,1$ on their own.

Clearly, if $b = -1$ we can have no solution, as this means:

$0 = (b+1)x_3 = 2(b - 1) = -4$, from row 3.

So we have to look at the following possibilities (all of which assume $b \neq -1$):

$a = 0, b = 1$
$a \neq 0, b = 1$
$a = 0, b \neq 1,-1$
$a \neq 0, b \neq 1,-1$.

Let's look at the case $b = 1, a\neq 0$ first. Here we see that we must have $x_3 = 0$ and that we have the infinite number of solutions:

$\left(\dfrac{1-t}{a},t,0\right)$

Now in the case $b = 1, a = 0$, we find that $x_1$ can be anything, and we get the infinite number of solutions:

$(t,1,0)$. So if $b = 1$, we get an infinite number of solutions. So far we have found that we agree with 2 of the 6 cases of your text.

Now let's turn to the case $a \neq 0, b \neq 1,-1$.

This gives the unique solution above (at the beginning of this post), which actually covers cases 3 and 5 of your text (which could be combined). That's 4 out of 6 so far.

If we have $a = 0, b \neq 1,-1$ clearly if we have ANY solution at all, we have infinitely many, since $a = 0$ drops $x_1$ right out of the system.

Clearly,

$x_3 = \dfrac{2(b - 1)}{b+1}$ (from row 3) poses no problem at all, and:

$x_2 = \dfrac{-2}{b+1}$ (from row 2 and row 3) doesn't pose any problem, either.

But now row 1 tells us that:

$\dfrac{2(b - 1)}{b+1} + \dfrac{-2}{b+1} = 1$ that is:

$2b - 4 = b+1 \implies b = 5$

(which is case 2), so if $b \neq 5$ there is no solution (which is case 6, sort of, there's no need to distinguish between the sets:

a)$b \neq 1,-1,5, a = 0$ and
b)$b \neq 1,5, a = 0$ and $b \neq -1$

because if $b = -1$ we already know there is no solution from case 4).

So your text is correct, they just arranged the answers differently than you might have been thinking about them.

(by the way, the latex for "not equals" is \neq)
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
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...
##\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...

Similar threads

Replies
2
Views
3K
Replies
15
Views
2K
Replies
3
Views
1K
Replies
7
Views
3K
Replies
1
Views
1K
Replies
9
Views
3K
Back
Top