Thread: Row-equivalent matrices

normally, that's how we do it. But alike yourself, i'm having trouble figuring out RREF humm

maybe we can supposed to use some other facts about row-equivalent matrices?

if someone can help out, which i'm sure of, i would be interested in technique of approaching this problem as well. Thanks.

here is an approach that might do the job.

and

use linear combination facts (swamp, pivot, and scale) to match entries of matrices A to that of B.

make...

{ note: r = row; c = column }

A (r1c1) = 1 b/c B (r1c1)

A (r2c2) = 1 b/c B (r2c2)

A (r2c1) = A (r2c1) = A (r3c3) b/c B (r2c1) = B (r2c1) = B (r3c3)

A (r3c1) = A (r1c3) b/c B (r3c1) = B (r1c3)

and

A (r2c3) = A (r3c2) b/c B (r2c3) = B (r3c2)



Unless i'm really gone mental (which could be the case this night lol) the above technique should be valid.

After all, as you said, two matrices A and B are row-equivalent iff RREF of matrices A and B are the same.

We can take matrix A, find it's RREF, which is also the RREF of matrix B that is row-equivalent to A, and then go back to B humm


P.S. i'll give those #s a try later tomorrow.

That seems valid, but in terms of finding the right elementary operations, it seems like it would be guesswork. I'm not sure exactly where to start since there are so many possible operations.

By the way, the RREF of matrix A is

unfortunately you're right...too many possibilities to consider.