Why is b considered an element of R^m in the Ax=b theorem?

  • Thread starter Thread starter bonfire09
  • Start date Start date
  • Tags Tags
    Column Theorem
bonfire09
Messages
247
Reaction score
0
In this theorem it states " Let A be a m x n matrix. That is For each vector b in R^m, the column Ax=b has a solution..." Why do they say that bεR^m? Is that because b is a mx1 column matrix where it has m rows making it belong to R^m?
 
Physics news on Phys.org
If A is an "m by n matrix" then it has n columns and m rows. That means that to multiply it by vector v, written as a column matrix, v must have n components, and then the product with be a vector, again written as a column matrix, will have m components. That is, A is from Rn to Rm.
 
so what your saying is that (mxn)(mx1)=(mx1).
and that means that bεR^m?
 
Last edited by a moderator:
bonfire09 said:
so what your saying is that (mxn)(mx1)=(mx1).
and that means that bεR^m?
I'm not sure I know what you mean by "(mxn)(mx1)= (mx1)". I thought we were talking about matrices, not numbers. What I said before was that a matrix with n columns and m rows, multiplied by a matrix with 1 column and n rows, gives a matrix with 1 column and n rows.

If I understand you notation, that would be "(mxn)(nx1)= (mx1)".
 
##\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