Elementary Row Operations and Preserving Solutions.

Bacle
Messages
656
Reaction score
1
Hi Again:

Just curious: I know that, given a system of linear equations,

ERO's (scaling both sides of an equation, exchanging/swapping rows

and adding a multiple of a row to another row) preserve solutions,

i.e., if x is a solution to Ax=b, then swapping rows will preserve

x as a solution, and no other solution will pop up, and same for other

two. More specifically, if given a system S, we use its associated

augmented matrix A, with x a solution to Ax=b and we swap rows

to get a matrix A', then A'x=b ; same for the other two Elementary Row

Ops.

This above is not so hard to show, but:

* question* how do we know it is precisely these three operations--

and no others--that preserve solutions?

Thanks.
 
Physics news on Phys.org
We have ##Ax=b##. Now given a regular matrix ##T## we can write ##A'=TAx=Tb=b'##and get a new system with the same solutions. This means any regular ##T## is allowed. By a step by step transformation this will be the matrices
$$
\begin{bmatrix}1&c\\0&1\end{bmatrix}\, , \,\begin{bmatrix}0&1\\1&0\end{bmatrix}\, , \,\begin{bmatrix}\frac{1}{c}&0\\0&1\end{bmatrix}
$$
expanded with the identity matrix elsewhere to match the dimensions.
 
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...
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...
Back
Top