Show that the two systems Ax=b RAx=Rb

  • Thread starter Thread starter orange12
  • Start date Start date
  • Tags Tags
    Systems
orange12
Messages
5
Reaction score
0
Hey. Got some troubles with this.

4 1 11
A= 1 3 11
0 2 6
1 1 5


1 -1 2 -2
R= -1 2 -3 2
2 -3 5 -5
-2 2 -5 6

B = 2 -3 6 -5
-2 2 -5 6

1. show that the linear system is Ax=b is only consistent if b € N(B)

2. let b € R4. show that the two systems

Ax=b RAx=Rb

are equivalent

hope somebody can help?
 
Physics news on Phys.org


A= \begin{bmatrix}4& 1& 11 \\ 1& 3& 11 \\ 0& 2& 6 \\1& 1& 5\end{bmatrix}


B= \begin{bmatrix}2 & -3 & 6 & -5 \\-2 & 2 & -5 & 6 \end{bmatrix}

Row reduce
\begin{bmatrix}4& 1& 11 & a\\ 1& 3& 11 & b \\ 0& 2& 6 & c\\1& 1& 5 & d\end{bmatrix}
and you will get something like
\begin{bmatrix}1& 1& 5 & d\\ 0& 2& 6 & c \\ 0& 0 & 0 & b-d-c\\0& 0 & 0 & a- 4d+ \frac{3}{2}c\end{bmatrix}
In order that that be solvable we must have b- d- c= 0 and a- 4d+ (3/2)c= 0. Those lead to a= 4d- (3/2)c and b= c+ d so the space of all such b is spanned by <4, 1, 0 1> and <-3, 2, 0, 1> (by taking d=1, c=0 and then d=0, c= 2).

If you row reduce
\begin{bmatrix}2 &amp; -3 &amp; 6 &amp; -5 &amp; 0 \\-2 &amp; 2 &amp; -5 &amp; 6 &amp; 0 \end{bmatrix}
you get something like
\begin{bmatrix} 2 &amp; - 3 &amp; 6 &amp; -5 \\0 &amp; -1 &amp; 1 &amp; 1\end{bmatrix}

The Null space of B is given by <a, b, c, d> with 2a- 3b+ 6c- 5d= 0 and -b+ c+ d= 0.

Show that the solutions to those equations are exactly the space above.

R= \begin{bmatrix}1 &amp; -1 &amp; 2 &amp; -2 \\ -1 &amp; 2 &amp; -3 &amp; 2 \\ 2 &amp; -3 &amp; 5 &amp; -5\\ -2 &amp; 2 &amp; -5 &amp; 6\end{bmatrix}
That is a square matrix so if you can show it has an inverse, all you have to do is multiply, on the left, on both sides of RAx= Rb by the inverse of R!
 
Last edited by a moderator:


HallsofIvy said:
A= \begin{bmatrix}4&amp; 1&amp; 11 \\ 1&amp; 3&amp; 11 \\ 0&amp; 2&amp; 6 \\1&amp; 1&amp; 5\end{bmatrix}


B= \begin{bmatrix}2 &amp; -3 &amp; 6 &amp; -5 \\-2 &amp; 2 &amp; -5 &amp; 6 \end{bmatrix}

Row reduce
\begin{bmatrix}4&amp; 1&amp; 11 &amp; a\\ 1&amp; 3&amp; 11 &amp; b \\ 0&amp; 2&amp; 6 &amp; c\\1&amp; 1&amp; 5 &amp; d\end{bmatrix}
and you will get something like
\begin{bmatrix}1&amp; 1&amp; 5 &amp; d\\ 0&amp; 2&amp; 6 &amp; c \\ 0&amp; 0 &amp; 0 &amp; b-d-c\\0&amp; 0 &amp; 0 &amp; a- 4d+ \frac{3}{2}c\end{bmatrix}
In order that that be solvable we must have b- d- c= 0 and a- 4d+ (3/2)c= 0. Those lead to a= 4d- (3/2)c and b= c+ d so the space of all such b is spanned by <4, 1, 0 1> and <-3, 2, 0, 1> (by taking d=1, c=0 and then d=0, c= 2).

If you row reduce
\begin{bmatrix}2 &amp; -3 &amp; 6 &amp; -5 &amp; 0 \\-2 &amp; 2 &amp; -5 &amp; 6 &amp; 0 \end{bmatrix}
you get something like
\begin{bmatrix} 2 &amp; - 3 &amp; 6 &amp; -5 \\0 &amp; -1 &amp; 1 &amp; 1\end{bmatrix}

The Null space of B is given by <a, b, c, d> with 2a- 3b+ 6c- 5d= 0 and -b+ c+ d= 0.

Show that the solutions to those equations are exactly the space above.

R= \begin{bmatrix}1 &amp; -1 &amp; 2 &amp; -2 \\ -1 &amp; 2 &amp; -3 &amp; 2 \\ 2 &amp; -3 &amp; 5 &amp; -5\\ -2 &amp; 2 &amp; -5 &amp; 6\end{bmatrix}
That is a square matrix so if you can show it has an inverse, all you have to do is multiply, on the left, on both sides of RAx= Rb by the inverse of R!

Thx for the help. I can see how a= 4d- (3/2)c and b= c+ d, but why do u choose d=1 c=0 at first, and the d=0 and c=2. And how is The Null space of B is given by <a, b, c, d> with 2a- 3b+ 6c- 5d= 0 and -b+ c+ d= 0. I can't seem to figure this part out, but i understand the answer to part two. Hope u don't mind taking another look, thanks again.
 


If I row reduce to reduced echelon form with the total matrix [B 0 ] I do not get the same as u get. I get it to be:

1 0 3/2 -4 0
0 1 -1 -1 0
 
##\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

Replies
2
Views
1K
Replies
9
Views
2K
Replies
8
Views
2K
Replies
9
Views
5K
Replies
7
Views
1K
Replies
14
Views
2K
Replies
4
Views
747
Back
Top