#linear-algebra
2 messages Β· Page 68 of 1
I have 2 seconds.
this will take maybe 2 minutes in C++
I see
so then you need to handle all these cases
and get a linear solution
Do I also consider zero till x1?
that won't be affected anyway
neither will the elements after y2
but there are more cases
note that you can have y1 < x1 < y2 < x2
you need to put 4 more if else on this too
This is so complicated, I'll have around 15 cases to cover it all up.
possibly more that I did not immediately see
X2 > X1
Y2 > Y1
π Ikr.
well you can write the general solution
for varying x1, x2 y1, y2
but that is probably not expected at this level
this is very similar to what you ask
this is the general version
but you don't even need sum
The submissions are reviewed by people to ensure the code wasn't copied from somewhere else, is this like a public algorithm that you believe is fine to use or what exactly?
a segment tree is well known
but your course likely expects a stupid solution with case work
And there's no chance you can help me finish these cases? 
Ripz.
I wish you the best of luck π¬
but I would find this hard too
to write such cancerous case work 
Thank you for the help.
Finding the matrix for linear transformation of mirroring in a plane x1 + x2 + x3 = 0, n is the normal vector to the plane. and u is an arbitrary vector. I dont understand the step between blue and red. Why is it the matrix subtraction possible when they are arent the same dimension?
that's just a thic column vector
Anyone got good resources for a geometric understanding of linear algebra other than 3blue1brown, specifically on change of basis and linear transformations
khanacademy?
Iβve been finding that helpful although I find their notation a little simple for the course Iβm doing
is there an algorithm for getting a non zero matrix that multiplies to a matrix with non zero entries to get a zero matrix?
like if we have a matrix
|6 -18|
|-4 12 |
let's called this c
is there an algorithm to find a matrix such that cd = zero matrix?
@hot willow sure, cd = 0 iff the columns of d are in the kernel of c.
kernel?
null space?
Null space of a matrix A is the set of vectors x such that Ax = 0
By the definition of matrix multiplication, if you have a matrix A and a matrix B = [v1, v2] where v1 and v2 are column vectors, the matrix
AB = [A(v1), A(v2)].
So v1, v2 \in Null(A) implies that AB = 0.
Since there is an algorithm to compute the null space, thats pretty much it
so in your example, you could choose $v_1 = (3, 1)$ and $v_2 = (6, 2)$ and check that $$\begin{pmatrix} 6 & -18 \ -4 & 12\end{pmatrix} \begin{pmatrix} 3 & 6 \ 1 & 2\end{pmatrix} = 0 $$
kxrider:
@half ice I think I understand now
the thing about the uninvertability of the matrix
Can one learn linear algebra without calc? Or do I need to learn calc first?
linear algebra is a different subject, and mostly independent
some lecturers might expect you to know basic calculus concepts
like "what a derivative is"
but even then, that's not necessary for the material
just a source of convenient examples
i have this question that confuses me
i have matrix A
and the invertible S matrix
now i know how to get the values of S
but i dont know what D is
am i supposed to know what the values of the diagonal D have?
i meant that i can get S if i know what d is
This looks like an eigenvector/eigenvalue question is it not?
oh
that might be why i dont know it
we haven't gotten through eigenvalues yet
thanks @nimble egret
Would it be fair to assume that if T: ββ΅ β ββ΅ β dim range T β β?
To be clear, I mean a linear mapping T.
Yea
Then yes.
So, it canβt be fractional
Yes.
Epic
In linear algebra, we don't deal with fractional dimension at all.
Cool thanks
Looks good. Looks to be a bit on the applied side and does avoid some of the grittier theory.
Pay special attention to chapter 4, as that's where the powerful stuff is
@real plaza
Did you buy it? I mean you can libgen the 11th edition
I don't know what the 4th edition has haha
Yes, for the love of god don't pay for textbooks
There's a lot there
How are algorithms to solve for determinants designed? Do they recursively solve for the determinants of smaller and smaller matrices until you get to 2x2 ones?
That's one way
But that's slow
Faster is to row reduce until you get an upper triangular matrix
@half ice yes, I think so
Can anyone check for me?
9 times the length means basically the idenity matrix times 9
But then to rotate it pi/2 rads I would put a negative one on the upper right corner and a 1 on the bottom corner correct?
And then the addition of the two matrices would give the new transformation?
Nup. The multiplication
Basically, if you want a matrix A to happen, then the matrix B to happen, you can instead do that with BA
,w matrix multiplication {{0,-1},{1,0}}{{9,0},{0,9}}
Yes.
Alright cool π
And for this one im not too sure
So it reflects over x
and then back pi/2 radians
Same idea. (Rotate clockwise)(Reflects over x1)
So the two matrices im multiplying are:
[0 -1]
[1 0]
and
[1 0]
[0-1]
Im getting something in correct i think
Im getting -1 along the other diagonal
do you know the definition of a linear transformation?
R^n -> R^m
isn't it just one vector space to another vector space
no, linear maps have to satisfy a couple other properties
$f(x+y) =f(x) + f(y)$ and $rf(x) = f(rx)$
Namington:
Yeah I've done that but different notation
for all scalars $r$ from the field ($\bR$) and vectors $x, y$ from the domain ($\bR^n$)
Namington:
that's a theorem, not part of the definition
but sure
that must hold necessarily
ok so usually what our prof did
since $f(0x) = 0f(x) = 0$
Namington:
and ofc 0x = 0
where he would let u = (x1 + x2)
and v = (y1 + y2_
)
so it would be
$f(u+v) =f(u) + f(v)$ and $cf(u) = f(cu)$
PeakThePenny:
sure, same thing
if i let u = x 1 + x2
and v = y1 + y2
we have
$T(u+v) = y1 + y2, (x1+x2)^3
yeah i dont think this is gonna add up
$f(u+v) =f(u) + f(v)$ this won't be satisfied
PeakThePenny:
find a counterexample then
to make it a linear transformation?
PeakThePenny:
yep, that's what i mean by "a counterexample"
and we can verify
clearly u+v = (4, 3) so f(u+v) = (3,64)
while f(u) + f(v) = (2, 27) + (1, 1) = (3, 28)
so this isnt linear
(in general, having exponents should be a big red flag that "it probably isnt linear")
well, i gave the definition above; a linear transformation is a function $f$ such that $f(u+v) = f(u) + f(v)$ and $cf(u) = f(cu)$
Namington:
but intuitively, you can think of a linear transformation as a function that only "stretches" and "scales"
never changing the shape of a plane
(this is the intuitive explanation 3blue1brown gives, for example)
who
alternatively, you can think of it as a "really nicely-behaved function"
in a certain sense
the derivative, for example, is a linear function
and this is incredibly useful
whereas something like exponentiation is not linear
it'd be really handy if we could just say $(a+b)^3 = a^3 + b^3$, but we cant
Namington:
since raising to the power of 3 isnt linear
Inner product of two vectors v & w
(sometimes used to denote the dot product, which is a type of inner product)
yeah thanks for the explanation
So, from reading it,
if v = { 1, 2, 3 } and w = { 1, 0, 0}
then <v, w> = 1x1 + 2x0 + 3x0 = 1?
yep.
That's the standard inner product in R^3
i'm not a pedagogy expert
naively, i'd say "most people but not everyone"
some people have legitimate learning disabilities
but i dont really know anyhting about this
true
so im kinda talking out my ass
if working in complex vector spaces, complex conjugate of inner product
complex conjugate of inner product
right
I don't understand exactly, so from my reading an inner product space has this as a quality, that is
for each v, u, <u, v> = <v, u>
with the line
So what does this look like?
if v = {1, 2, 3}, u = {0, 1, 0}
what's the complex conjugate?
what does <v, u>(with the line) look like?
ah
I think I get it
first off do you know what, if u,v are in C^n, <u,v> expanded looks like?
ah, good observation, I don't
I mean
I assume it works the same way?
(a1 + b1i) (a2 + b2i)?
if v = {a1 + b1i, 0, 0...}
and u is the same with 2
and then normal multiplication to get a number like that
but that is a guess
let's say $x,y$ are in $\bC^2$, and say $x=(x_1,x_2)$ and $y=(y_1,y_2)$
RokettoJanpu:
use the standard inner product on $\bC^2$ to say $\lbr{x,y}=\cjg x_1y_1+\cjg x_2y_2$
RokettoJanpu:
have you learned what complex conjugate is before
a + bi is the conjugate of a - bi?
for real a,b yeah
okay
I don't really understand why with x, y in C^2
we take the conjugate?
I mean, is that just by definition?
this is the defn of standard inner product for a C^n space
right, counter intuitive
So
the conjugate of <x, y> is basically conjugating the entire solution to x1y1 + x2y2 where x1, x2 are conjugates?
let's say $x,y$ are in $\bC^2$, and say $x=(x_1,x_2)$ and $y=(y_1,y_2)$\\use the standard inner product on $\bC^2$ to say $\lbr{x,y}=\cjg x_1y_1+\cjg x_2y_2$\\$\cjg{\lbr{x,y}}=\cjg{\cjg x_1y_1+\cjg x_2y_2}$
RokettoJanpu:
your u,v look too similar. pick other names
If I take the tensor product of a row vector with itself, do I just get another row vector thatβs the square of length of the original?
k yea
thanks, I got it
ππΎ np
let's say $x,y$ are in $\bC^2$, and say $x=(x_1,x_2)$ and $y=(y_1,y_2)$\use the standard inner product on $\bC^2$ to say $\lbr{x,y}=\cjg x_1y_1+\cjg x_2y_2$\$\cjg{\lbr{x,y}}=\cjg{\cjg x_1y_1+\cjg x_2y_2}$
PeakThePenny:
Compile Error! Click the
reaction for details. (You may edit your message)
let's say $x,y$ are in $\bC^2$, and say $x=(x_1,x_2)$ and $y=(y_1,y_2)$
PeakThePenny:
how to get black background?
didnt work
,tex --color black
Your colour scheme has been changed to black
^ this
is it possible to do this?
| 1 - 1 | | 1 | = | 1 | + | -3 |
| 6 -4 | | 3 | | 6 | | -12 |
Ann:
this? @gentle hedge
thanks yeah this
yeah, this is correct
wdym
I mean can I uses first column for that multiplication?
nvm, I made a mistake in calculation
ok I am having problems here. How the calculation was done here?
refer to the square matrix. the product can be computed by 1(first column)+3(second column)
Does this just refer to the group (or set?) of real numbers excluding 0?
$\mathbb{R} - {0}$
WhiteBerry:
set of reals, excluding 0
Thank you
what
Solve the system by using the proper inverse. is that what it says word for word
I translated from greek
System it means matrix i guess
So anyone knows what we have to do?
well i have a hunch that they want you to recognize that this is in fact a linear system in xy, sqrt(y) and yz, and to solve for the values of those things first and then x, y and z themselves
so perhaps you could make a substitution
like u := xy, v := sqrt(y), w := yz
solve the system, which is linear in u, v and w
then go back to x, y and z
Ok thanks
WhiteBerry:
This should be in #groups-rings-fields
Apologies, I'm studying it in my first year of university
the keyword is "symmetric group"
Thank you @limber sierra and @half ice
the symmetric group on 3 objects is the group of all permutations of {1, 2, 3}
so it'll have 3! = 6 elements
yeah
similarly, S_5 will have 5! elements
So it's a group of sets?
It's a group of "actions", per say
"Taking the second element and swapping it with the third" is one of the elements
Its inverse is swapping them back
Right
Okay this goes straight over my head
I'm missing knowledge here
I suppose I need to catch up on mappings?
This one is a bit abstract, I'll admit. The elements of the group aren't actual real objects, but actions on something else
See cycle notation, which is a great way to bring it back into the concrete
it's not "bringing it back" I have missed this entirely xD
I mean that "cycle notation" is good to visualize this
I see
Do you think it's worth studying Mappings first?
I need to study for my finals eventually anyway as I missed it
Cause like, I'm clueless about surjectivity, injectivity and bijectivity
Oh lol yeah those are important
yup x_x
Despite being a mapping itself, Sn is kinda unrelated and has its own thinking. You can know them independently
Oh okay
So do I not need to know those concepts for that question? I've got a test on Friday (other subject) so I don't mind delaying this
You can learn about those three concepts in like an hour and a half on wikipedia
Okay
Idk what's gonna be on your test
No no no, my test is unrelated
Like I said, I don't mind delaying the learning of these concepts due to my test (other subject) on Friday
But hey, if I can understand the required concepts in an hour and a half I'm down.
Khan academy has videos on them in his linear algebra module
It's not linear algebra but that's the first time in many students' education that it becomes super important to define injective/surjective rigorously
Imo it should be taught with algebra ii
Before lin alg many curricula are sloppy in not distinguishing between codomain and image,a function and its graph, a function and its image
Β―\_(γ)_/Β―
can someone help me figure out what this question is asking?
I don't understand what I'm supposed to even be doing for it
Assuming that this is a 2x2 mtx
Taking a vector in the plane and rotating it about the origin theta radians
Is a linear operator
Since it's a linear operator,it has a matrix representation
Find it
Ra is the matrix corresponding to the linear operator "rotate the vector a radians"
Still confused?
π»
yeah i'm trying to do another problem presently so i can deal with that one later
Then why did you ask for help
because I still don't understand so I went to do something else in the work so i can come back to that later
I began an explanation and you didn't understand it immediately from the first 2 or 3 sentences you give up?
Okay
π€¦ββοΈ
not really giving up just thinking about something else
I didn't leave the party, i just decided i wanted to be somewhere not at the party
imo if someone replies to you out of their own time to help you, the least you can do is give them your attention
Yeah I'm trying to look at it and I just don't understand what it is asking at all in any way
was hoping that the problem I pulled from the book would help but it did not
Hi, i have a nice question:
when you want to find the eigenvalues / eigenvectors you always do this:
nxue:
But what happens when you do:
nxue:
and get the values, and then multiply them, you will get the determinant of A
Why does it happen?
For a 2x2 system:
To write An= lambdan n
An - lambda n = 0 vector
(A - lambda I) n = 0 vector
The I come sure to the lambda isn't a vector
Since you could have n = 0 vector as a solution which isn't very helpful
From cramers rule you can get infinite solutions when determinant of
(A - lambda I) = 0
Meaning both lines of the matrix are the same or a multiple of each other
So you can make any solution you want as long as one is a multiple of the other in n Eigen vector
Hopefully this makes sense, this is how I think of it anyway
I don't see how you answered the question stabulo
I've never seen that equation used anywhere, the
det(A-Ξ»I)=Ξ»
@wintry steppe where did you see that expression?
i made it up
I thought he was just proposing because he didn't know where the original came from
So I think I answered it :) 50:50
but I dont understand how why when you multiply all the lambdas we get from the second equation i wrote, we get the original det
You don't get the second one?
Not multipled anything either
If you have 2 equations and 2 unknowns you can make one of the coefficients of one of the unknowns ewu as l and subtext the 2 equations , solving the simultaneous equations, cramers rule is as general method to do it
This method has
In the denominator of cramers rule formula for the matrix you're trying to solve here is the 2x2 matrix is the determinant of A- lambda I
$|A - \lambda I| = \lambda
\text{You get:} \lambda_1 , \lambda_2, \lambda_3 , ... \lambda_n$
nxue:
and then multiply them
Why are you setting the determinant equal to lambda
but I thought to myself, what if we do this: det(A-xI) = x
after you solve this ^
and get x1 x2 ... xn
Well it wouldn't do anything, since it would break the condition of cramers rule
Since it the determinant is non zero
Then cramers rule makes it solvable
With 1 solution
that does not exist
after you get x1 x2 x3 ...
and multiply them, you will get det(A)
One solution always exists for n = 0
ok let me do an example i think it's confusing
I guess I don't know your question
Yeah
it doesnt matter
no idea why the hell u wud do that
i dont try to find eigenvalues
But use ur example
its something weird and different
dont pay attention to eigenvalues, its something different
ill continue:
(3-x)(-1-x) = x
Keep going then
That make det(a - Ix) = x
You legit solve that with quadratic eq for 2x2 matrix and u get det formula lol
multiply those together and you get the determinant of A
(-3)
@fervent spoke
can you explain it again? i dont understand
Determinant of A - 3?
You've just made a random quadratic and solved it as far as I can see
?
Whole point of orig formula is to find lambdas that make that eq = 0
I don't have as clue what is going on
If u set it equal to lambda
Thats basically det(A - Ix) - x = 0
Replace x with lambdas lol
U do that and u get cancer equation to solve roots for
Even for 2x2 it kinda cancer
if you replace x by lambda then what you get?
But u get det(A) after solving for roots
It has to zero or you will get a single solution but to have the eigenvector formula which you have n on both sides so it will just be n = 0 which is why you must strive for infinite solutions which manages determinant of that matrix being zero, the n = 0 vector is not very interesting which is why you want the infinite solutions
I'd you had it equal to lambda not equal to zero I guess, then you will be able to solve the system of equations and have 1 solutions but you always know the n = 0 one will do this
An = lambda n
Either no solutions which can't be since always have n = 0
1 solution which would be the n = 0 trivial one
Or infinite
The determinant gives you the lambda values such that you get infinite solutions
To the best of my knowledge*
Looks very much like linear algebra
yessir
Basis of what?
R+ with addition and multiplication defined as they did
it is, its given as a vector space
like a part of the question is to prove its a linear space
which i did with the 8 axioms
i think the zero vector is 1?
but idk how to find a basis for this
Cool
@wintry steppe
If it's a 1d space then any vector is a basis
Plug into quadratic formula and simplify
Its aids algebra but u get det(A) after it all
whats the zero vector though
Tricky
any vector
what
including the 0 vector π€
We want the solution to x+0=x
0 isnt in R+ though
he just said 1d space
oh ok
π
Solving for the unknown 0 i meant
"0"
With air quotes with your fingers
Let's use e for less confusion
x+e=x, solve for e
What's the equation x+e=x look like with your addition?
"including the 0 vector" oh damn you got me
Any single vector except e spans the space
Indeed, e=1
@fervent spoke
that does not tell you why the solutions of deltas, when multiplying them, gives the determinant
i have another question regarding this
why when you calculate
|A- xI| = x
you get a polynomial where the value without "x" is the det of A
...
Wat
Are you setting it equal to x as some kind of experiment exercise?
i know if you do:
|A- xI| = 0
and get a polynomial it has something with det in it (i dont think its the free value)
@austere cedar
bro im not talking about eigenvalues, leave it alone lol im just messing around with equations
What are your trying to do then?
nxue listen
its like asking why is 2 + 2 = 4
what are you claiming about the equation det(A-xI)=x
^
what do you think this equation does
im giving an example it should clear it cus we got confused here
because it's not obvious to us why this equation is of any interest
^
any more than examining the solution to, for example
Plug that shit in urself
det(A-xI)=5
See how cancer that is
bro be more mature im asking nicely
Quadratic formula is alr cancer bc u have to manipulate it akgebraiically
im just saying
and you're not explaining it either
I'm mind boggled tbh
yes, but i dont want it to be a specific value, im just messing around with this equation and want to see what properties it has
do you agree that det(A-xI)=5 is a wholly uninteresting equation?
/it gives
No property
det(A-xI)=x is just as an uninteresting an equation
why?
no, the burden of proof is on you to prove something is interesting
True
im giving an example tho
by default making up a random equation is not interesting
why 
your equation is just as interesting as det(A-xI)=13
thats not true, because im asking for what values we get that det(A-xI) equals x itself not just a random constant
thats not correct
your equation is just as interesting as det(A-xI)=13
@vast torrent
and I'm asking you, for what values do we get that det(A-xI) equals 13
but it doesnt matter, the question matters
I think this guy is too far gone TFG
TFG?
Too far gone
can we start over please?
Like Alabama republican etc
yes
i will give examples
LMAOOO
Good luck
can I ? or you're too mad at me for asking questions and not understanding your solutions ...
I'm not mad bro
:(
you can try again
thank you bro :)
all im saying is let's take the eigenvalues equation, and change it a little, so we dont =0 but =x (to see for what values the equation det(A-xI) gives the value itself)
when you calculate |A-xI| = x
you will eventually get a polynomial p(x) = x
all im aksing is why the value without x (i forgot whats the name of it, for example: 6x^2 + 4x -5 so -5 is the value without x's) is the determinant of A
that's all lol, im not here to make new rules, im just curious
the constant term it's called
oops
okay so you're asking about the constant term of a polynomial
if p(x) is your polynomial
then p(x) + x^2 - 300x^11 has the same constant term, agree or disagree
yes, but its not the standard poly, it's when you det(A-xI)=x and not =0
yes i agree
yes
so your question can just as well ask
why is p(0) the determinant of A?
because you're asking
why is the constant term of p(x)-x the detemrinant of A?
Still confused
he we wasking why the constant term of the polynomial p(x)-x was the determinant of A
Constant term?
i know that p(0) = det(A)
when you do |A-xI| =0
but when you p(0)-0
you still get the same constant term
Oh like the y intercept of a quadratic
yes
Weird question I guess
it's okay to ask weird questions
nvm π
can i ask another question tho but now it will be more 'serious' because it was in my test
or i filled the questions capacity for the day
you can borrow a question from tomorrow
lol
im going to use that card
i dont study in english, and im totally not sure to translate it, but given a ("multiplication space ????" i hope i translated it well)
f(u,w) = u^t Aw
which of these statements is 100% false:
1)A is symmetric
2) A-I is diagonlizable
3) AA^t is orthogonal
4) trace(A-A^t) =0
Inner product space, thats the term
i dunno whats a quadratic form
it was 2 minutes to hand in the tests so i marked 3
a function of the form f(u,w) = u^t A w
that's a quadratic form Im saying
we call it here "American questions" (Multiple choice lol)
because 100% means 100/100 , 1, so I don't know what "1 false" means
I guess we deserve that
so i made this logic: if there is only 1 solution right (and there is only 1 solution to mark)
if 1 is correct then 4 is correct, so i Xed 1
I dont understand how you can answer that quesiton unless there's a part you didnt translate correctly
we're not told anything about f
so how can we conclude anything at all about A
its inner product space, takes 2 vectors and outputs this :
nxue:
standard inner product space,
<(3 , 6 ,1 ) , (1 , 1,2 )> = 3*1 + 6*1 + 1*2
but this one isnt standard
yes I See what it's asking
the question is not standard inner ...(i keep forgetting the name)
inner product space
lol
which of these statements is 100% false:
1)A is symmetric
2) A-I is diagonlizable
3) AA^t is orthogonal
4) trace(A-A^t) =0
it's confusing because
when they say symmetric, and transpose
do they mean symmetric in this product or symmetric in the usual product
symmetric as A = A^t
it's worded weirdly
ill tell you half the solution i got from someone
if its an inner product then f(u,w) = f(w,u)
(i forgot its R so no adjugated)
so A has to be symmetric
$u^\intercal A w = w^\intercal A u$
gfauxpas:
yes
if A symmetric so A-I is diagonalizable (??? that i dont know)
100% true π
π
let me think about that for a sec
ill tell you why i said "100% false" , b/c in the question they worded it like: which of these statements is necessarily false
(i guess because some of the others can be false sometimes, but not necessarily)
I don't see why that statement should be true
which statement
if A is symmetric then A-I is diagonable
I don't see how A-I is of any relevance to the problem
its just this annoying american question,
such as
A - 2B + AB = I
and 2 is an eigenvalue of B
which of the following is necessarily correct:
a) detA = 0
b) 1 is an eigenvalue of B
c) 1 is an eigenvalue of A
etc..
sorry, multiple choice question
π
ok someone told me that if A is symmetric:
then A-I is symmetric
if its symmetric then its normal if its normal its diagonalizable
the problem is that ive never heard the term "normal matrix"
normal is usually called unitary I think? let me double check theyre the same
no, Im very wrong
normal is strictly weaker than unitary
normal means $AA^\dagger = A^\dagger A$
gfauxpas:
unitary means $AA^\dagger = A^\dagger A = I$
gfauxpas:
what is that dagger?
Is that transpose?
conjugate transpose
@south wadi
It would have to be the case that
[a b] [1] = [3]
[c d] [3] [4]
and
[a b] [1] = [0]
[c d] [1] [2]
Multiply is out, that's four equations with four unknowns
the answer is this
but i dont understand the fking first step
why is T(e_1) = T(e_2)
and like where it says we dudce
why is it pulling 1/2s out of nowhere
it never said T(e_1) = T(e_2)
the matrix corresponding to a linear map T can be fully determined if you know where T sends the standard basis vectors
yo so rokabe
like i legit am losto n the first step
why is e1 the same as e2
and why are they jizzing out 1/2 and 3/2 like where this shit coming from
They're not the same
Perhaps should note the x and y in the first equation is not the same as the x and y in the second equation
We want to rewrite our standard basis vectors as a linear combination of the two vectors given
Each of the vector equations is just a system of 2 equations in 2 variables
Which you can solve however you want
yeah i just dont see the -1/2 constant and 3/2 coming from
no idea
just spawned in
jizzing out 1/2 and 3/2 π
Which gives e_1
So even if you can't get them
You can verify these coefficients work
why do we want the coefficient to be 1 on e1 and 0 on e2
??
I'm looking at e_1 only
If you look the right hand side of the equation
Simplifying gives [1, 0]
Which is e_1
We're writing (1, 0) as a linear combination of (3, 4) and (0, 2)
ok
why (1,0) though
holy fk dude this shit is so confusing
and useless
sorry im back now just had a tantrum right there
honestly im lost in this question
the first 2 were a breeze
So we are writing a linear transformation T
the matrix corresponding to a linear map T can be fully determined if you know where T sends the standard basis vectors (which is to say, what T(e1) & T(e2) are). for a linear map T, we can say T(x)=Ax where we're finding the matrix A. what the previous sentence means is, the columns of A are T(e1) & T(e2) or T(1,0) & T(0,1)
And also recall the transformation is linear
for T(1,3) = (3,4) and T(1,1) = (0,2)
This is why it's useful to write the standard basis vectors as a linear combination of known vectors
To utilise linear properties
so we want e_1 to be (1,0)
and e_2 to be (0,1)
so why are we multiplying -1/2 by the x and 3/2 by the y
no. in R^2, e1 is another name for (1,0)
ok
e1 can be expressed as a linear combo of (1,3) & (1,1), so e1=x(1,3)+y(1,1) for some unknown scalars x,y
ok
if we find what x,y are then we can compute T(e1) by taking T(x(1,3)+y(1,1))
which, because T is linear, is just xT(1,3)+yT(1,1)
ok i think i get it now
if u call a variable "arbitrary" does that mean its an element of real numbers?
e.g. this textbook problem says: Let W be the set of all vectors of the form (some vector with b and c in it) where b and c are arbitrary
if u call a variable "arbitrary" does that mean its an element of real numbers?
no
not in general
well if it only makes sense with b and c as scalars
which it most likely does
then yes
yeah so
b and c are def real numbers
doesn't make sense to consider 'em as anything else
ok thanks
hello. does someone knows why, here, composition is commutative ?
Let E be a K vector space, f an endomorphism, and f^0 = Id_E, f^k = f o f^(k-1)
i think thatβs because of the properties of the linear endomorphism but iβm not sure
f^k is the composition of k copies of f
the commutation of f with its powers boils down to the associativity of composition itself
So row echelon form is where a row's first non-zero number is atleast one column to the right of the previous row right?
Let $T:V \to W$ be a linear transformation. If you want to check if it's surjective, then you just need to show that $T(V) = W$.
Abhijeet Vats:
Is there a rule to row reducing?
yea
What I'm having trouble with is reducing and finding the pivot columns
In this example, the pivot columns are 1, 3 and 4 when reduced
if that confuses u jst focus on making matrix look like this
Yeah that's what I wanted focus on, but not all matrices will look like that
Solve it how u want
so if it doesn't look like that I'm lost
in any case, do you know what operations are "valid" in row reduction?
yes
so try and reduce it best you can
to something similar in "spirit" to that
that is to say
a "pivot variable" is the leftmost variable in a row
you want every "pivot variable" to have all 0s below it
ye that dude explaining better lmfao
might just have to grind out some problems
if u have a 1 in a row there cant be 0s om the left of it
I get it when my professor goes through it, but I don't know if I can do it myself
the box region denotes the "we dont care" section
because its not below any pivots
also, in this case, you dont have to row reduce to 1 exactly
just to have it in this "shape"
since all you care about is the position of the pivots for this problem
doesn't there have to be 0's above and below a pivot variable?
for the purpose of this question? doesnt matter
you only care about where the pivots are
i..e columns 1, 3, 4
yes if you're "fully reducing" you'd have to reduce all the entries directly above the pivots to 0
oh okay
Not sure if I'm phrasing this correctly, but would I eventually reach that answer even if I don't do the optimal row operation?
oh yeah, you dont have to do row reduction totally optimally
just try to make progress every step
in fact, doing it optimally is very hard - computer programmers spend a lot of time thinking about how to efficiently implement row reduction
So for transformation matrices, specifically the rotation one. How would I convert a clockwise to counter clockwise? Like -pi/4 (clockwise) would be 45 degrees in the 4th quadrant. So would the counter clockwise be pi/4?
So for this problem
I see how at each step of the gram schmidts, we can multiple the vector by -1
But I canβt prove that any orthonormal list of vector satisfying that span equality is of this form
Think about how to map each point from the first n to the second
Maybe consider 2 "separate" transformations first - one to deal with italics and one for the size
@vast torrent finite set
Well this is what I meant
So for each vector produced by gram schmidts, I can multiply it by -1
And the final finite collection will still be an orthonormal collection of vectors
So for each vector we have 2 choices
Thus the 2^m in the question
But I canβt prove that any finite sequence of vectors satisfying that equation is of this form
with my life
I was googl8ng things
If {v1,v2,...,vm} is an orthonormal basis
Then for any isometry A
{Av1,Av2,...,Avm} is an orthonormal basis for the same space
So there are infinitely many bases
I made this same mistake
note how it says span{v_1, v_2, ... , v_j}
for all j
so the span of the first number of elements must be the same too
i.e. span(v_1) = span(e_1)
and span(v_1,v_2) = span(e_1,e_2)
etc etc
@vast torrent
Hello
I am having trouble understanding vector spaces
first of all, i don't entirely understand what a vector space is
do you have your definition of a vector space?
a vector space is a mathematical structure where we have some sense of "vector addition" and "scalar multiplication"
a set of vectors from v1 ... to vk
that is not a vector space
oh ok
a vector space is a set of vectors associated with two operators, vector addition and scalar multiplication
addition/multiplication has to follow some "rules" here
in order for them to "resemble" what we want addition and multiplication to look like
do you have a full definition of a vector space? somewhere in your notes/textbook?
yeah, so the definition is given on the second page
the basic gist is, one thing mathematicians like to do is generalize
you mightve seen vector spaces like R^2 and R^3 before
and maybe, say, C^2 or similar
but one natural question to ask is, "is there something special about these spaces? is there a way we can define a general notion that tells us 'what we want' a collection of vectors to look like?"
a vector space is an "algebraic structure", which basically means a set with some additional operations on it
(a set of vectors, in this case)
in theory, those operations can do whatever they want - but we want vector spaces to follow some sensible "rules"
the rules we want vector addition to follow include things like:
a + b = b + a
a+(b+c) = (a+b)+c
there's some element 0 such that a+0 = a
every vector has a "negative" (so we can talk about subtraction) such that a + (-a) = 0
these are fairly sensible things to want from something we'd call "addition", right?
and it's nice because they give us some "rules" that unify vector spaces
they let us easily tell:
a. what is and isn't a vector space
b. what properties we can use when talking about vector spaces in general (rather than just talking about R^2 or C^n or whatever, we can talk about all vector spaces at once - that's powerful! - by just using these rules)
similarly, let s, t be scalars and a, b be vectors; we want scalar multiplication to satisfy:
s(a+b) = sa + sb
(s+t)a = sa + ta
s(ta) = (st)a
there exists some scalar 1 such that 1a = a
again, reasonable things for us to want something we call "scalar multiplication" to satisfy
Vector space more like diet field amirite

one thing to note: we never define vector multiplication here
namington, you're way too nice lol
multiplying vectors isnt generally very useful or well-behaved
alright, so, we have two operations: vector addition and scalar multiplication
but it seems kind of... arbitrary
like we have one set with two operations
but those operations seem pretty unrelated
how can we tie those two operations together?
well, you're probably familiar from elementary algebra with the fact that x(y+z) = xy + xz
right
so that's where s(a+b) = sa + sb and (s+t)a = sa + ta come from
anyway, thats a bit of a long-winded side-tangent
bringing the focus back to your specific question
in teh screenshot
In one you add vectors and in another you add scalars, note that
we want to show that R^2 with this funky addition
@ shahrik
is not a vector space
that means we want to show that it "breaks one of the rules"
to recap, these rules are:
a + b = b + a
a+(b+c) = (a+b)+c
there's some element 0 such that a+0 = a
every vector has a "negative" (so we can talk about subtraction) such that a + (-a) = 0
s(a+b) = sa + sb
(s+t)a = sa + ta
s(ta) = (st)a
there exists some scalar 1 such that 1a = a
also something I didn't mention: whenever you add vectors or multiply vectors by scalars, we expect to get a vector from our vector space back
it wouldnt make sense if, say, $\begin{pmatrix}1\0\end{pmatrix} \oplus \begin{pmatrix}3\6\end{pmatrix} = \text{goldfish}$
Namington:
(we call this "closure")
anyway, focusing on this specific question
what "rule" do you think this would break?
obviously we're only dealing with addition (the + is written in a circle to distinguish it from regular addition), so we only need to look at those rules
that's how addition is defined; what rule do you think it breaks?
dont think about what it "should be", think about what the problem is
the problem is that it wouldnt work for all values of b2
why does this break our "rules for a vector space"?
it wouldnt*
