Row Reduction: Adding Rows in Matrix

  • Thread starter Thread starter AerospaceEng
  • Start date Start date
  • Tags Tags
    Form
AerospaceEng
Messages
28
Reaction score
0
quick question if i have the matrix; (R represents a specific row)

1 1 3 -3 0
0 2 1 -3 3
0 -1 -1 2 -1

R3+R2 -->R2

1 1 3 -3 0
0 1 0 -1 2
0 -1 -1 2 -1

and then R2+R3 -->R3

1 1 3 -3 0
0 1 0 -1 2
0 0 -1 1 1

is there anything wrong with my adding of rows or what not? I'm really just second guessing if i can add a lower row to a higher row. thanks.
 
Physics news on Phys.org
I think it is far better to use a simple "algorithm" always doing things the same way, working on one column at a time, from left to rightm top to bottom.

That said, I would not Use your first step where you add the third row to the second. Instead I would either "divide the second row by 2" then "add the new second row to the third" which gives
\begin{bmatrix}1 &amp; 1 &amp; 3 &amp; -3 &amp; 0 \\<br /> 0 &amp; 1 &amp; 1/2 &amp; -3/2 &amp; 3/2 \\<br /> 0 &amp; 0 &amp; -1/2 &amp; 1/2 &amp; 1/2 \end{bmatrix}

or "swap the second and third rows" then "add twice the new second row to the new third row".

\begin{bmatrix}1 &amp; 1 &amp; 3 &amp; -3 &amp; 0 \\<br /> 0 &amp; -1 &amp; -1 &amp; 2 &amp; -1 \\<br /> 0 &amp; 0 &amp; -1 &amp; 1 &amp; 1\end{bmatrix}
 
AerospaceEng said:
quick question if i have the matrix; (R represents a specific row)

1 1 3 -3 0
0 2 1 -3 3
0 -1 -1 2 -1

R3+R2 -->R2

1 1 3 -3 0
0 1 0 -1 2
0 -1 -1 2 -1

and then R2+R3 -->R3

1 1 3 -3 0
0 1 0 -1 2
0 0 -1 1 1

is there anything wrong with my adding of rows or what not? I'm really just second guessing if i can add a lower row to a higher row. thanks.

You do add multiple of lower rows to higher rows, after reducing, to turn your matrix
into reduced row-echelon.
 
##\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