How do you solve equations with matrices?

  • Thread starter Thread starter 3m0k177y
  • Start date Start date
  • Tags Tags
    Matrices
3m0k177y
Messages
20
Reaction score
0
How do you solve equations that have matrices?
heres an example (its just off the top of my head)

3x+y=z+4 where
x=1 0 0 0
0 1 0 0
0 0 1 0
0 0 0 1
and y=0 0 0 1
0 0 1 0
0 1 0 0
1 0 0 0
and a follow up question; does the process change if coordinates are involved in the equation?
if so, how?
 
Physics news on Phys.org
Your equation doesn't make any sense. On the left hand side, if x and y are 1x4 matrices then 3x+y is a 1x4 matrix. That's OK. The left hand side is the matrix 3 0 0 4.

So the right hand side must also be a 1x4 matrix, but can't add a matrix to the scalar "4".

I have no idea what you think the array of numbers after the equation means.
 
I will answer your question assuming that you meant 4 to be 4*E, where E is the identity matrix of GL(4,R) (i.e x=E).

To solve the system you are given you simply reduce it to a simple equation in each entry. So if we denote by Xij, Yij, Zij, Eij the entry in the ith row, jth column of X,Y,Z,E respectively, the equation becomes:

3Xij+Yij=Zij+4Eij

for every i and every j. Rearrange:

Zij=3Xij+Yij-4Eij

Hence Z is the matrix:

-1 0 0 1
0 -1 1 0
0 1 -1 0
1 0 0 -1

Hope that helps :smile:
 
##\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