#linear-algebra
2 messages · Page 60 of 1
Ann:
yeah
that's an expression of v as a linear combination of w_1, w_2, ..., w_k
with coefficients t_1, t_2, ..., t_k
is that the answer you were looking for?
not really could you dive deeper into it
there's nothing else that can be said without further context
ok I am wondering if this vector v would be a one dimensional vector if w is just a point
???
there is no "w"
there are w_1, w_2, etc
what are you trying to say when you say "one-dimensional vector"
I mean you can't break it into smaller vectors
because like most basic vectors has an x and y component doesn't it?
what do you mean by "break it into smaller vectors"
in no vector space is there a vector inexpressible as the sum of two other vectors
ok wait let me draw a graph of what I think is hapening here
because like most basic vectors has an x and y component doesn't it?
what's an "x component"? what's a "y component"? are you working in R^2, with the standard basis {(1,0), (0,1)}? then every vector has an x component and a y component.
you're not giving much context, so it's very hard for me to tell you anything constructive.
are you working on a problem right now?
are you trying to make sense of a theorem?
what is it, exactly, that you're doing?
trying to make sense of the theory
"theory" and "theorem" are two different words
can you show the theorem or lemma or result or whatever you're looking at right now?
in full?
whats the difference?
a theory is an entire corpus of knowledge
while a theorem is one statement, with a certain hypothesis and a certain conclusion.
in any case.
please show me the thing you're looking at, whatever it may be called.
,rccw
okay... so you're looking at the definition of a linear combination.
yup
i mean
So I was just playing with it and i was wondering how v would change if you change w
yeah, that's it really ¯_(ツ)_/¯ the two basic operations in linear algebra are addition and scaling, and when you do that to a bunch of vectors, what you get is called a linear combination
a simple example i guess
could it also not be that w1 and w2 are on top of eachother?
what do you mean by "on top of each other"
could they be parallel, or even coincident? sure, they can be whatever you want. just because i drew mine like this doesn't mean it always looks exactly like this
again, watch 3b1b's essence of linear algebra. his illustration skills are way better than mine.
What is the proper notation for span?
This was how my linear algebra book expressed it.
Given this matrix. I need to find a orthonormal matrix M so that M^tAM is a diagonal matrix. How do I do that?
,rccw
Thank you
If you need to make a orthonormal matrix have you tried to find the orthonormal basis?
How do we do that
Is $M^t$ the transpose of $M$ or the inverse? Because I'm familiar with diagonalizable when it comes to $Q^{-1}AQ$ but not with $M^t$
Jules Trayus:
When $M$ is orthogonal, $M^\top=M^{-1}$
Rijinaru:
Oh in that case we need to start by finding the eigen values and eigen spaces for $A_2$
Jules Trayus:
So the eigen values are: $det(A- dIn)$
iiNathanz:
So the eigen values are: $det(A- dIn)$
The eigen values are values of $\lambda$ such that $\det(A_2-\lambda\cdot I)=0$
Jules Trayus:
Yup.
okay i found: 1, 1 and 4
So now you'd want to find the eigen space
Span(a,b)= R2 but what else could the answer be to span
Like if it is collinear or just one vector
the span of any set is always a subspace of the space your set's from
in R^2, the only possible subspaces are:
- all of R^2 (dimension 2)
- lines through the origin (dimension 1)
- only the origin (dimension 0)
Ohhh so it would either equal R1, R2, or R0?
no
Yes
R^1 is what some people use to denote the real number line, which is distinct from and doesn't have any points in common with R^2
R^0 just doesn't make any sense
So what is the notation then
well a line is most commonly just specified as the span of a single vector
Okay so span(a)=ca
no
Loll
span(a) = {ca | c ∈ R}
if you can't type ∈ please at least use the word "in" instead
also math is case-sensitive
Yes sir
and don't call me sir because i am not one
no, i have autohotkey.
Guys can you help me I don't understand espace vectoriel lecons please .I have a test tomorrow
Span(a,b)={ca|c member of R}
yes, if a and b are collinear, the span(a,b) = span(a) [= span(b)].
span(0) = {0}.
@pale shell. No I will take it tomorrow
U said that you had an important test or something some time ago
I understand matrice and system linear but I found espace vectoriel so difficult
my exam is on the 22nd.
Hi, how do I find the values of a parameter such that given system of equations has an unique solution?
x + λy = λ
-x + y + λz = λ^2```
you want $\det\begin{bmatrix} \lambda & -8 & -8 \ 1 & \lambda & 0 \ -1 & 1 & \lambda \end{bmatrix} \neq 0$
Ann:
How do I even begin with this .-.
I am following this ML course
and the first programming assignment wants me to do that
To implement finding euclidean distance in an efficient manner
That's what x and z are
I can't even find what a Gram matrix is
Some help please?
Are you familiar with what an inner product is?
Hi. I'm 12, and i'm self studying linear algebra through a book by Ray Hoffman. I'm kinda stuck in the second chapter, because I can't remember the definitions and theorems. Is there an intuitive visualization of concepts like span, basis, and finite-dimension?
🍌 🔨
I mean, I turn 13 in March, so I guess it's fine.
Thanks for the link, by the way.
@cunning forum yeah I am familiar with inner products
What the hell is eigne
how did you define addition of maps?
T(u1 + u2) = T(u1) + T(u2)
that's right
oh nope
f and g in Hom(U, V)
then (f+g)(x) = f(x)+g(x)
prove that f+g is linear
then prove that this new + is associative, commutative, give 0-map
construct opposite of f, such that f + (-f) = 0 and prove its in Hom(U, V)
then you construct and verify the rest of axioms for scaling and distributivity
when you say f and g in Hom(U,V) are f and g linear maps?
that take U to V?
correct
ok that makes sense
so essentially I prove the axioms of a vector space but with linear maps instead of vectors?
yes
why must I prove that (f+g) is linear?
so, Hom(U, V) is closed under +
ye
ok I get it, thanks @echo quail
How to prove two vectors span r2
using what information
The vectors in component form
this is trivial if you've proven things about the relationship between bases and dimension
i mean like in class
like what have you proven that you can use
Idk
do you know what linear independence is?
Yes
i mean like 2 linearly independent vectors in R^2 span R^2
But like he wants the system of esuation method
so using systems of equations show every vector can be written as a unique linear combination of your two vectors
this is easy if you've proven this statement is equivalent to the only linear combination that gives you the zero vector being the trivial one
So basically
I write out cv+cw=xy and then I write the equations but I keep solving them wrong to get the coefficients
i mean ok then this is just a computation problem
which i mean it's tough to tell where you're going wrong
Yeah
How is this wrong
I have to do cross product of first two and then dot product of 3rd one times result right?
How could I solve the bottom one thats marked on yellow?
So far I've separated them into "real" and "complex" numbers
rn I have: "2/(7e^6) * i/(e^i)"
you can't split it like that, that's not how exponent rules work
ok better
now im kinda stuck idk what to do next
you're trying to get it of the form r*e^{i theta}
ye
so you have some things that are kind of like that with the i/(e^i) part, try to make that more like e^{i theta}
could i move the bottom up? w negative exponent?
yep
i see, but wouldnt that delete the "i"
ah true
how do you represent i in polar form
seems like i didnt do much
uh
sec
oh as "y coordinate"
srry this is kinda hard for me to grasp
have you learned vectors before?
not rlly
think of 'r' as being the length and e^{i theta} being the direction
like i've studied a bit on my own
oh ok
yeah like r=radius and e^{i theta} is the angle
or something like that i remember from class
sort of, theta is the angle
e^{i theta} is more like a unit vector pointing in the direction
$e^{i \theta} = \cos(\theta) + i \sin(\theta)$
Merosity:
you can think of these as its x and y coordinates
1? because i have: e^{-i} which is re^{-i} where r=lenght?
|i| = 1
i think its r=sqrt(a^2+b^2)
but this is entirely unrelated to |e^{-i}| = 1
oh
these are two numbers multiplied together
so now we have |i|=1 what do we know about the angle?
you said it was in the y direction earlier, what angle is that
90deg?
yep
exactly
so rn im only doing the "i" portion of "(i)*(e^-i)"?
oh i see
e^{-i} is taken care of really
e^i90
xD
wrong
oh
fix it did you see your mistake
e^i(1/2pi)
oh okok
usually people like theta to be between 0 and 2pi
so your other angle of e^{-i} could be fixed but, well it's up to whoever is asking the question it doesn't matter to me
Hmmmmmmm
well ok first, what's your final answer
ok so, i have (e^(pi/2))*(e^(-1))
oh and the other part
the 2/(7)(e^(6))
that i just kinda left there
that's fine as it is
although you used parenthesis wrong
oh how come
it's 2/(7*e^6)
ohh ok
no, the angle is in the exponent
e^{i *theta}
that whole thing is not the angle
oh so i have 2 angles rn right?
that's like a direction vector
have to multiply them
there is only one angle
and then take that one?
yeah you have two angles you need to combine yeah
oh okok
theta= (i)(pi/2)-(i)
so theta=pi/2
or did it get lost
cause im not sure where the "i" were
yeah you are warmer but still wrong
e^{i*pi/2}
$e^{i \theta} = e^{i \pi/2}*e^{-i}$
Merosity:
$e^{i \theta} = e^{i (\frac{\pi}{2}-1)}$
Merosity:
Mekbot:
try to see if you can figure it out
ok
combine the exponents
yeaH
pog
so what's theta = ?
(pi/2)-1
perfect
damn that was kinda hard
so does there always have to be an "i" multiplying the exponent?
yeah
like lets say in the rectangular form: a+bi
that's where the angle will be
then it is r=24 and theta = 0
i would still write 24e^(i)
Merosity:
oh ok
that would be 1 radian
true
I think the most straightforward way to do this if you're given z is to find what |z| is first
mmm
then divide that out and just figure out the angle by putting it into the form e^{i theta}
so if z = x+iy then |z| = sqrt(x^2+y^2)
you don't actually have to evaluate this directly
like we ignored the real numbers automatically
there are harder ones though, like for instance 1+i
in some ways, it may be easy or hard depending on what you know
huh
what's r and theta for 1+i?
and the theta
r is not 1
r is not 2
op/adj
yeah use tangent to find theta good
r=sqrt(2)
correct
same thing
doesn't change anything
x+iy you have real part is x and imaginary part is y
one may just plug into arctan for Re(z)>0, otherwise atan2 works nicely
so tan(theta) = y/x
oh
just like normal
if you already have it in rectangular form, you can just get the correct quadrant to fix what angle it has to be in
if $x>0$, then $\theta=\arctan\br{\frac yx}$, otherwise use $\theta=$ atan2$(y,x)$
RokettoJanpu:
no, just short for 'arc'
i guess it's a bit much to introduce the atan2 function at this time, mero can help you sort through the sign casework w/o it 
it's part of the true inverse to the coordinate transformation, x=r cos theta and y=r sin theta
r =sqrt{x^2+y^2} and theta =atan2(y,x)
yeah don't worry about it, just focus on the complex numbers for now
so in the 1+i example
doing it by regular trig like you were taught is good enough
no
actually, arctan(y/x)
yeah
aight i think im ready-er
for tmorrow
ty
one last thing if i may, a friend sent me this, but im pretty sure he shouldt be able to do that right?
where he gets 3(e^6*e^(ipi))
and multiplies the 3
on both
I have to go
shouldnt it just multiply one of them and never turn into a 9
oh dw
imma go to sleep then, thank you for the help, really appreciate it and i learned quite a bit
this is just scalar multiplication and vector addition yeah
LADW can be tough if you haven't read a book like it before
you might have to reread chapters multiple times
it's a really good book, but it's dense and written like a "real" math textbook
uh not that i'm aware of
nah
most of them should be fine w/o a solution set, if you have any questions you can come here
1.7 and 1.8 are probs the most challenging from this set
that's ch.2
ch.2 is also probably the most simplified chapter of the whole book, so once you get through 1 2 should be pretty easy to work thorugh
also note an intro to lin alg class covers up to about halfway through ch.5
if you want to go more in depth you could after ch.4 read ch.9, then do ch.5 and ch.6
ch. 7/8 are pretty abstract, they're good, but probably harder than the rest of the book for intro to lin alg
i just told him to read ladw not ladr
are you a math major?
i assumed he was when i made this recommendation
if you can read ladw it means you're ready to work through higher level books as well
I am following this ML course
and the first programming assignment wants me to do that
To implement finding euclidean distance in an efficient manner
Posting again cause didn't get any response yesterday .-.
What have you tried?
How to visualize linear transformations?
3Blue1Brown is king of visualizing linear algebra
Watch his video series on linear algebra to see what I mean
Also how do you draw one tho?
draw what
Draw R2 after a linear transformation
well you could draw a grid like what 3b1b does i guess
Yeah but would you just map out where î and j hat go so then you could fill in the rest of the lines like that?
i mean... sure?
Ok
so based on my understanding the spectral theorem allows us to find an orthonormal basis of eigenvectors
but are there any applications where we specifically require the basis be orthonormal?
e.g. for computing large matrix powers diagonalizability seems to be sufficient
I remember it being helpful in computating projections and stuff
https://math.stackexchange.com/questions/518600/why-is-orthogonal-basis-important seems to answer your question
And iirc some theorems required orthonormal basis but not sure
ah that makes sense, thanks
What do determinants do
Please help me with these questions. Im not sure at all how to approach them
@pale shell easy way to find if your matrix is invertible
And if the matrix is invertible then you know a whole bunch of things about it
sure yes the invertible matrix theorem is a thing but also you should prove every step of it
you want to find n linearly independent vectors all of whom have a as a root for 23
24 you have n+1 vectors, so if that set is l.i. then it forms a basis, argue why it can't form a bases
basis
Why is the dimension of the nucleus=n-r where n is the dimension of the starting space in a linear function and r is the rank of the representative matrix of said linear function
I did it a long time ago and am revising but totally forgot
so you have $E$ a finite dimensional vector space with $\dim E=n$, $F$ another vector space and $f:E\to F$ a linear map with rank $r$
\ \
you take $S\subset E$ a supplementary subspace of $\Ker f$ (I assume you know how to justify the existence of such a $S$), and your goal is to show that $S$ is isomorphic to $\operatorname{Im}f$
\ \
so you look at the linear map
$$\fun gS{\operatorname{Im} f}v{f(v)}$$
and show it's a bijection (and that's not too hard!)
Tuong:
can someone help me
I need to know how to solve 15xb>55
and have no place to start
this isn't linear algebra. go to #❓how-to-get-help
no one will answer me D: and ok
Why does nobody care about geometric meanings
is this referring to your question about determinants
Ye
linear transform, scaling factor, det
The answer was basically a cool number
determinants are generally introduced poorly
might be good to read ladw's ch.3 on it
i can't tell if ladr or ladw gets rec'd more often
well ladr doesn't get recc'd for intuition about determinants ever
so that's something
3b1b focuses on visual intuition, not computations
linear eqns can be used, but not solely used, for data analysis, and linear eqns are perhaps a very big motivation for learning linalg concepts
Does anyone know why the zero test for linear dependance works?
wdym zero test
you mean like for a set of vectors to be linearly independent, the only linear combination of them that equals the zero vector is when they're each multiplied by 0?
Yes
what's your definition of linear dependence
In my school calc 2 is a prereq for linear algebra, why would that be?
no material from cal 2 is necessary but most lin alg classes expect a level of mathematical maturity and use the calc 2 pre req as an attempt to achieve that
Hey guys! my exam is coming up soon and my teacher mentioned something about problems that combine both arithmetic and geometric sequences and series. However I don't understand what he meant by that as I have never encountered a question like this. have any of you encountered questions like this, and if you have can you please @ me or private message me as I do have a few questions. Thanks 🙂
Try Brilliant.org if you want some hard problems on that stuff
Hi, Why is the dot product of the zero vector and (v,v^2,...,v^n) linearly dependent?
@feral grove Oh okay that makes sense
@native river that question doesnt make sense. The dot product gives you a number
Are you asking why a set containing the zero vector is linearly dependent?
Yes
What's the definition of linear dependence?
Whats up linear algebra peep
A vector can be express as a linear combination, such that -cv= c2v2+c3v3+...+cnvn
Is that the definition of linear dependence?
Considering I can set all those coefficients to 0
And get a valid equation
Are you sure that's the definition?
How will you define linear dependence?
c1v1 + c2v2 + .... + cnvn = 0
Has a solution
With at least one of c1, .... , cn not zero
Okay
From the definition
You should be able to see why a set containing the zero vector is linearly dependent
i like nutting omg
give me a damn linear algebra question
or i will fuck your wife
till her pussy bleeds
i like licking period blood
so its all good
@nimble egret can you please explain to me?
its obvious dawg
if you have a fucking 0 vector
it makes the set linearly dependent
Well
Suppose v1 is the zero vector
And we set c2, ... cn = 0
So we have c1v1 = 0 right?
What value of c1 satisfies this equation?
@native river
c1=0
The reals
Yes
Since all real numbers are a solution
Clearly there is a non-zero solution right?
Which satisfies the definition of linear dependence
@nimble egret Thank you
np
@feral grove thanks for the help, i think i understand how to do 24 now
Im still kind of confused in general about telling whether or not a set of polynomials are linearly independent or not
the normal basis {1,x,x^2,...} makes sense why theyre lin. ind. but other times its confusing to me how you can figure that out
Can't you just treat them like vectors and do the normal approach
Well
They are vectors
Idk... yeah theyre "vectors" but not vectors like <2,4,1>
I mean you can just represent them like that for the sake of checking linear dependence anyway
oh how do u do that?
1 + 2x + x^2 as <1, 2, 1>
Missed one
I did ax+b(x-2)+c(x^2+x) = 0
trying to see if that means a=b=c=0
to check if theyre lin ind.
then i re-arranged that equation
do u see what i mean?
right
Yeah, that works

i know its false
need a counterexample
cant think of a function that obeys that rule
i proved the opposite of that statement so i know for a fact that its false, just dk how to show
so what you are saying is that you think it's impossible for two sets to be subsets of each other?
$A \subseteq B$ and $B \subseteq A$ aren't negations of one another, you know.
Ann:
no, you aren't getting away with "yea whatever" on this one, because (f) is true
i see what you're saying
This doesn't look like linear algebra, this looks like set theory.
You're confusing subsets with proper subsets?
its in my linear algebra homework sir, maybe i am mistaken
wait (f) is true?
im so confused
this was the set of questions
c is false and i showed it with y = x^2, d is true and i proved it, and e is trie and proved it
@wintry steppe no that is not what the problem is saying
any hints on how to prove (f) @dusky epoch ?
these are all set inclusions. prove them as you would prove a set inclusion.
let y in B. show that y is in f[f^-1[B]].
hmm
or maybe it is actually false and i fucked up.
see this is confusing. if its false will it break during it?
cus c was false
and i just showed a counterexample to p=disprove it
i didnt do it abstractly, idk if the derivation will break midway
If its true you can show that:
if let y in B. show that y is in f[f^-1[B]].
and
let y in f[f^-1[B]], show that y is in B
If its false, at least one of those statements must be false
yea so i showed that your bottomm statement is true
i guess ill try the top one
cus the only example i can think of that will break the top rule is a relation
not a function
for example x = y^2 breaks the top rule
This looks like set theory to me, so idk what you mean by function in this example
Oh you literally mean that
Well yeah that's a valid example
yea but x = y^2 isnt a function
?
I'm just thinking of this in terms of set theory, so I'm trying to give hints
gotcha yea
this is confusing cus my course is trying to merge the two
its intro to lin alg so i guess they're teaching a bit of evreything
Why is the dim(ker(f))=n-r ? (where n is the dimension of the starting space in a linear function and r is the rank of the representative matrix of said linear function)
(I’m searching for the proof or just the reasoning behind it)
Take a supplementary subspace of ker(f) and show it's isomorphic to im(f)
that's all
Why would the fact that its isomorphic show that?
I read your answer above but i thought it was for another question xd
the dimension of the space is the sum of the dimensions of the supplementaries
If $\Ker f\oplus S=E$ then $\dim\Ker f+\dim S=\dim E$
Tuong:
Kk ty but thing is my book is using the fact that dim (kerf) = n-r to prove the above
So i cant really use this
(Even though i understand where this is going)
that's weird because this thing is just a consequence of the incomplete basis theorem
Yeah, we do it slightly differently, it says its a consequence of Rouchè Capelli theorem but I don’t see how that fits
You know that theorem?
(I do linear algebra in a different language so some names may not match)
how do i even start
i know i have to prove A implies B, B implies C, C implies A
so uhh yea im lost lol
you can start by noticing C implies A is obvious
the rest is really just playing around with the definitions
im sorry, i just started learning lin alg a week ago at uni, could you explain how i would write C implies A in a 'mathematical' way?
think about what it means for T not to be injective
T not injective means there exists two distinct vectors that have the same image by T
ohh ok so since there exist an infinite number of vectors that have the same image, T isn't injective
im stuck on A -> B
so there are multiple vectors in Rn with the same image. how does that mean that there will be an infinite number of vectors in Rn such that they can be transformed to the zero vector
is it cus you can multiply it by a scalar and it will still become 0? since if it was injective multiply it by 0 would result in another new vector and that cant have the same image as the original
no doesnt sound right
T not injective means there exists two distinct vectors x1 and x2 such that T(x1) =T(x2), i.e. such that T(x1-x2)=0
now have a look at the line generated by x1-x2
for any two artbitrary vectors though right
they aren't really arbitrary
they're just two vectors which existence comes from the definition of "not injective"
right
how does that show there are an infinite number of possibilities for T(x1-x2) = 0 though
when α is a real number, look at T(α(x1-x2))
for all real number α, you have T(α(x1-x2))=0, does that makes infinitely many vectors that are mapped to 0?
uhhh no i guess
maybe do something like assumed c = x1 - x2 and take x1 to be a constant vector. For any random vector c in Rn, there will exist a x2 such that x1-x2 = c, and therefore its infinite
does that make more sense
no
idk bro, i dont get it
it does, x1 and x2 are distinct, x1-x2≠0, {α(x1-x2) | α real} has as many elements as there are real numbers
gotcha
so for B --> C
assume T(x + z) as the transformation
that equals T(x) + T(z)
we know there are an infinite number of x so that T(x) = 0
so T(z + x) = y has an infinite number of vectors z + x that map to y since there are infinite number of vectors such that T(x) = 0 right?
@brittle juniper
you basically got it
might be a good idea to preface with "for any y in im(T), there exists at least one element z in R^n so that T(z) = y" bc you introduced z outta nowhere
gotcha yea ill write it in a better way, just wanted to confirm logic
thanks boys, this has been real helpful 😄
@brittle juniper thank you anyways
DIM
SUM
Do u whaat the fuck aeigen os
nani
I dream of a day when you'll learn how to construct proper sentences
Does this result mean that they don’t span R2
what's kinda noteworthy is that your work leads to 0=y-2x, which says the two vectors span the line given by y=2x
you're welcome
so what guarantees the fact that we can always remove one of w's and not the u's?
Can someone explain in own words what a generator is and give an example? I don't understand in the way it is worded here
"here"?
in my tekstbook
well we can't see your textbook, einstein! it's not hooked up to a webcam!
it's in dutch so it would be useless to give it to you,
the notation should still be the same
and i'm pretty sure i could reason out what the dutch means
it ain't chinese
ok, if you need I can try to explain a few words if needed
just post it already
,rccw
so... generator = spanning set
is that a question or answer?
i mean as far as i can tell this just says "we say S is a generator for V if span(S) = V"
uhhh yeah? what else do you want to hear from me
so, S is a subset of V and we only say S is a generator if span(S) = V?
"S is a generator of V" is DEFINED as meaning "span(S) = V"
ok, then we get introduced to linear independence
and I think I understand it
but then we get to basis, and it says it is a basis if it is linear dependence and if it is a generator.
er
no
a basis is a set that is linearly independent, and a generator, simultaneously.
yeah thats what I mean
ok but the way you said it was wonky
,rccw
Couldn't find an attached image in the last 10 messages
can you tell me why they are important or what they do, the basis?
so I atleast have an idea of what I'm doing?
well
if you have a basis for your vector space, every vector in the space can be expressed as a linear combination of your basis, and said expression is unique
the former is guaranteed by the basis being a generator and the latter by its linear independence
so yknow. that lets you get a better grip on your vector space as a whole
and also any two bases for the same vector space have the same size
and that size is called the dimension of your space
which is another important quantity in linear algebra
ah oke. thanks
Why do things tend to move towards the eigen-span in a ODE (is it generally true for any DE system)?
I think my question is ill-defined, let me find an example.
Get free access to over 2500 documentaries on CuriosityStream: http://go.thoughtleaders.io/1128520191214 (use promo code "majorprep" at sign up)
Support the Channel: https://www.patreon.com/zachstar
PayPal(one time donation): https://www.paypal.me/ZachStarYT
This video cover...
i'm gonna disappear soon but what do you mean by "things"
he starts at an arbitrary point with arbitrary populations and eventually, it settles on the eigen span
can't watch the video rn, but the concept is kind of similar to the way differentiating exponentials works. If you have some differential operator A and some vector v such that Av = av for some a in R, then there had better be some exponential function at play (e^{at} where a is the eigenvalue).
It turns out that the eigenvectors span the space of solutions to the ODE, and when you parametrize the solutions in this way, its clear that solutions either converge or diverge from eigenvectors (depending on the sign of the eigenvalue). @alpine echo
@slow scroll thank you, but I don't understand this second part
It turns out that the eigenvectors span the space of solutions to the ODE, and when you parametrize the solutions in this way, its clear that solutions either converge or diverge from eigenvectors (depending on the sign of the eigenvalue).
Specifically, I don't get what you mean by, "when you parameterize the solutions in this way"
Can you please, provide a simple example?
a simple example are the lotka-volterra predator prey equations, do you know those
oh actually
those are more complicatied
because theyre not linear
I meant something like
$\begin{cases} \dot{x} = ax + by \ \dot{y} = cx + dy \end{cases}$
gfauxpas:
let's make it symmetric just to guarantee it's diagonalizable
$\begin{cases} \dot{x} = 2x - \frac 1 2 y \ \dot{y} = - \frac 1 2 x + \frac 1 3 y \end{cases}$
gfauxpas:
$\dot{\begin{bmatrix} x \ y \end{bmatrix}} = \begin{bmatrix} 2 & - \frac 1 2 \ - \frac 1 2 & \frac 1 3 \end{bmatrix}\begin{bmatrix} x \ y \end{bmatrix}$
gfauxpas:
so what exactly is your question, why you can diagonalize this and get the solutions?
To find the axis if a parabaloid, can i find the intersection between the quadric and a plane (which is a conic), then find the centre of said conic and find the equation of the straight line passing through the centre of the conic and parallel to the eigenspace of the eigenvalue 0?
(Advanced linear algebra xd)
Maybe? Why not just do it all at once
@lone quail how would you know which plane to use?
Any plane would be fine i guess
Because the centre of the conic which comes out is still a point in the axis no?
I dunno, seems convoluted to me
(This is non canonic form)
Just diagonalize a 3x3 symmetric matrix
Yeah and then?
The eigenvectors unitized will be the directions of the axes and the lengths of the axes will be the eigenvalues
That wont work because the quadric is rototranslated from the origin
Or whatever the right term is for the "fake axis' of a paraboloid
Meaning that the axis dont pass through the origin
Whats the quadratic form in questuon
,rccw
This is the generic form of a quadric
You can take the non linear part which js a 3x3 matrix and diagonalise it the issue is that the eigenspaces which come out are actually parallel to the axis
So my idea was to find a point passing through the axis by intersecting a plane with the quadric and finding the centre of the conic which comes out
(You can find the centre very easily using partial derivatives)
I saw online an approach using homogeneous coordinates but I've never actually tried it
A 4x4 quadratic form on [x,y,z,1]
Yeah but you can just consider a 3x3 matrix because the rest is linear
Well you're saying that's not good enough for your problem
You do find eigenspaces
But they are parallel
So any better idea in finding maybe a point passing through the axis?
As intersecting a plane seems a bit convoluted as you say
In mathematics, the matrix representation of conic sections permits the tools of linear algebra to be used in the study of conic sections. It provides easy ways to calculate a conic section's axis, vertices, tangents and the pole and polar relationship between points and line...
Id try it using wp's way with homogeneous coordinates
And then come back and @ me with it because id love to see it in practice, ive only seen it mentioned in passing
Gl and @ me :]
Ahah, @lone quail,found it on the page
If you set the first 3 rows of the matrix in homogeneous coordinates
And dot them with a to-be-determined vector (x0,y0,z0,1)
And equate to 0
That's precisely the coordinate at which all degree 1 terms vanish simultaneously
So you make a substituion x'=(x-x0) and so on
And the center will be the origin in the new system
The same result.as completing the square in 3 variables
Well you dont need to make the substitution i suppose
You can just translate
Kk thanks!
problem though
this change of coordinates will change the constant turn
term
WP has a formula for the new constant term for conic sections in 2 dimensions, but we want an equivalent term for 3 variables. maybe I'll try to find a formula when I have more energy
so what exactly is your question, why you can diagonalize this and get the solutions?
@vast torrent I'm not very sure, how to put it. But, why do the "initial condition vector" eventually settle in on the eigen span
Does anyone know any begineer subspace proofs?
@alpine echoi think its related to the so called stable manifold theorem but im busy atn
Stable manifold theorem
I'm relatively new to linear algebra 🥺
k so
let me look it up and see how simple it is to explain
the idea is that
the end behavior of trajectories settle into these subspaces as t goes on
and the stable manifold theorem gives conditions on which these subspaces have eigenvectors have bases
no worried
worries
so that's what the theorem says. under certain conditions, the "end behavior" of these trajectories are subspaces, and the eigenvectors span those subspaces
as an easy example
let's say for certain initial conditions the trajectory ends up at 0
and let's say that you end up at zero any time you start anywhere on the vertical axis
and if you dont start at the vertical axis you never end up at 0
then the set of all initial conditions that lead the trajectory to 0 is the vertical axis
which is definitely a subspace
an eigenvector that spans it would be (0,1)
Alright....🤔
but this theorem says
that the solution space can be split up into these subspaces
each subspace corresponding to the end behavior of a trajectory
and each "end point" of the trajectory spanned by eigenvectors of the system
these end points are called fixed points
and they might be infinite
okay dinner time
I'll be around maybe later
Yeah, cool thanks a lot.
It makes sense, when we look at it,
$X(t) = P e^{Dt} P^{-1} X(0)$ this way. Cause, solving like this, will definitely yield, a combination of $e^{\lambda_nt}$
(Oh wait, I'm actually not able to reason it this way either 🤔
But, I've got no insight as to why that should be the case without looking at it this way
Aravindh_Vasu:
Got another doubt, does "as t goes on" correspond to applying the companion matrix again and again?
Really stupid question: Why isn't $\mathbb{R}$ a vector space over $\mathbb{Z}_2$?
Nicholas:
In what context
For my question, is it because the elements of $\mathbb{Z}_2$ are equivalence classes not integers, so they can't be multiplied by real numbers?
They are any choice of scalars
^
Nicholas:
Unless I'm missing something, this does work as a vector space
Wait, mb.
What's a(1 + 1)?
Where a is a real vector?
And 1 is the element from Z2?
0?
Or is it a + a = 2a?
2a=0
well that was the equivalence class thing lol
but yeah that's just a consequence of overloading notation
Because 2=0
so that does work?
We're talking about R over Z2
which is why this is an example of overloading notation
yeah^
we've multiplied an equivalence class by a number
so i have a matrix, each column is a vector. But two of the values in the matrix are variables. I have to find variables for this 3x3 matrix such that they do not span R3. How would I go about this? I have learned only span and indepedence so far. And I am having trouble understanding what the relationship between independence and span is, particularly when it says a set of vectors spans or doesn't span a r^n.
Okay so let's use [0] and [1] for the scalars
a + a is the addition between two vectors, and is done in the reals
[0]a=0 for sure
Unless a is its own additive inverse, this can't be 0
But is a+a=0? We have a+a=[2]a=[0]a=0
ok so I'm actually working towards a question where it's asking me to prove that in any vector space over Z2, every element is it's own inverse. That lead me to "well in R things aren't their own inverses" and then this
so a being its own inverse is a good thing lol
We've proved that if R over Z2 is a vector space, a=-a for all a in R
That doesn't rule out being a vector space
If every element is its own inverse, the vectors have to be Z2ⁿ
well yeah I was thinking that under standard R, x + x =/= 0, which is why I was thinking it wasn't a vector space, then I realized I was dumb
The vectors are real numbers
Why not
Better question
If this is a vector space
Is it a 0 dimensional one
Is there an element that's not a scalar multiple of 0?
1?
and that's true
Okay
So we didn't collapase the space into a point
We're doing pretty good, put scalars in []
Vectors on their own
oh yes nvm 1 is a vector yeah
so if my set of vectors doesnt span r^n
what does that mean in terms of independence
tysm for all the help lipschitz and kaynex :D
Find all values z1 and z2 such that (2,−1,3), (1,2,2), and (−4, z1, z2) do not spanR3
is my question
Wait tho
Um
Wp says
Apart from the trivial case of a zero-dimensional space over any field, a vector space over a field F has a finite number of elements if and only if F is a finite field and the vector space has a finite dimension.
But that doesn't seem true here
R over Z/2Z has how many elements?
Still continuum many, no?
@restive shuttle
So Rⁿ is an n dimensional space. Every basis of Rⁿ has n vectors in it.
If there's too many vectors, they're lin dependent. If there's too few, they can't span the entire space.
we havent learned basis or anything else
But you should have a reason to
we only learned independence and span
Reason through your every step
Your step might be correct, but you need to have an approach
Not just throw techniques at it randomly
So what are you trying to do?
trying to find z1 and z2 such that the 3 vectors do not span r3
What does that have to do with row reduction?
im not sure but the answer key has a solution that appears somewhat in my echelon form
and im not sure why
Well let's figure out why
Lets make a matrix with the 3 columns the vectors in the problem statement
Yes but it you don't know why you're putting it into row echelon form
Then you're just pushing random buttons hoping something happens
That's not math



