Is Row Echelon Form an Upper Triangular Matrix?

  • Thread starter Thread starter ichigo444
  • Start date Start date
  • Tags Tags
    Echelon Form Row
ichigo444
Messages
12
Reaction score
0
Is row echelon form an upper triangular matrix? if so, does this mean that its determinant could be 1 or 0? Even if its row equivalent has a different determinant? Please Answer and thanks.
 
Physics news on Phys.org
Yes, a "row echelon" matrix has all "0"s below the main diagonal- "upper triangular". The numbers on the diagonal do NOT have to be "1"s.

You can always reduce a matrix to row echelon form by row operations and those may affect the determinant:

If you multiply a row by a number, the determinant is multiplied by that number.

If you swap two rows, the determinant is multiplied by -1.

If you add a multiple of one row to another, the determinant is not changed.
 
Right! Thank you! This is my first post and i find this site helpful. Thanks!
 
##\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...
Back
Top