#linear-algebra
2 messages · Page 59 of 1
It's wrong but i cant find the mistake :/
@wintry steppe found it
Its in the step -3R1+R2->R2
Sign error
You could also noted that since you have x=z you can rewrite the system to have 2 equations in 2 unknowns
this might be a multivar question, but what is the distinction between an eigenvector and a standard basis vector being multiplied by a scalar?
Hello I have a quick question, this is very early on into the course but Im not sure I understand the solution
so for 6b, I understand that I have to transform it into row ecehlon form
as I have done here, but Im not sure Im understanding the solution...
we have that b1 = -b3 and b2 = 2b1
and im not really sure where to go from there
the solution says its this
but Im not sure what it means by b2 can be anything and how the solution is a [b1, b2, -b1]
Hello, if anyone could help i'd appreciate it. I have to express an equation in parametric form. This is the question:
My method of working was to solve for the implicit representation - in standard form which is: 3x -4y +18 = 0 and then use that to create the parametric equation. What i eventually came to was:
x = 2 + 3t
y = 6 -4t
However, this is wrong and i'm not certain why.
Or on a different note, would it be appropriate to let:
x = t
such that:
y = 9/2 + 3/4t ?
Yes
mop:
just by definition?
All automorphisms are homomorphisms.
lmao
<3 Hoodie <3:
Sorry, this
depends how you define sine
Suppose A is a n by n 0-1 matrix. Prove that the determinant of U = nJ+B+B*+2AA^T is divisible by 2^(n-1) where B=(i-1)AJ and J is the all ones matrix.
This is not the original problem, but I've reduced the problem to proving this, which should be easier. But now I'm stuck.
Perhaps we need to use the fact that U is the sum of 3 Hermitian matrices and is thus Hermitian.
If I'm asked to find the norm of the vector between l1 and l2 which is orthogonal to both lines and I know that the cross product of l1 and l2's direction vectors is (-1,2,1), is this a valid method for solving it? https://gyazo.com/43ef784e7f62a59403490f2fd6695b1d
<@&286206848099549185>
@gleaming topaz what does it mean for a vector to be in between two others
Well I'm looking for a line l3 which intersects both l1 and l2 and is orthogonal to them both and I'm asked to find the length of the line segment of l3 between l1 and l2
maybe I was a bit unclear but does that make sense?
I think i see
Well that would be the shortest line segment between the two lines
By some calculus argument somewhere
I would find the general form of a line segment connecting the two lines and then minimize the norm of the function using calculus. Someone feel free to chime in if there's a better way.
I don't know how you took cross products of lines
I took cross product of their direction vectors
to find the vector perpendicular to them both
I guess you took one of the 2 unit vectors on the line
Hmm
No
Direction vector won't characterize the line unless it goes through the origin
You need 2 vectors to describe the line, a displacement vector and a direction vector
So your idea would work if you accounted for that
Yeah but what I've done is find a vector between l1 and l2 in the same direction as l3's isn't it
What does it mean for a vector to be in between two others
In between two linew
Idk what that means
@vast torrent https://gyazo.com/16aa035a6087eaffb1ad9f3055593fe5 L1 and L2 are the red and blue lines right, I'm looking for a vector perpendicular to both l1 and l2 which gives the shortest distance between them
Lets say that the green line is the vector "between" them
Okay i looked around on stack exchange a bit
Each line has 2 vectors defining it
Displacement and direction, right?
$\mathbf s + t \mathbf{\hat{u}}$
gfauxpas:
gfauxpas:
You need to find the cross product of those two vector valued functions of a real variable
Then using calculus minimizes the answer in s and t
I'm looking if there's an easier way
Actually forget the cross product
Minimize the real valued function of the distance between them
You mean the norm of a general vector between l2 and l1?
The distance between two points
And if I'm right
The arg max of the distance function (s,t)
Will tell you which vectors to cross to find the vector between the lines
But I'd prefer someone check what im saying
I found this just now https://math.stackexchange.com/questions/1033419/line-perpendicular-to-two-other-lines-data-sufficiency
His method is harder i think
I'm not quite sure I understood yours if you don't mind elaborating
I could compare results
Take the eyclidean distance between two points x+tu-hat, y+sv-hat
Minimize that function to get the distance between those two lines
The vector with that distance in the direction of the cross product x×y is the one you want, or its negative
So you mean the length of PQ right? https://gyazo.com/75902d49b5423eaa90835f1a3bb3ad06
Distance between two points is sqrt(Δx²+Δy²+Δz²)
Yeah exactly the norm of PQ in this case
Though you will find it easier to minimize Δx²+Δy²+Δz² ,which has the same arg min by strict monotonicity of sqrt
Do you know that theorem
Nope, haven't started with multivar calc yet if it's from there
If f is strictly increasing, f(g(v)) has the same arg max and arg min as g(v)
The upshot is that you can optimize the inside of the square root instead of the whole thing with the square root
Square it then optimize
Do you know partial derivatives
Nope haven't done that yet
You need a very simple application of them here
Basically since you have 3 variables
You consider 3 seperate derivatives,in x, in y, and in z
And solve the derivative =0 simultaneously
3 derivatives =0 at the same time
Just like in calc i but three equations at a time
So in this case my (x,y,z) is (-1+s-t,-5+2s-t,-1+3s-t) ?
Oh so (-1+s-t)^2+(-5+2s-t)^2+(-1+3s-t)^2 ?
What do I derive with regards to here or is that what you mean? We could take it in PM if you'd like
The notation is $\pdv{f}{s}$ instead of $\dv{f}{s}$
gfauxpas:
You take 2 derivatives. With respect to s, pretending t is constantl
And wrt t, pretending s is constant
And you want both to be 0 at the same time fir optimizing
Just like calc 1
But two equations simutaneously
Oh I see, so they'll give me a system of equations where they both equal 0 and I can solve for s and t?
You got it
I'll try and compare the results thank you
And you don't have to worry about testing second derivatives bc it's obvious from the definition of distance that there's going to be one minimum and no other extrima or saddle points
There is a second derivative test for partial derivatives but it's not necessary here
And it works a bit differently
Ok thanks I appreciate the help, I'll try it out
Also this answer will be the square of the distance, you'll take the sqrt at the end
Well this will give me s and t right so I can just insert that into the original equation for the distance
yes that should work too
in fact I think you can even go back to the two vectors defining the plane, put in s and t
and take the cross product
for those particular vectors
so what was the other method?
a system of equations with dot products?
Yeah this one https://gyazo.com/5cf71624a1f6f352739b469a0006e851
I'd definitely forget that way on a test
another common notation for $\pdv{f}{t}$ is $f_t$
gfauxpas:
for when you come across it in your travels
Is that from multivariable calculus?
yes
partial derivatives are from multivariable calculus, but this particular application was simple enough I had confidence you could handle it
Thanks for your time once again
np bro
or sis
what calc have you taken? just part i?
the deeper you go into calculus and linear algebra, they more they overlap
I've done half calc 1 I think, starting with integrals & diff eqs next week and when I'm done with that multivar calc
?
that shorthand notation is awful and I hate that it's used
ye
yup
The matrix method
well, start eliminating then
Let Q be the quadratic form https://gyazo.com/0e3a183c5805a35917dbb9d38db5da52 How do I find the shortest distance from the surface Q(x)=1 to the origin?
<@&286206848099549185>
What's the usual convention for the operator that takes a matrix and stretches it out into a vector; column after column,or row after row?
Is there a common convention?
Nm found it on wikipedia, column by column is the standard
Question
Why do vectors have arrows at the end if they are not moving infinitely in one direction
The arrow indicates the direction in space
Soo is that the x coordinate?
???
Is the magnitude the x or like its actual length
The magnitude is the length
Draw a triangle
Yeah
With the x axis or y axis as one of the sides and the tail of the vector at the origin
It should become pretty clear that if you have a vector (x, y)
Then the magnitude is given by sqrt(x^2 + y^2)
The arrow is ultimately just a notation @pale shell
You can argue they're extraneous if the base of the arrow is at the origin
Thanks
But typically we like writing the arrow in different places to show geometric things
In which case it's not obvious what the base is
The point itself is really the vector, the point at the tip of the arrow
I can go on if you want
I see
Interesting stuff
So tell me
How do you imagine a vector in four dimensions
Most people can't imagine 4d space. I read somewhere that some people can but not 5d and up,idk if that's true
Can you?
Hmm
(x,y) is a 2d vector
I honestly am interested in linear algebra
And (x¹,x²,x³,x⁴) are vectors in 4d. Pretend they're subscripts not superscripts, it's harder to do subscripts on mobile
(x¹,x²,x³,x⁴,...,xⁿ-¹,xⁿ) is a vector in n dimensions
Linear algebra is really important
I have my qual on la tomorrow im so nervous
Qual?
Qualifying exam
I need to pass the quals in 3 subjects to get my MA
Maybe you can teach me some more sometime
Calculus
High school, college, university?
High school
Ah, well, if you plan on going to college, you'll learn so much more than a high school class
Nice
I am super interested in other dimensions and stuff
Now, in terms of of imagining higher dimensions
Ye
The usually add another aspect to the graph that changes according to that aspect. Ill explain
Let (x,y,z) be 3 coordinates of position in space
(x,y,z,t) adds another dimension. So I'll pick one that can be described by real numbers, like time
Then a computer will have a 3d graph that changed as t goes from 0 to 60, then a 1 minute movie of a changing 3d image is 4d
Another way to imagine a dimensionis temperature
3 dimensions will give a shape, now imagine the shape changes depending on how cold or hot it is
Do that and time and your mind might be able to process a 5d set of points
Now connect the graph to a battery and have it change depending on your charge
(x,y,z,time,temperature,charge) is a 5d point
Some of these approaches don't allow for negative numbers for physical applications
You can go higher
And still have a physical interpretation
A vector in R^n , which is what youre probably asking about,is really a point
The line connecting the tail to the head helps you understand those properties
But the vectors have to be straight, that's very important
There are more general definitions of vectors that you'll learn about
@gleaming topaz you can use lagrange multiplies
Know those?
I can think of another way but it's harder
No haven't learned that, I was given a solution but dont quite understand it, I'll post it and see if you could help me out maybe
The other way is to change the variables so that you form an ellipse in standard position such that the shortest distance will just be the smallest minor axis
For points (x,y,z), you want to find a matrix such that
<(x,y,z),A(x,y,z)> = 3x²+4y²+2xz+3z²
And to choose such an A such that it is symmetric
Can you do that?
It will have a good number of 0s
Well one such matrix A would be (3,0,1;0,4,0;1,0,3)?
That it can be diagonalized by a matrix where the eigenvectors form a orthonormal base?
The vectors are all perpendicular to eachother and are unit vectors right
Think determinants
The determinant is either 1 or -1 yeah?
Yup,so?
Sorry I'm not following, are you hinting towards something about the volume or something else?
The only transformations such a matrix could be
Is a product of rotations and reflections
Wait
That's not exactly right
The point is that it's an isometry
I think its right actually
Ignore the matrix A that's not right, but this is the solution I did not understand if you have any idea what happened? It's in swedish but maybe the math makea sense
Basically it says that the surface is given by 4(y1)^2+4(y2)^2+2(y3)^2=1 but I'm not sure what that means
Its wrong
Okay, well, i have to go, but i gave you enough to finish
Alright well thanks I'll see what I can do
Anyway my point was
Isometries will.rotate and reflect the ellipsoid
But won't change the lengths of its axes
Find a coordinate system where there's only u²,v²,w² terms in the quadratic
Hey, so I'm currently studying linear transformations, more specifically, the change of basis applied on a transformation
My issue is when we're dealing with a transformation in between dimensions
So I kind of hit a roadblock here
I have this transformation T: R^3 -> R^2, which I have represented by the matrix m(t)=[(0,1,1),(0,1,-1)]
I now want this transformation, but in the basis S={(1,1), (1,2)}
My issue is, I can't get to the matrix that changes a vector from the basis E to the basis S
The basis E being E={(1,0,0),(0,1,0),(0,0,1)}
I'd be able to do it S were 3 dimensional, and if T were from R^3 -> R^2
But I'm just lost here
you're having trouble because it makes no sense to go from E to S as they live in completely different spaces with completely different dimension. You are most likely misunderstanding the instructions. Perhaps you want find out what the outputs of m(t) look like in the basis of S. In that case, you want to find a transformation A to compose on the left of m(t) that sends vectors in the standard basis to their representation in the basis of S. @wintry steppe
I see, that must be it
I'll look over the instructions again and let you know if I have any more issues!
hey here, i wanted to know what kind / group of graph can be described by an unitary adjency matrix
If P is the projection matrix on a space U, is it possible for there to be two alternate forms of P?

i only just started my linear class this semester
but its tons of fun
so far
its like doing a puzzle
If I have a line that intersects a plane and want to find the angle between the line and the plane do I just take the dot product of the planes normalvector and lines direction vector divided by the norm of them multiplied by eachother?
Or is that wrong
linear algebra amirite?
@gleaming topaz the angle formed by the intersection of a line with a plane is not unique. It does however make an angle with the normal to the plane, and yea, the angle between the line and the normal is obtained using dot product
in LU factorization, the U matrix can never have zeroes on its diagonal, right? 
if A=LU is invertible, then U cannot have 0s on the diagonal
Yes, because U is a triangular matrix and det(A)=det(L)det(U).
Hello! How do I find the Kernel (Ker) and the Image (Im) of the following lineair mapping R² -> R²: f(x,y)=2(x, -y). And if the invers of the lineair mapping exists, what is it?
well, you can't get 0 unless x = y = 0, so Ker f = {0} and it's invertible, and the image is the whole codomain.
Where can I find a set pf practice problems for each unit?
do you know of any way to take two vectors and make a vector that's orthogonal to both of those?
yeah you got it
show your work, sounds like you made a mistake somewhere
or maybe they want you to simplify the square roots more
or rationalize the denominator even
nah webassign doesnt care
nvm got it
How is this wrong
@quartz compass
oh wait forgot = 0
Have you dealt with cross products?
Nevermind, that might not be necessary
I'm not the greatest at this, but hopefully I can be helpful
I think what you wanna do is subtract one of the point vectors from the other
ok
Then, you wanna find a vector normal to both that and your direction vector
So, dot product with (9, -2, 9) is 0 and dot product (2, 9, -6) is 0
i would have to use cross product right
Both methods work but cross product is easier/faster IMO
I believe those should be the coefficients of your plane equation
Now you've got a normal for the plane and to find the equation you need a point on the plane as well to find it's equation
Can you figure that out somehow?
Yeah that works
I have a question as well, though I'm not sure if this is the correct place to ask
I'm dealing with subspaces and my question is ambiguous as to what set my scalars are in
So I can't tell if I'm closed under multiplication or not
@floral barn If it's not specified I would assume they belong to the real numbers? Or was that what you meant? Although I'm not entirely sure
'Let P3(R) be the set of polynomials of degree at most 3 with coefficients in R.'
Does this mean its scalars are in R?
I would interpret it that way yes
Looks like you wanna find what's perpendicular to the line, then find values that satisfy the plane equation and add the point
I think
Should be fairly straightforward
Are you on a strict time limit here?
I set up a system of linear equations
6x - y + z = 0
6x + y - 8 = 1
Matrix and row reduce, yada yada
You should be able to express two of the variables in terms of the third plus a constant
Then you can add the point, I think
Can someone please take a look at this question? The question is basically "What's the geometric meaning of the transpose of a matrix and the product of AA^T?"
@dusky epoch
uhh
yeah i got nothing
i mean i could tell you that the (i,j) entry of AA^T is the scalar product of the i'th and j'th rows of A but that's about it
sorry @alpine echo
Ah, alright no problem, is there anything you suggest I can do to understand this?
Like the 3b1b way?
Does it look like I did this correctly? It feels right but I haven't done anything like this before.
your a and 9 look weirdly similar
ya, sorry for trash handwriting
it doesn't look like you made any algebraic fuckups
I kind of just plugged and played with formulas from my notes, which I hate doing bc I never know if it's right lol
I could derive the dot product thing, that would prob help intuition
hello, how do i prove that: f: R² -> R³: f(a,b)=(a,b,a+b) is a linear mapping
i dont know xD i need to prove that for every a and b this is a linear mapping
is linear mapping and transformation the same?
Yea linear mappings and linear transformations are the same thing.
What's the definition of a linear map?
@sullen pollen are you still here?
ok, do you know how to run with that?
$\fxn{f}{\bR^2}{\bR^3}{(x,y)}{(x,y,x+y)}$
RokettoJanpu:
this is the defn of f
i'll make you show additivity first
let $a=(a_1,a_2),b=(b_1,b_2),\quad a,b\in\bR^2\\$show $f(a+b)=f(a)+f(b)$
RokettoJanpu:
so a + b = (x1+x2 , y1+y2) and evaluated in f it gives: (x1+x2, y1+y2, x1+x2+y1+y2)
when we evaluate a en b in f it gives: (x1, y1, x1+y1) and (x2, y2, x2+y2). When we add them together it gives the expression above and then we proved that
ok i worried x1,x2,y1,y2 would throw you off since i used x,y in the defn of f
ok i'm gonna assume the field of reals. now show me homogeneity
let $a=(a_1,a_2)\in\bR^2,\quad c\in\bR\\$show $f(ca)=cf(a)$
RokettoJanpu:
ca = (ca1 , ca2), so f(ca) = (ca1, ca2, ca1+ca2) = (ca1, ca2, c(a1+a2)) = c(a1, a2, a1+a2) = c * f(a)
all done!
ooooo now i see how the definition lets me show how to prove it in exercises
thank you very much!!
no problem man 
Hello, I have a question: How would I check if two vectors or two lines lie on the same line? I am not asking if two vectors are colinear, I am asking if they lie on the same line on 2D plane.
fuzzy question. there always exists a line that runs through the tips of any two chosen vectors
If the kernel of a lineair transformation is (0,0) (assume R²), is the image always R²?
assume R^2
does that mean "assume the domain is R^2" or "assume the codomain is R^2" or what
uhm the transformation is R² -> R²
then yes.
thanks!
how what
How do I do it
have you ever converted vectors between polar form and component form before?
No
then read up on that
can you show what you've read and which part of it is confusing?
i can try to clear that up, but i need to know what needs clearing up
Well it is telling me to use sin and cosine
can you show what you've read and which part of it is confusing?
To convert the form
can you show what you've read and which part of it is confusing?
On khan acadamey
can. you. SHOW. what. you've. read?
okay, so it's giving you stuff pertaining to this problem in particular
Yes
they could've done a better job presenting it, imo
first convert each vector to component form, then add.
Okay so what exactly is component form though?
$\vec{v} = (8 \cos(140^\circ), 8 \sin(140^\circ)) \ \vec{w} = (4 \cos(40^\circ), 4 \sin(40^\circ))$
Ann:
...uh
yknow
when you give your vector in terms of x and y coordinates instead of a direction and an angle
yes
So polar form would look like a matrix?
what do you even mean "look like a matrix" 
It would be inside a matrix

,,,,,,,
there's no real agreed-upon notation for polar form
because from experience it's rarely used for vectors
Okay so look
because it's hard to add them in that form
It is saying that I have to convert from a magnitude and an angle to xy coordinates
How do I do this
i mean you COULD write something like [r, θ] for a vector with length r and angle θ but that's not a matrix just two numbers in square brackets
anyway
the vector with length r and direction θ is (r cos(θ), r sin(θ))
khan has GOT to have a video that explains this
I was literally watching them and it said nothing on this
But I like how they sometimes have you do some research to get the answers
I was literally watching them and it said nothing on this
surely they have something on "conversion to and from polar form"
or sth
Okay so how do I convert from a magnitude and angle to component form though
the vector with length r and direction θ (in component form) is (r cos(θ), r sin(θ))
Okay thanks
Can someone explain to me what a subspace is? like for example V is linear dependent on v and w. So V = all linear combinations of v + w, so "For All a,b element of R: av + bw = V". So the subspace of V would be some like only even numbers a and b?
holy fuck that's gotta be some sort of bad wording x3 combo
are you translating this from another language @pulsar turret
it's not about being compact
also how can there be a "kind of" in response to "are you translating this from another language"?
either you are or you aren't
it's not a definition I am reading
like for example V is linear dependent on v and w.
this already doesn't make any sense
it's explained in my own words
@quasi vale are you gonna try to respond to rolly's bad wording with an entire paragraph of more bullshit or sth? seeing you type an entire essay in the discord message box is kind of stressing me out
I have a very big question but you were helping him out so I copied it and went out from the channel
anyway... yeah, nobody here knows what you're talking about, rolly.
Maybe i ment linearly independt on v and w?
\
ill ask it later when you are done with him
I think he means that v and w are linearly independent vectors?
that also doesn't make any sense
there's no such thing in linear algebra as being "linearly (in)dependent on something"
yeah, please rephrase it, hopefully in a way that's actually understandable this time
if V is a vectorspace, and W is a subset of V. W is only a subspace if W itself is also a vectorspace. Now my question is how does V and W look like to eachother?
how does V and W look like to eachother?
............ what
what does that even mean
like, let's begin with maybe what is V and W?
yeah I'm not sure what it is tho
what do you mean "not sure what it is"
like what does it represent
what does WHAT represent
a vectorspace
are you struggling with the fact that the idea of a vector space is fairly abstract at first glance
i mean...
idk. would it help if i gave some examples of vector spaces that are easy to visualize
i guess the most prominent ones would be R^2 and R^3
whose elements are vectors in the pre-linear-algebra sense
i mean there's a reason why vector spaces by themselves are so abstract. bc there's many things out there which are vector spaces
like solution sets of certain differential equations, or spaces consisting of functions meeting certain criteria
not that you need to actively think about all that when doing linear algebra
in fact the opposite is true since the point is to abstract away all the specifics and focus only on the structure that arises when all you consider is the behavior of your objects when they're added and scaled
yeah so R^2 is a vectorspace
you might consider giving 3b1b's Essence of Linear Algebra a watch some time
Watching a vid atm on independent/dependent vectors. To check if three vectors are independent, we can do that by c1v1 + c2v2 + c3v3 = 0, where c1,c2,c3 are constants and they all should be 0 for linear independence. There's another method. If the determinant is non zero, then the vectors are linearly independent and if the determinant is zero, the vectors are linearly dependent. Can we think of the determinant as the volume of the parallelepiped and if the vectors are linearly dependent, then they don't form a 3D shape but instead a 2d one(assuming the other two are independent), and hence the volume is zero. If the determinant is non zero, then there is some volume and the vectors are linearly independent and form a 3D shape.
Also does it matter if it is b-a or a-b for that specific equation
What is the standardbasis for the vectorspace of 2x2 matrices?
Isnt it just the unity matrix
Is this correct to represent the line to pass through these two vector points
,rotate
Also is this how you would write the parametric equation
please don't write t's like that
fix your t's then we'll talk.
Watching a vid atm on independent/dependent vectors. To check if three vectors are independent, we can do that by c1v1 + c2v2 + c3v3 = 0, where c1,c2,c3 are constants and they all should be 0 for linear independence. There's another method. If the determinant is non zero, then the vectors are linearly independent and if the determinant is zero, the vectors are linearly dependent. Can we think of the determinant as the volume of the parallelepiped and if the vectors are linearly dependent, then they don't form a 3D shape but instead a 2d one(assuming the other two are independent), and hence the volume is zero. If the determinant is non zero, then there is some volume and the vectors are linearly independent and form a 3D shape.
,rotate
it's not a rule of math, it's just good practice for your ts to look different than +s. It
Okay also did I get the parametric equation right
uh I dont know what the original problem was
but as to your determinant question yes. If a parallelotope is of dimension less than the space it's in, it has 0 volume
Sorry I had to write the equation of the line that went through those vectors but with parametric equations
I don't understand what you did
you wrote + instead of - then
I added the negated version
bad practice
you haven't fixed your t's.
it's unclear to the reader what you did
Ok ok fine
Take a chill pill ann
it took me weeks to get into the habit of making ts that way when I decided it was a good idea to do so, Ann
if it's a habit, it's hard to break
it's worth breaking, but it can be difficult
Okay
so you have a system of parametric equations. Let's say you didn't have internet access. How would you check your equations?
without asking us
you see if your line goes through your two points you started with
Well my graph isn’t exact tho
gfauxpas:
is there a t that gives you v?
you can plug it in but here it's easy enough you should be able to do it in yoyur head
T=0
that's w, yes
t = 1 gets the other one
yes
Oh so if there is some t to get one vector and some t for another, it is true?
I don't want to say a blanket statement for all lin alg problems
in this particular kind of problem, it is the right way to check it
because the question says
the line has to go through those 2 points
and if there are ts that make the line go through those points, well, then the line goes through those 2 points
Hmm
Makes sense
But the reason why I checked here was because
I tried an online one and I gave me a different equations for them
It was like a solver
because parameterizations aren't unique
Oh
the parameterization can change the speed and direction your point traverses the graph of the curve
I say curve not line because in calculus the same thing comes up
paramaterizations are not unique
How do parametric equations even work like I just learned how to put them into the x= and y= form
It didn’t really go into deph
they make a function describe each coordinate of points of a graph, essentially
a graph in 3d is a set of point (x,y,z) and if you assign a function to each coordinate x(t), y(t), z(t) that's a system of parametric equations
I'm glossing over some details
🙂
So it kind of divides the x and y coordinates into two separate equations
in a sense
So if you can plug in a value for t so that it gets both sets of points, then those points are on that line
or in general a curve
Thank you so much
there's a caveat that the functions you choose have to be strictly monotonic but I'm not sure you know what that means
No
basically the functions you choose have to keep going along the graph only once, not changing direction, not doubling in on itself, not stopping and then continuing
np
if a matrix is in (reduced) row echelon form, and we transpose it, will it give us the (reduced) column echelon form?
yes
and what information does that give about the basis of a subspace of R^n spanned by the rows/columns of A?
Could someone help me visualize the span of 2 R3 vectors and why they would make a plane
Can you visualise vector addition?
Mhm
You can just take two pens and point them randomly them in the air
Ok
And then visualise the pens scaling up and down
And the plane formed by the addition of these two "vectors"
What do you mean?
Don’t all the vectors cross the origin?
We often don't really care about the absolute position of a vector
But rather it's relative direction and magnitude
Oh
Ohhh
I thought of a better way to visualize everything
Imagine each additional one as a control knob
So aV would just make a line
Then av+bw would move that line to make a plane
Then you move the plane around with another vector
The third vector you get from adding the the two vectors
Traces out the points of the plane
Mhm
And as you vary your coefficients, you get a different vector
Until you trace out all the points of your plane
Like if you can imagine one scalar controlling a vector to create a line
Yeah
If you imagine the vector as a pen again
The tip of the pen traces out a point on your line
And as you extend or shrink the pen
You trace out more points
And you can visualise that it traces out a line
So the red lines would be two arbitrary vectors that have been scaled
And the points inside the blue lines will be all the possible vectors produced by the additions?
You can visualise it like that sure
Is it accurate?
Yeah
2 linearly independent vectors in R2 will span R2
What do you mean?
If they are linearly independent
It will span all of R3
Which I guess can be considered a solid?
Sir I have another problem
I can’t exactly visualize four dimensions
How should I consider spans in higher dimensions
Linear dependence and stuff
Ok
Like we stated
Two linearly independent vectors span a plane right?
And in the case of R2, all of R2
Take e.g. [1, 0] and [0, 1]
I think it's pretty clear to see that
a[1, 0] + b[0, 1]
Can equal all possible [x , y] depending on what we pick for a and b
Can anyone point me in the right direction on how to solve this problem? I know I need to find the orthogonal line that goes from point A thru the line L (90 degrees at L intersection), but I'm not sure how to do it.
And once I find the line I should be able to find the length pretty easily.
Do you know how to calculate projections?
Ah, that's probably what I was missing. I remember doing it in lecture but I'm not sure how
iirc I should decompose A into pieces with 1 parallel to L and one orthogonal
Something of that type yes
Basically pick some random point on L
Find the vector joining it to A
This gives you the hypotenuse of the right triangle you want to form
Use projections to form the rest of the triangle
Thank you
How do I prove that a vector space doesn't have a finite basis?
show that for any finite set of vectors, there's some vector that cant be written as a linear combination
but say I'm given the vector space of all continuous real functions
ok
I'm thinking, I show that it's not finite dimensional
so thus its infinite dimensional, and as such doesn't have a finite basis
its obvious that the continuous functions in R doesn't have finite basis, so isn't finite dimensional
idk how to formally show this though
do it exactly like I said
show that for any finite set of vectors, there's some vector that cant be written as a linear combination
@nimble egret so I picked the point (7,6,5) and found that the vector joining L and A is (-6,-8,8). Now how do I find the projections? Do I find the angles between using the joining vector and L / A?
Then with the angles I use trig to find lengths, which I can use to find the exact point?
You don't need angles
Well actually hmm
My approach would have been to find projection side and use Pythagorean theorem
But angles might work as well, right angle trig anyway
@sonic osprey so you're saying I must show that there is a vector that can't be written as a linear combination (span) of a finite set of vectors?
Ok I'll try it out, ty
@sonic osprey so there is a real valued continuous function that can't be represented by the span of a finite set of real valued continuous functions?
yes
so could I say that since R is uncountably infinite, there is a polynomial function (hence, continuous) that is nx^y, but for any linear combination of (x^y, 2x^y, ... , mx^y) I can always set n = /sum(1,m) +1
and since nx^y is a vector in the real-valued continuous functions that can't be represented by the span of finite number of real-valued continous functions, the vector space doesn't have a finite basis
@sonic osprey how does that look?
bad
because you've only shownthat nx^y can't be written as a linear combination for this specific basis
like I said
you need to show that for any finite set of vectors, there's some vector that cant be written as a linear combination
but just showing that nx^y can't be written as a linear comb. shows that it is not finite dimensional
and thus doesnt have a finite basis
no thats just wrong
Because youve only shown it cant be written as a linear combination of (x^y, 2x^y, ... , mx^y)
right, idk how to generalize it to show that for any finite set of vectors, there's some vector that cant be written as a linear combination
how would you start to prove it? I'm stuck
Your idea will work, just not in the way you've stated it
the other way to think about this is to find an infinite set of continuous functons are linearly independent
ok so the set of polynomial functions {x^0, x^1, x^2,..., x^n} where n is uncountably infinite
the sum of these can only equal zero if all coefficients are zero
so linearly independent
yeah that works t
what does this show?
this shows that there's a set of infinite vectors that are all linearly independent
And its a fact that if you have some set of vectors that are linearly independent, then the dimension of vector space is at least as large as that set
ohhh right
but isn't that only for finite dimensional vector spaces?
@sonic osprey I have this lemma in my notes that is exactly what you are saying
but it has the qualification that V is a finite dimensional (f.d.) vector space
Ok, I found a vector (p) which is the correct length of the orthogonal one, but now how do I get the point at which this vector comes out of L to hit A?
Sorry for the messy handwriting
I know the correct point is (5,4,3), but I can't figure out how to get there
Draw it
Yea, I've been using an online graphic thing to visualize everything
nvm, got it
(-4, -6, 10) is the vector relative to point A, so if I do A - (-4,-6,10) I get (5,4,3) 🙂
-4 in x direction, -6 in y direction, 10 in z direction from point A
Guys
If we have a linear combination of three indépendant vectors in R4, what is the span?
... a 3-dimensional subspace (?)
@real plaza anything specific you don't understand? The idea is that the row operations (switching equations, adding an equation to another, and scaling equations) doesn't change the solutions.
There is another interpretation in which each elementary row operation has a corresponding matrix which applies that operation. Does that ring a bell?
Well the left sides and right sides are equal in each equation
its just adding something on both sides. If y = x and a = b then y + a = x + b
They are taking the equation y = x and replacing it with another (true) equation y + a = x + b
If a = b
so, one key idea is that you still have the other equation, a = b
So you go from
y = x
a = b
to
x + a = y + b
a = b
and the statement y = x is still there, since you can "undo" it by replacing row 1 by row2 - row1.
and not every operation has this property. Namely, if you were to instead replace row 1 by 0 times row1, then you lose that information that was there before.
nope, but there are examples of operations that will give you "extra values." Namely, if i take a row and replace it by another row:
y = x
a = b becomes
y = x
y = x
Then instead of finding x1 x2 x3 that satisfy y = x and a =b, they now only have to satisfy y = x, a weaker constraint.
The key idea is really invertibility. At any step along the way during elimination, you can undo what you have done to get the original information. Similarly, if you start with the solutions, you can find the original system by doing the row operations that solved it, in reverse.
surprise 
and you keep 7=7 because you need that information to see that 5=5. Thats the whole idea here
linear algebra provides a good framework for what is going on. When matrices are introduced, you'll see that a system can be represented by a matrix A and a vector b (where b is the column of right hand sides) in the equation Ax = b.
Any elementary row operation has a corresponding invertible elementary matrix.
So the question is: if you have some elementary row operation matrix E, does the equation Ax = b have the same solutions as the equation EAx = Eb, the system you get by applying the transformation to both sides?
Kind of, you have to be careful not to take something for granted: not all matrices are invertible.
And it turns out, since that operation is invertible, you multiply both sides by the inverse of E: E^-1
E^-1 E Ax = E^-1 E b
=> Ax = b
doing Ax = Eb and not EAx = Eb would be more like a mechanical error in the elimination process. If you have worked with gaussian elimination on matrices, it would be like performing the row operation on the left matrix and forgetting to do the same on the augmented part.
or like saying y = x implies a*y = x
But unlike the algebra we're used to, there are nonzero matrices "X" such that you can have
XA = XB but not A = B for matrices A and B i.e. cancellation doesn't work in general. delicate point
!15m
I tried using definiteness to prove the condition but im not sure if that's all that needs to be showed?
Don’t worry too much about it. I just dumped a ton of information on you lol. In short, solving a system is like solving a normal linear equation ax=b, except we have to be more careful about how we go about it.
“Learning about matrices” isn’t exactly that straightforward since to understand what they are, u should really understand what a vector space is.
Soon enough tho (probably before introducing vector spaces) you’ll shift from using linear equations to describe systems to using matrices. The conversion between a system and its matrix representation is pretty simple
I taught myself what I know using mostly a book called “linear algebra done wrong” by Sergei Treil. It’s a pretty theoretical book, but it doesn’t outright avoid determinant and matrices like Axlers “linear algebra done right”. I agree that it can be daunting. I think that its not a bad idea to use multiple resources, except that differing terminology and ordering of topics can possibly make things confoosing.
treil is the best intro to lin alg book imo
the only problem w/ treil is how he deals with dimension, but yeah treil is better than that
That’s not surprising. There is a lot of debate about “where to start” and how to teach it when it comes to linear algebra in particular. What’s weird about Treil’s dimension?
he mentions dimension late in the book and he doesn't do super rigorous stuff with it
late being not first chapter
your book feels like a book about linear algebra for like engineers
which tbf is most intro lin alg books
I am taking what is supposed to be a theoretical math major LA course this semester and my first homework is basically putting matrices in RREF lul
lmao
I doubt it will. I think everyone has to go through the process of reducing matrices... at least once... I guess....
we started off in first year with LADR
because the goal isn't to teach linear algebra, but to teach how linear algebra can be used in computation
Started off rough
ladr is an eh book
Wow lucky tho
i think so
im skipping chapter 10 though
No. LADR is just really... different
ladw has a really nice construction of the determinant
because most books kinda just say this is the thing, here's the formula, done
yes
We did the first 5 chapters of LADR+matrix stuff in 4 months
and we're currently on inner products
treil does a great job of motivating linear algebra (again outside of dimension) and giving the actual math of it
ladw will be in a different order
probs ch.1/ch.2 flipped
could be the same after that
yeah but make sure you understand all of it
Random question, but how does axler get the eigenvalues of a matrix without determinant?
Ur good
he does the determinant
Yea it’s been a while tho
he just does it badly
it is
3b1b is very good
i'd reccomend it
just remember all his videos deal exclusively in R^n
ladw will deal with more abstract vector spaces
over more abstract fields
yes but like
what about C^n, or function spaces
or polynomial space
R^n is a vector with n coordinates of real numbers
In an engineering course, not much time is taken on a vector space. You see what makes a subspace, and move on. The course is largely based on solving systems of equations, computations on matricies, using the determinant to solve problems.
i.e. big bad
still computation, you probably don't even mention characteristic polynomials
Btw C^n is a list of n complex numbers.
Much like R^n is a list of n real numbers
We do mention characteristic polys, and use them to get the eigenvectors and values. We use these for diagonalization. We don't mention Cayley-Hamilton, or use diagonalization for anything
ok, i guess that's more than i thought
That's the upper end. Basic change of basis, but no mention of an orthonormal basis. No finding them
No using diagonalizations for anything D:
oof
cayley-hamilton is a really nice result
that feels reasonable to teach too
C is just better R
When you start considering the topology of these spaces, C is always better than R
fundamental theorem of algebra
The solution to equations has nothing to do with topology
i was typing that while kaynex was typing the topology thing
You get a vector multiplication that works pretty well on C
Lol forget I mentioned it. I didn't have any good examples on the mind.
i mean yes
There are no topological properties that C has that R doesn't that makes C algebraically closed and R not
terrible sentence but
Sure, but it's hard to say that this is the reason that C is algebraically closed
There are plenty of spaces that contain R that have such a subset that are not algebraically closed
I think we got two conversations mixed up here
So it's hard to say that this a topological property inherent to the algebraic closure of R
I mentioned that C^n has better topological properties but am likely talking shit because it may not I didn't think through my stuff there
Yeah, I was trying to say that it's not topological properties that C has that makes it nicer
It's algebraic closure, which is not really a topological property
Especially if we're considering vector spaces because we're pretty locked down
bottom line, C is better R
Better is ambiguous but sure
i mean i agree that's mostly a meme statement
We never focused on recognizing vector spaces. We didn't talk about what a linear transformation does to a vector space. A basic talk about linear independence and dimension but we're not tested on it and don't see it in the nullspace/column space
never heard of it
oh mit ocw
it's probs fine then
i think it's applied tho
it's hard to find a good rigorous linear algebra class
Is this any close to being correct?
you didn't include units
and why did you multiply V with s^2?
cool
is that actually right though?
👍🏾
yes
Look at that, didn't even have to use calculus
wait til you do vector calc in kinematics 
thank you for the help
you're welcome
could you say that N is a subset of N?
it's not wrong is it?
N is here all natural numbers
What's the definition of the subset relation?
any set is a subset of itself @pulsar turret
Suppose A and B are sets. Then, what does $A \subset B$ mean?
Abhijeet Vats:
ok thx
Oof nice lol
@cursive narwhal A is a subset of B
Yea but what does that say about the elements of A?
all the element in A are also in B
So if we're asking ourselves if $A \subset A$, you're saying that all the elements of A are in A
Abhijeet Vats:
That's a tautology
yeah
So, since it's always true, every set is going to be a subset of itself.
This has nothing to do with sets of numbers, by the way. This is really just something in the context of set theory
yeah, I was just wondering if there was a rule that says you can't do it or something, you know like deviding by zero
thanks for the help
Sure
what does this represent. vector v = bigsum(ti wi) for i=1 to k.