MHB Clearing fractions with row operations.

skoker
Messages
10
Reaction score
0
i know you have the 3 row operations. add two rows. multiply a row by a constant. add a multiple of a row to another.

my question is can you multiply a row by a constant to clear a fraction at any time so long as you end up in row echelon form. no matter what operations you do the result in row echelon form will be unique?

i am checking my work with a software and when i do fraction free result it comes up with a different Gauss elimination then i do. but then when i put all the pivots to 1 for row echelon its the same result. is this going to give me problems in other thing? maybe where a Gauss elimination has to be unique?
 
Physics news on Phys.org
Re: clearing fractions with row opperations.

so i think i figured it out. sorry if this is so basic, i just started in the linear algebra book.
i was doing the \( 3 \times 3, \; A^{-1} \) with Gauss elimination by hand and always getting it wrong.
 
Last edited:
Re: clearing fractions with row opperations.

to answer your original question, the upper triangular and row-echelon forms of a matrix are not unique. the reduced row-echelon forms are, however.
 

Thread '##(A/\mathfrak{a})_{\mathfrak{p}/\mathfrak{a}}## and its isomorphism?'

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...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

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...
View full post »

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\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...
View full post »

Similar threads

I Row space, Column space, Null space & Left null space
Replies
8
Views
3K
Python Partial pivoting in getting the reduced row echelon form of a matrix
Replies
2
Views
1K
I A few questions about doing a Gaussian Fit
Replies
4
Views
1K
MHB Find determinant by row reduction in echelon
Replies
3
Views
1K
I Are three zeros always required in the third row for a matrix in echelon form?
Replies
3
Views
1K
MHB Check the statements about a 4x5 matrix with rank 2.
Replies
9
Views
5K
MHB Define matrix to get a row operation of type 1
Replies
2
Views
1K
I Matrix diagonalization algorithm
Replies
5
Views
2K
MHB System no/infinitely many solution(s)
Replies
15
Views
2K
I Can't understand a step in an LU decomposition proof
Replies
1
Views
2K

Hot Threads

Recent Insights

Back
Top