#linear-algebra
2 messages Β· Page 163 of 1
dual space of the dual space
sniped
I'll uh...
do 1-13 first
B)
if the cat theorists talk about it idk if i'm supposed to talk about it 
small brain

slim, you need a norm for it to be an embedding
just checked the func anal book on my shelf
hrmmmmmmmmmmmmmmmmmmm
yeah
oh i mightve misread the book
i believe it
just pick a basis and take the coordinate function
:^)
all spaces are finite-dimensional, btw
(i am trolling)
Would that require choice for non finite dimensional spaces?
A vector space is always iso to its double dual, right?
If the natural isomorphism doesn't depend on the choice of basis, does the existence of basis matter?
Talking about, infinite dimensional vector spaces, same case valid that they have the same dim iff they are isomorphic, but here the existence of basis ? I don't know about the basis of infinite dimensional vector spaces, but I have proved two infinite dimensional v spaces isomorphic without even thinking about the basis
A finite dim vector space is always isomorphic to its double dual, but not always for infinite dim, here a counterexample https://www.mathcounterexamples.net/a-vector-space-not-isomorphic-to-its-double-dual/
what is the geometric interpretation of raising a number to a matrix power
something like a^A where a is a number and A is a matrix
There is no geometric intepretation,afaik
I think there is in terms of like lie groups and thinking about generators or some such nonsense
kind of similar to thinking about the limit definition of e^x along with complex numbers but instead of that specific 2x2 matrix - other stuff
probably someone else can give a better answer than that
lie groups 
https://drive.google.com/file/d/1Ir4TBRF7p7aKYvZINqorVwFS_30xw92U/view
https://drive.google.com/file/d/1_sJaEuHAjrjTank1Hk4yVeo9af_fHjY6/view
what shall I study to be able to solve the linear algebra problems in these two papers under the given time limit
I have very less time so I am seeking advice of the experienced people here
these are rather long so it'd help you to post some examples of the linear algebra problems in here
You don't need anything other than knowing the definitions of matrix multiplication and determinant
but things like eigenvalues and cayley-hamiltonian are being used
I am not talking about solving the problems but solving them as fast as possible
Cayley Hamilton is not that useful for jee
That's coaching institutes. Actual JEE doesn't need that
it is not generally taught
yes they ask problems like there is a matrix A
find A^2-3A+5 something
and it turns out tr(A)=3 and det(A)=5 so this is based on cayley-hamiltonain
some people say they use 'tensor calculus' to solve them faster
I am totally unaware
I mean the AIR 1 guy himself said that
You don't need any tensor calc
...I found 2 questions that I could solve easily using my arsenal of multivariable calculus and tensors, gaining those precious minutes...
If I multiply two vectors (i.e in three dimensions) using the dot product I get a scalar and since this scalar does not belong to the vector space then the dot product does not hold under closure
. Is this reasoning correct?
yep
@glass pivot I gave it too, I could easily solve the questions of matrices, and I didn't know about Cayley's theorem nor about Tensors, at that time I thought that tensors were something we only study in GR, I was a fool then, but I could solve the matrices problems of JEE without knowing all that.
Going out of syllabus is never recommended for JEE, it is a waste of precious time
But if you have interest, you can study it, and even use it, no harm, but still time is of importance and don't forget Chemistry
Hello, doing exercises on conics and i run into x^2+y^2+1=0. Isn't this a imaginary circumference? My book says imaginary ellipse, which i know is kinda just a more general circumeference, but why not being more specific?

So it's just my book being dumb
Itβs a circle with radius i clearly
what does |f| for f in F mean
When you have a linear transformation from A to B, that means both A and B have the same field, right?
ye
ic, thx
seriously though what does |alpha-lambda| mean
I'm assuming lambda is an eigenvalue
alpha is just some other constant from the field
|alpha - lambda| is just the difference between the two (absolute value)
it's axler, so they're probably working over R or C
thus, that expression makes sense
okay so F needs to be either R or C for |β’| to make sense lol
An inner product norm requires a notion of conjugation
Prove that for every choice of the value of a Skew-Hermition form is purely imaginary or zero
can someone please provide a solution to this?
seems good
thanks for the response. This is kind of a silly question, but after I transpose the matrix is it better to leave the constant out front or should I distribute it into the matrix?
I guess that it's better to distribute it, so that your final result is a matrix, and not just a matrix-scalar multiplication.
it's probably cleaner to leave it out, matrices with integer entries are prettier
then again in some contexts (I'm thinking probabilities, Markov chains) it's better to keep fractions in the matrix
alright thank you both so much for the feedback. And just to double check, the work and answer look correct?
Looks fine to me
they're correct, I checked
awesome thanks so much
hello I just have a question about polynomials when we say that a polynomial must contain the zero vector what does that mean does it mean that all the coefficients must be able to be equal to zero?
uh, do you mean "polynomial vector space"?
all vector spaces must contain a zero vector
in the case of polynomial vector spaces, this zero vector is usually just 0
so yes, all coefficients equal to 0
slimvesus
Yes
Hi everyone I want to double check my thinking on the following question:
For two arbitrary matrixes A and B prove or disprove that (A + B)(A β B) = A^2 β B^2
my thinking is that this is false because the middle two terms -AB + BA isn't guarenteed and most likely wont cancel out because with matrices AB, doesn't inherantly equal BA
yes
thanks
v is any vector in V
yep
We can write v = S(u) for some u
Now finish it
@thorny hemlock What'd you come up with
S^-1TSu = cu and Tv = cv
Right, (S^-1TS)u is S^-1Tv = cS^-1v = cu
So u is an eigenvector of S^-1TS
with eigenvalue c
that's all you needed to show
Can someone please help me understand why if A is an invertable matrix and AB = 0, then B must be a zero matrix
well, the only thing you have to work with is that A is invertible
what does that mean?
A^-1A = 1
left-multiply by A^-1
p
A is non zero right
A is invertible
but what property of being invertable makes it so that there exists no other non-zero to make it zero
A^-1A = I
the "idea" of invertibility is that we can always "undo" application of that matrix/transformation
right
but its very hard to "undo" something if we get it to 0
ok cool
for example
if we take 3 * 0 = 0
its very hard to "undo" that
to get back from 0 to 3
just through multiplication/division
since of course, multiplying 0 by anything gives 0
so if we have AB = 0
but we know A can always be "undone"
whereas its very hard to "undo" something that ends up at 0
we know that B must've been 0 to start
this is a very informal explanation
but hopefully that gets across the idea
that's a great explanation thanks so much. So i guess that opposite question is if a matrix is not inveratble why does that make it so it's possible that it can have a non zero matrix to get zero
since we cant "undo" multiplication by a noninvertible matrix
not in the general case at least
so that doesnt really pose issues
I kind of think of it as A has to have linearly independent vectors, and the only way you can get them to make 0 is by a linear combination with only 0s
and hence you can just come up with some examples
otherwise we could do nontrivial combinations of A to make 0
yeah mero thats a bit more formal
I wouldn't say formal, just looking at vectors
theres a hyperformal argument by looking at the algebra of square matrices and kernels of operations within them
but thats not really necessary here
thank you both so much it makes sense now
just to double check my understanding:
if A were not invertable and we have AB = 0, then we have no way have way of "dividing" it to the other side to say for certain that B must be a zero matrix?
if A is not invertible, then B might not be a 0 matrix
It's possibile for AB = 0 where neither A or B are the 0 matrix
that's what I was trying to get at, but great thanks so much
[1 0; 0 0] [0 0; 1 1]
it says prove that 3 or -3 is an eigenvalue
I think ive shown that 3 and -3 are eigenvalues ?
$T(v+w) = 3(v+w)$ and $T(v-w) = -3(v-w)$
Yes
hm
yeah i thougt so
yeah
aight good
cause in the field with two elements, -1 = 1, so that's false
so yeah, you can do that
(just, your second equation wasn't correct, but i think you have the idea)
wait
nvm
yay
np thanks
haha yep
for this problem is it enough of a proof to do a direct substitution of the variables?
my bad i forgot to factor out z at the end but is this enough of a proof or does there need to be something more?
and my bad i realized all those values should be added together right?
so z1(x1+y1) + z2(x2+y2) ...
penis
thats what u did
when theyre in rows like that theyre still considered added?
hey can anyone recommend any good yt channels for linear alegbra? (like prof leonard for calculus)
I've heard people say good things about this guy's linear algebra https://www.youtube.com/c/MathTheBeautiful/playlists
thanks a ton!
how do i find the number of row echelon matrices over a 2 element field?
not sure of the details but you could do combinatorics
its about 3x4 matrices but im unsure how to proceed
i feel like for matrices that small you could just mindlessly write em all down
it'd be a bit of a pain maybe
but it'd work
I'm pretty sure there's a smarter way but I suck at combinatorics 
just write a python program to shit them all out
that'd probably require considerably more effort than just like, doing the problem
but hey
it works
it's probably some power of 2
Q21. I am not sure why it would be x = t(q-p) + p
specifically why is the last term + p and not + q?
if you put in t = 0, you get p, and if you put in t = 1, you get q - p + p = q. however, if you are adding q and not p, then this does not happen, and you don't have a line joining p and q
well
if you add q as opposed to p, then at t = -1, you get p - q + q = p, and at t = 0, you get q
so it's not wrong
just a little weird
it's just a little nicer to have the points on the line be at t = 0 and t = 1, as opposed to t = -1 and t = 0
hmm writing them all out manually i get 12 in total
it sounds weird to me tho
ill try do it with a combinatorial route i guess
if i get the solution set x+y+z=0 from a system of equations with 5 variables, the dimension of the solution set is just 2 right
cuz its the equation of a plane
split them into cases depending on the rows
theres over 200 so probably a bit more than painful
So I just started learning linear algebra and I have no idea how to solve a systems of equations with complex numbers
I just want to know how I would begin to solve this
just do it the normal way
but do i combine real and imaginary parts?
i don't see how i can just isolate u or v normally
Kanishk
so now just work normally, remember though you are working over a complex field
@raw vault
np, I was just practicing my latex
I am self learning linear algebra
and I stumbled upon a problem.
How do I prove something is subspace of another?
Show it's not empty, closed under scalar multiplication, and closed under addition
Np
how do I do this?
You mean X=E_1 E_2 where E_1 and E_2 are elementary matrices?
nvm
I read the problem wrong
uhhhhhhhhhhhhhhhhhhhhhhhhhh
@round coral yeah kanishk
also, moonbears
yeah X as that and Y as another
but every elementarymatrix commute
ah, what was really your question, X and Y has elementary matrices, did you mean how Moonbears has written?
What about E2?
X = E1 . E2 Y = E3. E4, Let E1 commutes with E3, and E2 commutes with E4, X.Y = E1. E2.E3.E4 = E1.E3.E2. E4, I think you just need to use associativity
is this what you meant?
or do you mean E1 commutes with both E3 and E4, and E2 also with E3 and E4 ?
yeah this
wait
we can just bash this
damn thanks
yeah, it is simple , you can do that
alright I was thinking about a rigorous proof, but I am an idiot.
Like taking inverse and all, then reaching a conclusion
looks good to me
@hollow finch thanks so much. Is there a more linear algerba-y way to solve it? Like all the operations in a matrix or something?
the easiest way imo would be to get the equation of the line as L(t)=(4,5,1)+t(-3,-2,-3) (this is just L(t)=A+tAB)
you know (c,d,-5) is on the same line, so there must be a t such that (4,5,1)+t(-3,-2,-3)=(c,d,-5)
the last entry is the only one that's useful to us, and it says 1-3t=-5. so t=2. plug in t=2 to get c and d.
awesome thanks so much
i think this one is pretty straight forward, but just to double check. If I have some vector [-3,4]^T and I want its unit vector I just find it's magnitude and apply that scalar to the matrix right? So i would get |v| = 5 and then v = [-3/5,4/5]
you find it's magnitude and divide by that; you should be more precise about what you mean by "apply that scalar to the matrix"
is calc a prerequisite to linear alg
or can simple high school math be a good enough base
high alg that is... as in alg 1 & 2
ok, thank you
is it a relatively hard thing to learn or nah
like in the beginning
It's not difficult, but that's probably because I had experience with proofs
ok, thanks for your insight
{(x,y,z)βR^3/2xβyβ12z=1} is a vectorial sub-space ?
it isn't a vector space at all; it doesn't contain the 0 vector
remember that subspaces have to be closed under addition and scalar multiplication
so if v is in the subspace
then v - v should also be
but v - v = 0
so 0 must be in the subspace
but 2*0 - 0 - 12*0 = 0
not 1
so you run into an issue.
so, no.
Thank you I really appreciate it
@wintry steppe do you know how to do Gaussian elimination?
sort of but its really tricky
hi guys one doubt . a matrix B(mxn) can be invertible?
No
It doesn't make sense for a m x n matrix to have a 2 sided inverse
What would the identity be?
an mX n matrix can only be invertible when m=n, you need the map to be both injective and surjective , when it is possible?
only when the dim of domain vector space = dim codomain vector space
@wintry steppe
Are column spaces and vector spaces the same thing? Is it just that you view a column as a vector and they are two terms for the same thing?
the column space is a specific subspace of a matrix
It's defined as the span of the columns of the matrix, which by definition is just the image of the linear map it corresponds to
in particular it is an example of a vector space
essentially: the column space is an example of a vector space, but "vector space" is a much broader class than just column spaces
some other examples of vector spaces:
- R^n, C^n, Q^n, etc. for some natural number n (ie the spaces made up of vectors with n entries from R/C/Q)
- in fact, F^n is a vector space for any field, if youre familiar with that jargon
- spaces of m-by-n matrices are also vector spaces, typically denoted F^(m x n) for a field F
- the space of real continuous functions
- the space of real polynomials with degree at most 5 (or any natural number)
there are a lot more examples
row spaces, column spaces, null spaces, etc. are ways to construct new vector spaces (specifically subspaces) from a matrix
other ways to construct new vector spaces from old ones include quotient spaces and direct sums of spaces
which you might encounter later
also eigenspaces
going to have to think on the other examples for a little bit but thank you both very much - very helpful / appreciated
what do you think
why is this in #linear-algebra
because @wintry steppe
I am learning how to do subspace proofs, and I was wondering if this is valid
The zero condition is redundant
It's fine
(just take lambda=0 and some function f,do lambda f and you end up with zero function)
Yes
Thank you
@native rampart Would it be pretty much the same proof if instead of βcontinuous,β it said βdifferentiable?β
Because the class doesnβt have analysis as a prereq
ig,Better ask your teacher
literally the exact same proof would go through if you replaced continuous with differentiable throughout
or k-times differentiable
or smooth
etc.
although you have a small typo
"Let U be the set of continuous real valued functions on [0,1]."
shoutouts to my into calc class that stated the basic theorems on continuous functions, differentiable functions, etc by saying "they form an algebra"
with no further explanation
If this was on a la test,Are you supposed to prove that sum of 2 continuous functions is a continuous function,etc. Or can you just assume such things are true?
just make sure u understand everything 3b1b has if u wanna get started
essence of linear algebra
typically youd be able to assume that.
but this is the kind of thing thatd be unlikely to appear on an LA test
since it requires that prerequisite knowledge
pset sure, test probably not
this is the kind of question that floods undergrad classes 
i swear to god there's a new question like that every lecture before a test
third year complex analysis class
"do we have to prove that continuous functions preserve limits?"
I just thought about something
We all accidentally do that
Is it accurate that fourier series coefficients are a basis for the set of periodic functions?
oh ok so only form a basis of certain periodic functions but not all?
I just know periodic functions form a subspace
as long as the ratio of their periods is rational
so I assumed maybe functions with fourier series were a subspace as well
squirtlespoof
the vector space composed of vectors with $n$ entries from the field of 2 elements
Namington
the field of 2 elements typically being notated $\mathbb{F}_2$, or $\mathbb{Z}/2\bZ$, or $\mathbb{Z}_2$, or a whole bunch of other things
Namington
its the integers modulo 2
does that jargon make sense to you? or do you need further explanation
squirtlespoof
right
theres a bunch of notation for finite fields
unfortunately
youll also see GF(2) frequently
which stands for "galois field of size 2", but "galois field" just means "finite field" so
yeah
confusing notation
fortunately, for finite fields, there's only 1 field of any given size
well, 0 or 1
so theres never ambiguity on that regard
the problem is that finite fields are just so darn useful/come up so often that they were invented/reinvented like 10 times
and in somewhat different contexts each time
so we're stuck with a bunch of different notations
for the same thing
since different people coined different notations lmao
rero rero rero
squirtle
Pikachu
Yes
Well look
yeah this looks perfect
define u=Tv
and reverse inclusion follows by just changing notation
OHH
u is the corresponding eigenvector
(mero, they should treat case of zero eigenvalue also)
TSu = lambdau
yes
what makes you think what is written doesn't work for zero eigenvalue?
because zero eigenvalue results in zero vector, no?
no
yes we want v be nonzero
since axler defines eigenvector to be nonzero
thus as it is said on pic we want u = Tv to be nonzero
oh I see
the point anyway is that if 0 is eigenvalue then TS and ST are both noninvertible
so if Tv = 0 the eigenvalue is also 0
if S and T are both have linearly dependent columns, then they obviously contain a 0 eigenvalue
so assume one doesn't, call that one T so that u=Tv is nonzero
that patches it up, basically I'm saying what they say but slightly differently cause I think it's clearer this way
Solution,ig
quick question, what is the identity operator on C2
yes
and the matrix would legit just be (1,0, 0,1 ) this one rightt ?
yes
Is a non-invertible matrix the same thing as a non-reversible matrix?
What's a reversible matrix?
I guess a bijective relationship
or if given the output you can recover the original inputs
then it is the same
nonsquare matrices cannot be invertible
because if matrix has more columns than rows then domain of associated linear map is bigger (in dimension) than codomain
thus map cannot be injective
if matrix has more rows then codomain has bigger dimension and map cannot me surjective
if map is injective it will be surjective if you restrict codomain to its image
and then it will be reversible
but then it won't have nonsquare matrix
yw
if E is a vector space of finite dimension and F is a subspace with the same dimension, are E and F the same vector space?
alright, thanks!
Which should I learn first eigenvectors? Or orthogonality and the dot product
from a theoretical perspective, inclined to say eigenvectors first, because then you can build up to the spectral theorem while learning inner products
that's how it was done for me and i found it satisfying
Nice that sounds good. I've just gotten to Diagonilzation and I'm feeling a bit blindsided
What method should I use to determine for which alpha, beta and gamma the set $S = (-1, 1, 1), (\alpha, \beta, \gamma ), (1, 1, -1)$ is a basis of R^3?
rcatalang
Compile Error! Click the
reaction for more information.
(You may edit your message to recompile.)
it will be a basis if and only if the matrix formed by making those vectors the columns has non zero determinant
what about doing it algebraically? my prof told us to not use matrixes yet
in order for them to be a basis of R^3, the vectors have to have in their image the standard basis vectors
that's one way to look at it
(as if they have those vectors in their span, they subsequently span R^3 and thus form a basis)
Would this proof be valid?
@wintry turret yes
you kind of state $(\lambda x_1)^3 = (\lambda x_2)^3$ without any justification
Namington
i'd at least explain that, like
since $x_1 = x_2$, we have that $(\lambda x_1)^3 = \lambda_3 x_1^3 = \lambda_3 x_2^3 = (\lambda x_2)^3$
Namington
For the counterexample to disprove this, how would I find two vectors where the closed under addition property fails?
Like, if I didnβt know Eulerβs formula, how would I tackle this? Because (e^(iΟ/3),-1,2) + (1,1,1) can work here
@wintry turret Can you do regular algebra on x_1^3=x_2^3 to see that x_1=x_2 isn't the only complex possibility?
Does it have to do something with the conjugate @stiff frost
@wintry turret so if a^3 = b^3, say a = bu. what can you say about u
u must be 1 @shrewd mortar
Ah, yes
take $\omega$ for eg, $\omega ^3 =1$ , so a possible case can be $a= b \omega$
Kanishk
So Ο would still be 1, and so itβs still a=b then? @round coral
$\omega ^3 =1$ , $\omega \neq 1$
Kanishk
Iβm sorry, but Iβm not understanding why $\omega \neq 1$
beeswax
Oh, so am I finding the roots of $\omega^3 - 1 = 0$
beeswax
it is usually taken as $e^ {i \frac{2 \pi}{3}}$
Kanishk
hello i am trying to solve the following problem
and I am not sure, though someone told me that the summation is equal to VV^T
and i am not sure why that is the case
For scalar multiplication, would I have to pull the βscalarβ from R or from R^R?
R
So, since R^R is the vector space, weβre taking the scalar multiple from the field which it is defined? @native rampart
the vectors are functions of R^R
Right
it doesn't make sense to take scalars from R^R
Omg yeah, im dumb, thanks
This is a standard technique, but even without being in the habit of thinking about roots of unity, beeswax might have known how to factor a difference of cubes. I was just thinking $a^3-b^3=0$ so $(a-b)(a^2+ab+b^2)=0$ and when you're in the complex numbers, the quadratic factor has roots.
dirib
Any help on the following is more than welcome
Show that for any x,y,z elements of an inner product space the following identity is true:
a stochastic matrix's entries are nonnegative real numbers, since a probability in the usual sense can only be a nonnegative real number.
so I'd say yes
@native rampart , @round coral I open up z-x, z-y and the then the right part of the equations and see what happens then?
Yes
I have 2 planes:
A=0, y, z
and
B=2, pi-t+s, pi+t+s |t, s belong to R
I want to, say, know how far apart they are
how would I go about this? I can't use the normal method on account of the fact that I have no idea how to create a normal vector going from one to the other
I don't even know if they're parallel
- Can you find out whether or not they're parallel? 2. If they're not parallel, what's the distance between them? 3. If they are parallel could you make and use a normal line to figure out the distance?
Hey everyone I just want to make sure I'm solving/thinking about this question correctly. Because the two lines' direction numbers are scalar multiples of -2 that means they are either parrallel or the same line. Because their y intercepts differ for the y equation (6 vs -14) we can conclude they are parrallel
I think I messed up. Is it: they are parrallel because there is no t for (-2,6) = (1,7) +t(-2,4)
[4,-8] = -2[2,4]
so you can re-write L1 as x=[-2,6] - 2t[-2,4], then re-parameterize -2t -> s and then it's clear that both lines are parallel
thanks so much for the response. So your definition is definitely better and more formalized, but is my reasoning at least passable?
well (-2,6) as a point isnt a y-intercept
x = [-2,6] just refers to where you pick t=0 to be
but saying [-2,6] doesn't exist on[1,7] +t(-2,4) is correct isn't it?
so they're parralle because they share a slope, but not points
i got a subspace of R^4 with a basis formed by three vectors. however, when i used this basis to describe the subspace according to its linear correlations i find it has two restrictions. so shouldn't the basis be two dimensional?
Yes that's correct, but that statement alone doesnt prove they're parallel. An alternative solution is to get the equations into symmetric form, then into slope intercept form
@nocturne jewel thanks so much. One thing i'm confused about is why does that statement alone not work?
and the solutions youre talking about make perfect sense to me
cause there could be some other point where they cross
if you have 2 lines that intersect (ignoring coincidental lines), then all points except the point of intersection are different
if they share the same slope arenet they guareneed to not cross unless theyre the same line?
same slope same intercept: same line
same slope different intercept: parallel
different slope: could intersect
*skew lines in 3D have different slopes but dont have to cross
but my lines are in 2d so if they share the same slope but have a different point, can't that alone prove it?
same slope different intercept proves they're parallel
but nothing about the original lines tells you explicitly what the y-intercept is
so would my first explanation attempt be correct? Multiply by the scalar so the equations have the same direction slope and then compare the y intercepts?
If I'm given a certain line (1,2,3) how do I figure out its general equation?
that's not a line
I assume
that the (1,2,3) is supposed to start at (0,0,0)
oh wow
it's between a line and a plane
you can find the intersection point between the line and the plane, then a point of the plane and the point associated to the line from that plane, and figure out the angle easily knowing that
how do I know that the line and the plane would even intersect
for all I know they could be lightyears apart
unless the line and the plane are parallel, they will always intersect since they are infinite
can you post the
pic of the problem?
do you know how to write planes and lines using matrixes? with that you can solve a system and if there is no solution, it means they are parallel
qqqqqqqqqqqqqqqqq.pdf was already taken
lmfao
i got a subspace of R^4 with a basis formed by three vectors. however, when i used this basis to describe the subspace according to its linear correlations i find it has two restrictions. so shouldn't the basis be two dimensional?
so how, I've found the intersection between the line and the plane, what now?
you can get a line that is perpendicular to the plane that passes through a point of the original line
I tried using this guy's idea of expanding an normal line then finding the angle between the two lines but it didn't work
An alternate formula is discussed to find the angle between line and plane.
with that you can get the intersection of that line with the plane
ah yeah i was trying to tell you that
why didn't it work?
cause the anwser is wrong
I got the normal line right
extended from P
n=(1,1,sqrt2)
then I used costetha=n o r / | |n| | * | |r| |
and that gave me 22.5 degrees
90-22.5=67.5 which is nowhere near any of the options
I double checked all of the math and it's alright
I assume that I should've compared n to something else?
he mentions an "m" in that video, idk what that is so I just compared it to r
like I did in the previous exercise
do I have to compare the angle between n and m?
I guess that's what I did wrong
what is the m of that r?
I don't get this slope thing
hold on, are we talking about his exercise or mine?
well it's the same problem
but the way his line is written is weird
it's in a different way which I don't understand
which is why I chose to try and ignore the m bit and try and carry on just comparing it to the line itself
well as long as you can find the vector of your line
so m is the vector of the line?
in this case yeah
what is the difference between a vector and a line?
the vector of a line is essentially an arrow that points where the line is going
yeah that's why the vector points where "it's going"
imagine the x axis
the vector of the x axis is just (1,0)
and the line?
depends on how you write it, usually y=0
christ in heavens
the line is infinite
and straight
so it passes through wherever it passes
what is the purpose of the vector?
without it you can't know where the line is going
how are you supposed to know for example where y=2x+3 is going intuitively?
but you can get the vector and understand it quickly
and how do I get the vector from a line?
it depends on the notation, honestly the notation you're using is pretty weird for a geometry class. i assume you're doing a linear algebra one?
and haven't they taught you about vectors yet?
they probably have
I just didn't understand it
I mean, not prolly
they have
isn't that notation just the general equation?
if you want to dm me your notes, i can read portuguese
CatalΓ‘?
i speak it yeah
so i can figure out the notation you're using
and its just numbers anyway
cause it seems weird to me
oh yeah
that's the equation for the plane huh
I think that we're supposed to assume that the line starts at 0,0,0
does that help ya? Cause my notes sure ain't
although I do appreciate the offer
i would ask someone else who is familiar with the notation
but once you figure out how to get the vector you can do it easily
well thanks for all the help
try pinging a helper or smth
If the normal to the plane is n=(1,1,sqrt2), what did you use for r to end up with 22.5 degrees?
I think you just did some arithmetic wrong
Oh, you're offline. But I think you had the right method and just messed up the calculation a bit
do you know how to represent |+> or |-> in the |0>, |1> basis?
how do you define |+> and |->
well unless it says somewhere earlier in your book/notes then you have no chance of answering it
this is true in general
if someone gives you random symbols and doesn't tell you what they are, you can't do anything lol
go back to your notes and book to check to be sure
doesn't sound quite right
it's a vector, written in a different basis so you gotta invert the change of basis matrix that they've essentially given you here if you want to write |phi> in terms of it
think of |0> and |1> as being the column vectors (1,0) and (0,1)
they're not complex numbers
so does this mean you have reached an answer, can you show your work
I don't really know what you're talking about unless I see it
@stoic jungle don't dm me just post it here
yeah, what happened
can you explain your reasoning here for the second equals sign
looks like you sorta put |psi> there but divided by sqrt(2)
but that's not right
can you use this to write the 2x2 change of basis matrix?
yes
this |phi> is represented in the |0>, |1> basis
so in order to change basis you have to know the change of basis matrix
like I said here, think of constructing the 2x2 matrix by thinking about how these vectors get transformed
I'll help you get started $$\begin{bmatrix} a & b \ c & d\end{bmatrix} \begin{bmatrix} 1 \ 0 \end{bmatrix} $$
Merosity
we want to multiply this vector |+> by this to get a linear combination of |0> and |1> states, what do the entries have to be
Im trying to close this one out, and I was wondering how I would get the contradiction that v is an element of U1.
what you have is this
you need to use this to find the change of basis matrix
it doesn't matter which way you go
if you have one direction you can just invert the matrix to go the other way
you seem a bit too unfamiliar with linear algebra to be doing this, you might have to go back to study linear algebra more
maybe it helps if I show you two equivalent notations, a|0> + b|1> is the same as the column vector (a,b)^T
I could drag you through and hold your hand every step of the way, but I don't feel like you're putting in enough effort
@wintry turret so you want to prove that union of two subspaces is a subspace , right?
Right
if so, that is not true always, union of two subspaces is not always a subspace, take for eg. the vector space R^2 , take two dim 1 subspaces span(1,0) and span(0,1), (1,0) +(0,1) = (1,1) which does not lie in span (1,0) U span (0,1)
@wintry turret
So the first prt is invalid then
yes, the first part of your proof is wrong, where is it wrong, I will leave you to think about it
I see it now, thank you @round coral
But for the second part, Iβm not quite sure how to close it
think of it like this, the counterexample I gave just now, how to make it up, you see the problem , their intersection is {0} , what I can do to make U_1 U U_2 a subspace, it is when one is a subset of the other, so this problem won't arise, that is what they are asking you to prove @wintry turret
once you see this, get the idea, you can prove it quite easily
Prove that $\mathbb{Z}$ equipped with $+$ and $\times$ from $\mathbb{Q}$ is not a vector space.
moshill1
The solution in the note says that addition is fine, but im kinda confused on why
I think it's cause $\mathbb{Z} + \mathbb{Z} \to \mathbb{Z}$ (namely the sum of 2 integers is an integer)
moshill1
Yeah, wasnt sure cause the prof only wrote "addition is fine"
Well, if you want to show its not a vector space, you can just show one axiom is false. So you don't really have to address those which are true
Im not actually showing it it's a worked example in the notes, i just wasnt sure exactly on why addition was fine
since both Q + Q -> Q and Z+Z->Z
Do you understand now? "Addition is fine" just means all the addition axioms hold
Yes
i got a subspace of R^4 with a basis formed by three vectors. however, when i used this basis to describe the subspace according to its linear correlations i find it has two restrictions. so shouldn't the basis be two dimensional?
too vague to know what you mean by restrictions
Essentially I had $F = <{(1,1,1,1), (0,1,2,-1), (2,1,0,3)}>$. When I tried to write the system according to the equations that restrict it I got two of them, $x-2y+z=0$ and $2x-y-t=0$. These are the solution to the problem but since the basis is three-dimensional, wouldn't one expect only one of these restrictions and not both?
rcatalang
Can anyone explain why it is the above diagram which is more correct? f is a linear function which has eigenvectors, v1,v2,v3. B which represents f according to the basis v1,v2,v3 for both the domain and codomain does not commute P^1B! =/= AP, which is first converting from v1,v2,v3 to the standard basis, then applying the transformation A, which represents f with regards to the standard basis for the domain and codomain.
So basically I'm giving this function here, and I can see from the form of it that its eigenvectors are v1...v3
Shouldn't it be <x,v_1>?
why should it be that?
nvm
i don't think it matters, it's a function is from R3->R3
yeah in r^3 it's symmetric
but if i wanted to represent f as a matrix, B, according to v1..v3 as the basis for both the domain and codomain, then it isn't represented in the relation P^1B = AP, which i think is bizzare
P is identity from v1..v3 to e1..e3
identity transformation
okay if you look at the lower diagram, if i wish to go to the upper right corner, i can apply P first then A, or B first then P inverse
but that's false!
oh sorry
oh wait a sec
no it's not the same because $AP=(f(\mathbf{e}_1), f(\mathbf{e}_2) , f(\mathbf{e}_3)) (\mathbf{v}_1 , \mathbf{v}_2 , \mathbf{v}_3) $
huh mathbot not working
$$AP=(f(\mathbf{e}_1), f(\mathbf{e}_2) , f(\mathbf{e}_3)) (\mathbf{v}_1 , \mathbf{v}_2 , \mathbf{v}_3) $$
init0
imagine that i'm representing columns here
$$AP=(f(\mathbf{v}_1) , f(\mathbf{v}_2) , f(\mathbf{v}_3))$$
init0
then you agree with?
if you agree with that, then consider
$$ B = (f(\mathbf{v}_1) , f(\mathbf{v}_2) , f(\mathbf{v}_3)) = (\mathbf{v}_1 \lambda_1, \mathbf{v}_2 \lambda_2, \mathbf{v}_3 \lambda_3)$$
init0
but then
$$PB= (\mathbf{v}_1 , \mathbf{v}_2 , \mathbf{v}_3) (\mathbf{v}_1 \lambda_1, \mathbf{v}_2 \lambda_2, \mathbf{v}_3 \lambda_3)$$
init0
which for sure isn't
$$$
$$(\mathbf{v}_1 \lambda_1, \mathbf{v}_2 \lambda_2, \mathbf{v}_3 \lambda_3) = (f(\mathbf{v}_1) , f(\mathbf{v}_2) , f(\mathbf{v}_3)) = AP \neq PB= (\mathbf{v}_1 , \mathbf{v}_2 , \mathbf{v}_3) (\mathbf{v}_1 \lambda_1, \mathbf{v}_2 \lambda_2, \mathbf{v}_3 \lambda_3)$$
nah the vs are eigenvectors for f
init0
i calculated it
they are orthogonal
sorry my mistake
yea
hmm
nah PB just gives
it seems that AP actually gives B
i think it has something to do with the fact that they are eigenvectors or something?
how can i find the sum space? the intersection space you can find defining the space that has all of the restrictions of the two, but what about the sum?
<@&286206848099549185>
yeah exactly
Where can I find a proof
Proof of what?
How the matrix is diagonal
Take the eigenbasis
2x2 determinant, picture proof, anyone want to help me break this down. I'm having a hard time
honestly I'd just construct my own proof with triangles than try to decipher this
nice I think that was actually easier lol
π
$\mathcal{L}$
Namington
it's calligraphic L
thanks
Why doesn't row replacement change the value of the determinant?
what do you mean by replacement
scaling one row and adding it to another row, and then replacing the original row with this row
Follows directly from the definition of determinant
geometrically you can think of it like shearing the shape, it doesn't change the volume
is that the recursive cofactor definition @native rampart
I mean the multilinear one
- not sure what {inf} means, since infinity isnt a number
- how is scalar multiplication addition
- min() means just take the smaller one?
infinity is just a new element we "add" to R that satisfies min(x, infinity) = x and x + infinity = infinity for all x
- how is scalar multiplication addition
why can't it be? as long as it satisifes the axioms [does it?] it's fine- min() means just take the smaller one?
yes
Oh so multiplication is now just "operation"
Oh so multiplication is now just a word for an operation
Like multiplying numbers doesnt have to be a * b = ab, it could be a * b = a^b for example?
Ok so ik T isn't a vector space bc if I pick v in T such that v<0, no additive inverse exists
I'm confused as to how the set of all convergent sequences on some range can form a vector space. Isn't one of the requirements to be a vector space to have the zero vector which is not the same as the number zero?
My understanding is that since sequences are functions, you could have a sequence map to the zero vector, which would satisfy that condition. What confuses me is that I thought in order to be a convergent sequence, you had to map to values on the number line like the number 0 itself instead of a set
the zero vector is the zero sequence 0, 0, 0, 0, 0, 0...
assuming you're defining addition the standard way.
isnt the property that for all v in the vector space, there exists an element w such that v+w=0
youre not mapping anything to vectors, the sequences THEMSELVES are your vectors
they might not "look" like conventional column vectors
but that doesnt matter
the sequences (ie functions N -> your set) are vectors
ahh that makes sense - ty. In my mind I was including the limit and thinking of the value for that instead of the sequence tiself
if w < v < 0 then min(v,w) = w != 0, so v doesnt have an additive inverse
im confused lol
so are scalars vectors now?
Cause you're saying a real number is a vector
Fields form a vector space over themselves
right, so why isnt 0 the additive inverse if V is the real numbers?
so then there isnt an additive identity...?
ok let me think about this
yeah but for T to be a vector space, dont all elements of T need to have an inverse
the additive identity for T is a vector x such that min{v,x} = v ?
so there can be multiple x per v?
okokok so if i find x st min{v,x} = x, ive shown the property fails?
wait no
that just means v is identity
OH
identity is infinity
cause inf is bigger than any v in T
"no additive inverses" but inf is an additive inverse.. so how are there none?
identity is inf
inverse of v is w st min{v,w} = inf?
which only holds if v and or w are inf
Hi guys is anyone familiar with inner products with integrals ?
so only inf has an inverse which means the property fails
since all v in T need to have an inverse
ok got it
(famous last words)
1st week back from break: let's warp your mind with 0 addition and multiplication
it also doesnt help that the words with typical definitions like real numbers, addition, multiplication, etc get abstracted into this
as you saw with me wrapping my head around "real numbers being vectors"
Anyone have good proof/intuition for how the definition of cofactor expansion satisfies the properties of the determinant as a function
I just read through my books proof and still feeling lost
Anyone know about real/hermitian inner products <u,v>
@rare hazel can you be more specific? what's your question?
should be just computing the integral
How would you prove this
@tacit storm prove that if phi is a bijection then v1..vn is a basis, then the other way around
surjective?
contradiction
when dim V is finite, ||the rank nullity formula holds, implying surjectivity||
no clue mate
do you know what the rank nullity formula is?
yes
ok, so write it down in the case that T is injective
is the kernel 1
the kernel is trivial
yes
so then what does rank nullity formula say
im not sure
you know what the formula is, right?
nullity V + rank V = dim(v)
nullity T + rank T = dim V.
yes
nullity is 1
0
so the nullity of T, when T is injective, is?
0
rank T = dim(V)
thank you brother
π
are you a student
yes
what year?
another way to phrase it is: if T is injective but not surjective, and V is finite-dimensional, then T(V) is a proper subspace of V with the same dimension as V, contradiction
3rd
well showing it's a linear subspace is pretty simple using $\alpha P[x] + \beta Q[x] \in V$
rcatalang
when it comes to a basis you need to think about what's special about this subspace?
it's an even function
as in all polynomials from V have to be even
ohh the last part you mean
what is a good example of a linear map which in surjective but not injective
f: R^3 -> R^2 ; f(x,y,z) -> (x,y)
thanks brother
injective linear maps are inclusion maps and surjective linear maps are projections

all linear maps are just inclusions or projections 
ngl the third part is pretty hard
unless there's a trick to it i ain't seeing
which might be the case
Thank you guys, Yh the last part is tricky itβs one of those where it can either take 10 mins or 10 hours
Also what would be the correct basis for V ??
How would you prove this
Thank you appreciate it
simply using the canonic basis, a set of size n+1 could be: (1,0,0...0), (0,1,0...0),...,(0,0...,1),(1,0,0...,0)
the first and last vectors are the same
ergo it is linearly dependent
however, without it you just have the canonic basis of R^n which is by the definition of basis, linearly independent
and it's also the "general" basis for any R
that wouldn't work, because any subset containing the first and last vector wouldnt be linearly independent
ohh shit you're right!
but, if you make that last vector something with all components nonzero, it should work
yeah just make it (1,1,1...1)
TTerra
maybe that will help 