#linear-algebra
2 messages · Page 43 of 1
what is the LEAST amount of vectors u need in order to create the R^3 space
I like how three people are trying to find the best way to ask the same question now lol
3?
yes, three
lmfao my bad
no, it's not bad lol
the more the merrier
I just find it funny we are all trying to accomplish the same thing
so we need at most 3
any more than three and we know that one of them isn't needed at all
to put it into linear algebra language you have heard before: one of the vectors is a linear combination of the others
you need at least 3 linearly independent people to have a basis for helping solve linalg questions
do you recall the definition of linear independence?
hm
how about you search for that definition first then
right, they are linearly independent if the only coeffs that give you the zero vector is 0
so how about we write out the linearly independent condition for your given vector set
can you do that really quickly on paper for me?
$c_1\begin{bmatrix}1\2\0\end{bmatrix}+c_2\begin{bmatrix}2\5\1\end{bmatrix}+c_3\begin{bmatrix}2\5\1\end{bmatrix}+c_4\begin{bmatrix}1\3\2\end{bmatrix}=\vec{0}$
⚡Amphy⚡:
ok got it
now you can see plainly that there is a non zero combo that will get you zero
but this is a good case, let's formula how you would do this in a general case then
so recall matrix multiplication and it's many different forms
one method of multiplying matrices looks at taking combinations of columns
if I have AB, then I use the coefficients of B to take combos of the rows of A
so if I rewrite the above statement in terms of matric multiplication, I get this
$\begin{bmatrix}1&2&2&1\2&5&5&3\0&1&1&2\end{bmatrix} \begin{bmatrix}c_1\c_2\c_3\c_4\end{bmatrix}=\vec{0}$
⚡Amphy⚡:
now I would preform row reduction on the matrix we see on the left and see if the matrix is invertible or not
(not invertible is what you will find)
I mean you have seen this all before right?
this is getting confusing lol
solving for null space is what we are doing
not this way
I haven't seen many books present the null space in this way either lol, which is why I liked it when I thought of it
start with linear independence and we end up at null space lol
it's just a way of showing where Ax=0 comes from
but you have heard of null space before?
taught about free variables and all?
the vectors that satisfy Ax=0 are in a vector space we call the null space
how about you just take this document and see if it helps at all
need some help with 18
this is the solution but i was wondering why he doesn't take the zero vector into consideration?
shouldn't question 18 be made of 4 vectors
the second row is just a * 0 + b * 0 + c * 0
Do you understand the algebra they used to get that set S?
What's the difference?
I mean you can add d * zero vector and nothing will happen
The zero vector is in there, let a = b = c = 0
Remember a span is always a vector space
it's already going to be in it
true
by setting all coeffs to 0
oh yeah true
This is like saying "x isn't the solution, x + 0 is"
is the image of a matrix the same as its column space?
it seems as it would, since kernel is the same as null space
different words for same things 😠
@native lodge it didn't really help lol I'm sorta confused more now lmao
Can you explain why they're using t=1, like I get the c1 setup but like
I have no clue either. The above is how I would
(2,5,1) = (2,5,1)
(2,5,1) - (2,5,1) = 0
I think they got there the same way I did, but with a lot more arbitrary steps
is it dependent cause there is a free variable
kay
in the sense if there was no free variable there would only be one solution so it would be independent
It's dependent because there's a way to make one of the vectors using a linear combination of the others
For then it would be independent then?
dude
just row reduce
then ull know
if all of the columns are pivot columns than yes
if not then no
so what I said above is right then ye
what did you say above
in the sense if there was no free variable there would only be one solution so it would be independent
ya
think of it this way. If there is a free variable than at least one of the columns is DEPENDANT upon that free variable
Well, you want to find all a,b,c such that
$a\begin{bmatrix}1\3\-1\-2\end{bmatrix}+b\begin{bmatrix}2\5\0\-1\end{bmatrix}+c\begin{bmatrix}1\-1\1\-1\end{bmatrix}=\vec{0}$
Oh

😦
thats what I asked mike lol, also what is that LOL
Kaynex:
Compile Error! Click the
reaction for details. (You may edit your message)
Wat
Well, imagine those are your vectors from your problem
Finding all a,b,c is the same as solving the matrix equation Ax = 0, where x is (a,b,c) and A is:
[1 2 1]
[3 5 -1]
[-1 0 1]
[-2 -1 -1]
There’s a little trick here. You can show they’re linearly independent just by showing the determinant of the block formed by the first three rows is nonzero because dim column space=dim row space.
Even even more simply, if the three 3 by 1 truncations of the columns formed by ignoring the bottom row are linearly independent, the original vectors are.
And the det is nonzero
@silent dune
Can you show an example I'm kinda lost on the wording
So our vectors make a non-square matrix, we can't use the determinant here
I’m truncating the vectors
But, you can row reduce it to solve the system
Take [1,3,-1], [2,5,0], [1,-1,1]
If these are linearly independent, the original vectors are too
ah I see
what is the difference between vector space and subspace
None, really. A subspace is a vector space inside your vector space
A plane is a subspace of R³
The plane and R³ are both vector spaces, but one happens to be contained in the other
I forgot to say that the converse also (almost) holds
If all n by n truncations of an m by n matrix, m>=n, have det 0, then dim col<n.
I have a homework question and was wondering how I would tackle this using Linear Dependence and Independence.
Determine all values of k for which the following set of vectors spans ℝ4. You can select 'always', 'never', 'k = ', or 'k ≠', then specify a value or comma-separated list of values.
Where i'm given 4, 4x1 vectors with one of these vectors having a variable k.
which the following set of vectors spans ℝ4. what are the vectors?
kk
form a matrix
then row reduce
anyone know how i can do this?
wtf
what lol
question is fucked
yeahh lolol
this chapter took me the most time to understand
yeah same
rjcaste:
they arent inverses of each other
one is an inverse of the other
BA = I is the same as A^-1A, which is not the same as A^-1*A^-1
ok yeah
yeah
whats ur question
rjcaste:
rjcaste:
:)
how do i prove subspace for this
using subspace test
textbook didnt teach me shit
i can break that up into 3 vectors?
o shit didnt know that
iight ty
oo ur on the same chapter as me
lol where u from
Ontario canada
r u at york
nope
👀 i can pm u if you really wanna know
ya r u
yep
ye
upon inspection there is no way that can span R^4 lol
it can be subspace though, yes
thought it said span R^4 or not lol
is it because there are only 3 vector columns?
as in span all of it
yeah
R^4 needs a 4x4 matrix that has linearly independent columns in order to span all of R^4
you only have a 4x3
oh right on
it can be a subspace of R^4 though
didnt even cross my mind till u mentioned it
divide by a matrix is not a thing
the proper terminology is multiply by the inverse
important to know that
r u first year @clever cedar
aight peace bro
i dont even know where to begin
would there be a point on each line that is parellel to one another?
are you familiar with orthogonal projection?
No sir we skipped that section
not enough time until midterm he said
i know projection
i understand how to project onto an orthogonal vector
but i only understand that context within a plane
if theres a point on a plane that is orthogonal to a vector
@clever cedar hm i found this: https://math.stackexchange.com/questions/2213165/find-shortest-distance-between-lines-in-3d
oh wow, thanks man
no problem
is there a way to find a linear independent vector from others without using gram schmit
i have the first 3 LI and i need a 4th
in R^4
i have vectors (1,0,1,0), (0,1,0,1), (1,0,2,0)
need a 4th linear indepenedent
i know i can educated guess
but is there like a process i can use
yeah 0,0,0,1
uh
i think
if u set up the first three columns as those
and then the last column as the 0,0,0,1 vector column
then row reduce it to RREF
ull get the first column to become
0,0,0,1
which is known as extending a basis
yeah
that would just be to show that 0,0,0,1 is a LI vector tho
not to actaully find it
i guess i can reduce the first 3 into the first 3 basis vectors of R^4
and then see which one is missing
Can always let it be the general vector (a,b,c,d) and row reduce including that one. You'll get rules a,b,c and d have to follow
There's definitely many choices you can make to find them
if S is a subset of V and they have the same dimension how do i prove S = V
i guess i gotta show they have the same span but idk how to
like rigourosly
yeah sorry
is V findim
oh yeah they specified tha too
hm mmaybe if i say if B is a spanning set of V then it has dim(V) linear independent vectors, and C is a spanning set of S it has to have dim(S) linear independent vectors, so dim(V) = dim(S) means span(B) = span(C)
no that sounds kinda dodgy
ok
heres what i did instead
let B be a linear independent basis of V so V = span(B)
|B| = dim(V)
because B has dimV linear independent vectors
and sicne dim(V) = dim(S) then |B| = dim(S)
and that implies S = span(B) since it was specified that all vectors in B are LI
V = span(B) = S so V = S
hmm how do you know that every vector in the basis of V is a member of S? S is a subspace of V, so this doesn't exactly follow immediately.
@elfin wasp no, this doesn’t work at all
ok
lol
the cardinality of a set of linear independent vectors is equal to the dimension of a vector space
doesnt that mean its a spanning set>?
You’re trying to show a basis of subspace S of dim V spans V
ok how do i do that
This isn’t that easy from scratch. One approach is to go by contradiction and complete the basis (assume S doesn’t span and add some new vectors to the basis so it does span) and then show that all bases of V have the same cardinality
Feel free to ask if you need help with the details
Hey, anyone have any experience with linear hashing?
i dont know the right section to ask this at
hey , in a) to prove that there is a 0 we basically just look at f(1)=0 so there is no need for computations but for the b) what should i do? assume that f(3)=0 and f(1)=0 so f(3)=f(1)?
I don't think you understand part (a) correctly
that might be the case^^
my teacher told me that i need to show that f(x)=0
and since in this case f(1)=0 , it's kinda proven based on my understanding
i know that there is also the addition and multiplication part to prove but i'm not doing that rn
that there is a zero vector? and that if i add a vector called x with the zero vector it will give me the vector x
okay so how do you add vectors in this vector space
that's my problem right now , i know most of the rules and i'm fine with proving that something is a subspace as long as it's not a function but with functions i have no clue how to proceed
i just said that thing earlier because my teacher tried to explain it to me but it looks like i misunderstood her
You should go figure out how addition of functions is defined
and scalar multiplication of vectors
you mean like f(x)+g(x) and a * f(x) ?
@sage mantle
In this space, the vectors are functions, and the scalars are constants. f(x) + g(x) is adding two vectors, af(x) is a scalar multiplication
You'd have to go through your subspace test, which has three rules in it
so for the first rule , we need to prove that f(x)=0 right?
and since f(1)=0 , then it's proven?
f is a vector that belongs to V.
f is a vector that also belongs the subspace W, if f(1) = 0
For the first rule, we want to prove that f(x) = 0 is one of the vectors in W.
@proven magnet.
Yes, but there are ways to relate det(A) to a row reduced version.
I see thanks
@half ice convert it to a "similar matrix" A=QSQ^(-1) where S is a basis in the same space
is there a fast way?
fuck it, cofactor expansion it is then
I personally like to do this for 3×3 matrices
You can add row 2 onto row 3 to reduce a cofactor expansion by one step
I can't wait to finish this spectral theory part
how do i get RREF based on column relations
A is a 4x5 matrix
col 1 2 and 3 are LI
col1 + col2 + col4 = 0
2col2 - col3 + col5 = 0
The simplest set of columns that are LI are columns of the identity matrix, and if we must create an RREF matrix based on the given info, those are the columns we must use anyways
From there, you can see what the other two columns must be based on the given linear combo relationships
ohh ye i was kinda confused cuz i wasnt sure if i could assume the collums could be reduced to 1, 0 0 0 0 etc
but u always can do that its only the rows u cant assume that
can someone explain why that n and r work
is n = 9 cause its transpose of C, and must be like that to multiply by b?
first what's the size of C^T?
9xr
yes, so n must be 9 so that C^T can right-multiply with B or AB
have you figured out r?
ye it doesn't matter, I was just confused if you could change the order when multiplying it would matter then
matrices are associative under multiplication
thanks
no prob 
I have one online assignment question on skew lines but it was never covered in class or the chapters we've in the book. Which section of the book could it possibility be in?
Are you guys taking the same class or something?
What book are you using specifically
thx
ohh im asking for the rank
@half ice
the 2nd part
the rank is usually the rows with the pivot
but how do I found out how many pivots this has
RREF?
You can't find the number of pivots without A. However, you do know A's nullspace
how do I know a's nullspace
if I have its nullspace
ill have its rank too
3-nullspace
cuz 5x3
You're right, if you have one you'll have the other. They add to 3
I should be saying "nullity" not "nullspace"
but how do I know its nullity
nullity is the free var columns
ohhhh
theres 2 free var colums in this right
the S one and the T one
so the first one
is a pivot
right
@half ice
The nullity is 2, yeah. So, rank is 1!
How do I show AB-BA=I has no solution
Oh wait
The previous question makes it trivial
ok
Additivity of trace plus Tr(AB)=Tr(BA) finishes
yeah
How do I prove that if two homogeneous systems of linear equations in 2 variables have the same solution set, then they are equivalent in the sense that each equation from each system is a linear combination of the equations from the other system
<@&286206848099549185>
So given a solution set say X, belong to R^2, then any two homogenous systems a_i*x + b_i*y = 0 which have the solution set X can be transformed into each other through row operations
now the solution set itself can be either 0, or a 1-d subspace, or the whole of R^2
now you need to check each of the three cases individually
Ok
you have proved that it's bounded, I think. that's equivalent to proving it's continuous for linear operators
t.f.a.e for linear operator: bounded, continuous, continous at zero
ok
would it be as simply as just stating that L:C([-3,3]) -> is bounded and hence continuous
you should say "since L is linear, L being bounded implies L is continuous", and then prove it's bounded
and then do what you did
Heya
A question
if I have a eigenvalue that is a complex number and a corresponding eigenvector
why is the conjugate of the eigenvalue an eigenvalue
and why is the eigenvector associated with it also the conjugate of the eigenvector?
and why are conjugates so important anyways
is your matrix real
if so, then its charpoly is also real, and with those, complex roots come in conjugate pairs
It asked me to convince myself
so I tried
and I don't know how to approach it
And I think its real?
oh
yes A is a real matrix it says that up there
hey I am having a little problem with figuring out where to go next with this
that is what i have so far
Quick question:
Do:
(P index 0)
v = vector
--->
P0P = tv
mean
(x1, y1, y1) = t(x2, y2, y2)
a diagonalizable operator A : V → V has exactly n = dim V eigenvalues (counting multiplicities).
counting algebraic multiplicities? so (ƛ - 6)^2, eigen value "6" appears twice in the diagonal matrix D?
<@&286206848099549185>
your wording is scattershot
i mean the last question
those were other q's
the last one 3.1.16
asked
i mean 3.1.14
Let A be an r×r matrix and suppose there are r−1 rows (columns) such that all rows
(columns) are linear combinations of these r−1 rows (columns). Show det (A) = 0.
for a square matrix A, det(A)=0 <-> the set of A's columns is linearly dependent
i mean only one has to be linearly dependant not all of them
SETS of vectors are referred to as LI or LD. not individual vectors
right, semantics arent my concern at this moment
although i will study them more as per ur note
im just wondering if my proof of linear dependence here is acceptanble
in the context of determinants
there are a couple people here who will be harsher on you for improper wording
im being unclear
i won't double check the work but if you show det(A)=0 then the set of A's columns are LD. or if you know the cols are already LD then you can expect det(A)=0
the wording pertains to other questions not related
i shoulv'de taken a better picture
the question im concerned with is where i created the matrix beside 3.1.14
but regardless thank you
where? you just added two cols to make the third col
yeah
that was my demonstrative matrix
to show that if a column in a matrix is LD on other columns
than det = 0
the set of the columns is LD
- The n column vectors of A are linearly independent
regardless ur avoiding my question and being pedantic on some wording, so thanks anyway lol
it's not pedantry. precise wording is important in math and especially so in linear algebra where imprecision can be fatal
@clever cedar to answer your original question, your "proof" doesn't really capture why its the case that singular matrices have zero determinant, and as soon as you write down a matrix, you are losing generality. You have to use the linearity of the determinant and its invariance under row/column replacement.
First, you should know that the determinant of a matrix with a zero column/row is necessarily zero (this follows from the linearity of the determinant). Then you should prove that any singular matrix (non invertible square matrix) can be transformed to a matrix with a zero column w/o changing the determinant.
the question wasnt in regards to singular matricies. It was in regards to linearly dependant matricies
I appreciate ur input nevertheless
Those are the same thing
4 = sqrt(16) and 4 = 2^2
but they are different expression
the question DIRECTLY asked about showing how a linearly dependant matrix has det of 0
not how a non-invertible matrix has det of 0
Those are not the same thing
Singular and linearly dependent are actually the same thing
A matrix is singular if and only if its linearly dependent
"Singular Matrix. A square matrix that does not have a matrix inverse"
Just replace everything in what he said with linearly dependent if you want
ive never come across the term singular in my book
I don't think you understand what logically equivalent means
so im phrasing the internet
That's true
Me: Wants to learn full linear algebra.
Also me: Finds a PDF with 400+ pages...
400 pages barley scrapes the surface probably
How to do this?
Basically the issue is:
I know how to do it using this way (correct me if its wrong):
whats the question
First page
Find the representative matrix Mcc(f)
Thing is i heard i can also do it using this method but its not coming out the same:
So i was trying something like this, I’m getting a similar matrix but not quite, anyone know where i went wrong (question above)?
What do you think?
not sure
Well think about what they're saying
You know what the union of two sets is
you know what subspaces are
"Let H and K be subspaces.." ""show that the union of two subspaces is not a subspace"
what
Read that again, you're missing a couple words there
the union of two sets is just whats in one set right
oh no
its both the sets right
yh
first or latter?
o
yes
Why are you trying to help if you're not completely sure about these things
union would be all
"help" and "discussion" are two different things
union is both set A and B
in the circles
true so anyways
i understand sub space and union
but dont know how to approach this problem
Well what is the question asking you to do
yeah
Well read it, what is it asking you to do
lol
In contrast to the first part
In the first part, you showed that the intersection of two subspaces is always a subspace
yeah
So what is this second part asking for
i guess the zero vector would also be present in both sets
but closure under addition and closure under scalar multiplication wont
#advanced-number-theoryYesterday at 22:19
What did you expect
Linear algebra is a huge subject, there's a lot to learn
agentnolaYesterday at 22:37
400 pages barley scrapes the surface probably
@terse mirage @sonic osprey cmon let me be frustrated over wanting to learn this and having not much already in knowledge xd
How do you know that closure under addition and closure under scalar multiplication won't?
@prisma kestrel yeah it's definitely tough
Just get started though, you'll get through it
then you'll look back wondering how you ever did that
because if i take something from set a and add it to with something from set b it wont always be true that its under addition cause we dont have the intersection of the two
they're just arbitrary
it could be there though? How do you know it can't?
Maybe the thing from set a added to the thing in set b is in set b
but like it wont ALWAYS work
cause we're taking the union
not the intersection
is my thinking right?
am i in the right irection
direction
Why does that matter?
You should read the second part of the question again
Word for word
It really tells you what to do
im a bit curious though what IS linear algebra because i thought algebra captures stuffs like calculating with letters and numbers 😄
if you're given the dimensions of a matrix and what Col A is equal to
how do you find Col A^-1
by Col I mean column space
is that a serious question
yessir I am not smart
no i meant marino
o
sry
np
somehow yeah, but im distracting the discussion, so i wouldnt like to expand this topic in this channel
except the ongoing stuff would be over but i dont think so
Yeah algebra kinda is like that
@sonic osprey so i can give two vectors one from one set and one from another set and show that adding them does not give me back the same vector as each other i thinking?
try it
@prisma kestrel Linear algebra is just like that, except you don't really work with numbers anymore
you work with vectors
which are kinda like multidimensional numbers
Then you study the analogue of lines
vectors are only element of the cartesian product of sets which contain numbers arent they?
Vectors can honestly be anything, they just have to satisfy a couple rules
In most cases, with people just learning though, you'd be right
so the same axiomatic stuff as in natural numbers?
They'd always be real numbers or sometimes complex numbers
Related, but quite a bit more complicated
A bit less set theoretical
im at the moment busy with the construction of N (through peano) and slowly moving to the integers atm 😄
well axioms dont have to be based upon sets ^^
In most cases, with people just learning though, you'd be right
im learning this stuff for fun or lemme say due to interest
Vectors are just a lot easier to visualize and stuff in 3 dimensions and with real numbers
so i dont really care what people do to learn it to get through the exam 🤣
when your vectors themselves are functions, it becomes pretty hard to visualize
?
What are your sets
And visualization is pretty important in linear algebra
So you build up the geometric intuition first
Then you can move onto more abstract things
thats what i loved about the visualization of pythagoras in R³
you can just see HOW and WHY it is like that
Well, explain what you wrote
so
general matrix addition with same rows and columns i guess xd
wait actually
let u = (a,0) and v =(b,c)
u in one sub space
and v in the other
vector addition results in the second entry not being 0
thus there is not a closure under addition?
You haven't said what the subspaces are
subspaces of r^2?
whatever these vectors are in
Are U and V subspaces or vectors
how do i define what the subspaces are
You know what subspaces are
yea
Then you know how to define a subspace
subspace of a vector space which is also a vector space
i guess u and v are sub spaces?
im not reallt sure
tbh
idk
Then go think more
they are vectors to me
when i first drew them
i thought of them as vectors
okay
i mean isn't a vector space a set of vectors
where as this is just one vector
Depends exactly what you meant by writing [a 0] I guess
looks like a 2d vector (?)
ok i stop it because i influence even more confusion than what is already there 🤣
does linear dependence imply a zero row?
not always
but the reverse implication holds true
a zero row does imply linear dependence
could you give me an example of a matrix that is dependent but doesn't have a zero row?
oh ok
'''if det(A) != 0 for an n x n matrix than if AX = 0 show that X = 0.
AX = 0
AIX = 0
AAA^-1X = 0
stuck from here
idk what next
o
shit
thanks man
it didnt cross my mind i can multiply RHS
since it was 0
wait
10 = 0
5 * 10 = 0 * 5
50 = 0
thats not allowed
these are vectors and matrices not real numbers
which sketchboard software do u use elite?
notability on the i pad
......
oh ok
i hate there is no useful stuff on windows/android 🤣
lol im sure there is
nonsense, plenty of sketch apps on andriod
it's windows come on
microsoft has their own notebook software
microsoft onebook or something @prisma kestrel
my professors use it a lot
lol
what do you think how i feel as i fill this notebook with mathematical proofs
and what sucks the most is that its microsoft
I WANT INDEPENDENT SOFTWARE 😦
and if they one day should close one note i dont think i can keep my notebook
so i'll create pdf backups now and then
hey guys I was doing an induction proof I was able to get to the part now I just need to do algerbra and I am stuck i need to make:
((k + 1)! -1) + ((k + 1) * (k +1)!) = ((k +1) + 1)! - 1
can you show the to-prove formula?
ye probably
n=1 worked so nvm
yeah thats the base case
now the hard part:
induction hypothesis but i am not smart enough to figure it out
i haven't done induction in like a year lol
well im doing it on paper rn
nice!
ok i got it
i chose "i" as iterator variable, hope that doesnt matter too much
can some some help with an identify trig question
@north sierra @wintry steppe looked over it? 😄
i need to prove left side equal right side
do you know if they are equal in fact? 😄
given by exercise description or something
yeah they equal my teacher told me
ok i got it fujoshi
Say you have x (i1,j1,k1) X y (i2,j2,k2) with x and y being some number. After doing the cross product, would the magnitude just be x * y? If so, do you keep the numbers found for direction in the cross product with that specific direction? Ergo the final result being ( x1 i, y1 j, z1 k)
@jaunty hemlock you need the trigonometric pythagoras
With z1, y1, x1 being the numbers you calculated in the cross product
yeah
@wintry steppe btw im sorry for just solving the exercise, that was dumb, so where have you been stuck on?
@jaunty hemlock and where are you stuck?
Or actually, the magnitude would be |b|*|a|*sin(theta(ab))
sorry what do you mean
well you asked for help to prove the equality
so how far have you got and where have you stopped?
i mean i could just send the solution but i think nobody would support me with that and actually its not useful either 😄 and i already did it with an induction above so i wanna keep away from this kind of "help"
could i see what you got and tell you where i got stuck
just show me what you have problems with
what have you already tried etc
do you have a mobile phone with which you could send a picture via discord?
okay let me upload it
i'll prepare tex
Marino:
here where i got
lemme give you the hint you dont need to transform the trigo functions into other functions because the solution is much simpler
this transformation isnt too clear to me
alright i come back to that i currently stated a new equation
because $\frac{\frac{tan - sin}{tan}}{sin}$ should be $\frac{tan-sin}{tan \cdot sin}$ if im not wrong
Marino:
send help please
Let U and W be subspaces of V. Then V is the direct sum of U and W, if every element v in V can be expressed as
v = u + w for some u in U, and w in W in a unique way
wtf
is this
supposed
to mean
everything lol
ok yes i know what subspaces are
how do you usually represent a subspace though
because what I usually picture
is a 3D space
and a subspace would be a plane
only thing I know is that there are three things that define a subspace.
- Closed under vector addition
- Closed under scalar multiplication
- Zero vector exists
what is one possible subspace of R^3? Would {x1, x2, 0} where x1 and x2 can be anything be defined as a subspace of R^3?
Sure, but at its core, a subspace is just a set of vectors
That satisfy the properties you listed
infinite set of vectors?
my problem is how would one represent that set of vectors that make the subspace
Usually infinite, not always
😮
Why do you need to represent sets
R^0
I mean it's not pointless
right?
Yes
hmm
It's just that it doesn't really matter here
ok
so going back to my question
uhhh
hold on
I have to prove both directions oh no
if V is a direct sum of U and V, then B U C is a basis of V
wait lememe type it up
Let B be a basis of U and C be a basis of W. Then V is a direct sum of U and W if and only if B union C is a basis of V
it actually looks really obvious, but lemme try formalizing it
Well do you understand what direct sum means yet
yes
kind of
take some vector in U, take some vector in W
add them together
wait actulaly not rly
LOL
I thought I understood it
sum sounds like the sum of every possible vector which could occur but im not into this topic so dont take me too serious here
@paper egret Understand that first
do you think it possible to see a numerical example
i think the part that's messing with me the most is "in a unique way"
R^2 is the direct sum of the x-axis and the y-axis
So let me guess
there's something about Spanning
wait actually
does that mean that
this has smoething to do with a basis
basis means each vector can be expressed uniquely
wow it's almost like the problem you need to solve answers that question
so lemme guess. if V is the direct sum of U and W, it means U and W are basically bases of V
wait
that sounds so wrong
wait
LOL
Just read the question you're trying to solve if you want to know the answer lmao
does anyone know about the jacobian determinant and it's numerous uses!
Use the jacobian determinant!
Let U and W be subspaces of V. Then V is the direct sum of U and W, if every element v in V can be expressed as
v = u + w for some u in U, and w in W in a unique way
wtf
is this
supposed
to mean
this one?
Theres a tool you guys can use...
Stop, please
Lol
who are you talking to galois?
It's really not that funny
Well it's irrelevant to his problem so
ITS NOT
It is
lol ban hammer plz
jacobian determinant has nothing to do with this shit lmao
Please just stop trolling
im not trolling
Can someone please help me understand something about determinants, I have a quiz tomorrow and I have absolutely no bloody clue on what to do
@wintry steppe This channel's in use, move to a different one please
Omg
his question is resonable
and he has a quiz tomm
ffs
No one is answering in the other ones
have some sympathy
USE SHOELACE
"sympathy" if (lemme say i trust #galois) he says that that topic doesnt help in this topic? lol
Just ignore him
I met jacob jacobi
said the guy in white
It's not worth the time
:^)
I MET JACOB JACOBI
ok ill ignore
What does your problem say
Definitely not
ok i blocked him, i recommend doing so either
Can you find a counterexample
coutner example?
I can't really think of one off the top of my head
for direct sum
To the idea that U and W must have the same dimension
Can you come up with an example of a direct sum in R^3
if they have the same dimension, wouldn't that be perfect?
uhhh lemme think
xy and yz plane maybe?
Are you sure that works?
oh wait there's an intersection
😳
Right, intersections are bad
there's a subspace from the intersection
Right, so you can write v + 0 and 0 + v
Are you sure?
i mean it could be
it could be both
both could have the same dimension, and both don't have to
in the case of R^2
x-axis and y-axis
wait actually that's bad, there's an intersection {0}
wait shit i'm getting confused
whats the issue ?
Well why isn't the intersection of {0} bad
i will answer it
Why are the other intersections bad
I am fast
the first intersection we had in R^3 had like an infinite set of vectors
Not like
the R^2 case is also bad too though right
wait
😭
As a sum of something from the x-axis and from the y-axis
😡
So what's the difference
🅱&
ah jun got em
Can someone please help me I’m desperate right now
Why does 0 not have a uniqueness problem?
No one is answering questions
But other vectors do?
no cuz this channel is busy
0 doesn't have the uniqueness problem because there's only one way to represent em
Well I know but can literally no one pop in on questions
other vectors do, for example in R^3, have multiple ways to represent em
that aren't unique
The R^3 part doesn't really matter
if you have a non-trivial intersection
An intersection that's something that's not just 0
Then you can always write it as 0 + v and v + 0
okay anyways go back to thinking about the problem
i dont get what you meant by non[trivial intersection