Solbing equation A(u)=B(v) for square matrices A and B

  • Thread starter Thread starter ivl
  • Start date Start date
  • Tags Tags
    Matrices Square
ivl
Messages
27
Reaction score
0
Dear all,

this is perhaps a trivial question, so I apologise in advance. Any help is greatly appreciated nonetheless.

==The Equation==
The equation under consideration is:

A(u)=B(v)

where A and B are n times n matrices, while u and v are n-dimensional vectors.

==The Question==
From the above equation, I would like to determine u as a function of v.
Question: is the only way of determining u as a function of v to require that A is invertible?
In other words, is it correct to say that the only way of solving the above equation for u is u=A^{-1}B(v) ?

Thanks a lot,
IVL
 
Physics news on Phys.org
ivl said:
Dear all,

this is perhaps a trivial question, so I apologise in advance. Any help is greatly appreciated nonetheless.

==The Equation==
The equation under consideration is:

A(u)=B(v)

where A and B are n times n matrices, while u and v are n-dimensional vectors.

==The Question==
From the above equation, I would like to determine u as a function of v.
Question: is the only way of determining u as a function of v to require that A is invertible?
In other words, is it correct to say that the only way of solving the above equation for u is u=A^{-1}B(v) ?

Thanks a lot,
IVL



Well, more than "saying that the only way...", I'd say that requiring A to be invertible is the only way to guarantee that there's a solution to your problem, otherwise we'd have to look at each case in particular.

DonAntonio
 
Thanks for your reply, DonAntonio.

You are right, my question was a bit too vague. But you understood what I meant.

Perhaps a more meaningful way to put the question would be:

-given two n times n matrices, A and B
-let u and v be two n-dimensional vectors

A(u)=B(v)

For each choice of v, the above equation has a UNIQUE solution u if and only if det(A) is non-zero.

Correct?

Thanks
IVL
 
There is a unique solution if and only if A is invertible and in that case u= A-1Bv.
 
Thanks everybody,

glad to see things got clearer in my head. Problem solved.

Cheers
IVL
 
##\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