Why Is Matrix Multiplication Defined the Way It Is?

jacobrhcp
Messages
164
Reaction score
0
Something that has bothered me in my linear algebra class was that I learned a lot of techniques but didn't learn why they worked, or what they were useful for.

One of the things is this: why is matrix multiplication so useful in the way it's defined, and not in any other way? Of all the ways we could define the components of a matrix after multiplication, why does the commonly used way turn out to be so great?

I feel this is such a basic property that I should've learned it a long time by now, but I haven't, and I feel sorry about that.
 
Physics news on Phys.org
every linear transformation can be represented by a matrix

so take f, g linear and let A, B be their matrix representations respectively, then the matrix representation of fog is the matrix product AB, so it's defined the way it is(however strange it seems at first) so that this works
 
##\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