MHB 14.1 find a vector v that will satisfy the system

  • Thread starter Thread starter karush
  • Start date Start date
  • Tags Tags
    System Vector
karush
Gold Member
MHB
Messages
3,240
Reaction score
5
https://www.physicsforums.com/attachments/9050
ok I think I got (a) and (b) on just observation

but (c) doesn't look like x,y,z will be intergers so ?
 
Physics news on Phys.org
A basis for a vector space of dimension n has three properties:
1) The vectors are independent
2) The vectors span the space
3) There are n vectors in the space.
Further, any two of those imply the third.

The simplest way to answer the first question is that a basis for a three dimensional vector space, such as R^3, must contain three vectors, not two.

For the second, rather than using matrices, I would write
a\begin{bmatrix}1 \\ 1 \\ 1 \end{bmatrix}+ b\begin{bmatrix}1 \\ 2 \\ 3 \end{bmatrix}= \begin{bmatrix}a+ b \\ a+ 2b \\ a+ 3b\end{bmatrix}= \begin{bmatrix} 0 \\ 0 \\ 0 \end{bmatrix}
so we must have a+ b= 0, a+ 2b= 0, and a+ 3b= 0. Subtracting the first equation from the second we have b= 0 and then a+ b= a+ 0= 0 so a= 0. The coefficients are a= b= 0 so the vectors are independent.
(Actually, two vectors are dependent if and only if one is a multiple of the other. Here, it is sufficient to observe that <span style="font-family: 'Verdana'">\begin{bmatrix}1 \\ 2 \\ 3 \end{bmatrix}</span> is not a multiple of <span style="font-family: 'Verdana'"><span style="font-family: 'Verdana'">\begin{bmatrix}1 \\ 1 \\ 1 \end{bmatrix}</span></span>.)

There are, of course, infinitely many correct answers to
(c) Find a vector, v, such that \{\begin{bmatrix}1 \\ 1 \\ 1\end{bmatrix}, \begin{bmatrix}1 \\ 2 \\ 3 \end{bmatrix}, v\} is a basis for R^3. Since those are three vectors it sufficient to find v such that the three vectors are independent or such that they span R^3. You appear to have chosen to find v such that the three vectors are independent but you haven't finished the problem. IF the three vectors were dependent then v would be a linear combination of the other two. In particular, taking the the coefficients to be 1, the sum of the two given vectors is <span style="font-family: 'Verdana'">\{\begin{bmatrix}1 \\ 1 \\ 1\end{bmatrix}+ <div style="text-align: left"><span style="font-family: 'Verdana'"><div style="text-align: left"><span style="font-family: 'Verdana'">\begin{bmatrix}1 \\ 2 \\ 3 \end{bmatrix}= \begin{bmatrix}2 \\ 3 \\ 4\end{bmatrix}</span>&#8203;</div><span style="font-family: 'Verdana'"><br /> </span></span>&#8203;</div><span style="font-family: 'Verdana'"><span style="font-family: 'Verdana'"><br /> </span></span></span>
. To find a vector, v, that is NOT a linear combination, just change one of those components. Change, say, the "4" to "5": v= \begin{bmatrix}2 \\ 3 \\ 5 \end{bmatrix}. The first two components are from "u+ v" while the third is not so v is not any linear combination.
(Since these are 3-vectors, you could also take v to be the "cross product" of the two given vectors. The cross product of two vectors is perpendicular to both so independent of them.)



 
ok I can see that the multiplicity of the matrix's would be an easier way to check for linearity
but they seem to use the augmented matrix in the examples

thank you for the expanded explanation that was a great help
 
##\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...

Similar threads

Replies
3
Views
3K
Replies
14
Views
4K
Replies
5
Views
946
Replies
1
Views
3K
Replies
4
Views
3K
Replies
9
Views
3K
Replies
16
Views
2K
Replies
10
Views
2K
Back
Top