#linear-algebra
2 messages ยท Page 186 of 1
don't u wanna do $\sqrt{\int_0^{2 \pi} f(\phi) f^*(\phi) d\phi}$?
Edd
you just integrated the func, that's not the norm and requires complex analysis to justify
btw this is also the reason the inner product is more general than the dot product, this "coordinate" of a vector requires the inner product to define, anyway
i'm busy :3 use what i wrote
yea
this is even easier because the conjugate and the function simply cancel out
mirzathecutiepie
this?
o idk i just put that there to show that its normalized since the function is = to 1
the function's norm
ty i get it now
i just messed up the complex conjugate
needed to set it to - of the function
another quick question, say i had P(A + P) where A, P are matrices same size. could i make it into PA + PP?
yes
thanks
i have another quick question
would this be a good answer?
or is there more to it
i'm not familiar with the terms in physics
if two operators commute they share a complete set of common eigenstates (eigenfunctions)
observable can be thought of as some function of $X$ and $P$ like $X^2,P^2,X^2+P^2,....$ are observables
PROnoob
ok so observables are in general some kind of operators but what is actually observed are their eigenvalues and when this happens the wave function becomes the corresponding eigenfunction.
ohhh
so if the two operators commute then that means the observables are their eigenvalues?
yes 'observables' in the sense that when you make the measurement thats what is actually observed.
If v and w are in a complex inner product space, how do you expand ||v-iw||^2? I feel like im doing it wrong
I get = <v,v>+i<v,w>-i<w,v>+<w,w>
the two norm squared in C^N is v^H v
what's v^H?
no clue what that is
are these vectors in C^N or are they functions or what?
vectors in a complex inner product space V
generic abstract vectors?
yep
but not sure if i'm doing the expansion right
cause the 2nd term has conjugate stuff
looks ok
<v-iw,v-iw>=<v,v-iw>-i<w,v-iw>
remember tho that the inner product ina complex space requires complex conjugation
yeah that's for the 2nd term expanding
moshill
ahh
you can ask in a channel that deals with differential equations
multivar calc and diffeq
@nocturne jewel it looks ok, just notice that the 2nd and 3rd terms are complex conjugates of each other
so the overall result is real
Gonna be honest im not 100% confident with the conjugate symmetry property, how do they cancel?
i<v,w>-i<w,v> = 2i<v,w> is what i'm seeing
they don't cancel, you get 2Re{i<v,w>}
Not seeing it
2Re(z)
OH cause conjugate "distributes" so you get conj(i<v,w>) = conj(i)conj(<v,w>) =-i<w,v>
lol ty
still differential equations
probably linear, at that, but you should try the other channel
is this linear algebra
or a physics server where they use notation you are familiar with
If your question has not been answered for a minimum of 15 minutes, you may use the Helpers tag once. Please do not try to bump your question using this ping unnecessarily. Do not abuse this ping. Do not individually ping users with the Helpers tag without their express permission.
also this isnt really linear algebra, but whatever; have you tried substituting the point in?
if you "plug in" x = 2, y = 3, z = 4, is the equality true?
right.
lines are orthogonal if the direction vectors are
and how do you tell if 2 vectors are orthogonal?
yes
yes
They already got help
yeah seems ok
Homogeneous equation just means there's no constant term other than 0
but it can be independent or dependent
if u have an linear independent family of vector that are all from Q and if the family is independent in Q how does that implicate that it is linear independent in R
can somebody help me
You're saying you want to look at the "column" perspective of a linear systems of equations, right?
ah
if you do rref,
and you isolate the pivot columns
those columns will be independent
if you do column row factorization, which is what I think parametization does
where M = CR
then C would be your pivot columns
and R would be your independent rows, kind of acting as weights
so my intuition is yes -_-a
@modest kayak where is this question from?
u should probably ask someone else too though hehe
Yo is this valid for Gauss Jordan : r2 / -r2 -> r2
Or do you have to divide by another row
I know you can switch rows, add rows, and subtract rows I believe. But i'm not sure about mult and div
in elimination at least you're only supposed to subtract a multiply of one row from another
i'm fairly certain you can multiply rows.
oh???
I'm confused cause I tried to follow this Usually with matrices you want to get 1s along the diagonal, so the usual method is to make the upper left most entry 1 by dividing that row by whatever that upper left entry is. So say the first row is 3 7 5 1. you would divide the whole row by 3 and it would become 1 7/3 5/3 1/3.
if you could divide rows then $x + y = c \implies 1 = 1$ NOT $1 + 1 = 1$
uli
What........
I mean in terms of the system of equations
I just want to know if you can divide the same row by itself and store it in that row
I'm not sure you can
It's not one of the elementary row operations
I don't think you can do mult/div
Yeah, but he wants more right
its just when he put $r2/r2$ the denominator is a row, which you can't do
Yeah i'm not sure why that article said you could
uli
what article
Usually with matrices you want to get 1s along the diagonal, so the usual method is to make the upper left most entry 1 by dividing that row by whatever that upper left entry is. So say the first row is 3 7 5 1. you would divide the whole row by 3 and it would become 1 7/3 5/3 1/3.
....
you can divide the whole row by 3
You mult/div with Scalars
but not the whole row by the whole row
Yes, and it's better just to think of multiplication and not division
usually you don't apply a row operation to itself if you're doing elimination
since you want to zero everything below the pivots
You do it on the first operation at least
Here wait
[ 1 1 0 | - 1 ]
[ 0 -2 1 | 1 ]
[ 0 2 -1 | 3 ]
So I'm stuck here
trying to get the 2nd row to be 1
in the spot where -2 is
so divide by -2
.
Sweet thank you
other question
do the "pivots" have to be 1
exactly 1
or can it be -1
I call them diagnols but
Uh, i think just standard rref
Yeah thats all I've seen so far, I thought it would be weird to leave it as -1
[ 1 1 0 | - 1 ]
[ 0 1 -.5 | -1.5 ]
[ 0 0 1 | 1 ]
So I proved that there are infinitely many solutions even though they ended up with slightly different numbers right?
I ended up with a1 = -1 a2= -1.5 and a3 = 1 after doing Gauss Jordan
Feel free to roast/correct me
You need to find the general solution to those equations. Maybe try adding/subtracting them as a place to start?
The most I can simplify it to is x2 = -x4, and x1+x3+x5 = 0
That looks good. You need to introduce three free variables now
x1 = -x3 - x5, you could note
oh right
Not completely sure what you mean here
I guess I'm just still not understanding the process of Gauss Jordan. Like I wish I could see a tutorial on this exact kind of problem but I don't know what to google
sorry still not understanding fully
trying to think through it
my basis elements will be linear equations equalling zero right
Well, your general solution is $\begin{pmatrix} x_1 \ x_2 \ x_3 \ x_4 \ x_5 \end{pmatrix}$
Lunasong
But now you can replace x1 and x2 in terms of x3-x5
okay so (0 1 0 -1 0) will be one
So that it only depends on x3-x5
I only know x2 in terms of x4 though
I doooo, oops
okay so $\begin{pmatrix} -x_3-x5 \ -x_4 \ x_3 \ x_4 \ x_5 \end{pmatrix}$
Mms.
depression
whoops
Yes, now can you split that up into three terms? One with x3, one with x4, and one with x5?
so these are my three basis elements then?
does that look right @marble lance @stable kindle
@wintry steppe Well, I understand that , from what I know you have to perform Gauss-Jordan elimination at that point to prove whether or not the system has any solutions. I just wish I could see the process of proving it has many solutions VS none. They skipped that part on chegg so It's hard to do myself and I could be wrong
Looks good
Just add a 0 lol
@marble lance thanks so much for the help!
Np
Yeah one sec
@wintry steppe I feel Like might have done this right so far, but I am lacking a step or two to actually get the values of x,y,z ( or a1 a2 a3 in this problem )
I dunno that ones just such a mess, I'm about to do another and I'll be more carefull but I still don't know what to do after that, Like I think there's an extra step because we didn't do the upper right triangular as all 0's
Thank you!
Imma still do these by hand but, am I dumb and there's just calculators for these? LOL
Omfg , the time..... so much time wasted
LOL
Bruhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh I was wondering how we were expected to do these problems in 3 min
Oh...
HMMMMMMMM
now i'm more confused
LOL
wait cause
This ones suppose to have no solutions, but it looks like it does?
Or do I have to take those values and then calculate a1 still
this is for another problem but
also I thought the diagnol had to be all 1's
Linear is so confusing lol
OH
so because that last row is 0 = 1 its no solutions
wait...
didn't you do that in yours tho
no no
you had 0 =0
for that last row
ohhhhhh, now it makes sense
So you don't even have to further calucate that for the actual value?
If you just end up seeing an obvious inequality in the rref you can stop there
such as 0 = 1
Bruh, I see why you'd want to do rref now
You have enlightened me , thank you kind fellow
how can i find the orthogonal vector space to another vector space?
This seems like a dumb question but is it wrong to write Span = {} vs span = {} like is it just convention or an actual symbol like COS or SIN
I guess even COS and SIN are just conventions too i think
Like for a spanning set you would write S = {} and for the span it's span = {} but does the way it's written actually matter
@wintry steppe https://en.wikipedia.org/wiki/GramโSchmidt_process
isnt gram schmidt to find a base?
It's a technique to orthogonalize a basis
@wintry steppe Not sure if you're still around but, what do you do with that last row if the columns and rows are uneven. Is it just 0 = 1
yeah but i think i dont need that. Or maybe yes. Let me explain. I am working on polynomial vector space. I have a dot product and a norm. and i am given a polynomio. I need to find an orthogonal subspace
i got this
my polynomio is p(t)=1+t
and i have to find the orthogonal subspace generated by p(t)
you need x,y,z such that 0=1, which is impossible
Sweet and the rest are 1 =0 which is also an inequality?
ohhh
then what the heck is the last line
also z?
lol
Is it basically re-defining Z to = 1 = 0
But yeah the fact there's an extra row confuses me
the bottom-most row reads 0x+0y+0z=1
....... thats so weird
so you're basically adding another line to the system that makes no sense
and thats why its impossible
Isn't the dim(Poly of degree 2 ) = 2 ?? Or am I missing something here
oh duh 3 vectors not n = 2
its somewhat weird notation
though i guess the other way would be confusing as well.
Like R3 is 3 and that makes total sense
Lol, more so confusing for polys I guess VS other spaces
ew
Not sure about how to do this problem
Tried to do some of it,, but kind of stuck
what do you think the image is
well the derivative of an arbitrary polynomial
or the set of derivatives of arbitrary polynomials in V
yes, which is precisely what
given any poly p in the image, T, can you find some other poly q such that T(q) = p
not sure how to express it
you basically just have to apply the power rule/integration power rule? idr what its called
to every part of the poly
idk how to do that
what is the integral of ax^b
a/(b+1)x^b+1 + c
and so the derivative is of course ax^b
so for any given p(x) in T (the image) , the polynomial given by applying that rule to each of the monomials of p(x), named q(x), is such that T(q(x)) = p(x)
which should give you the answer
So would it be the span of (1, x, x^2, x^3, ..., x^n) ?
aka the set of linear combinations of those
hmm we haven't learned about infinite dimensional spaces
well ur answer depends on whether V is finitely generated or not lol, not sure
If V is finitely generated, would that be the answer and just with the qualification that n is finite?
would what be the answer
the span of (1, x, x^2, x^3, ..., x^n) ?
yep
okay got it thanks. and that would be n-1 dimensional right?
would it? you should count them
oh n dimensional
wait
idk how to count it actually
the set of linear combinations of (1, x, x^2, x^3, ..., x^n-1). not sure how I would count that
right
so let v1 = 1, v2 = x etc
but isn't it the count of all possible linear combinations
no, the dim of V = the number of vectors in a spanning set
noo
oh its n
yes
LOL I cant think
you have n-1 vectors with an x component, and 1 vector that is just "1"
so we have n-1+1
right, the count of v1 starts at x
no
i mean it doesnt matter where you start
yeah aas long as you add what you left out
sure
lol thanks for helping me think through that problem

Solving through some Matlab work
It's asking me to compute the left hand side and right hand side of the equation and store them in the variables LHS1 RHS1 and so forth
How would i calculate LHS1?
there's no LHS to calculate..?
Ah here we go
You posted 3 matrices and mentioned an equation
A(B+C) follows bedmas of numbers, but with matrix rules
so you compute B+C first, then left multiply the result with A
@edgy kelp There is a formula with A, det(A), and adj(A) in it. If you know the formula, you can plug in the value that you know and find the answer. If you are unsure of what the formula is, I can show it if you want.
Yeah @wide magnet what is the formula? I believe the answer is suppose to be a matrix though
Right?
Yeah that is correct
@edgy kelp and if this looks unfamiliar to you, you may recognize this. I wouldn't use this one though since the problem being asked is not dealing with an inverse matrix.
I am familiar with this formula @wide magnet
The second one at least
So Its just 7 * Identity Matrix
Yeah
Oh okay I see now.
Question regarding the Gram-Schmidt process, particularly in anything greater than R^3. From the derivation from 1D-3D there is a recursive way to compute a new N+1 orthonormal basis vector by finding a orthogonal projection of another vector with a linear combination onto the unit vectors subspace, this extends that idea into N dimensions. But I am curious for anything past 2D can we derive a new orthonormal vector with a cross product between two orthonormal basis without doing any projections onto sub spaces and solving for the new basis vector?
yeah that will work in 3D
in 4D and higher you have to define what you mean by a cross product of 2 vectors, or think if that's something you actually want
Well I refreshing linear algebra after years of doing it and coming at with a fresh new mindset and start to see patterns
i never saw before when taking it in uni
you can basically make a cross product in n dim that takes n-1 vectors and outputs a vector that's orthogonal to them all by the same determinant type construction as the cross product in 3D space
what you mean by same determinate type construction
you can compute the cross product by a determinant by putting the first row as basis vectors, then the second and third rows as two vectors you're taking the cross product of
it's a pretty common way to compute the cross product, if you haven't seen it before tell me how you compute it normally
so you use the row space (column space transpose)
then
so it's something with the row space you're doing right?
I'm not doing anything
Ya ok I see what you mean
"you can compute the cross product by a determinant "
this is the key
that's interesting
another way to think of it is as like, in n dimensions if you have a determinant with n-1 vectors already filled in it
if you put any other vector that's in the span of those n-1 vectors, the determinant is 0
and so you can think of factoring out this vector and you have effectively a determinant operator
wild
lol ๐
math I swear is crazy like this
hey guys can you help me with a determinant?
you can leave more rows of the determinant "unfilled" in a similar way, but at that point it's probably easier to change notation to work with levi-civita tensors
like I said, just change of notation effectively
Having trouble finding the determinant for that
imagine you leave 2 rows out of the determinant filled
you could imagine this as being a thing that's now orthogonal to the n-2 vectors left in it
I guess in this case you could explicitly write it as a matrix
and then multiply with a vector on either side
ok 3x3 case, expand out one row with i_1, j_1, k_1 and second row with i_2, j_2, k_2 and last row is a vector
then the entries of the matrix will be the number multiplying the product of the thingies
yeah like you know what it has to give you in the end, the determinant of a 3x3 matrix, so you can check your work no matter how you fumble through to the final answer
maybe that's not very fun though, lol
lol
either way was curious I am not a linear algebra expert or anything just building the knowledge base now after watching the khan videos to get a good knowledge base
to work with things in game dev
makes sense, sounds fun
have you made any games yet or what kinds of game do you want to make?
I've been constantly going to Linear algebra back and forth and said F""" it i am gonna sit down and understand this on a geometric level
because last time I learned it it was compute this compute that
and i never learned anything
Now when I visualize it in my head geometrically it makes way more sense to derives things with it that uses vectors
I just helped someone else out with a handful of vector calculus two days ago too for something they were programming for a game saying similar kinda things lol
I need to use linear algebra to do rotations, movement mechanics and collision physics
some of it can be easy just normal vectors and some vector math
Right now I am trying to figure out how to translate a rotation matrix to a equivalent quaternion operation
I am rotating a frame of reference where a vector lives
hmm it's been a while since I've done that but I distinctly remember quaternions being much better than matrices
because you could more directly rotate how and where you want to
to compute
save compuation
Right now I have what I want working with a rotation matrix
I can take any vector
say its gravity
and reorient the players mouse input
with gravity pointing down
regardless of frame of reference
for example if I walk up and wall and want gravity to point in that direction perpendicular to that wall
I need to rotate my frame of reference so my mouse input stays aligned when I pitch or yaw or roll
while having zero gimbal lock
yeah, from what I remember quaternions avoid gimbal lock altogether
yes
so what I was trying to figure out was
how do I compute the pure quaterions and W to get a new rotation
to rotate my vector
using quaternion multiplication versus a rotation transform
I guess I don't understand what you're really doing well enough from that description to say what to do but I'm pretty sure I could come up with the computation directly in terms of quaternions
which might be easier than trying to translate from rotation matrices
That would be dope. Let me try to see what I can derive from it
I have a bit of knowledge with quats
let you know what I get
I have a specific quaternion video that helped me when I was doing animation in blender a few years ago that might help
I have had some success with quats already doing a plane game
but I never did this specific frame of reference transform with quats before
explains pretty clearly how quaternions have a double cover and why that makes sense to have the whole rotation space be 4 dimensional to cleanly interpolate between different mixtures of pitch, roll, and yaw
the only thing I could think of is computing the projection between two coordinate systems
to get W
for all the basis vectors i transform
then I can take the vector and rotate it by that amount
I feel like fundamentally converting from rotation matrices to quaternions will be flawed
I mean I am cheating a little
you'll end up doing things the same way and so end up having gimbal lock
because how you're working with them is as if you're working with matrices, they just happen to be represented as quaternions
I am cheating because
i am using pure quaternions
so they map 1:1
at least what I think i am doing
X-Y-Z unit vectors
W = 0
right
rotate those when W = 0
then do quat math on that vector in that new basis
I don't think so, at least I don't know if how you're imagining quaternions work is how they actually work
like normalized quaternions let's say, when W=1 that's completely unrotated
then W=sqrt(2)/2 and X=sqrt(2)/2 would be like one of 3 possible ways to rotate around an axis by 90 degrees
they're like living in a space of rotations
yeah
the sum of the squares must equal 1
its like two buckets of water
between real and imaginary
at least how I visualize it
yeah that's pretty good way to think of that I think
you can have complex, pure real and pure imaginary
so the pure imaginary defined a vector
in R3
so like
(w,i,j,k) => (0,1.0i,0.0j,0.0k) so I have a vector
rotating around i
which is
roll i think
how much is defined by some other quat
times that
thats how I was able to do a airplane rotation
with a rotating velocity
well you need all 4 dimensions to talk about rotations unless there's some other convention I'm aware of
if w=0 always it's weird
because you can never rotate back upright even partially
What would the matlab code look like to divide the first row to make the pivot a one
Just a general idea
why 0.2?
same as dividing by 5
I see, so by pivot we are trying to turn the 5 into a 1?
btw that worked, thanks dude!
np
try a really simple line to project onto
yeah I tried to start with that idea, but couldnt work through it
what is the dimensionality of a line?
1
how many lin indep columns does the matrix have, then?
one right?
tbh im not too sure. I know that the basis has only one vector since the dimension of a line is 1. and that vector clearly will span the line
not sure what else I can conclude
that:s about it, just notice that the column space of the matrix has to be dim 1
that makes sense I think. still not sure how to create an example from that knowledge
aside from that, you could use this single vector as a change of basis
or if it is clearer, do a vector projection with dot products
if you write this out as an equation with one side being the expression for a projection, you can choose a really simple line. from there you might see what the matrix would have to be
still not completely understanding. trying to think through what you guys have said
can you give me an example of one such line. I know the projection expression would be T(x) = projy(x)
idk like the line defined by scalar multiples of a standard basis vector
that is as simple as it gets
for example, t*(1,0,0)
do you know how to do scakar and vector projections? changes of basis?
yeah I know the computations
never really thought through them though conceptually
so I project a vector onto t(1,0,0) and essentially I'm trying to find the matrix of the transformation?
So I'm looking at my textbook. looks like I can easily find a 2x2 matrix that projects onto a line in R2
@lavish jewel @wintry steppe is there a similar formula for a transformation matrix of a projection onto a line in R3?
you don't need a general formula
what is the projection of a general R^3 vector (v1,v2,v3) onto (1,0,0) (on the line we are talking about)?
o I meant for a projection matrix
just notice that $x \cdot w = w^{\text{T}} x$
Edd
it would be v1/1 (v1, v2, v3)
so you can group stuff in that formula and it directly gives you a matrix
i trust you peeps will be ok, have fun!
yuhhhh
yeah so if we choose a line L to be scalar multiples of (1, 0, 0). then every (v1, v2, v3) will project to (v1, 0, 0)
line L in R3*
so is the matrix of the transformation a 1 in the first entry, and all else zero?
that works yup
ah okay that finally makes sense
POG
thanks so much for the help!
why the orthogonal vector subspace to the polynomio 1+t is inf-dimensional?
wrt which product?
Well,The dimension of orthogonal vector subspace will always dimension of parent vector space-dimension of the subspace you care aboit
SPD?
Need some help thinking through this
Could scalars of the identity matrix for a 2x2 matrix (I2) work?
Yea,That would be vector space generated by I
other fun examples might be, diagonal matrices, symmetric matrices, triangular matrices
I just have to show that the subspace contains 0, so the zero matrix, and it is closed under addition and scalar multiplication right?
yup
got it thanks! and to show that it is a subspace of all 2x2 matrices, I can just state that since it is 2x2 it is a subset of the space. or do I have to do something more rigorous to show it is a subset?
perfect, thanks!
I'm not really sure what they mean , could someone dumb it down for me
first equality is the rank-nullity formula
the inequality is because dim ker L >= 0
dim ker L + dim range L >= 0 + dim range L = dim range L
(you can add things to both sides of inequalities and they still hold)
which shows that dim V >= dim range L
oh one sec
so nullity is dim ( N(B) ) where N(B) is the null space right
yes
which is the same thing as the rank of the null space
if by "rank of null space" you mean "dimension of null space" yes
but be careful with that terminology
ooops
because in linear algebra "rank" usually refers to the dimension of the image
but it can be used to talk about the dimension of any space
I see...
this makes sense
hard to think about abstractly
thanks!
i have a matrix where the entries are members of Z_3 and I want to row reduce it
and ive been wondering
how do I deal with row operations producing negative / fractional entries?
is that an invalid row operation?
No
R_4->R_3+(-1)R_4 is perfectly valid
Here
Valid operations are:
1)swapping of 2 rows
2)Scaling of a row by a unit
3)R_1->R_1+cR_2 where c is any member of the ring
well
i may be misunderstanding but
R_4-> R_3 + (-1)R_4
means the fourth row becomes 0 0 0 1
which i can perfectly wrap my head around
but lets say
Yes
one of my intermediate steps
was
R_1 -> R_1 + (-1)R_2
and that produces
0 0 (-2) 1
-2 is not in Z_3
what happens then?
so they wrap around?
Yes
i guess that is pretty obvious...
The addition is as per the ring addition
then what about ones producing fractions?
but fractions are not part of any Z_n
Frcation is multiplication with a multiplicative inverse
OHHHHHHHHHHH
The multiplication as per the ring rules
I have grabbed a bagel I am now ready for the study guide

Lol
Do you not like bagels and linear algebra study guides
is it possible for a symmetric 2x2 matrix to equal the zero matrix when multiplied by itself?
i worked out that it is possible if the 1st entry is equal to minus the 4th entry but i think i did something wrong
I mean write out the matrix multiplication of a symmetric matrix, set it equal to 0, and you get 4 equations for the entries
0 matrix is symmetric
0^2=0 
No
it's impossible right?
Yes, It's not possible
There's a theorem in LA which says that all symmetric matrices are similar to a diagonal matrix
Am I wrong or is this incorrect?
I didn't get the same component for khat
I got -2/sqrt5
Let me send my det, lol, they wrote theirs a bit diff
Does anyone know off top of their head how to convert a matrix of floats to rationals?
for Julia
not necessarily
Ax = 0 is always consistent
but A may not have full rank
which leads to A not being invertible
yup
could i get some help with a problem in voice chat?
post the question so people know if they can help or not. ..
Can someone help me with this problem. I'm supposed to only reason through it geometrically
I can't manipulate the equations, find RREF, etc.
so what are they
equations of planes
vectors (x,y,z) that satisfy the equations. so it would be a set of vectors
no but geometrically so like
in terms of the planes, what do the solutions look like
the things that satisfy all the equations
the things on both planes
it would be a line created by the intersection of the planes
okay so since the solution is in the form of a line, it therefore must have multiple solutions
and I know the planes intersect because they each equation equals zero?
uhhh not quite
wait
hmm
no actually yeah that works
bc they will intersect at at least the origin
so how can I prove that the intersection forms a line?
okay makes sense. so for (a) it can't have a unique solution, because the two planes intersect forming a line, which implies there are infinite solutions. for (b) it can't have no solutions, because the planes intersect at at least the origin, which would be a solution
uhhh you could find the normal vectors to the planes, cross product them to get a vector d along the line , take the origin as a point in both and then it's just any vector of the form kv works? or generally with any point p in the intersection, any vector v where v = p + kd would work and that's a line
yeah i think that works
well i think to be pedantic for part a you want to say
'if the two planes intersect, the intersect is a line'
do I have to explain why that is the case for this system?
such as why it doesnt intersect in another form?
i think you can take that as granted
okay, perfect got it. thanks so much for the help!
coolio
If your question has not been answered for a minimum of 15 minutes, you may use the Helpers tag once. Please do not try to bump your question using this ping unnecessarily. Do not abuse this ping. Do not individually ping users with the Helpers tag without their express permission.
just ask your question
Isn't that just the coordinates of T(1) T(x) T(x^2) in terms of B written as columns?
So just find T(1), etc
is there anyone here who can help me with some linear algebra homework
@marble lance so its just [T(1) T(x) T(x^2)]
Yep
i thought the entries were respect to the basis B though
{[T(1)]B . . . [T(x^2)]B}
like this
also i don't understand how we can solve it without knowing what p(x) is @marble lance
Yeah, that's what I thought you wrote the first time, oops
Uh, p(x) is your input
So it's 1 when you plug in 1, and x when you plug in x, and x^2 when you plug in x^2
huh really?
isn't the function sign redundant?
if p(x) = x
why would it be in this form?
bruh
it can be anything
it's a polynomial in P^2
the point is that p(x) could be 1, or x, or x^2
so like generally p(x) = ax^2 + bx + c, right?
If I say, f(x) = 2x + 5. You don't say what is X? Well, now you have T(p(x)), p(x) is the polynomial you plug into the equation
sorry i was getting confused
i thought we were trying to find T(p(1))
but we're actually trying to find T(1)
nnno
wdym? @stable kindle
Yes, we are trying to find T(1)
ok then
I feel like im close lol
so going to repost if I have trouble
Can someone check if my answer is correct for this question. It asks for us to say if the statement is true or false and then justify
A linear combination of four vectors in R5 can be expressed as a product as the product Ax where A is a 4x5 matrix. T/F
anyone know the answer
I just started my 8 week course very confused on simple questions
@vital tapir it's all good except how the rhs is written https://i.gyazo.com/ee94bf385fbb07d2014fc4e327856381.png
how should I write that instead?
A linear combination of four vectors in R5 can be expressed as a product as the product Ax where A is a 4x5 matrix. T/F
@vital tapir matrix multiplication generally doesn't commute so we must be consistent in writing left/right multiplication by a matrix. if we left-multiply the lhs by A^-1 then we must do the same to the rhs
ah right thanks for pointing that out, makes sense. so I just move the A^-1 to before the lambda?
yes $A\inv(\lambda v)$
RokabeJintarou
got it, thanks!
The dimension of the solution set to the equation 7x1 + 3x2 - x3 + x4 = 0 is three. T/F
what do u guys think
True @sick pecan
I have a question
If A and B are square invertible matrices, the inverse of AB is A-1B-1. This is false right cus it's BinverseAinverse
if we find that b[T]b is not diagonalizable does that mean T is not diagonalizable?
If A is a 5x5 matrix with the property that A3 is equal to the identity matrix, then A is invertible. T/F
im unsure
A matrix is diagonalizable if the algebraic multiplicity of each eigenvalue equals the geometric multiplicity. We define these terms, state the relevant theorems, and see how this works in three examples.
according to this no i think
i just learned this monday lol
The solution set of a system of n equations with n unknowns is a subspace of Rn. T/F
what u guiys thing
The solution set of a system of n equations with n unknowns is a subspace of Rn. T/F ? also this is tricky
If a transformation has the property T( v1 + v2 ) = T(v1) + T(v2) for any vectors v1 and v2, then it is a linear transformation. T/F
damn i wish my textbook had solutions to these t/f questions mad hard for me
If A is a 5x5 invertible matrix, the null space of the linear transformation T(x)=Ax consists of one vector. t/f
The above is my answer for that problem, which is to state if it's true or false and justify. I feel like I'm missing something though or did something wrong
I didn't use the fact that v is a unit column vector anywhere in the problem
looks right
it's actually true that whenever v is non-zero, vv^T has rank 1
hence determinant zero
I see. Curious as to why it has the qualification that v is a unit column vector in the problem then.
red herring lmao
Welp. I've decided to try to work through the entirety of Axler. ๐ God help me.
And I've run into the first problem that's really stumping me. (The book says it's significantly harder. I COULD look it up but I really don't want to.)
That's as far as I've gotten.
Here's my proof of the previous problem.
But ... I have no idea if I'm on the right track or this is gonna be something completely out of nowhere.
want to find a basis for all functions which obey f'=2xf
@mystic sentinel I have to study for a final but I think the idea here is to take two vectors each found in only one of the two subspaces
and play some game about failure of closure
or something
That's what I did for 1.C.12 and it worked decently well.
For 1.C.13 though ... when you've got three vectors, I dunno if that's going to just turn into casework trudgery or what
Yeah sorry I misread
I only read c12
okay for c13
the hint is useful
it tells you that you need to do something that you can't do over F_2
I don't have time rn to think about what that is
but if you only reference addition of vectors or something
Fair enough
your proof won't work
Huh. Interesting.
So you need to use scalars in some important way or you need to do something that screws up signs
(over F_2 +=-)
I didn't realize that the sum of any two gives you the third.
(In Fโยฒ, looking at nonzero vectors)
My money is that the reason the proof works for R or C
but not F_2
is a sign issue
maybe not though i really need to get back i cant get drawn in
lol
good luck
tldr if your proof makes sense in F_2 its wrong so you gotta do something that you can't do in F_2
I think I vaguely recall doing this problem, I agree that sign issue sounds probably right
Well, I guess this basically has to be it, it is so characteristic of F2
How do I find vector x and show that T(x)=y?
So I at least feel like I'm gonna have to do something similar to what I was doing in my 1.C.12 proof. Take three vectors, maybe call them u v w so that each is contained in exactly one of the three subspaces, and consider u + v + w ... or maybe some other combination
But if you need to include scalars, maybe u + av + bw
Isnt there a mistke here?
@mystic sentinel is it true over other fields of char 2?
2.8a how the hell can u multiply if r and c from other are not equal?
question 2.8a
It only mentions Fโ specifically.
F2?
Talking to @wet finch
yeah I know but just in terms of how to answer it
oh sorry
if it's true over F_4 for example then that's almost weirder
And yeah, so far my method from before isn't working very well. I tried examining, say, u + av + bw, where u, v, and w come from the subspaces U,V,W
one other thing you can't do over char 2 is divide by 2
things like u = (u+v)/2 + (u-v)/2
Interesting
So I'm thinking something like...
Say your vector space is X, and it has three subspaces U, V, W, and none is contained in any of the others. Pick u in U only, v in V only, w in W only.
Show that there's some a,b such that u + av + bw isn't in U u V u W.
If u + av + bw is in U, then u is in U, so that means av + bw is in U, but that doesn't really give me much of a contradiction to work with.
Neither v nor w is in U, but their linear combination could be.
. . . unless this is reducing to the previous case? But if that's the case, then what's so special about Fโ?
... okay, in Fโ in just about any space, you can have u = (1,1), v = (1,0), and w = (0,1). And neither v nor w is in the span of u, but v+w certainly is.
Well
you can reduce one possibility to the previous case
which allows you to take 3 vectors all not contained in the other spaces
my guess is from there it doesn't reduce
Yeah, I got that much I think
Like if one space is contained in another it reduces to the case I already proved so I'm assuming no one contains any other
can you use multiple scalars?
Yeah that's what I"m trying to do, lol
this is tricky
But let me see if the whole dividing by 2 thing helps. If I can work a 2 in somehow, then I might be onto something.
Does V + W = L + W imply V = L? (set-theoretic pun unintended)
Since if I'm in a field where 2 = 0, then I've got something.
I think it's more about the size (and thus the lattice) than the characteristic.
I was assuming V, L, W are pairwise incomparable.
Lattice?
Are you talking about like a lattice created from adding repeated copies of u,v,w in various combinations?
Still no, consider any three lines in R^2
Ohh, right
The "lattice structure" here is the fact that any two subspaces have a largest common subspace (the intersection) and a smallest common superspace (the thing spanned by both)
At least, I think that's what they're saying
I was also thinking about this
I see. But I'm trying my best not to use things like "span" because they haven't been discussed yet ๐ I imagine it should just be doable from the definition of a vector space somehow (and maybe field properties)
Fair enough
You weren't going to like any of my attempts then lol
I think most so far have started with "assume we're in finite dimensions, choose a basis"
U u V u W should equal U + V + W, right?
If it's a subspace then yeah
Nice!
Cool. Any suggestions for what direction I might want to try without giving it away?
Right now I'm just sort of trying different linear combinations
what's with the nick btw max? You didn't really seem the type to make jokes about 2 genders...
Yeah I figured it would be about the 2 thing LOL
lmao
okay so like
Max, does your proof work over F4?
Actually
yes
Okay good
I wonder if the (u+v)/2 + (u-v)/2 thing could be part of it
I felt like that had to be true lol
is this statement true for F4?
Think about you v_1,v_2,v_3 all not contained in the others
yeah
so the issue before
was v_1+v_2 can't end up in V_1 or V_2
if it did work for 3 spaces
where would they end up
ponder this
and try to get a contradiction
I feel like that's exactly what I was trying to do ๐
ohhhh wait max I think I see it
wait maybe not
That's okay
I'll deal with it
Wait are you telling me to DM you
Or referring to my previous name ๐
Nah either's fine lol
Actually maybe I can try reducing it down
can u think of anything else equally obvious
Like ... if I start with two vectors
v_1 and v_2, from distinct spaces. Think about v_1 + v_2. I can show from previous problem it's not in the first or second space, so it has to be in the third, and maybe get a contradiction there
Actually lemme drop subscripts and just use different letters. Here's what I'm thinking now.
Subspaces U, V, W, containing vectors u, v, w (each one is only in that space).
Start with u and v and look at the last problem.
u + v can't be in U or V. So it has to be in W.
(If it has any chance of being in UuVuW.)
And then from there, you can do the same thing with u - v for the same reason, so u - v is also in W. But that means that (u+v) + (u-v) = 2u is in W which wasn't supposed to be the case.
But that's okay if 2 = 0 because then the zero vector is in any subspace.
it wont work in char 2
