Uniqueness of identity elements for rectangular matrices

Bipolarity
Messages
773
Reaction score
2
Let A be the set of n \times n matrices. Then the identity element of this set under matrix multiplication is the identity matrix and it is unique. The proof follows from the monoidal properties of multiplication of square matrices.

But if the matrix is not square, the left and right identities are not equivalent; they are both identity matrices, but have a different size.

How do you know that the left-identity is unique, and that the right-identity is unique?
So given an m \times n matrix A, how do you know that the only matrix satisfying AI = A for all A is the n \times n identity matrix?

Is this even true? Could I possibly find multiple right-identity elements?

BiP
 
Physics news on Phys.org
Let ##B## be an identity element. Let ##A## be the ##m\times n## matrix with a 1 on the ##i##th row and the ##j##th column and zero everywhere else. You know that ##AB = A##. This gives a condition on ##B##. Which one? What if you vary ##i## and ##j##?
 
##\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