#linear-algebra
2 messages ยท Page 53 of 1
Try it with something that is a vector space lol
So you can see why it works to prove it
@half ice Would it have been correct to write it like this and show that for (x,y)=(0,0) they're not equal? https://gyazo.com/0396f197c7a19b3e8a8eb3ebb1b29216
You cant write it as a mtx if you dont know its linear
You could show there's no matrix that satisfies it
I guess
But this is pretty obviously not linear lol. No need for that much work
$T\left(\left(x1,y1\right)+\left(x2,y2\right)\right)=\left(x1+x2+y,y-x1-x2\right)$
The-Elite:
$T\left(x1,y1\right)+T\left(x2,y2\right)=\left(x1+y1,y1-x1\right)+\left(x2+y2,y2-x2\right)$
The-Elite:
okay so im doing this now
was wondering if im doing this right
i know i can show it as a matrix and thats it
but i wanna practice the addition property lol
Nop. Take this example:
T(a,b) = (a + b, b - a)
i guess im not allowed to order them like how i did in the first step?
$T\left(\left(x1,y1\right)+\left(x2,y2\right)\right)$
T\left(\left(x1,x2\right)+\left(yz,y2\right)\right)
am i allowed to turn the first into the second?
What's , between the two vectors?
o i meant to put a , one sec
The-Elite:
$T\left(\left(x1,x2\right)+\left(yz,y2\right)\right)$
The-Elite:
yeah am i allowed to do that?
Swap a first component for a second component? No
(x1, y1) + (x2, y2) = (x1 + x2, y1 + y2)
$T\left(x1,:y1+x2,:y2\right)$
The-Elite:
true
this the above right?
i guess i should provide more detail
$T\left(\left(x1,x2\right)+\left(x2,y2\right)\right)=T\left(x1,:y1+x2,:y2\right)$
The-Elite:
No not that
I'm just adding the first components together, and the second components together
omg what am i doing
lol
one sec
okay wait
lets start over
lol
so i did:
$T\left(\left(x1,y1\right)+\left(x2,y2\right)\right)$
The-Elite:
wait for the last question we did
you added the vectors like usual right
so for this i can do T(x1+x2,y1+y2)?
Yes
true
Only one way to add in Rยฒ
Is that.true
You cant have a vector space on R2 with any other defn of v+w ?
Other than componentwise?
Hmmst. I don't know! Maybe you could
But we're definitely not working with that one here

Almost definitely something to do with
aโb = a + b + ab
then i would get
$\left(x1+y1+x2+y2,:y1-x1+y2-x2\right)$
The-Elite:
?
are you talking about my question?
No, mine
oh
Yeah that's right
thanks for all the help @half ice
Ohai. What's up?
if im testing T(x+y) and T(x) + T(y)
and theyre the same except the order is switched
is that still showing that its linear?
so for T(x+y), i have (x1+x2),(y1+y2)
but for T(x) + T(y) I have:
(y1+y2),(x1+x2)
can someone help me understand how to solve for t? do i need to ln both sides?
Hey can anyone help me figure out where I've gone wrong here? I've asked in another math chat and didn't really get any further. It's been giving me some serious grief and I need to understand how to properly solve a system like this with repeating eigenvals
you got two separate eigenvectors?
it should be the same, but using the same eigenvector to form the fundamental matrix didnt work for me so I tried solving it using a generalized eigenvector, but probably did that wrong.
if you didn't then you will have to use the matrix exponential
when it comes down to it, you will be using the generalized eigenvectors
No, T isn't applied in the first case
i've missed tons of class (health) so let me just ask.. with the generalized eigenvector, do I find that by augmenting A-(lambda=1)*I with the eigenvector (-1,1)?
T switches the first component for the second, and the second for the first
@wintry steppe is that calculus and linear algebra?
@native lodge how does the matrix exponential work? I don't think its required here but thought I'd ask
thx for the help this term @vast torrent
@north sierra its an engineering course: linear algebra with differential equations
lol its actually rlly elegant. one of my homework assignments was to do a cryptography problem
but I'm lost
it technically counts as an ODE credit, so it's not too advanced
โกAmphyโก:
you have a chance at evaluating it by using the Taylor expansion of e^x
@wintry steppe ^
it works out nicely for diagonal matrices and nilpotent matrices
Could you also define the sine of a matrix?
Oh ok, I got confused until I realized the problem itself uses e^t.
@half ice I bet you could. Maybe by diagonalizing the matrix, then taking the Taylor expansion for sin(x) of the remaining elements and sticking that in there?
do you need to use ln to solve for t?
@inland gull what kind of a problem is this? does it have a part a?
i just need to isolate and solve for t
im not sure how to show A must be symmetric and have only positive eigenvalues for this problem
what does it mean for $\ang{\mathbf{x},\mathbf{y}}=\mathbf{x}^TA\mathbf{y}$ to be an inner product?
Ann:
as in <x,y> is commutative, is linear in the first argument
and <x,x> >= 0, and is = 0 iff x is the 0 vector
det(bC) = det(bIC) = det(bI)*det(C)
introducing an identity matrix makes it clearer
since bI has b on the diagonal, so its determinant is b^n
Also, it comes from the fact that scaling a row or column scales the determinant by the same amount. i.e. let v1, v2, .. , vn be the column of a matrix A, and let det(A) = D(v1, v2, ..., vn) denote the determinant of A. Then
D(v1, v2, .., cvi, ..., vn) = c*det(A)
so when you scale every row/column by some amount (i.e. when you are taking a scalar multiple of a matrix) you get the identity det(cA) = c^nA for an nxn matrix
show work?

what
you're aware A is the matrix AFTER the row ops were done on B?
yeah
then first row of B is multipled by 1/2
so the determinant is divided by 1/2
er
then the second operation has no effect
hold up
third one changes the det sign
1st row op doesn't do that
so what does it do?
tell me again what 1st row op is
1/2R1
well the determinant is multiplied by 1/2 then
but if i want it back id have to reverse
it
what's the det of the resulting matrix after 1st row op?
5
ok, continue
then the second operation doesn't do anything to the detemrinant
third operation changes its sign
so det(A)=?
๐๐ฝ
i was interpretting the Q so bad lol
what does the second sentence mean/ask for? I know they are linearly independent so they span the entire 3 dimensional space for the first part :o
a[1, 1, 0] + b[1, 1, 1] + c[0, 1, 1] = [b1, b2. b3]
find possible a, b, c
in terms of b1, b2 and b3
to check independence just check whether the determinant is 0 or not
If they are independent, since the number of column vectors is equal to the dimension, it must span the space
ahh thank you!!
Is this true?
translation:
If two operators are diagonalizable, then their composition will be too.
I'm going to say no. I'm yet to get a counter example though @half osprey
Nvm that was easier than I thought
https://math.stackexchange.com/questions/1084522/is-the-product-of-any-two-invertible-diagonalizable-matrices-diagonalizable/1084537
ooooh
I was thinking of a diagonal matrix instead of a diagonalizable
thats why I couldn't find a counter examplel
Cool cool! Feel free to ask if there's anything else
Is there any oblique projection formula that can be used to find the transformation matrix for a 4D hypercube to a 3D hyperplane?
If that makes any sense.
if we're finding the inverse of a 3x3 matrix or higher
and Im using the
[A | I]
way
and solving till i get to the identity matrix on the left side
are we allowed to swap rows?
will that mess up the inverse ?
you can do that. It won't mess up the inverse. You can do any operation you want as long as it has a corresponding invertible matrix associated with it.
There is a matrix that permutes the rows of any matrix its composed with, and since permutations can be undone, it is definitely invertible. You don't have to actually have to think about that all of the time, but it helps to know what is going on in the back end.
okay thanks so much
yeah cause i kinda had to swap rows to get an identity matrix for this question im doing right now
i dont really get what that second sentence you wrote means
cause i dont know what permutations is
I just mean a re-ordering of the rows. In this case, you are really only switching (transposing) rows. If I switch two rows, then if I switch those same two rows again, I get back to where I started. So that process is invertible.
npnp
so i have that matrix
and i wanted to get the eigen basis
anyways, did i do it right
That one matrix should read
[2x2]
[x2]
[x3]
When you add vectors, you get another vector. Never a matrix
ok but is my basis right ?
and the parametric form or whatever you call it
there's two free variables so i should get 2 vectors for the nulA
The final answer looks right
ok thanks bro
so like my professor put the basis vectors in a matrix
and he got this
idk how
it dosn't make sense
he already made 2 mistakes today that i pointed out
so this could be the 3rd but idk
well the column space of that would be the eigenspace. A weird way to write that tho
Oic
yeah
okay my prof was wrong lol
๐ฆ
hes making me doubt myself 2 days before my linear algebra exam
this is no good
what are you doubting?
it's pretty common to put vectors in a matrix if that's what you're doubting
$Av_i = v_i \lambda_i$
Merosity:
for instance these equations one for each i can be written all together as 1 matrix equation if you put the vectors in a matrix and the scalars on a diagonal of a matrix
$AP=PD$
Merosity:
the columns of P are the eigenvectors v_i
no im just doubting myself cause the answer that i get (which is correct) is different from the profs answers (which is wrong
so when i compare my answers to his, im like huhhuhhuh
and i start doubting myself
"did i do this right?"
"am i supposed to do this instead"
just check using symbolab then
yeah i checked using one of those types of websites
and i also emailed him and he said he made a mistake
so yeah im relieved
like if I had a mirror, where would they be
in the same spot
which is where, perpendicular to the mirror?
um
what spot relative to the mirror are the vectors that don't move
bruh
the line that we drew lets just say
lets say i drew y=x okay
thats the line
im talking about
so the points (1,1) and (-1,-1) are on that line
yeah
but that has eigenvalue -1 if we reflect
and it's stuck on the line
you said it has eigenvalue 1
idk you're being too vague
where's your mirror?
what
ok so does the point (1,1) reflect to (-1,-1)
sad
you're gonna remember something your TA told you about mirrors?
think for yourself!
you know how a mirror works
if your mirror is along the line y=x
and you pick the point (1,1)
where does this reflect to?
draw a picture if you have to
i did
so where does the point go
so (1,1) ends up where?
so be confident
but thanks bro
that's all you need
when you said "sad" after i said the "TA said this"
my heart stopped cause the TA is super smart
and like hes insane at Linear Algbra lol
cause i was like
yeah it was only sad because you were trying to argue by authority rather than your own mind, that's all
omg he got something wrong
yeah
oh but the thing is
so -1 would be the vectors that are not on the actual line then im pretty confident in saying that lol
okay but i dont get what the eigen vectors are tho
or what the eigen vectors would be
oh wait
so for the eign value 1 id be all the points of the mirroe?
or idk
(1,1) is what im thinking for the eigen value = 1
i guess we have to define a line first tho right?
cause there are infinite lines through the origin
it's probably better if you draw a picture, then draw the eigenvectors in the picture
yeah true
ill will send a pic
soo for the eigen value of 1, i guess itd just be (1,1) in this case
and for eigen value of -1, itd go from (-1,1) to -1(1,-1)
so vector would be (1,-1)
yeah it is
yeah, good
corresponding to eigen value 1
all scalar multiples of an eigenvector forms your entire eigenspace
true yeah
makes sense hopefully
I don't remember, repost the question
got kinda buried lol
well we live in R^3 roughly speaking
true yeah
LOL
where do you have to stick your arm so that it doesn't move?
up or down
now is it possible to have more eigenvectors?
seems like in 3D space we should have 3 eigenvectors yeah?
can you rotate in a way so that you have more than 1 eigenvector
umm
so when my arm is up or down that would correspond to an egien value of 1?
i mean the line could be anywhere so maybe not
well, that corresponds to the eigenvectors with eigenvalue 1 yes
all vectors along the axis of rotation are those eigenvectors
thats the z axis right?
there's no such thing as "the z axis"
you can call it the z-axis
but you can call it anything
oh okay
we don't even have to rotate around a single axis, it's just easier if we rotate in a basis where one of the axes is being rotated around
rather than some kind of mix between stuff, but it depends on what you're trying to do or describe
i cant think of any other eigen value
people who do animation have to deal with 3D model rigs with creatures with many different joints that can rotate in certain different angles and the math has to be able to accomodate whatever in any coordinate system
just as an example of where this is applied
would the eigen value have a multiplicty of 3 or what
yeah, for an arbitrary rotation that's about it, but no
the other 2 eigenvalues are complex numbers
ohh
there are special cases though
if you rotate 180 degrees for instance
then you have a 2D eigenspace with all -1 eigenvalues
since everything in that 2D plane normal to the axis of rotation get mapped to their negative
that is so hard to imagine
just imagine a 2D plane
draw a circle and then draw a dot on the circle
then draw where that dot ends up after rotating 180 degrees
do the same for several more dots I suppose to convince yourself
although you really only have to do (1,0) and (0,1) to see that
well if you're having trouble thinking about this, I think I can help
well you said it was hard to imagine
yeah but i dont know what the objective of this is
so idk I was just trying to help you see how to look at the eigenvalues and eigenvectors for a 180 degree rotation as a special case
well what do you have for your answer to this question
is it done or is there more to say
they say at least 1, so I think you're good
it helps to think about what vectors don't move or are only scaled
could be (1,sqrt(2), 7)
you can rotate around any axis
but wouldn't at least 2 of the entries be 0?
eigenvalues are not dependent on your choice of basis
(1,sqrt(2), 7) how did you get that
(0,0,1) would be if you rotate around that axis
I could rotate around (0,1,0)
well not in my chair but lying in bed
yeah
(1,sqrt(2), 7)
lool
+y
lol
you could say it's diagonal along the line y=x is north
i mean i just imagined a cartesian plane
yeah you are imagining a specific coordinate system on the world that doesn't really exist
you can say north is the positive z direction and east is the positive x direction
or weirder than that
you can say (1,sqrt(2), 7) is north
yeah i dont get that
it's all just a matter of choice of how you draw coordinate lines
i get you can say north is the positive z direction and east is the positive x direction though
there's no coordinate lines in the real world
what do you mean by that
so like i shouldn't think about the cartesian plane when thinking about the real world?
the coord system you work with is entirely what you choose
oh
i see
yeah that makes sense
but this also is true in linear algebra?
well that was a dumb Question
i guess it is
shocker
so it is kind of not even really real to begin with
i never thought about this stuff so abstractly. this is cool
my mind is always stuck in one thing
lol
thanks for making me thing abstractly
its soo cool
I guess it's more complicated topic than I give it credit for
thanks for all the help
yep
I don't know, I'd have to like see a specific definition of basis first to see if it can be weaseled in or not
i see
like the zero vector itself I think forms a 0d subspace but maybe I'm wrong
I could see how that is like, vacuously true
idk not interesting to me personally but probably something to know if you're gonna be taking a test soon lol
the empty set is the only logical basis for the 0 space
the 0 space is 0 dimensional. The basis must have 0 elements
Ll?
linearly independent
^
I read it as $L\ell$
Icy001:
what kind of savage do you take me for
an Ll one
lol like when people write IR
ew
I was thinking maybe due to this
not quite
how is it that every day i see a couple new variations on the thonk emote?
because it's discord
thonks are integral to every big server
just think
what would we all do
if we had no thonks
thonking is definitely at the pinnacle of discord culture
yeah gram schimdt lol
society would collapse without thonk emotes. ig i was ignorant to question that
cropped
for B would I apply the transformation to all the vectors in B
and then convert TB to basis B'?
and then that will give A' so it's in [T(v)]B'=A'v
Hi guys, noobie question here: But how is the vector $c = (sqrt(2)/2, 0, sqrt(2)/2$?
McNulty:
so it says not to use the pythagorean theorem so i can't use the dot product or what?
I don't see how you'd use the Pythagorean Theorem lol
lol yeah true
Unless they're orthogonal
isn't the pythagorean threoem when you find the length ?
Pythagorean theorem says, for any orthogonal u,v:
|u + v|ยฒ = |u|ยฒ + |v|ยฒ
And that holds for general inner product spaces
You can still find u + v and then find its magnitude to get |u + v|
You could use the dot product if you wanted as |u|^2 = u.u
||u+v||^2 = ||u||^2 + ||v||^2 is only true when u*v are orthogonal ?
okay thanks
@north sierra "u*v are orthogonal" makes no sense
did you mean "u and v are orthogonal"?
* is not a substitute for and.
so you know if I have an orthogonal basis, lets say {u1,u2}
and you have a vector y that you're trying to write as a linear combination of the orthogonal basis vectors
does this formula only work if the vectors are orthogonal ?
Is there a periodic equvialent of the characteristic polynomial of a tensor?
I'm representing the unit cell of a crystal as a variable size tensor and I'm trying to see what alleys exist to encode it in some fixed dimensional space
@topaz plover you can find the missing numbers
how
so... do you know how the adjoint is computed?
yea so i guess you could just plug x, y, z into those question marks and solve the system you get
yea, but you don't have to compute the entire adjoint or anything. Just compute the cofactors that involve the missing numbers. Then they are equal to some entry in the adjoint. For example, the cofactor you get by deleting the top row and last column is equal to the bottom left entry in the adjoint.
You can make 3 different equations like that.
Err well, you can actually make more than 3 equations. It seems that some of them are linearly dependent
ty
oh what is it
how would u do this
youd have to do dot product
and cross product
but this is lines not vectors
lines are defined by the direction vector
hence the name
so you can just take the dot product of the two direction vectors to determine if they are parallel
you dont need to worry about cross product since the dot product will give enough info
but its lines not vectors
yeah but the direction the lines are facing is all that matters
which is entirely encoded in their direction vectors, the vector next to s and t
you could choose any vector laying on the line and put that in the left vector
yes
but what about parralel
their direction vectors would be linearly dependent if they were parallel
Yeah
so its not perpendicular
So they're not perpendicular
And since there's no ฮป such that ฮป(3,1) = (-1,-3), they're also not parallel
Alternatively, the cross product is non-zero, so they're not parallel
so about the question from earlier: another thing you can do (probably better) is to compute A * adj(A) with generic entries on the bottom, and solve for the missing entries so that you get a diagonal matrix in the end.
A * adj(A) should be diagonal because we know from the inverse formula that A * adj(A)/det(A) is the identity.
So for the second question, you don't have to do any work, because the determinant is the factor you have to divide by to get the identity (ones in the diagonal)
ty
Good morning everyone
I don't have a question about linear algebra, but I will be taking it next semester. With that in mind, does anyone have a personal favorite book on linear algebra with proofs for undergrads?
I would like to start reading up on this subject to prep before the semester
not linear algebra done partially right?
that's not a real thing iirc
Nope
good morning xD
I just got that book
it assumes that I have some pre-existing knowledge of linear algebra (which I do in terms of applied context)
I've only done proofs in discrete mathematics prior
LADR
get LADW.
i guess so
These two questions are meant to test you in your knowledge of the definitions
For the question (a) i understand that we can prove W is a subspace of R^3 by proving three things :
Show it is closed under addition.
Show it is closed under scalar multiplication.
Show that the vector 0 is in the subset.
Is it right ?
That would be sufficient
But what i'm struggling to understand here is that, if we can prove that W is a subspace of R^3 then set of points W must lie in a plane or a line right ?
a vector of W, when it is โ 0, does indeed lie on the line generated by itself, but that's stating the obvious
But i wonder one more thing is that, by given W above how can we know that every points in W is in a plane, because by taking any a, b in R i think there may be chance that some points in W don't lie in a same plane(subspace). If this happens, W can not be a subspace because points in R^3 are not closed under addition.
you can check this by finding how many vectors form an appropriate basis for W
You mean dimension, right ?
there's a quite natural linear map f:Rยฒ->Rยณ such that Im(f)=W
and the dimension of Im(f) can be at most 2
I still don't get it, can you give me some more information, please ?
No, i haven't studied about it yet
you'll learn about them soon then
Ok then , guess i'll have to read about linear maps now ๐ !
no need to rush
But can you please tell me is there any chance to that set of points don't lie in a plane ?
I know for sure that there exists a plane of Rยณ that completely contains W
You know this by linear maps right ?
Yes
Ok thanks a lot !!!
You're welcome
hi guys it might be a stupid questions but
why dont they just write a matrix with a=1 instead of writing a in the matrix and next to it "a=1"
nah this is one single questionh
this matrix never shows up again
lol
also
i got 11
or 1/11
which is the determinant
when finding the inverse do you divide by the determinant
divide what by the det
ok
thanks
also this question
what do they mean by contained but not equal to
its not in my lecture notes
v1 is in v2 or v2 in v3 etc...
and then v1 =/= v2 etc...
right?
ok so this statement is true then
if E is a finite dimensional vector space and F is a subspace of E that's not equal to E, you can say something about dim(E) and dim(F)
idk man
dim(F)<dim(E)
have you not yet covered the concept of dimension of a vector space
We've to prove this before getting into the completeness relation, but I'm really stuck as to where I should start.
Could someone help me out?
,rotate
@mystic mango The part after "Show that" isn't parsing. Is "c" supposed to be a scalar constant? Then how can a scalar = bra vector?
After show that: Sigma{1;n} |a> Ca
equals 1? is that a 1?
a linear combination of vectors equaling 1 
I think its supposed to mean the outer product of |a> and Ca, and then substitute some stuff to figure out Ca
And instead of 1 its the identity matrix?
i'm having some trouble understanding the logic behind this
i understand the matrix, and i accept how the eigenvalues were calculated
but i don't understand how to read them or how the eigenvector matrix works, especially with the is
hii, someone can help-me with a question in #help-2 ?
let eigenvector as v and eigenvalue as a
a eigenvector and a eigenvalue of a matrix satisfies
$A*V = aV$
r41nm4ker:
so to find the long term distribution
i'm not quite sure what to do
i see the math that is done in the 2nd picture but it's not really making much sense
yeah they used matlab, but my class doesn't use matlab so im a bit in the dark as to whats going on
yeah : /
well im a math major but my class is just... apocalyptically bad
my only saving grace is that the practice exam is identical to the final exam
and that the problems are all stolen so i can google them to figure out how they were done
im just so far behind in this class that most explanations don't really click
exams
that is a pain
i have a linear test tomorrow
my friend told me how to do the question
and i can't do alone
huehuehu
but about eigenvectors
basically is
A.ev = C.ev
where C is your eigenvalue
so my A matrix times the eigenvector is the same as the eigenvalues times the eigenvector?
yes, but matrix multiplication is different
is done in other way
In mathematics, matrix multiplication or matrix product is a binary operation that produces a matrix from two matrices with entries in a field, or, more generally, in a ring or even a semiring. The matrix product is designed for representing the composition of linear maps tha...
take a look here
the idea is
Line * Columns
example
i understand matrix multplication
i'm not that far behind, i sort of fell off the proverbial cliff at diagonalizing
so pdp-1 especially
i get eigenvalues but not eigenvectors
r41nm4ker:
Compile Error! Click the
reaction for details. (You may edit your message)
there is tests
about geometrical multiplicity and algebric multiplicity
basically P is formed by eigenvectors
and D have all eigenvalues in diagonal
alright yeah i remember that
and the eigenvalues i use our eigenvalues() command
eigenvectors i don't think sage can handle, or at least i've not figured out how that works
we're allowed to use sage on our final
right so i have the matrix in
i have the eigenvalues
but im not sure how to handle the eigenvalues bc they're complex
yeah, that is a problem too
complex eigenvalues are fine
in general, real matrices do not have to have real eigenvalues or real eigenvectors
you find the eigenvectors exactly as if the eigenvalues were real
-while following the rules of complex numbers of course
alright
so i have each eigenvalue
and i have the identity matrix
so what i do next is i just take each eigenvalue * the identity matrix and then subtract that from A?
yea. if $\lambda$ is an eigenvalue, then the basis for $\ker (\lambda I - A)$ gives the eigenvectors corresponding to $\lambda$. They will also probably be complex.
kxrider:
@slow scroll whats ker?
Null space, or kernel. Whatever yโall call it
we call it the null space
We call it kernel
so i rref the result
Analysts and applied mathematicians call it null space 
hm nvm that didn't work
I think you could just use Law of Cosines
alright so i have my 3 eigenvalues, i have the identity matrix, and i have the original matrix
first i multiply each eigenvalue by the identity matrix
then i subtract that from a
then i row reduce each result? i think i screwed up somewhere
also the solutions seem to say they only use the adult vector? so im not really sure what to do with that
The adult vector? Whatโs that loll???
so the original problem im trying to solve is described here with its solution
i'm trying to figure out what exactly they did
i thought markov chains were for the weather or something
It's just any stochastic matrix that describes a linear dynamical system
Yeah, I think the goal is to determine the steady state of your system
now it wants me to make a eigenmatrix using only the adult vector (?) but that i'm confused by
Basically, find when A_k+1 =A_k
yeah, so the long term distribution
i'm just trying to figure out the sequence of steps to do that and im falling v flat
Yeah, unfortunately I'm not home right now so it's hard for me to work through the math just on my phone
I believe you could accomplish that by diagonalozing the matrix then raising it to a higher power
so in order to do that i need to calculate the eigenmatrix right
Well the eigenvectors and eigenvalues
im v weak w eigenvectors
i'm trying to read how thats done rn and its not quite clicking
One other way to solve
Is just find the eigenvectors of the matrix corresponding to eigenvalue 1
Because that fullfils the requirement that Av = v
where is the channel for angles
well rn im v concerned that i 100% forgot how eigenvectors are calculated
even though i did so fine just 2 weeks ago
for stuff like this
Yeah, so you if you know your eigenvalue then you can use the equation $Av=\lambda v$ which is the same as $(A-I\lambda)v=0$
l spacebaR l:
i don't remember settng it to 0 previously
right so i want to set it = to v i think
You end up just having to find a basis for the null space of $A-I\lambda$
l spacebaR l:
It just comes down to gaussian elimination
With all zeroes on the right side of the augmented matrix
right so i row reduce = to 0 but i don't remember doing that previously
i guess i'll see if i can tack on a 0 to the end? i've never learned how to do that so im v confused
Well that's how I've always been taught to find eigenvectors
I'm sorry if I'm confusing you
its fine im not operating at 100% rn
Haha fair enough
I got to go for like 30 mins but if you're still stuck I'll help when I get home
can someone help with 10c
Well not really
If you assume that they are both vectors with tail at the origin
It will just be the magnitude of their difference verctor
Vector*
so how would I solve this
$|v-w|$
That's fair, and a good assumption
l spacebaR l:
then wat
Yeah find the vector produced by their difference
Then find the magnitude of that vector
Which you can find using Pythagorean theorem
Yeah np man
What does it mean for a vector to be in span(x,y), for example?
idk
So a vector is in Span(x,y) if you can write the vector like ax + by for some scalars a, b
yeah so choosing a to be 2 and b to be -3 you can see that it is true
w is in the span of u1 u2
kk ty
forming a matrix using u1, u2 and on the augmented side putting (2,-3) would work?
You have to consider all three basis vectors
oh right
so for this here its the fibonacci sequence but i don't know how to prove it or what its looking for
k(1)=2, k(2)=3, k(3)=5, etc
@half ice just had my final and wanted to say thanks for all ur help this term
Yeah, no problem at all. Feel free to ask if there's ever anything else
Hey All. Got a question here and not really sure where I went wrong. Not really sure where i'm going wrong.
now when I take that A^-1 mod26 and multiply it by A i'm not getting an identity matrix like my instructor is saying i should.
Note that's A inverse only in mod 26
Well that's what he said will work. but it isn't lol
,w matrix multiplication {{10,18,1},{17,1,3},{4,7,21}}{{0,23,19},{23,14,13},{1,12,18}}
,w matrix {{415,494,442},{26,441,390},{182,442,545}} reduce mod 26
Wolfram Alpha doesn't understand your query!
Perhaps try rephrasing your question?
Display results online and refine query
If $x_1, ... x_k \in \mathbb{R}^n$ are vectors and none of them is a multiple of any other, then $x_1 ... x_k$ ..
- must be linearly independent
- may or may not be linearly independent
glee:
To be linearly independent, none of the vectors are allowed to be linear combinations of each other
I'm leaning towards 2. may or may not be linearly independent
cause there might be a case where despite it not being a multiple of each other, it potentially might be linearly dependent
Yes, but why?
@half ice Thanks for that. You got me there. I had to reduce mod 26 again and it got me to the identity matrix. Appreciate it.
@slow scroll why I'm not sure but I can probably cough up an example of 2 vectors that is linearly dependent
Well, what if v1 = v2 + v3? None of these vectors are multiples of each other, but this is a valid linear combination demonstrating linear dependence
the method I know is uhm to write it in REF then solve for $x_1, x_2$ and so on
glee:
from there I can tell if it's dependent or independent, I'm not remotely good enough to see it from the equations like you showed there
also no clue about linear combination ๐
are you free now @slow scroll I have a couple questions tbh
Well take an example like this: is the set {(1, 0), (0, 1), (2, 1)} linearly dependent?
Without writing these in a matrix and reducing and stuff, itโs not hard to see that since (2, 1) = 2(1,0) + (0, 1) that this is linearly dependent
Thatโs all youโre checking for
are you available for a couple more LA questions?
Yea
If $A, B \in M_3 (\mathbb{R}) ; and ; det A = -7, det B = 4$, what is $det (A^{-1} B)$ to 2 decimal places?
(don't tell me the answer just point me in the right direction)
Is $M_3$ here a 3x3 Matrix?
Can someone recommend a good video teaching QR decomposition? There are many results when i search for it and i don't know which videos are best. Rigor is important
$\mathcal M_n(F)$
Is the notation for n by n matrices with entries from F
It's a set
Of all such matrices
i'm slightly confused by dimensions




