Can you switch rows in a matrix without actually switching them?

  • Thread starter Thread starter aaaa202
  • Start date Start date
  • Tags Tags
    Echelon Form Row
aaaa202
Messages
1,144
Reaction score
2
Suppose you weren't allowed to switch rows, would it then always be possible to turn a regular matrix into the unit matrix or would the operation be needed in some cases?
 
Physics news on Phys.org
no, you don't need it.

let's say we want to switch row j and row k. add row j to row k. then add the new row k back to row j.

now multiply row k by -1, and then add row j to row k again. you should now have what row j originally was in the k-th row (and twice the original row j + the original row k in the j-th row).

now subtract twice the current k-th row from the current j-th row. voila! rows j and k have been switched.

(there may be a shorter way to do this, don't know, don't care).
 
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