#linear-algebra
2 messages · Page 45 of 1
what do you mean, "never left a matrix in that form"
i'm asking you to take the inverse of a matrix
are you not able to do that
i am
then what's the fucking issue
are you still somehow under the impression that since D is called D it has to somehow be diagonal even though in this case it very clearly ISN'T
no
i was thinking D had to be inversed to get this matrix D^-1 that i gave there in the pic, so why are we now inversing that matrix to get D ?
D^-1 is known and we want D.
Inverse of an inverse is the original matrix
$D = (D^{-1})^{-1}$
Ann:
Think about what an inverse is
u and v are unit vector and the angle between them are pi/3
what is (3u-4v) ∙ (u+5v)?
anyone mind to show me how solve this problem? the correct answer is suppose to be -23/2
use dot product properties to rewrite that expression
do you by any chance mean this one (au + bv) · w = (au) · w + (bv) · w?
in this case is w = (3u-4v)?
that looks useful
this looks poorly written. what even is u^2
(3u-4v) ∙ (u+5) = 3uu - 4vu + 3u5v -4v5v
·, not *
$3u\cdot u-4v\cdot u+3u\cdot 5v-4v\cdot 5v$
RokettoJanpu:
no prob
is it OK to create a vector space from the span of a line?
or reformulate to "vector space spanned by the direction vector of a line"
i know the conditions
A span is always a vector space, yes
so if I know a line goes through origin, "let a vector space be spanned by a line L that goes through the origin"
cuz idk if "direction vector of line" is proper
thoughts?
You span vectors, not spaces
so you can't span a line? ok i'll say "vector space spanned by the direction vector of the line L"
A line that goes through the origin is a vector space
Sure
In that all of the vectors going through that line form the space
a direction vector of the line
thx bois for clearing it up
Not by definition, you'll need to test some axioms on it, or find another clever way. I like the span idea
Like take (1,2) in R². The span of that is a vector space, which is also a line.
(-2,-4) is in the space

if i have a line y = 3x
and i want a basis vector, that spans the line
solve for each variable in terms of just one variable gives me
(x, 3x ) ---> basis is (1,3)
so span of (1,3) represents the line
but what if the line is y= 3x + 2
does that 2 have an effect on the basis?
That's not a vector space at all
So you can't describe it with the same tools that you could with other vector spaces
One might call that an affine space. You could simply take out the 2, then add it back in after vector space stuff
the reason i asked this question was cuz
i was given a plane, something like 3(x-2) + (y+1) + (z-5) = 2
so its not set equal to 0, but 2.
and i wanted to find a basis for the plane
am i going to run into the same problem as above?
ok so on that first problem with the line equation. if i get the vector (1,3) as the basis.
and you say add the 2 now.
does that mean( span of (1,3) ) + (0 , 2) ?
Yeah something like that
I want to prove -v + v = 0 (where 0 represents the 0 vector). Is this proof correct: -v + v = v + -v (comm law of add) = 0 (add inverse law).
sure
thanks!
my next proof differs from the book's, is this one valid too? prove 0 + 0 = 0 (where 0 is the 0 vector). my proof: 0 + 0 = (v+-v) + (v+-v) [add inverse law] = v + v + -v + -v [comm law of add] = 2v + -2v = 0 (add inverse law)
you overthought that one a bit
you didn't need to introduce any new vector at all
0 + 0 = 0 follows directly from the definition of additive identity
oh snap!
v + 0 = v for all v, and in particular for v=0
you're right, thanks for that insight. is my proof still valid even if overcomplicated?
I suppose lol. You drop the brackets, so it may be worth stating associativity
Dumb question i've been practicing the row reduction algorithm and i'm not sure if this is right
$$
A = \left[\begin{array}{ccc|c}{0} & {1} & {-4} & {2} \ {0} & {0} & {1} & {-5} \ {1} & {-3} & {5} & {4}\end{array}\right]
$$
$$rref(A) = \left[\begin{array}{ccc|c}{1} & {0} & {7} & {8} \ {0} & {1} & {-4} & {2} \ {0} & {0} & {0} & {1}\end{array}\right]$$
Zophike1:
For the row operations I took $-5R_{2} + R_{1} \rightarrow R_{3}$ then did $3R_{2} + R_{1} \rightarrow R_{1}$
Zophike1:
then finally did $R_{3}/16 \rightarrow R_{3}$
Zophike1:
Is what I did right because the calculator i'm using is showing me something different
it doesnt look right
i think u shud have a pivot/leading 1 in each column
from what im seeing doing the work
Then what should it be then for the rref(a) ?
the first thing i did was:
swap row 1 and 3. (this puts a lead 1 in column 1)
then swap row 2 and 3 (puts a lead 1 in columns 2 and 3)
ok so its in echelon form. that there tells you its nonsingular. and it can be row reduced with leading 1's and then 0;s in the other spots of each column (sorry idk how to say that last part)
im not a tutor btw
ahhh okay I put in Echelon form then ?
so next step id do is
4*R3 + R2
this means add to row 2, 4 times row 3
shud look like this after u do it
1 - 3 5 | 4
0 1 0 | -25
0 0 1 | -5
we did that step to get a zero in row 2, column 3
does this step make sense?
Should I do that step after A is in echoloan form ?
you do not have to solve A to echelon form, but sure its a very good guideline to try to follow
you basically end up solving echelon form in the process
and then yes do it after
Because now looking at it I think I put in echelon form
my echelon form matrix is :
1 - 3 5 | 4
0 1 -4 | -5
0 0 1 |-5
just check u got that when for yours
this is to r2
so take 4times r3 and add it to r2
the notation i wrote for my step there
is how my book and professor do it
4R3 + R2
I got it thanks 🙂
I've just been having trouble with this algorithm and applying iteffectively
is there a functional difference between rank and the dimension of a column space?
nvm
'''rank(A) = dim(row(A))'''
and since dim(row(A)) == dim(col(A))
then by transitivity it must be true
just saw it in my book
if a man can swim across a river in 10 minutes or (1/6 hours) and if the current flows at 4km per hour in the opposite direction, is it true that by multiplying 4(1/6) will get the resultant vector
Do you learn jordan canonical form in a first semester linear algebra class or an upper level class?
@wintry steppe iii is true right off the bat
wait hol up nvm
it is fals
as the only way that would be true is if it were v that was there instead of u as the thing which u was "orthagonal" to in the statement
as v and w form a basis for a plane which is itself orthagonal to u
the sum of two orthagonal vectors will be orthagonal to neither of them
false qed
the way to test these is to write out the vectors as something like w = <w1, w2, w3> etc. and then see the results
that would be an easy way to prove or disprove (i) for instance
rewrite all vectors as components sub 1,2,3 as outlined above, then compute the dot and cross products. compare.
for (i) at least
then you will be able to discern whether or not it is correct
got it tysmm
let S be the set of vectors given by (i)
for any real scalar c and any element X picked out from S, determine if cX is also an element of S using the condition that all elements in S must satisfy
if yes, S is closed under scalar multiplication. if no, S isn't
oo okay
so the only one which would be under the scalar multiplication would just be (i) right @gray dust ?
didn't check. just here to post tips
why wouldn't ii be?
well before guessing why should i be or not be closed under scalar multiplication
if one of these sets fails closure under scalar multiplication then you should be able to present a counterexample
(0,0) is not in (i)
that alone already disqualifies it
bc 0 times literally anything is (0,0)
ohhim stupiddd
Can anyone advise me as to how begin solving this?
https://i.imgur.com/l5DvIfN.png
what am i looking at
the operation AP - PB = 0
where P is an unknown matrix, and A and B are known?
prove similarity
prove similarity ok
solving that ungodly complicated system is definitely not the way to go
consider instead finding the eigenvalues of A and B
if A and B have the same eigenvalues, with the same multiplicity, and (if necessary) the same JNFs, then they're similar
Oh, umm I missed part of the question actually. It wasn't just proving but proving by finding P and P inverse
Ann:
so then you're gonna have $R^{-1}QAQ^{-1}R = B$
Ann:
$P = R^{-1}Q$
Ann:
Ohh I see,
https://i.imgur.com/DKxlX2N.png
I am stuck, I cannot bridge the gap from what I figured out - about connecting similarity to eigenvalues and determinants - to calculating P. I am not sure what is going on in your first equation either, I haven't seen that form before with the whole A D B thing.
do there exist scalars $c_1$ and $c_2$ such that $c_1v_1+c_2v_2=(-2,0,-1)?$
RokettoJanpu:
row reduce v_1 and v_2
then you can easily try scalars
to see which satisfy
@wintry steppe
@wintry steppe
u have two accounts
specifically b and c
So, say I have a matrix norm for a matrix Ax where A is PSD
because you can spectrally décompose A into QWQT, where W is the diagonal of all of A’s eigenvalues, the norm would just become Wx, right?
Since The norm is unitarily invariant?
Q. AX = 0 where A is an n x n matrix and X != 0, prove that det(A) = 0.
Can i prove this with a contrapositive?
AX = 0
AA^-1X = 0
IX = 0
X = 0
QED
is my proof done there if its a contrapositive?
i'd rather call this a proof by contradiction
oh alright ty
"assume det(A) != 0 and hence that A is invertible, then we have <your work>, contradiction, therefore det(A) = 0"
Hi,
How to compute the square of a matrix and vector product.
I have a matrix M (mxm) and a vector n (m x 1), and the product is defined as
$M ; n$
beepbopbot:
beepbopbot:
The answer is $n^T , M^T , M , n$
beepbopbot:
How to get here?
Ann:
do you have any context for this
Okay I will elobarate
I have $\theta(x + \delta x) = \theta(x) + \nabla \theta(x) \delta x + O(\delta x)$
beepbopbot:
beepbopbot:
I am computing $|\theta(x + \delta x) - \theta(x)|^2$
beepbopbot:
So in that expression, I get $(\nabla \theta \delta x)^2$
beepbopbot:
??
Proof of Proposition 2.2.1
Can somebody elaborate on how we get that system of equations
Not sure how those three equations come from the orthogonality of the rows
Are these notes good? http://joshua.smcvt.edu/linearalgebra/
They seem pretty solid to me so far
@daring solstice i use https://dec41.user.srcf.net/notes/ this set of notes myself
it really has everything for first 1-2 years of uni math
I have a question pertaining to diagonalizing a matrix. How do I know which one I set to lambda 1 and lambda 2?
it doesn't matter
as long as you don't mess up in pairing up eigenvalues with eigenvectors
Okay, so the eigenvalue obviously has to pair up with their respective eigenvector
easy enough
can anyone help me find a matrix for the reflextion across the line y=2x?
the matrix corresponding to a reflection about the line $y=\tan(\theta)x$ is $\\\begin{pmatrix}\cos(2\theta)&\sin(2\theta)\\sin(2\theta)&-\cos(2\theta)\end{pmatrix}$
RokettoJanpu:
thanks
i dont really get why the slope becomes tan(theta)
tan(theta) = y/x is that why?
$\tan(\theta)=2\implies \theta=\arctan(2)$. Is there a way to evaluate $\cos(2\arctan(2))$ without a calculator?
xyz:
@wintry steppe a more rudimentary method to do it would be, imagine any random point x,y
reflect it across the y=2x axis and express the new coordinates in term of x, y
find the matrix since you have M X= X'
then solve for M?
you could try a double angle identity but i doubt you'd get too far without resorting to calculator
$M\begin{bmatrix}-2\1\end{bmatrix}=\begin{bmatrix}2\-1\end{bmatrix}$
xyz:
should i just memorize this formula
for a test maybe, but it's always nice to know how to derive it
hmm okay
The graph shows how many kronor one day one had to pay for English pounds at a currency exchange office. Draw the function that shows how the number of kronor (y) depends on the number of pounds (x).
don't know how to do this, anyone willing to help me out?
@wintry steppe whats the whole question?
@wintry steppe yup solve for M
so basically you say, the perpendicular distance of (x,y) from y=2x is a certain distance d,
this lets you know the position of (x', y') after reflection
and you just do MX=X' and sort of intuitively guess at a solution to M
How do I do this
@silent dune
Have you tried to expand the brackets?
Not sure how to do that
Like multiply it out I'm assuming but like I know order matters so I'm still not really sure how to
X(A + B) = XA + XB
For example
Note it's not AX, it's XA
You can't flip order, like you said
How do I deal with the ^-1
Mhm, I've skipped it for now but yea
protip @silent dune @half ice (A-I)=A(I- A^{-1})
How do we know that
Hm
if two linear transformations are invertible, then their composition is invertible right?
because $g^{-1}\circ f^{-1}=(f\circ g)^{-1}$ right?
xyz:
yh
How would I prove that A(A-I)^-1 is A then?
cause im assuming the (I-A^-1) needs the A infront to = I
mike0x81:
mike0x81:
@silent dune
@silent dune
Let X = (A - I)'
(A - I)X = I
AX - X = I
AX = I + X
So A(A - I)' = I + (A - I)'
Oop that's not a useful result. Sorry for the ping
lol all good anything helps its the last question I gotta do now
they already showed you how to do it above
namely this:
A(A-I)^{-1}(I-A^{-1}) = A(A-I)^{-1}(A-I)A^{-1} = I
it is equal to I - A^{-1}
If I'm given 3 vectors and told to calculate the volume of the parellelpiped, can I use gaussian elimination to simplify them or does that not work
A question is asking true or false, if the det=-3 then the volume of the parrallelepiped is 3
use dot product
Yes you did lol
Assuming my assumption works I am able to prove that it is true
Oh good point
Let A, B, C be any three vectors in $R^{3}$ space then the volume of parellepiped = <(A x B), C>
mike0x81:
Yes that is the case
yes, determinant is the volume of a parallelepiped
@north sierra does it satisfy subspace test?
Can I row reduce
you can derive that using the properties of the determinant
namely that it is bilinear
The question isn't asking if H is a subspace (though you'd have to assume this) don't go with the subspace test
Instead, what are the properties of a basis?
Sounds interesting
I'm going to go and try and prove the determinant thing then, ty
Linearly independent, good. It also has to span the set that it is a basis of.
Luckily, they show you that v1 and v2 DO span H
you just need the properties of the determinant:
- swap two rows -> determinant becomes negative of what it was before
- multiply a row by a scalar -> determinant multiplies by scalar
yeah since those two are met, isn't a basis? for some reason my book says it's not a basis
why not?
how do i do that?
Oh lol fair
no
2v1 + v2 = [2,1,0]
So [2,1,0] is in Span(v1, v2)
oh
But obviously this isn't in H, so Span(v1, v2) has things that aren't in H
They are
H is the set of vectors sv1 + sv2
Span(v1,v2) is the set of vectors av1 + bv2
These are not the same set, and therein lies the problem
And Poros did notice this, in that H is a one-dimensional space
So it can't have two basis vectors
You may not know about dimension yet but it's useful
yeah i dont know about dimensions yet
assume this is a matrix
could we say this is a basis of R^3 because there are three pivots in the rows (so it spans R^3) and it is linearly independent ?
It shouldn't be a matrix lol
If you do turn it into a matrix and row reduce, you'll find all three are pivots
So yes it's a basis for R³
but i could still make it into one if i wanted to row reduce right? though i really dont have to in this case
i dont really have to row reduce tho
the pivots are shown
its in ref
so could i say what i said earlier about the three pivots in the row?
i mean three row pivots
cause number of pivots in rows = span right
Yes it's a basis for R³
Number of pivots is the number of vectors that are linearly independent
So you've proven all are independent
Np. Feel free to ask if there's anything else
I have a question
Sure
about diagonalization of a symmetric matrix using orthonormal matrix
It seems to matter what order I put in the eigenvectors before I calculate the orthonormal matrix
how do I know which vector is x1 and which is x3
*x2 not x3
The ordering only seems to matter in this case
It shouldn't? I believe you'll just mix up the rows
Let me check to be sure
hmm
I do get that as I asked earlier today and the person said it doesn't matter which of course is true
but I'm diagonalizing for a symmetric matrix using orthonormal matrix
and to check if they are orthogonal I multiply the orthonormal matrix by itself
and when i do the multiplication on either configuration, the answer is different
If you look at the first paper I multiplied the orthonormal matrix and got an answer different from the bottom orthonormal matrix, which was correct
Nevermind I didn't do the transpose when I multiplied (QQ^T)
@half ice
hi
what if we have a question where we have a 4x4 matrix
and all the columns are lineraly independent
and it asks us to check for basis for R^3
would there still be basis for R^3?
Any basis for R³ will have 3 vectors in it
Since you have 4 lin ind vectors, there's a problem
can we pick any three vectors and make a new set?
@north sierra
It also doesn't help that the vectors are each in R⁴
if A is a 2x4 matrix And E=A*C^T -B^T is a 2x5 matrix then what is the order of B and C
what have you tried
@solar terrace it's been 80 minutes and you've either neglected or refused to provide any feedback
@dusky epoch I just saw your comment, I'm not sure what your question entails, I think I solved it im just wondering if anyone else comes to the same answer
my question entails sending me your attempt and pointing out exactly where you got stuck
if applicable
can someone help me verify how many distinct solutions
we get
i got 8
cuz u just get |det(P)|=|det(Q)|=|det(R)|
and you get 2 equations from each equality
so 2^3 =8 solutions ideally
i did all of that, but im not sure whether anything has gone wrong
i got the following exercise: Find the polar form and sketch the following complex numbers in the complex plane
a) for example is 3-3i
what am i supposed to do? i cant remember that we've gone through this in class
@mint sentinel polar form is basically r cis(theta) or r e^{i theta}
r is the magnitude i.e. √(a^2 + b^2)
while theta is tan(theta)=b/a
okay thanks
yami:
ok how do i show this
What are you confused about?
im not even sure if i understand the problem honestly
Well okay, what don't you understand?
ok so V and W are just some random vector spaces with arbitrary many v and w elements respectively yes?
yes
what does v' and w' mean

i dont understand the operations tbh, the lambda thingy looks like a scalar
okay i think i have somewhat of a grasp about it now
then how do i go about showing that it results in another R vector space?
what does the M stand for in question 17 and 18?
well, what does something need to satisfy for it to be a R vector space
is that about the 8 axioms
yes
hmm okay so the associativity and commutativity seem trivial
the 0 vector i assume exists because theyre spaces over R?
no
oh
Does this need to be over R? You get a vector space regardless right?
yami:
Is (v + 0, w + 0) the zero vector in V×W?
probably not
Without getting too into it, (0,0) is the zero vector in V×W
Oh wait, that's what you're getting at, isn't it?
(v,w) + (0,0) = (v,w)
Which shows that (0,0) is the zero vector
that sounds like i just made it up on the spot and cant be right, why is it right
The issue is - is (0,0) a member of V×W?
You can construct (0,0) by using the zero vector in each set
V and W have a zero vector because they are vector spaces.
The tensor product has a zero as well, by combining their zeroes
right
V and W have a zero vector because they are vector spaces.
this kind of opened my eyes
Oh? Well that's good I'm glad. Why?
because instead of looking at them as vector spaces and thus having a zero vector by definition i kept trying to look at R
A hint, you will likely need "because U and V are vector spaces" for 99% of this
and how somehow because theyre over R they would have a zero vector
sigh
i can make the same argument for the inverse element no?
Yup. U and V have an inverse for every element, U×V does as well
Just saying [Insert number] axiom or [Insert number] theorem is almost always useless, you can number the axioms however
right
Compatibility of scalar multiplication with field multiplication
talking abt this one
so what im thinking is
,tex $ \lambda \cdot \mu(v,w) = (\lambda\mu v, \lambda\mu w) = \lambda (\mu v, \mu w) = (\lambda\mu) \cdot (u, v)$
are lambda and mu scalars?
i think theyre supposed to be elements of R
since V, W are vector spaces over R
the concern that i have is that it doesnt show anything does it
yami:
I am having trouble understanding what these two questions are asking for
Could anyone explain to me what they want me to do?
Do you know how to show something is a vector space?
Closed under scalar multiplication and addition and that the 0 vector is in it?
No there's more
Yes
So what part a is asking for is to show that for any v, z, w in V, where V is a subset of C, that it is also a vector space over R?
V is a subset of C?
no
Oh
Anyone good with images and curves
Verify that $U=\left{(x-3y,2x+4y,3x+y)\right}$ is a subspace of $R^3$
xyz:
how can i do this using image?
how do i do i even do this using the definition?
because i dont have an equals sign so i cant see if its also in the set after addition
nvm i figured it out
True or false, the inverse of an invertible upper triangular matrix must be a lower triangular matrix.
I went with false
it's actually true
what is geometric multiplicity
i don't get it
and algebraic multiplicity
what do those mean intuitively
@paper egret matrix A has an eigenvalue L. algebraic multiplicity of L is how many times L shows up as a root in A's charpoly. geometric multiplicity of L is the dimension of the eigenspace corresponding to L
idk what you consider special about this stuff
if alg mult of L > geo mult of L, L is called "defective" and there's some slightly interesting phenomena when that happens
oh
The normal basis is {1,t,t²}
Nvm, let's go a different way. If that vector can be expressed in B, then it's in the span of B. That means:
a(1 + t) + b(1 + t²) + c(t + t²) = 6 + 3t - t²
For some a,b,c
So find a,b,c
idk how to
Simplify. Collect like terms.
Two polynomials are equal iff the coefficients on each term 1,t,t²,t³,... are equal
So you should be able to get 3.equations in 3 unknowns that aren't expressed interms of 1,t,t²
so i row reduced the top matrix into the bottom one
and for some reason when i plug in the values from the augemented column into the original equation, I don't get 1,1
why is that?
What are the values?
That's what I'm saying lol
what do you mean
What are you plugging in?
5 and -2
Into what?
Looks like you're plugging in (5, -2, 1)
yeah
Why 1?
So you can set that to anything and it won't change the result?
So your augmented matrix is
1 0 -5 | 5
0 1 1 | -2
yeah
Note this is actually a system of equations
ye
If the vector we're plugging in is (x, y, z) then this reads:
x - 5z = 5
y + z = -2
It definitely does not say
x = 5
y = -2
im still confused
so when i plug 5 into x
and -2 into y
into the original equation
i only work with the first two vectors?
and not the last one?
so since there's no z i dont include that?
What are you trying to do
Okay
What do you mean into x and y
i dont get 1 on either of the equations
doesn't 5 correspond x and -2 correspond to y?
No?
Not sure what you mean by correspond
If the vector we're plugging in is (x, y, z) then this reads:
x - 5z = 5
y + z = -2
It definitely does not say
x = 5
y = -2
i dont know what that means ^
This has a free variable, the solution isnt going to be a single 3-tuple
every time i checked my answer, i always did what i did and got the answer but for some reason its not working now
Why are you plugging in x = 5, y = -2?
im so shocked lol
i always thought thats how you check your answer
ive been doing it since september
I don't think you're clear in what youre trying to do when you reduce that augmented matrix
Youre not going to find a triple of numbers that solves it
You know that before you start
If your matrix were
1 0 | 5
0 1 | -2
Then that reads x = 5, y = -2
lol
But it isn't, and it reads very differently
Because it's 2 eqns 3 unknowns
Here you are probably going to find a whole line of solutions
Before row reduction that should be your guess
so whats the way to go about this ? when you have 2 eqns and 3 unknown?
yeah my goal is to find 2 solutions to 1,1
Think solving for the nullspace
👍
Now to emphasize the solution is a line
Write x3 as a variable, like t or s
And then the line of solutions is parameterized by that variable
t is a good replacement
Hey everyone, I have a question that is probably really simple to answer.
You don't have to but you should
is there a reason?
true
Define the unit square as the collection of points in R^2 with vertices (0,0), (0,1), (1,0), and (1,1).
Would this just be, R^2={(0,0), (0,1), (1,0), (1,1)} ?
It traces out a line
Np, feel free to ask if you have anything else
@obsidian rapids
It's any point (a,b) where 0 ≤ a,b ≤ 1
So what I put would be fine then. Thanks.
Yeah the copy paste definitely got that wrong
This reads
"R² is the set that contains (0,0), (0,1), (1,0) and (1,1)."
What do you want to say?
This is the question I was answering
You only want to sketch it
Is there any easier way to do this than trial and error?
anyone help me out here? Haven't been able to find info on this topic.
how have u started
really unsure how to even start with this one
it says u want "transformation matrix", so we must start off with ..?
I get that 0,0 needs map to 0,0 and the corresponding unit square coordinates but unsure what to do with that.
do you have matrices?
No I was just given the vertices
How many vectors do you need to define a parallelogram?
4
Really?
How many arrows
2? This is all still very new to me.
Yes. The sides will be u, v, u+v, u-v
So.you only need two vectors
See what i mean?
yeah I see. You get everything you need from 2
4 worked fine for me
They want us to find the matrix based on the usual rectangular coordinates
right
You just need to find the one on the x axis and y axis
And those will be the first and second column of your matrix
Draw a picture
I think that's the easiest way. You have a better way nox?
[2 1]
4 3
pretend the brackets extend down
yeah that works. Is there some sort of equation in the background for this? I'd like to know how this works.
not everything needs an "equation"
stack all the points for unit square in one matrix, and stack the given points in another matrix, then figure out how to do elementary row ops to get from one to the other
The "show your work" mentality always has me thinking i'm skipping steps I need to show.
i mean
The idea is that to define a linear transformation all you need to know is how it acts on the basis vectors
"here's a construction i pulled out of my ass and here's why it works"
is a perfectly valid way of showing your work
like showing your work is good and i'm all for that. but sometimes you just gotta make that leap of faith and pull something out of thin air.
So you need to.think
How does this function act on (0,1) and (1,0)
Linear transformations always map 0 to 0 so considering that won't help
right
You could consider (1,1) but you dont need to because (1,1)=(1,0)+(0,1)
Notice also that (2,4)+(1,3)=(3,7)
How does this function act on (0,1) and (1,0)
i mean that's the basic idea behind matrices in the first place
that you can specify a linear transformation completely only by saying what it does to the vectors in a basis
and everything else just follows by linearity
and you never run into ambiguity due to the definition of "basis"
so, knowing we are going to have 0,0 with a transformation. We also know that, (0,1) = A*[2/4] and that (1,0) = A*[1/3] which gives us our matrix. not one third, 1 over 3 in the matrix that I can't do on discord
formatting
why
you can use matlab-style notation for writing matrices in plaintext
separating rows by ; and entries within a row by ,
like this:
\verb+[1, 2, 3; 4, 5, 6; 7, 8, 9]+ for $\begin{bmatrix} 1 & 2 & 3 \ 4 & 5 & 6 \ 7 & 8 & 9 \end{bmatrix}$
Ann:
Did my logic make any sense there?
What does slash verb do?
It's a very good strategy, usually, to find your basis, and find what it maps to. The matrix is immediate if you can do that
and to do that you just need the vertices that correspond to the unit square points of (0,1) and (1,0) right?
the symbol immediately after the verb is the delimiter, and everything between it and the next occurrence of it is rendered in monospace font verbatim as typed
Ya ya
i'm just at a loss on how to explain this homework style haha
"It suffices to find how the operator acts on the basis { (1,0),(0,1)}"
Also called the standard basis
Well one of the students asked for help on it and this is what the instructor said, which makes it seem like he want's more.
And then explain how you found T(1,0) and T(0,1)
There's more than one way to skin a cat
What your prof mentioned will work, but it will merely find the same matrix that you've already got
gotcha
Our method works in general. If you know what a transformation does to a basis, then you know what it does to everything
I actually came because I have a question about a transformation
Im supposed to describe this transformation geometrically but tbh Im not sure what it does. We are given the forms for rotations and reflections but this doesnt seem to follow either of them, so Im trying to figure out what it does
Acceptable?
Similar idea, what does it do to the basis?
op format mess ups haha, fixed those
T(1,0) = (1,1)
T(0,1) = (1,1)
so does it just squish everything onto the line y = x? is there any better geometric description?
That's pretty much all it does
The basis gives you a pretty good idea of how the squish happens
You can see the matrix isn't full rank, the output loses dimensionality
things like basis, rank, dimensionality are outside of the scope of the course Im taking, I think. I wonder if there is a different way to determine what it does geometrically. I mean, for matrices like
well maybe Im just thinking of it wrong
Try test points? Have a question about where a certain point goes? Throw it in
if a set of vectors is linearly independent then the determinant should be non-zero right?
det of what?
determinant of the matrix of the set of the vectors
sure
okay thanks
oh yeah it has to be nxn right
i.e. as many as the dimension of your space
square
otherwise your matrix isn't square
Im having some issues here
the matrix to represent a rotation counterclockwise by 90 degrees should be:
0 -1
1 0
if Im not mistaken, labeled A, and the matrix to represent a reflection across the y=x line should be:
0 1
1 0
labeled B. And AB then is:
-1 0
0 1
which represents a reflection across the y-axis, but shouldnt rotating by 90 degrees then reflecting across the y = x line result in a reflection across the x-axis?
it seems like maybe A is wrong, that seems like a clockwise rotation? but the book Im reading seems to have that notation
Im just thinking because A[x, y]' = [-y, x], so if the x axis becomes the -y axis, and the y axis becomes the x axis, isnt that a clockwise rotation by 90 degrees?
so if the x axis becomes the -y axis, and the y axis becomes the x axis,
that's the wrong way of thinking about it
yeah, youre probably right
oh yeah I see now, youre right. man this stuff can be confusing sometimes lol. thank you and nice Homestuck profile pic
sure yeah
need a little help with linear subspaces
How do I know that V is a subspace?
should i look at this as a vector
that is in r3?
Sure that's a vector in R3
but why equal to 0 ?
What
x_1 is the first term in x
i know
but why is the whole expression equal to 0?
what would be different if it was equal to 1, for example?
would it still be a subsapce of r3?
so it's a zero-vector?
Also @south sedge do you know what a nullspace/kernel is?
im afraid not :/
Oh okay
So one of the vector space axioms is that the 0 vector has to be in the space
Just check the axioms for a subspace lol
@south sedge btw there's a very easy theorem you can prove that every subspace of R^n is of this form (the solutions of a system of linear equations)
would that help me with intuition? because that is what i feel im lacking
for example
i dont know what this is telling me
so x is in r3 such that the first or second element in the vector must be zero
what do i make of that in terms of subspaces
quick sanity check
$$p_T\left(\lambda \right)=\lambda ^2$$ this is an example of a characteristic polynomial that is NOT split
right?
apples:
What does it mean for a characteristic polynomial to split
it can be written as
$$p_T\left(\lambda \right)=\left(-1\right)^n\left(\lambda -\alpha _1\right)\left(\lambda :-\alpha _2\right)...\left(\lambda ::-\alpha _n\right)$$
apples:
for some alpha_i in the real numbers
@sonic osprey
or whatever your favorite field is
Then no that splits just fine
Hello
Kronecker cappeli theorem tells us if rang(a) = n than there is a single solution
if rang(a) < n then there are infinite solutions
But what if rang(a) > n?
that's impossible
the rank of a matrix literally cannot be larger than its size
you'd have to find more than n linearly independent columns
but by definition you don't even have that many columns in the first place
how can a 3 by 3 matrix have rank 10
so A is clearly nilpotent, and it seems clear the way to approach this problem is to show that there exists a basis B s.t. [A]_BB is the nilpotent matrix on the right
Yeah, think about eigenvectors
0 and any vector in ker(A)
well not 9
0
by definition
so like i could construct a vector as Av !=0 which would be an eigenvector of A
@dusky epoch What if you have a 4 by 3 matrix
its rang can be 4 and n can be 3
but I guess thats not something that shoud happen
no
the rank of a 4 by 3 matrix cannot be 4
the rank of a matrix is at most the smaller of its dimensions
hmm
what's the question
"Prove the equality"
Transposed Vandermonde
no you can do this not too badly
Think about determinant rules
what things can you do to a matrix that doesn't change its determinant
Add rows/columns?
More than that
switch two pairs of rows
more than that
think more
i can add 0 (i.e. a matrix with two same rows or a null row)
fuck fam I don't know
You can add any scalar multiple of a row to any other row
Furthermore, everything you said for rows, can also be done for columns
oh, yeah, that's what I meant by adding rows
forgot the scalar part
Which is probably the most important part of that rule 😅
still can't figure out how I would make this work trying that
That was my first approach
Then I tried expanding along the first row and trying to make some factorizations work / make other determinants but couldn't get closer at all
Can anyone help my for numbers 3-9
I hope you mean expanding along the first column
yeah, yeah, column, fuck me, I've been at this problem for too long and I'm starting to lose my sanity
@sonic osprey please expand on what approach you meant
i have a question for dot product. I don't understand what this formula is for... what is the cos for if you just add the two vectors
@sinful heron you use that formula to find the angle
it's not just adding
oh
theta is the angle between the vectors
@sinful heron so if you’re interested in finding the angle between u and v
and the dot product is a scalar not a vector
okay
so this is used for determining if two vectors are perpendicular to each other right?
if the dot product equals zero
sure
thanks guys
@tranquil trail for 9. you can use the fact that a*a =|a|^2
and separate the parts of the left hand side into two dot products
and the equation immediately follows
ye
kk
You can also get to that without memorizing the formula(though it is easier)
(2i + j + 0z) * (i -2j + 3z)
i read in my textbook that if the dot product is <0 then its obtuse i dont get why that is though
when is cos theta < 0
since you're looking at the smaller angle you'll never get past 180 degrees
But yes
And quad 2 is 90 degrees to 180 degrees i.e. the angle is obtuse
ohhh wow i get it now
or pi/2 to pi if you wish
i see yeah that makes sense
What are you supposed to do? Find a, b, c?
prove the equation
Oh, okay
are you familiar with what rules you have for manipulating determinants?
for instance you can add a row to another row without changing it
