Multiplication Of Vectors with a Vector As An Element

Fribbles
Messages
3
Reaction score
0
Hi,

If I have a vector c = [ a , 1 ]T where the element a is a vector. If I multiply c by its transpose:

cTc

is this defined? How do I calculate the a*a? Matrix multiplication rules would say that a * a is undefined because it is a nx1 matrix multiplied by a nx1 matrix. Or is the convention that it is the dot product?

Thank you in advance for your help!
 
Physics news on Phys.org
In order to write vectors like that, you will need to think of the original vector, v, as a column matrix, say, v= \begin{bmatrix} x\\ y\end{bmatrix} so that its transpose is a row matrix: v*= \begin{bmatrix}x & y\end{bmatrix}. Then the product, v*u, is the matrix product \begin{bmatrix} x & y\end{bmatrix}\begin{bmatrix}a \\ b \end{bmatrix}= ax+ by.

Of course, that is only notation. If you want to write the vector v as a row, fine. Then its transpose is a column and you have to write the product in the other order. Or you can go with the more abstract concept- given a vector in a vector space, V, there exist an isomorphism from V to its dual, V*, the set of linear functions from V to the underlying field. In that case "v*u" is the linear function corresponding to v applied the vector u.
 
Are you sure this is a well-defined vector, though?
The matrix notation, \vec{u} = \begin{bmatrix}x_1 \\ x_2 \\ \vdots \\ x_n\end{bmatrix} is defined such that x_1, \dots, x_n are the components of your vector in a given basis of your vector space, so they must be scalars.
That's why I don't think having a vector there makes much sense.
 
Thank you for the replies...so then does, a, have to be a column vector?
 
when you take the dot product of two vectors a.b what you're really doing is the transpose of a and then doing matrix multiplication

so a.b === a^t b

if a is 1xn and b is nx1 then a^t is 1xn and so the matrix multiplication is defined (and gives you back a 1x1 matrix aka a real number)
 
##\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