#linear-algebra
2 messages ยท Page 185 of 1
ahhh i still dont know. i am having trouble with the idea of a transformation from polynomials to matrices
can you think of a linear transformation that exists between any two vector spaces always
something simple
usually one of the first examples of linear transformations
hmm ive never heard examples of linear transformations other than the equation T(x)=Ax
so my understanding of a linear transformation is that there is a transformation matrix that take vectors in one space to another. but that is my only understanding of LT
and to answer ur question
no i dont think so
privyet tterra
T(f(x))=f'(x)
QR factorization analogue, but how to get started to prove this?
Hey , so I'm really struggling to put all the random concepts and little theorems into one big picture in Linear Algebra. Like in Calc, most of the concepts build off eacother in a pretty straightforward way. There's even a super easy cheat-sheet for all the easy-to-memorize derivative and integral rules. Does anyone know of a linear algebra cheat sheet that's good ? please for the love of god help
This is referring to diagonalizing/eigendecomp of a square matrix. Is this statement a bit misleading? It's pretty straightforward to see that since A is square and full rank, then A can be decomposed. However, I thought the rank of A has nothing to do it's ability to be diagonalized (rather linearly independent eigenvectors)
Also, I'm lacking the intuition of geometric/algebraic multiplicity and why/when something can't be diagonalized. The one thing I do understand about diagonalization is that for real vector spaces, it can be considered representing a transformation matrix A as a change of the basis spanned by the eigenvectors (..unless I'm wrong). anyone could point me to a source or explain it, I'd be greatful : )
yea iirc rank has nothing to do with diagonalizable but rather all normal matrices are diagonalizable
you are right i think, for all diagonalizable matrices the eigenvalues form a basis of the vector space, so the transformation that is encoded by A can also be represented by Lambda (diagonal) through a change of basis matrix. As for intuition of when something can't be diagonalized, im not so sure...
i dont think you need the vector space to be R^n or anything to do with real numbers though, i could be wrong
@wintry steppe if you know of a good calc cheat sheet, please share
I'm wondering what the difference is between symmetry and commutative operations. This same idea was introduced in matrix addition as A+B = B+A, and was said that matrix addition is commutative.
the difference seems very slight
except that in general, the dot product can be said to be a binary relation over a vector space and its dual space, whereas matrix addition takes matrices from the same space
that's how i understand it, at least. i'm open to be corrected
@wary lily scalar product has different output type and input type
it takes vectors as input but produces numbers as output
From your comments and a little bit of reading I understand that since since the dot product produces a different output type than it takes as input, the binary relation has been described here as opposed to the binary operation in a matrix addition. The corresponding ideas for binary operation and binary relation are called "commutative operation" and "symmetry property".
Thanks
is a change of basis equivalent to a rotation followed by a translation?
A=B is a way of saying there is a bijection from A to B
Ok,iso not just bi
It's abuse of notation
@lavish jewel what if both bases are orthonormal
then it's a rotation and possibly a permutation
though if discribed as a set, the pwrmutation can be ignored
surely with a translation though
as soon as you introduce translations, the operations are no longer linear unless you use a higher dim3nsional space
i know
no
you can look at projective geometries or interpret the matrices as intersections of flats if you like
well yeah im doing computer graphics
aha
so im using homogenous coordinates
right
to do affine transformation matrices
the translation requires an extra dim3nsion to be linear
yea
precisely because it isn't linear in the original dimensional space
homogeneoue coords are used to deal with projective geometries, yeah
projective space 
projective space 
thanks for the help! 
how do i go about solving something like this?
Is there a tidy way to calculate (or at least notate) things like "replace the k-th row of this square matrix with ฮด_ki" or "...with 0s"
I guess this comes up in Cramer's rule but I wondered if there were something more specific for this special case
I guess the latter is "multiply on the left by the diagonal matrix with 1s except a 0 in spot k".
Yeah, so what they're really saying is that if you take the isomorphism from X'' to X, then compose with T to go to U, then use the isomorphism from U to U'', then this composition of three things is exactly equal to T''
It's just a function, there's nothing that weird about it
I guess
you can just write g for one of them and h for the other or something though
Anyone that can give me a 2D matrix where the characteristic equation yields one eigenvalue that corresponds to two eigenvectors?
okay sure the identity matrix
I am confusion at this
by characteristic equation i assume you mean finding the roots of the characteristic polynomial
and by two eigenvectors you mean two linearly independent eigenvectors
Ye
so take the 2x2 identity matrix
Is there a more "random" example? Im trying to remember how they come about in more concrete examples
Or do they always become null
That's wt I dont remember I suppose
Whether the matrix after eigenvalue subtraction always becomes null when the eigenvalue shares two eigenvectors
these should always be non-zero scalar multiples of the identity matrix. in this case, you're diagonalizable with one eigenvalue, i.e. up to a change of basis just D = cI for some c non-zero, and then if you write down M = PDP^{-1} you get M = cI
Lul Ive completely forgotten L.Alg jargon
I'm just trying to explore this case cuz Im taking dynamical systems and in some special cases it is necessary to determine whether the eigenvalue shares one or two eigenvectors
I'm not getting into diagonalization at all
I just need to realize when the eigenvalue shares more than one eigenvector. Practically just figuring out the pattern
Or what made one eigenvalue w/ multiplicity 2 carry or not carry eigenvectors
Ye that's why I asked lol
I never liked linalg
Probably just a teacher problem
But idk, it never charmed me much either. Lots of hidden rules and info
I may be extremely wrong on this but I think the author's last name was Rachel or smth
No, found it
thanks

I have a great one actually do you need it still
its like 5 pages tho
lol
just intuit the entirety of linear algebra
linear algebra is the just fiberwise study of vector bundles Hom(E, F) -> M
just how a manifold is locally euclidean but maybe not globally
a bundle is locally a product but maybe not globally
just "bundle" itself is rather nondescriptive
there are e.g. fibre bundles, vector bundles, principal bundles, ...
a vector bundle over a manifold M is a union of k-dimensional vector spaces over each point of M that "locally looks like the product of an open set of M with R^k"
a shitty example is just M x R^k
a more interesting example is the union of all of M's tangent spaces (the "tangent bundle")
bundles come up literally fucking everywhere in differential geometry
they are unavoidable

they are rather convenient
you can add and tensor product vector bundles over a manifold 


tensor product of vector spaces actually does distribute over direct sum, up to isomorphism
but that's not the issue
you need a lot more structure to say it's an algbra lol
but that's a good observation
maybe the space of vector bundles does have a meaningful algebraic structure

privyet tterra
So I get for parts 1 & 2 you just add any negative u value here , such as -u to get 0+v = 0+w. Then you get v = w. But... like what is the point of the 3rd part here in the pink. I don't understand why you need that part to prove this or what they are trying to prove
?
mirzathecutiepie
Its the closure of addition
In this book lol
But I don't get why they had to suddenly change it to x. Like isn't w and v already any vector in V, why didn't they just say 0 + v = v + 0 = v for any v in V
and they felt like putting x
I guess, just threw me off
I see that you had to state that property now ok
or axiom
just didn't think it was necessary
but it is I guessssssss
if you wanna be anal about it
Oh i see now
They used 2 of the properties
I hate this calss
class
should the matrix of T(x,y,z,w) = (x,y,z,2x+y+z) be {{1,0,0,0},{0,1,0,0},{0,0,1,0},{2,1,1,0}}
Nothing, it makes 100% sense now haha, thank you
what's the point of calling it T
idk if that makes sense
is it just saying we use this to transform something?
ok thx
is using the standard basic vectors to find a transformation simply to break up and look at what each dimension of space is doing?
like
x,y,z
e1 just looks at x right
yeah
I have a hw question that's supposed to use standard basis vectors to find a transformation and I'm not sure how I'm supposed to show the work
like would a dialation of 2 just be {[2,0],[0,2]} * {[1],[0]} for e1
Question: Is the reason we choose u and v to be those specific vectors, because it describes every vector starting from the origin to those points
and because a square is symmetric, if we chose C it would be the same thing
So, like what I'm trying to say is you could have chosen C ( 0, 1 ) and B( 1 , 1 ) if you wanted to prove that too
But you can't choose ( 0 , 0 ) and B ( 1 , 1 ) because it has to start from the origin
Like why did they choose u = [ 1 0 ] and v = [ 1 1 ] when there are other valid vectors
Both of these 'start at the origin'
They chose them because it is simple to do addition with 1 and 0
You can chose k[1 0] and l[1 1], for some really weird numbers k, and l
For example, googolplex k
and some huge number l
you could also have chosen to add the vectors as fractions right?
It results in the same result, yet computationally costs a lot more for no benefit
Yes but fractions are also a pain to add
Like v = [ 1/2 1 ]
But, we need it to add to 2 to be outside of the space
to prove it isn't in V
Note that computationally fractions would be stored in terms of their numerator and denominator
So a number like 1/54354833 is 'small' but to a computer's memory not really
Oh okay
but 1.2 doesn't exist in that square
lol
Although that's assuming you are storing exact fractions. Typically computers store fractions by approximation using powers
no when you add them I meant
you add the vectors to get [2 1 ]
right, but you can't choose a vector thats already not in that space right
you can't just choose v = [ 7 1 ]
ah its okay ahha
right
But yes [0.5 0.5] and [0.7 0.7] are valid choices for showing it is not a subspace
Okay I was just trying to understand why they chose that specifically
You can actually add [1 0] [1 0] even
I was also trying to learn
That's how non subspacy unit squares are lmao
was thinking this too lol
Yeah we mostly deal with finite ones cause we are baby poo poo
yeah that
lol
It's probably possible to define a finite geometric area as a vector space with some clever limits, but not with the usual definitions of + and *
No, don't
Finite dimension and finite size are really important
I dont make the rules
And you should start with good notation now
of the book lol
Finite dimension yes. Finite size, with your euclidean geometry stuff, very noo
like nooooo no
Also i'm a comp sci major , i just tourture myself with a math minor
You should actually like the fact that R^1 is infinite
If every dimension is infinite, aren't higher dimensions just retaliative to perspecive
perspective
oh , I was just thinking of the flatlander expiriment
experiment
Like if you live in a 1D world where the X dimension is infinite
then the 2D plane doesn't matter
to you
lol
even though 2D space is also infinite and will go through the 1D plane
line
my bad
I have no idea what that means, im not talking in LA terms hahahaa
actually pushes up glasses its i and j hat thank you
LOL
I prefer x , y , z
I think the hat stuff is confusing
mirzathecutiepie

Also thanks for helping me with that problem everyone, i'll be back in about 10 min i'm sure
Oh interesting, If its LA i'm no help. Also this is just for studying i'm not doing hw
uhh to me looks like prime notation , all I got lol
Too advanced for me i'm not sure ๐ฆ
I'm so bad with vectors, what R dimension would this be considered then
how does ur book define T? X x U -> F?
since T is bilinear, its dual space should be a cartesian product of X and U, but depending on how your book does it, T could also be written as X x U' -> F
mirzathecutiepie
what is l there
aha
but then your def of T is wrong up there
this takes x and l and gives u a scalar
this is a bilinear form
like
u^t T x = some scalar
wait i'm stupid your def is ok
mhm
is it not? you said T(x) is in u
and l is in u'
and u' takes u to the field?
T' is, yes
you're mixing two things up there
T(x) is in u
T(x)' is in u'
that's fucked up
are you sure lol
i'm almost certain that's the thing lol
yeah lemme get out of bed
aight
just lemme save the other person's soul really quick
those are both in R3, but they aren't asking you about R3
they're asking you about the subspace W of R3
Ah yeah I realized it was cause z had to be 1
kk
thank you tho
aight, now
T: X -> U, yeah?
U is not the base field, but some other vector space
but then T can't be in U'
T isn't in U
Tell me if i'm crazy but, how did this randomly become 0
is it the equation of a plane ur looking at?
ok, you're just testing whether the definition holds
that stuff up there HAS to be 0, otherwise it isn't in the subspace
oh, so they are just like.. every variable here is now 0
the sum specifically in that way is 0
a b and c can be nonzero
@wintry steppe how would T' be in U' if T isn't in U D:
i think the book has been very formal in trying to separate vectors from their dual space, so you can't have a vector "act" on another as if it were a function
Uh, okay ahha. I get that the condition is that a + 2b -c must be = 0. But I don't get how adding those two equations up there becomes 0 unless you just say it does
you already know that a' + 2b' - c' = and that c + 2d - e = 0 because you took two vectors from W
precisely the set of vectors that already satisfy that
you are checking to see if it is closed under sum now
so it has to be 0 by default
for all u and v in W, yes
Makes sense , just a little weird i've never seen that before
if x is an element of X, then.... x is an element of X
Right, the condition being repeated like that seems overkill
like if we said that both those vectors had the same condition already , why do we have to add the conditions to prove it again
you can see this as $W = {x \text{s.t.} x = [a,, b,, c] \text{ and } a + 2b - c = 0}$
also, you know u and v satistfy that, but that's not what you are testing. you are testing if u + v is also in W, which is necessary in order for W to be a subspace bruh
wait i'll need some paper to track all this BS lol
13 15 17 19 23 24
4.4 1 3 4 8 12 13
4.5 1 2 3 12 13 23 24
4.6 8 10 20 28 30 32 44 47
4.7 4 9
4.8 6 7 10 15 23 24 26 29 37 42
4.9 2 7 14 18 34 35 45
dude only this many more practice problems
At about 20 min each ๐
what you wrote so far is right
those equal signs are a bit handwavy now tho
hmm no nvm
sigh the notation is so confusing
it's just asking for (u^t T x)^t^t = (u^t T x), but this gets nasty really quick
yeah
phf ez
let's see. we start with (l', Tx)
that's kinda cursed
looks like abuse of notation
ffs

ok
but
(l,Tx) = l' (Tx), yeah?
i mean, those are two "different" things
what info do you know for sure to be true from the beginning
how do you apply an element of U' to an element of U to get back to the field
ffs l is alread in U'
why no ', wtf
so i was correct in the beginning
sigh
right
line 8 is exactly what i had written before, just the ' was not needed
ok
so (l, Tx) = l(Tx)
which is also equal to T'l(x)
that's (T' o l)(x). hmm
how about
that's definitely doable
there's a very lame way
since (l,Tx) is in the base field
you could work directly in the base field
how about
bleh. have you already concluded that (x', x) = (x'', x')?
i'm afraid i don't know enough formalisms and lack the rigor haha
i think i got it too
mirzathecutiepie
Compile Error! Click the
reaction for more information.
(You may edit your message to recompile.)
aight, have a good one
i think you can get away with no inverse if you do this separately for T and T' btw
yes
so since we know itโs a linear transformation, then T(0)=0 so the zero vector is inside T(U) right
Yes
i just dont rlly get the addition and mult part of the test
Let's say T(x) and T(y) are in T(U),what can you say about T(x)+T(y)?
=T(x + y)
And is T(x+y) in T(U)?
i think so? because they defined it as a subspace
x+y is a element of U
they defined U as a subspace of V
okay, so why does that imply T(x + y) is in T(U)?
right... sorry im confused
okay let's take a step back
in order to show a subset S is a subspace, we need to show:
- S contains the 0 vector [you've already shown this]
- If u, v are in S, then u + v is in S as well
- If u is in S and k is a scalar, then ks is in S as well
in this case, we can substitute in T(U) = S and rephrase these as such:
- T(U) contains the 0 vector
- If T(x), T(y) are in T(U), then T(x) + T(y) is in T(U) as well
- If T(x) is in T(U) and k is a scalar, then kT(x) is in T(U) as well
so for now we want to show T(x) + T(y) is in T(U)
that is to say, we want to show it is the image of some element of U under T
as you previously observed, T(x)+T(y) = T(x+y)
now, is x + y in U?
yes, i think?
right, since U is a subspace, so sums of elements of U are in U
yea
this means that T(x+y) is in T(U)
since it's an image of an element of U (specifically x+y)
so T(x+y) = T(x)+T(y) is, in fact, in T(U)
this proves the closed-under-addition property
now suppose T(x) is in T(U) and k is a scalar
is k * T(x) in T(U)? if so, why?
well since U is subspace, any scalar of an element in U is also in U, so that means T(kU) is in T(U)?
yea just an arbitrary vec
and since k * T(x) = T(kx)
that means that k * T(x) is, in fact, in T(U)
this finishes the proof.
gotcha, thank you
yes, I need it. you can share the calc cheatsheet with me anyway you like. Thanks.
i have another question for #44
i was able to find the basis for kerT which is {t, t^2}
but i dont know how to find โpolynomials p1 and p2 that span kernel of Tโ?
is the basis those polynomials?
but i dont know how to find โpolynomials p1 and p2 that span kernel of Tโ?
you already did
you found a basis for ker(T)
got it
thank yall
trying to keep up with the terminology and theorems in linear algebra
also, for #44, i found a way to get the standard basis for the polynomials into a matrix A. so lets say i found that ColA = [1 1], what does this exactly mean about the range of T?
oh nvm im dumb lol
hey guys can I ask that what the symbol "( )" in (Ax,y) means? Tks in advance
oh this seems unsual for me tks anyway
oh i get it know =)))) i just search it
is the inner product of 2 functions in a hilbert space a dot product?
Yes,
that's the one i meant
you're left with some really nasty infinite sums there
you can of course diagonalize functionals in special conditions, but depending on how much you know about the functional, that's really not the best way of going about it
a nasty infinite sum of integrals, at that, when looking e.g. at square integrable functions
sure, but... oh well
you end up doing a dot product of inner products haha
Is this statement true or false?
by order does it mean it's 5x5?
yes 5*5
if that is all it means, then it's true
how do i prove its true
denote the columns of A as a_i
then you have found a_1 + a_2 + 0a_3 + 0a_4 + a_5 = 0, with coefficients not all 0
then the columns of A are linearly dependent
the rank of A is the number of lin indep columns
ah i c thanks ๐
anyway, as i was saying, to project onto this orthonormal basis that was mentioned you will need inner products
after doing those inner products, you could then do dot products of infinitely long vectors
yes
hmm?
A^T isn't defined otherwise
what
i think both of you are
oh i'm dumb, sorry
i was thinking of the rank
oops
@mortal juniper nullity(A^T) =/= nullity(A)
i'm a dumbass
sry what does =/= means
not equal
oh i c
hmm i don't think so tho, cuz A^T A and A A^T can have different sizes
the qns didnt mention a is always square thou
lemme think if i'm still mixing something up, what's wrong with me today
right, A^T A could be full rank with nullity 0
while A A^T can be rank defficient
for example
i think u meant this
simple example would be taking A = column vector
yep
well, A^T A has the same rank as A and also the same number of columns
so the nullity is the same
imagine A = [1;1;1]
ok
A^T A = 3, A A^T is a matrix of all ones
the first has nullity 0, the latter has nullity 2
nothing, those two have the same rank, but not the same nullity
where
D:
it says they have the same dimensions
dimension != nulity
A is square in your case
but anyway, the nullity of A^T A shoiuld be the same as that of A
they have the same basis for their null space
bruh even my english is bad today, wtf
so if its undefined i cant assume this statement is true right
nullity (A^T A) = nullity (A) always
nullity (A^T) = nullity (A) for square matrices
the first on account of having the same null space basis
your def explicitly says the "matrix" is square tho... i think?
in that case you are right
nullity A^T A = nullity A A^T
well A^T A and A A^T are both square, but of different sizes
How do you show that?
SVD
How do i solve this?
literally
sry if i interrupted
i thought it needs to be orthonormal
that makes things easier, it's not necessary tho. the scaling terms will cancel out
the coordinates in the basis will be different, but they don't want the coord, they want the projection
do you know how to project a vector onto another?
idk what i'm looking at
what are those scalars tho
this right?
i think she meant sqrt (1 square +1 square )
for that 1,0,1
is that what u mean?
ah
you have a small mistake
the scalars should be multiplying the corresponding basis vectors
should be 5/2 (1,0,1) + 1 (0,1,0)
is it 5/ sqrt2?
it is, but the vector projection goes in the "direction" of the vector
direction is given by a unit vector pointing in the same direction as the original
so you'll have 2 of those sqrt(2) multiplied together
like so
(5/2, 1, 5/2) right?
you forgot a sqrt(2) in the denom
ok thanks
just curious which programming software r u using @lavish jewel
looks like matlab or octave
this one was matlab
for really quick toy problems, it's ok. python has too much calling stuff from the parent object to do a quick problem with it haha
especially because it doesn't normally distinguish between row and column vectors, so making that projection matrix up there is annoying
guys just want to ask but when finding column space(for eg. C(A)), why cant we just transpose the matrix, then do rref, technically wouldnt it preserve the column space
what do you mean by "find the column space"
The column space basis is solved by taking a spanning set of vectors and forming matrix A, doing RREF(A), looking at the non-zero columns (linearly independent columns) and then relating that back to the original matrix A. The corresponding columns in the original matrix A form the column basis for A.
transposing changes the column space, though
the column space is the space spanned by the columns
if you transpose the matrix, the new columns are what used to be the rows
the rows may span a different space
an easy example would be the matrix $A = \begin{bmatrix} 1 & 0 & 0 \\ 0&0&1 \\0 &0&0 \end{bmatrix}$
Edd
but wouldnt the columns of A become rows now so technically doing ERO would preserrve the column
and by transposing again at the end
oh, if you transpose again at the end, you can do something like that
but still not quite haha
cuz the nonzero columns of RREF(A^T) indicate which rows to keep
not which columns
you can try with the matrix i wrote above
test it out and see what happens
ok sure i will try with matlab thks man
aight
what does (w)_S mean
the coordinates of w in the basis S?
if so, just put those vectors as rows of a matrix A and take Aw
what's the prob
hey guys given vector row X and Y. The dot product of it should I write XY or XY^T ?
XY^T if they're both rows
ok tks
What was your RREF?
1 0 0 -1
0 1 0 1
0 0 1 1
0 0 0 0
Yea,That works
Let's say (x_1,x_2,x_3,x_4) is a solution
Rewrite x_1,x_2,x_3 in terms of x_4
might be easier to see it on the augmented matrix, but it doesn't really make a difference
yes there is
mhm
and the last one is just 0
is it, though?
sothat means its 1 right
if it helps you, use a parameter. let x_4 = t
ok
now go back to all the other terms and substitute that in
i still see it being 0 now
we just said x_4 = t
yes
t can be anything
so it can be 1 if i want
[t, -t, -t, t] is the vector
ahh i see now
so what's the basis of the solution space
I swear to you we did not learn the bases of a solution space
unless we learned it in terms of different words
spanning set?
so what's the spanning set
[1,-1,-1,t]
No
not quite
is it the set of all linear combinations of [1,-1,-1,t]
the vector is wrong
hmm
i already gave you the vector above
[1,-1,-1,1]
that's a vector
what's the set
(i'm just being annoying now, but it's for completeness' sake)
oh gosh im not sure
{t*[1,-1,-1,1], t in the reals}
i wouldnt of guessed that
the set of all scalar multiples of [1,-1,-1,1], where the scalar is real
that should be the solution
do a quick check that Ax = 0, just to be sure
How would I solve this?
is it something like -3 on the third row of the elementary matrix
recognize what row operation can be done on A to get EA, then perform that row op on the identity matrix
I figured that one out @gray dust
Thanks!
I dont really understand this question
Can anyone explain it to me?
you know A and b are made up of integers
so every entry in the matrix A and the vector b are integers
Yeah
you also know the determinant of A is either 1 or -1
now, if we have the equation Ax = b
it's asking you if the entries of x MUST be integers
or if it's possible for them to not be integers
Question: So , the way they are asking these questions. They don't really care that an actual value plugged into a, b , or a2 could break these equations. But more so that the resulting equation has the same form as the set of all possible polynomials with that specific condition of a2 + a1 = a0
Because I could easily see a way to input 3 different values for a in which this equation would break. Such as all a's = 1. Then 1 + 1 != 1 and that condition would not hold true
what are u asking
Because I could easily see a way to input 3 different values for a in which this equation would break. Such as all a's = 1. Then 1 + 1 != 1 and that condition would not hold true
a_1 = a_2 = a_0 = 1 does not satisfy the condition so we dont care about it
Thats what I was trying to ask lol
what no
lemme write it out
A_1 = 1 A_2 = 1 and A_ 0 = 1 from the above problem . Then if you had a polynomial where the condition is that a2 + a1 = a0 , it would become false because 1 + 1 != 1
But I'm trying to ask is, do we just ignore the fact that you could easily have a polynomial that doesn't satisfy that condition, and only care about the ones that do
does this not tell you that we dont care ab polynomials that dont satisfy the condition

you just wrote that all the a's where 1 so I didn't think you understood what I meant
lol
But why
because thats what you asked 
cause if you say any poly of that form is included in this subset, doesn't that include the ones that don't
It seems contradictory to me
?
It's like saying every apple in this bag of apples is an apple, except the ones that are oranges but ignore those
but... youre assuming that p and q satisfy the given condition
thats
like
the first line of the argument
So we can just say it HAS to satisfy this condition
if i say "Let this thing satisfy condition A"
whenever you use "this thing"
you can assume it satisfies condition A
since thats what my "let" construction did
Just seems weird, I hate how much you just use words in linear algebra to suggest a complex thing like that
this isnt really linear algebra exclusive, its standard mathematical language
i don't really understand the confusion
If i said, for example
So by saying " let it be this" you are saying in reality " extract every possible poly that does NOT satisfy this exact condition and ignore it"
"Let x be a positive number"
and you said "what about x = -5?"
well that doesnt matter
since i let x be a positive number
uh... I think youre overcomplicating this
Like in calc you usually use an integral notation with bounds to show what operation you're doing I mean, In linear algebra you're just like. Yeeeee do this
this is perfectly precise wording
i dont really understand the confusion
i mean certainly in calculus youll use more notation and less words since intro calc has less proofs
typically speaking
but if you approach calculus rigorously you'll use these exact same conventions
look at, say, the epsilon-delta definition of a limit
we
ew
i'll stick to lim thank you
lim n -> my mom

Lol
The problem does make sense though, I just wanted to make sure that's what was happening. you guys confirmed my knowledge thank you!
"Let f be a function defined on a subset of the reals, and let a be a point in f's domain. We say the limit of f(x) as x->a is L if, given any epsilon > 0, there is a delta > 0 such that, for all x in f's domain, if 0 < |x - a| < delta, then |f(x) - L| < epsilon"
I always change that into notation and my teacher didn't care
LOL
well you can change what you wrote into notation as well
it just becomes very clunky
but like
Yeah It does make more sense to write it out, but I prefer symbols , Maybe im just weird
$\forall p(t), q(t) (\exists a_0, a_1, a_2 (p(t) = a_2t^2 + a_1t + a_0 \land a_2 + a_1 = a_0) \land \exists b_0, b_1, b_2 (q(t) = b_2t^2 + b_1t + b_0 \land b_2 + b_1 = b_0)) ...$
Like when I see and integral sign and an equation I'm like oh easy I know what to do, you start writing out the formal definition of it and i'm like .... whats calc again
Namington
then do metamath
metamath is an online project to redevelop mathematics hyper-formally from ZFC set theory
sounds cool
e.g. here's the proof that real-number multiplication distributes over addition http://us.metamath.org/mpeuni/distrsr.html
it cites a few hundred prerequisite results
So you can just say ax-7 without having to write the proof?
axioms are statements that are taken to be true without proof
so the "proof" of ax-7 would be ax-7 itself
sure, in the context of metamath's formal system
i would not recommend doing this in a mathematics class ๐
(well, unless you happen to be working on syntactic foundations)
Dude thats dope, I rather do that sound like coding's version of higher level languages
it's like turning assembly into c
Who needs to know the actual axiom anymore just say ax-7
lol
I'm so glad I didn't go for a math major I'm so bad at math
wanna know a fun fact: Just 2 years ago I was in the lowest level special ed math class in my college ๐ I've come a long way
I have a problem of proving (AB)^T = B^TA^T
I'm wondering if the (i,j)-entry of (AB)^T is a_j1 * b_1i +.....+ a_jn * b_ni
use index notation
Like the reason that span works is just because you can write it as a LC like that
$((AB)^T){ij}=a{jk}b_{ki}$
PROnoob
I'm 90% sure my answer is right, but I saw that it is wrong for some reason online
but then, I found this somewhere which verifies my answer
$a_{jk}b_{ki}$, this means $\sum_k a_{jk}b_{ki}$
PROnoob
So would my assumption seem correct?
yes
hmm
this also says the same thing
whats wrong in this?
I've found this a bit contradicting to what I'm about to put as my answer..
I believe the red triangles signifies that the answer that this individual put is wrong for some reason
Wait I'm stupid
no this is correct
Why did they choose 4 matrices instead of just 2 for S1? Can't you prove is a linear combination with just 2
and you're saying the same thing as well
then the online key is probably wrong?
maybe then
np
thank you again all my answers are correct : D
I don't exactly get some of the math here
how did a1 = 1 , wouldn't it be a1 = 1 - a2
or was that a random value they chose
arbitrary value they chose
@limber sierra Thank you, maybe you can explain better than the book. If we are just choosing a random value like before, then how is this no solutions.
Like literally the only difference I see is the coefficient changed
when you compute the solution you get 0=1
how the poop u get 0 =1
"when you compute the solution,"
I dont know what you mean by that
oh interesting did you happen to save that
like just solving for a1 , a2, a3 you mean
You just do gauss jordan on the augmented matrix
oh god I dont know how to do that
Is this an augmented matrix thing
yes
wait you said that oops
I need to learn this better
So basically, they did this and didn't tell you
they just said " yep no solutions "
lol
moshill1
yes they did the computation
RIP , thank you so much I was so confused
How do you use the texit thing
bot
[ 0 2 1 | 2 ]
[ 1 3 -1 | 3 ]
omg
rip
There we go lol
if there's a dollar sign then it'll try to render it as latex
oops
$$
\left\lbrack
\begin{array}{ccc|c}
0 & 1 & 1 & -1 \
0 & 2 & 1 & 1 \
1 & 3 &-1 & -4
\end{array}
\right\rbrack
$$
young_smasher
oh thanks
uhh
if you want to make a new line then you need 2 backslashes
coding_code_while_goofin
Compile Error! Click the
reaction for more information.
(You may edit your message to recompile.)
$$
\left\lbrack
\begin{array}{ccc|c}
0 & 1 & 1 & 2
0 & 2 & 1 & 2 \
1 & 3 &-1 & 3
\end{array}
\right\rbrack
$$
bruh what
I litearlly copied what you put
you still only have 1 backslash
weird i guess it doesn't show the backslash in the source but it's there
coding_code_while_goofin
Compile Error! Click the
reaction for more information.
(You may edit your message to recompile.)
FUUUUUUUUUUU
I don't have time to learn Latex I had a simple question LOL
I don't think it tagged you , if it did sorry for the double tag @nocturne jewel
thanks
nvm , I see now you just re-ordered it so a1 was always the first entry
can anyone guide me
i ahven't done anything all year and i have a midterm soon what's the most effecient way to learn this to get a decent grade on my first midterm
it's on this stuff
Question: is there a faster way to do Gauss Jordan Elimination than just having to sit there for 30 min trying to do rref
Lol you're screwed bud, I'm learning just that 2nd half for my second test and it's really hard. You definitely cant learn that all in a week, unless you're a genius
well
if geniuses can do it
so can i
i just hvae to figure out what geniuses do
what would be the easiest sections to focus on then?
Geniuses study for months and fundamentally understand concepts, where as goofs goof around all semester and play video games
now you know, lel
some argue that genetics also play a role
so
Ch1 seems learnable but idk about that second one
well i still need help
if there's lectures it's prolly easier
alright
there is
there is so many resources
i also have a midterm review
here i can send it
how can i send a pdf?
idk too much linear honestly but someone else might be able to help
i think you can drag it in
oh there we go
which ones of these do you think i should try and takcle or should ij ust try and learn chapter
1
Dude, if your test is next week just stop and accept that you need to retake the class. Trust me you will have to cheat if it's that soon or make other people do your work. No one here wants to spend 30+ hours being your tutor cause you were too lazy to try
Where did I ask for tutoring?
You should drop your ego dude, I'm just asking for what they would do from ground 0
honestly you should try to get through the whole thing
there are probably some q's that are the same, but theres a fair bit you need to cover
Should I do khan academy lectures at like 2x speed then? I usually watch all my videos at 2x-4x speed (not just for school stuff just in general)
Coding just don't type
My ego? This is worse than coming in here asking for answers to homework questions lol
You are pressed LOL
You don't know anything about improving at stuff or learning
if you think 1-2 chapters of work can be learned in a shor tperiod of time.
I legit learned all my OChem shit and got an A from 3 days
from doing nothing
hmm what's happening here
I'm not against you trying I'm just saying I feel sorry for anyone spending more than 5 min giving you a strategy for the test when you didnt try
This is trying?
Lol, dude you have no idea why I didn't even do any work up until now. You don't even know anything about my work ethic
You're just talking out your ass and making assumptions because you have an ego and you're insecure
I learned 5 chapters of OCHem in 3 days and got an A on the exam grinding 5 hrs a day only
I'm not trying to fight, the first thing you said was I didnt try all semester plz help lol
well you're just falsely quoting me now
please find the part where I said I didn't try
lmfao, youre such a moron i'm just going to block you sorry you haven't contributed shit
and you spelled stuff wrong
theres the direct quite
quote
@toxic meadow @wintry steppe take the argument to dms
if you wanna continue having a friendly off topic discussion, you can do so in the chill channel peeps
you're welcome
I'm just going to block him, because he still falsely quoted me. I never said "I didn't try all semeseter' I said "I didn't do anythin gall semester"
if you cant tell there is a fundamental difference btn. those two sentences you are braindead srry. now im going to block you pce
Sorry for being toxic terra
whatever makes you two stop bickering
Yeah, I blocked him it's all good.
๐
all righty then :) now go and have a lovely day
it is time for linear algebra.
I can't believe people like that are so elitist, he legit thinks you have to be a genius to learn shit quickly... It's just about the hours you put in, and how smart you study. Anyone can do it, you don't have to be intelligent, just shown the right methods.
$\mathrm{Hom}(V,W)\cong V^*\otimes W$
(T*Terra, dqโฑ โง dpแตข)
Yeah, so like what would you guys recommend? I think I'm just going to learn ch.1
hard work = massive procrastination
what about echelon forms
hmm yes, since it lets you find out subspace dimensions
check mark means fundamental concept you should get down, question mark means something i'm not so sure you should spend too much time on
Alright thanks a lot
(this is my personal opinion)
Alright, I'm going to get to grinding now, if I have any specific questions I'll come here.
Usually though I can figure it out there's a lot of resources like khan academy, my teachers lectures, etc.
aight GG
didn't expect linalg chat to get messy

it's been happening now and again
linear algebra just gets people feeling heated ig
same urk
dem vectors
Nah, im chill. I just don't think coming into a server saying you did nothing and need someone to help you is the best approach. In other servers they reject you if you're obviously trying to cheat on a test or not trying
prove that any finitely-generated module over a PID can be decomposed uniquely into a direct sum of cyclic submodules, and use this to derive the jordan canonical form and rational canonical forms
this is linear algebra
right?
ofc
is that pro pic a deep fried beastars image, terra?
,av
i am left with more questions than answers

@wintry steppe your attitude wasn't chill. for future reference please be less condescending to others
Welcome to Life
say something along the lines of "i have never gone into the pre-university channels"
archsys pings me in #competition-math with this pic, modulo rainbow
save it and add rainbow, new pfp
not much more to it
can read my messages however you'd like but I was chill
the SVD uses orthonormal vectors
what you can do is shove an identity matrix between X and Y*, normalize the vectors that yield the corresponding rank 1 matrices, and multiply their norms by the corresponding entry in the identity mat
as for the first image, have you already shown that the frobenius and induced 2-norm have to do with the singular values of the matrix?
What is the polar identity for inner products used for? It feels more of a hassle than a help just by looking at it lol
hello quick question, where does this formula originate from and what is v?
i know that lamda is eigenvalue
it's the definition of v being an eigenvector (with eigenvalue lambda) of the matrix M.
thank you very much
[assuming v nonzero]
how do i find is this function is normalized
can i show u what i have
im stuck
not sure where to go from here
u substituion?
oh i was trying to ask my friend how to isolate that
he said to do u subsitution
so i can get e^ 0 with the dash thingy
mirzathecutiepie
what do u mean by that
i is just a number
as far as i can see yes
mirzathecutiepie
yes that worked, thank you
im so lost
you're missing something though
do u mind if we join voice for a quick second so u can explain to me
you should find the norm based on the inner product so that the integral is real

