#linear-algebra

2 messages ยท Page 111 of 1

ocean sequoia
#

idk how else you would answer that its kinda yes or no XD

half storm
#

Yea lol. I don't think I could have given a different answer.

ocean sequoia
#

i was trying to use a property maybe to solve something dont worry thats not the 'real'question

half storm
#

Got you.

ocean sequoia
#

thanks

half storm
#

No problem. As a side note, a vector space is finite dimensional if there exists a finite set of vectors that spans the space.

ocean sequoia
#

ah that makes sense so its only infinite if there is not a finite set

#

and in this case m vectors would span the space

half storm
#

Yup.

#

The standard basis with 1 in the first coordinate then all zeros, 1 in the second coordinate all zeroes etc.

#

Any vector space that is a finite cartesian product of a field is a finite dimensional vector space.

median forum
#

wait

#

what is F here?

#

a finite field?

half storm
#

I assumed that it was an infinite field. He didn't specify.

#

I was wondering that.

#

I don't think it would though.

pallid rampart
#

Well it doesnโ€™t matter

#

As long as F is a field

#

F^n is an n dimensional vector space over F for any field F

half storm
#

Yea because if you're assuming that vector addition and scalar multiplication are defined in the way that you would usually define them, then I was thinking it shouldnt

#

yea

torpid horizon
#

hi

#

can someone help me here

#

on a question

half storm
#

I can try shoot.

torpid horizon
#

im not sure how to do numbers 10 and 11 but for 10 I got the answer B

#

thisis the given

#

here are questions 10 and 11

#

it's multiple choice

half storm
#

You're gonna have to type some of this out

wintry steppe
#

um do you have the pic of the original problem

half storm
#

Or that

median forum
#

this writing is as bad as mine

#

yikes

wintry steppe
#

ok look I'll try to translate

#

nevermind, bad idea

median forum
#

Find the change of basis matrix $C = C_b$, B_2$ that changes $B_1$ coordinates into $B_2$ coordinates :

stoic pythonBOT
median forum
#

something like that

torpid horizon
#

yes

#

that what it says

#

so it says....

wintry steppe
#

@torpid horizon what is B

torpid horizon
#

for option b?

#

on 10?

wintry steppe
#

no

#

i mean the problem

#

oh nvm

#

didnt see the other pic my bad

#

well think about it

#

how do you turn (3,1) into (1,1) and (2,1) into (1,2)

#

essentially, you are mapping 3x to x, y to y for the first vector

#

and 2x to x and y to 2y for the second vector

torpid horizon
#

so the instructionssay B sub 1 = (3 1), (2 1) ) and b sub 2 = .....and let h = R ^2 map onto R^2 be linear such that h (3 1) = ( 1 ) and h (2 1 ) = ( 1 2 )

wintry steppe
#

and thats exactly what a matriix represents

#

so we want to find a matrix A such that (3,1) maps to (1,1)

torpid horizon
#

so is the answer to 10 letter B?

wintry steppe
#

and also maps (2,1) to (1,2)

#

why are you rushing

#

you asked for help so im trying to explain

torpid horizon
#

yes go ahead

wintry steppe
#

so lets say A is a 2x2 matrix containing column vectors (a,b) and (c,d)

torpid horizon
#

ahuh

wintry steppe
#

we know A * (3,1) = (1,1)

torpid horizon
#

ok

wintry steppe
#

just a note: (3,1) and (1,1) are column vectors here

torpid horizon
#

ok

wintry steppe
#

so compute the matrix multiplication

#

and tell me what u get

torpid horizon
#

so which am i multiplying?

wintry steppe
#

we have A * (3,1) = (1,1)

#

where (3,1) and (1,1) are vectors in R^2

torpid horizon
#

ahuh

wintry steppe
#

and A is made up of the column vectors (a,b) and (c,d)

#

so multiply that out

#

our goal is to find a, b, c and d

torpid horizon
#

so do i multipl both?

wintry steppe
#

just multiply

#

A * (3,1)

torpid horizon
#

what is A here?

wintry steppe
#

its [(a,b), (c,d)]

#

(a,b) is a column vectors

torpid horizon
#

( 3 a + b 3c + d)

wintry steppe
#

and that = (1,1)

#

so 3a + b = 1

#

3c + d = 1

#

now lets do it for the other vector

torpid horizon
#

ahuh

wintry steppe
#

so A * (2,1) = (1,2)

#

same idea

torpid horizon
#

so after i write ......3a + b = 1

#

3c+ d = 1

wintry steppe
#

multiply A * (2,1) = (1,2)

#

we r gonna have 4 equations after this

torpid horizon
#

ok let me see

#

i got...

#

2a + b = 1

#

2c + d = 2

wintry steppe
#

great

torpid horizon
#

so what would i do next

wintry steppe
#

so 1 = 2a + b = 3a + b

#

so b = 1-2a

torpid horizon
#

ahuh

wintry steppe
#

=> 3a + 1-2a = 1

#

=>a = 0

#

=> b = 1

torpid horizon
#

ahuh

wintry steppe
#

now for c and d

#

2c + d = 1 + 1

#

= 1 + 3c + d

#

so 2c + d = 1 + 3c + d

#

=> d = 1 + c + d

#

=> 1 + c = 0

#

=> c = -1

#

now for d, we know 2c + d = 2

#

so d = 2 - 2c = 2(1-c) = 2(1-(-1)) = 2 * 2 = 4

#

so we have (a,b) = (0,1)

#

and (c,d) = (-1,4)

#

so our transformation matrix A = [(0,1), (-1,4)]

#

where each vector in () is a column vector

torpid horizon
#

ahuh

#

so that's the answer to 11 which is letter C?

#

did i do #10 correctly i got the answer was B

wintry steppe
#

well what did u do for 10?

torpid horizon
#

i did this....

#

i got B?

soft tundra
#

Is the answer to c that the error vector must be orthogonal in order to be the shortest distance to b?

torpid horizon
#

how would i find the lipshitz for #14?

half storm
#

@soft tundra Yea

soft tundra
#

ty ๐Ÿ™‚

torpid horizon
#

can someone please help me

rigid cypress
#

gimme a sec

#

where's the question exactly

#

@torpid horizon

torpid horizon
#

im stuck on these last two

#

it says if S = <v1 , v2, etc) is a linearly dependent subset of V then V sub j element of S such tht span S = span (S, (vsubj))

#

true or flase

#

i said True

rigid cypress
#

think about what linear dependence means

torpid horizon
#

ahuh

#

so is it false then

#

idk

rigid cypress
#

here

torpid horizon
#

means it equals 0

rigid cypress
#

it could be true or false

#

so think about it like this

#

if i gave you a 3d vector space V

#

and then a subset S = {(1, 0, 0), (2, 0, 0)}

#

the values of S are linearly dependent right

#

but is there a vector you could add to S to make it span V

torpid horizon
#

so it doesnt mattter?>

rigid cypress
#

?

#

what im saying by "it could be true or false" is that i wont give you the answer

torpid horizon
#

so meaningless?

#

how about for 20

#

#20

rigid cypress
#

???

#

i didnt say it's meaningless

torpid horizon
#

i mean question #20

#

i just said true

half storm
#

is that $ S \textbackslash {v_j } $

torpid horizon
#

yes

rigid cypress
#

i was talking about 19

#

i cant read 20 tbqh

half storm
#

fuck it I can't Tex it but Im' assuming it's S take away vj

#

But @rigid cypress is right. You have to think about what it means for a set to linearly independent and what exactly is the "span of a set of vectors".

ocean sequoia
#

do you know what a direct sum is?

torpid horizon
#

not really

ocean sequoia
#

what does it mean to span a space?

torpid horizon
#

tht all vectors fall within that space

ocean sequoia
#

also i cant read the question so im going off the help

#

can you be a bit more specific

half storm
#

That second problem that you listed, the most I can make out of that is that f is a linear map from V into W and that B_1 is a basis for V and that B_2 is a basis for W

#

I can't figure out what the rest is trying to say.

torpid horizon
#

yeah my teaches writing kinda bad

#

which part was it

ocean sequoia
#

is that it?

torpid horizon
#

yes

cursive narwhal
#

Let $S$ be a linearly dependent subset of $V$. Since it is linearly dependent, there exists a vector in it, call it $v_j$, such that $v_j$ can be written as a linear combination of the other vectors in $S$. So, it is the case that:

$$span(S) = span(S \setminus {v_j})$$

stoic pythonBOT
cursive narwhal
#

@torpid horizon

half storm
#

\setminus cool.

torpid horizon
#

yes

#

thats the question

cursive narwhal
#

I've given you the answer

ocean sequoia
#

i dont even understand what the question is

cursive narwhal
#

The statement given to you is true.

#

I mean, as I understand it, it holds.

ocean sequoia
#

is it just asking if you can make S linearly independent?

#

or that if you remove a vector V_j it doesnt change the span?

torpid horizon
#

yes

half storm
#

the second one.

torpid horizon
#

yes

#

i said true as well

half storm
#

That is the correct answer.

torpid horizon
#

number 20 im not sure what the answer is

#

but i wrote

ocean sequoia
#

that is true do you understand why?

rigid cypress
#

do you think 19 is true

torpid horizon
#

C

#

i kind of understood it

#

and for 19 i wrote true

rigid cypress
#

we're not going to give you any direct solutions

torpid horizon
#

im just trying to understand the problems

#

because it talks about spans

ocean sequoia
#

@torpid horizon hang on lets do one at a time

#

what is a span

torpid horizon
#

okie

ocean sequoia
#

it seems likeyour def is weak

torpid horizon
#

span is where you have vectors that fall within a coordinate plane

ocean sequoia
#

no

torpid horizon
#

no?

ocean sequoia
#

no

torpid horizon
#

i saw a vid maybe i misunderstood

ocean sequoia
#

i think you did

#

it happens this stuff can be confusing the first time you go over it

torpid horizon
#

omg yes

half storm
#

The definition you gave is a sufficnet way of viewing the span of two vectors in R^2; But there is a more general definition, and it is the one that you will almost always want to refer to.

dire thunder
#

span is set of all linear combinations of vectors

half storm
#

^

dire thunder
#

i mean in R^2 it is plane

#

but generally it is not

ocean sequoia
#

do you know what a linear combination is

cursive narwhal
#

there are a grand total of 3 people helping out and it's not very useful

#

two of you need to back off

dire thunder
#

correctly would say if n >= 2 and you have exactly 2 independet vectors you will get plane

#

hi vats

half storm
#

Yea I'll leave this to you guys.

#

I like answering questions because it helps me know that I understand the material.

#

But I don't mind.

ocean sequoia
#

same but ill back off for the same reason

#

you are right vats

torpid horizon
#

ahuh

#

every feedback helps

#

since im lost lol

#

so dont worry if u guys know a lot

#

enlighten me

#

lol

wintry steppe
#

@soft tundra yes

#

must be normal to the plane by definition

cursive narwhal
#

pixie, do you know what a vector space is? Can I assume a basic level of knowledge from you?

torpid horizon
#

yeah i just started the course

cursive narwhal
#

Because right now, I'm just going to give you the abstraction straight up and you have to grapple with it.

Let $(V,+,\cdot)$ be a vector space over $\mathbb{F}$. Let $S$ be a list of vectors $S = (v_1,v_2,\ldots,v_n)$. So, this is a list of $n$ vectors from the vector space. We're not saying anything more about them. Then, I will define the following set:

$$span(S) \coloneqq {\sum_{k=1}^{n} \alpha_k v_k: \alpha_k \in \mathbb{F} }$$

This is the definition of the span of $S$. It has geometric meaning when you're talking about $\bR^3$ or $\bR^2$ or even $\bR$. But here's the abstraction.

stoic pythonBOT
cursive narwhal
#

Simply put: the span of a list of vectors is the set of all possible linear combinations of those vectors.

torpid horizon
#

ah

#

ok

cursive narwhal
#

Does that make sense? So, for instance, suppose that $V = \bR^2$ and I'll define $S \coloneqq ((1,2),(1,3))$. If this is a vector space over $\bR$, then $span(S)$ consists of vectors of the form:

$$\alpha \cdot (1,2) + \beta \cdot (1,3) = (\alpha+\beta,2\alpha+3\beta)$$

with $\alpha,\beta \in \bR$. That's the general form of the vectors that will lie in my span.

stoic pythonBOT
cursive narwhal
#

Linear Algebra can be a bit tricky if you're just starting out with it and haven't been exposed to proofs before. I don't recommend using videos to learn it. Use books instead.

dire thunder
#

any math can be a bit tricky

torpid horizon
#

yeh i feel like LA is hard or me

#

diff eqns not so much

wintry steppe
#

i personally enjoyed LA more than diff eq

torpid horizon
#

im the opposite

#

lol

#

thank u guys for ur help

cursive narwhal
#

Have a look at Klaus Janich's Linear Algebra textbook. You can use the linear algebra lecture notes by E. Kowalski as a supplement

torpid horizon
#

oh ok

#

is it free

dire thunder
#

lib

#

gen

cursive narwhal
#

The lecture notes are freely available (Just search up Linear Algebra lecture notes by E. Kowalski). Getting a copy of Janich's text will cost money but you can use libgen

torpid horizon
#

ah ok ill look right now

half storm
#

Linear Algebra is definitely a class that introduces you to the idea of abstraction. A Diffy Q course will generally give you some nice physical examples to see how the occur and get some good intuition of the information they convey.

#

Also, DE taught at the undergrad level is fairly algorithmic.

#

You recognize a certain type of problem and there is a procedure that you follow to solve it.

#

Linear algebra is more about thinking about the structures are and how they are related to one another.

median forum
#

not pdes

#

odes are

half storm
#

Yea PDEs delves more into the theory

#

I kind of wish my professor delved more into the theory about DE. DE and linear algebra probably should be taken in the same year, or you should try to take them concurrently.

#

There is obviously an extensive amount of theory for ODE's but generally it is not discussed.

#

not at undergrad anyways.

#

You do get some of it though. Most of my ODE's class was filled with theorem statements that could be pretty hard to grapple with and most of the theorems are generally not proved because you need a course in analysis and LA to really understand them.

cursive narwhal
#

John, where did you do your undergrad?

#

(Just curious haha)

half storm
#

At a liberal arts college.

#

I can't really tell you cause it's a small school and I might dox myself. Sorry ๐Ÿ˜ฆ

cursive narwhal
#

It's fine, it's fine

median forum
#

gl proving frobenius LULW

half storm
#

I'm mostly speaking from my own experience, but I've heard similar stories from my friends who went to other schools.

cursive narwhal
#

it's a bit different where i'm studying but maybe that's because the culture for math in my school is a bit different

half storm
#

Yea, I kind of wish I went to a university. I think it would helped me in some ways. I wasn't a great student. At least not my junior and senior years of college. I did pretty well first two years.

torpid horizon
#

im looking at the

#

resources u posted

#

ty

#

i appreciate everyones help here

#

idk if u guys are still online

#

but ty

ivory basin
#

i need help on part c of this problem

#

i know axiom 7 or K(u+v)=Ku+kv is the axiom that fails but i dont get why

half storm
#

@ivory basin In order for V to not be a vector space, it has to be the case that there exists a k in our field of scalars - which is implied to be the real numbers in this case - such that Axiom 7 doesn't hold.

#

What I'd recommend you do, is consider both expressions on each sides of the equality seperately, and consider what k has to be so that they are not equal.

#

Does that make sense?

ivory basin
#

but when i think of both sides as seperate expressions i still cant think of any k scalars that break the axiom

half storm
#

Alright, I'll actually work through it.

half storm
#

Hmmm, I checked out Axiom 7 and it seems to work out ๐Ÿ˜ฎ

#

Of course, we could both be doing it incorrectly

#

How do you "know" that it is Axiom 7 that is the issue?

ivory basin
#

im not sure either my friend said he asked his tutor and the tutor said axiom 7 failed

dusky epoch
#

which axiom do y'all number 7

half storm
#

scalars distirbute over vector addition. If k is a scalar taken from a the field F and u and v are vectors in V, then K( u + v ) = ku + kv.

#

That's the one her is referring to.

#

But it seems to check out to me.

#

There is another axiom that deals with distributivity. Basically it's distributivity over scalar addition

#

so if k and l are scalars from a field F and v a vector in V , then (k + l) v = kv + lv

#

Did you consider checking that property?

#

That could possibly be the axiom that isn't satisfied.

ivory basin
#

this is what my friend sent me and said this is the right answer

#

but it doesnt look right to me

half storm
#

Well they kind of just skipped to saying $ ku \oplus kv \neq k ( u \oplus v ) $ but they didn't verify that.

stoic pythonBOT
half storm
#

When you went to verify it yourself. You saw that this is actually a true statement. I verified for myself as well. It seems to hold - thought of course we could both be doing it wrong.

#

I have a feelling though that the other distributive property may not hold.

dusky epoch
#

ku + kv = (ku1 + k - 1, ku2 + k - 1) + (kv1 + k - 1, kv2 + k - 1) = (ku1 + kv1 + 2k - 2 + 1, ku2 + kv2 + 2k - 2 + 1)

#

it does hold

half storm
#

That's what we both got.

#

So their tutor is wrong.

#

Give me a sec to check the other distributive property.

ivory basin
#

so then which axiom is the one that fails because i tried them all

#

unless i did one wrong

#

i did all the axioms and it looks like it is a vector space but the question says prove that V isnt a vector space so idk what to do

half storm
#

I'm checking and its looking like a vector space to me lol

ivory basin
#

thats what i think but idk why my teacher phrases the question as prove its not a vector space

dusky epoch
#

okay so you know what might be helpful

#

expressing the operations in terms of the "classical"/standard addition and scaling on R^2

#

letting z = (1,1) and (+) and (*) be the new operations, we have
u (+) v = u+v+z
k (*) u = k(u+z) - z

#

(k + l) (*) u = (k+l)(u+z) - z
k (*) u (+) l (*) u = k(u+z) - z + l(u+z) - z + z = ku + kz + lu + lz - 2z + z = (k+l)u + (k+l-1)z

#

hm

noble hemlock
#

Over a commutative ring, why is the trace of a square matrix the sum of its characteristic eigenvectors?

dusky epoch
#

it's not

#

did you mean to ask why the trace of a matrix equals the sum of its eigenvalues

noble hemlock
#

yeah that's what I meant sorry @dusky epoch

dusky epoch
#

i believe you might wanna assume its charpoly actually factors over your ring

noble hemlock
#

yes

#

Assuming that, how do I go about proving it? @dusky epoch

dusky epoch
#

leibniz formula for the determinant i guess

#

and also vieta's formulas

noble hemlock
#

how

zealous widget
#

how can I show that if $n$ projection matrices $P_{1}$ up to $P_{n}$ of dimension $n \times n$ sum to $I$ then (assuming these projection matrices are for projecting onto lines), then these independent line vectors $a_{1}$ through to $a_{n}$ are orthogonal?

dusky epoch
#

so $P_i$ is the projector onto $\ang{a_i}$?

stoic pythonBOT
zealous widget
#

Yes

#

correct

dusky epoch
#

(btw it's $n \times n$)

stoic pythonBOT
noble hemlock
#

Is the adjoint of an orthogonal matrix also orthogonal?

zealous widget
#

oh OK thanks

stoic pythonBOT
zealous widget
#

question edited

dusky epoch
#

right so
it seems to me like if we assume the $a_i$ are of unit length (normalizing otherwise to make it the case), then $P_i = a_ia_i^T$

stoic pythonBOT
zealous widget
#

hmmm

dusky epoch
#

(@noble hemlock yes)

zealous widget
#

my algebra textbook taught me that it should be $P_i = \frac{a_ia_i^T} {a_i^Ta_i}$

stoic pythonBOT
noble hemlock
#

can you show why? @dusky epoch

dusky epoch
#

@zealous widget yeah i normalized the a_i to have length 1

zealous widget
#

oh yeah good point

dusky epoch
#

@noble hemlock A^T A = I implies A^T (A^T)^T = I

noble hemlock
#

what's A^T?

zealous widget
#

transpose

gray dust
#

transpose of A

noble hemlock
#

ah okay that makes sense

#

thanks

dusky epoch
#

hm ok so

#

$\sum_{i=1}^n a_ia_i^T = I$

stoic pythonBOT
dusky epoch
#

hmm

zealous widget
#

I tried a clunky method of adding all the fractions

dusky epoch
#

hold up.

zealous widget
#

tryna find some cancellations

#

didnt work

#

take your time

#

no rush lmao

dusky epoch
#

ok no nvm.

#

i might need to rest for a bit

zealous widget
#

so we'll do this later then?

dusky epoch
#

maybe?

zealous widget
#

sure thing

#

rest is more imporrtant than my q

#

so go and do whatever :D

#

@dusky epoch nevermind did it myself with my clunky fraction method and some tweaking

#

thanks for the help though

#

was greatly appreciated!

#

actually

#

wait

#

no

#

i didn't do it

#

nvm

onyx comet
#

does ayone have advanced knowledge for la?

real stirrupBOT
#
Rule 1

The help channels are solely for help with math, so feel free to post your question. Asking whether you can ask a question or if anyone knows about some specific topic is unnecessary, so please try to avoid questions of that nature.

modern palm
#

how do you prove that any line through the origin in R^3 is a subspace?

#

specifically that it is closed under addition

half storm
#

Well a line is given by a vector equation right?

#

something to this effect

modern palm
#

yes

half storm
#

$$ L := r(t) = <a_1 , a_2, a_3> + t<b_1,b_2,b_3> where t \in \mathbb{R}$$

stoic pythonBOT
half storm
#

In order to show something is a subspace, you need to show that 0 is contained in the set

#

that for any two points in the set that their sum is in the set.

cursive narwhal
#

\langle, \rangle

modern palm
#

yep

half storm
#

and that it's closed under scalar multiplication.

modern palm
#

thats what I learned, makes sense

half storm
#

o.k. so we'ere considering that the line is passing through the origin it follows there exists a t_0 such that r(t_0) = 0

#

i.e. the zero vector.

#

This is by assumption of our supposed line.

#

Does that make sense?

modern palm
#

yep, makes sense

half storm
#

Cool, alright now take any two points lying on the line L, then it has to be the case that such a point in R^3 satisfies the aformentioned equation.

modern palm
#

ok

half storm
#

So I'm saying suppose that <c_1,c_2,c_3> and <d_1,d_2,d_3> \text{ are on the line, then this statment is true. That there exists t_1 and t_2 such that }
$$ \langle c_1, c_2, c_3 \rangle = \langle a_1, a_2, a_3 \rangle + t_1 \langle b_1, b_2, b_3 \rangle$$

#

Ugh.

#

Well I'm trying to say is <c_1, c_2, c_3 > = <a_1, a_2, a_3> + t_1 <b_1, b_2, b_3> and <d_1, d_2, d_3> = <a_1, a_2, a_3> + t_2 < b_1, b_2, b_3>

#

So we sum them.

modern palm
#

so.. <c_1, c_2, c_3 > and <d_1, d_2, d_3> are two lines?

half storm
#

They are points on the line.

#

We want to show that for any two point on the line that their sum is also contained on the line.

zealous widget
#

hey
would anyone here mind explaining why $P_1P_2=0$ ($P_1$ and $P_2$ being projection matrices of size $n \times n$) means that the vectors $a_1$ and $a_2$ are orthogonal? (the vectors $a_1$ and $a_2$ are the vectors that the projection matrices project onto)

stoic pythonBOT
modern palm
#

what are <a_1, a_2, a_3> and < b_1, b_2, b_3>

half storm
#

<a_1,a_2,a_3> is the initial point on the line and <b_1, b_2, b_3> is the direction vector.

#

<b_1, b_2, b_3> is the vector that gives you direction in which the line points.

#

Does that make sense?

#

Did you go over the vector equation of a line in R^3 in class?

modern palm
#

if <b_1, b_2, b_3> is a direction vector, then isnt the equation you gave in the form of l = p_0 + td, where p0 is a point and d = <b_1, b_2, b_3>. So isnt those two equations of two lines?

half storm
#

They are the same line because the two equations I gave you have the same direction vector and the same initial point on the line.

modern palm
#

ok

#

oh ok i see

half storm
#

The vector equation for a line is completely determined by a point on the line and it's direction vector. It's defined uniquely in this way.

modern palm
#

they are using the same points as well as the same direction vector, its just that the two lines have different t

half storm
#

Yup

modern palm
#

so we add them?

half storm
#

because the t is the number that determines where on the line you are.

#

yup

modern palm
#

ohh i think i know where this is going

#

that smart lol

half storm
#

so if you add them you get <c_0, c_1, c_2> + <d_1, d_2, d_3> = <a_1, a_2, a_3> + t_1<d_1, d_2, d_2> + <a_1, a_2, a_3> + t_2<d_1,d_2,d_3>
= 2<a_1,a_2,a_3> + (t_1 + t_2) <b_1, b_2, b_3>

#

I hope you can see that this is a point on the line because we have the same direction vector only scaled by a different amount and the point 2<a_1,a_2,a_3> is merely scaled by a factor 2.

modern palm
#

yep

half storm
#

There's probably a clear way of writing this in order to get rid of the factor 2 and make it explicitly clear that it's a point on the line. Maybe @cursive narwhal can answer.

#

oh i know what it is

modern palm
#

I understand what you mean

cursive narwhal
#

wot

half storm
#

by our assumption it's a line passing through the origin.

#

so <a_1,a_2,a_3> is necessarily zero.

#

the zero vector.

modern palm
#

yep

half storm
#

So, if we had noted this in the beginning, the equation would have reduced instead from <a_1,a_2,a_3> + t<b_1,b_2,b_3> to simply t<b_1,b_2,b_3>

#

O.k. now we need only to show that it's closed under scalar multiplication.

modern palm
#

yep

half storm
#

So we let k be any element of the real numbers and we need to show that for any point on the line, i.e. a point <c_1,c_2,c_3> = t_0 <b_1,b_2,b_3> for some t_0 when scaled by k k<c_1,c_2,c_3> is also a point on a line.

#

so k<c_1,c_2,c_3> = k t_0 <b_1,b_2,b_3> where k * t_0 is a real number.

#

and since we have the same direction vecotr, it also is point on the line.

#

so L is closed under scalar multiplication

#

So L is a subspace.

#

@cursive narwhal I was trying to see why the factor 2 didn't go away in order to make it clear that we had another point on the line. But then I realized that this statement doesn't hold for lines in general and I had the general equation of a line in R^3.

#

@cursive narwhal but then after using the information we had by assumption that it was a line through the origin it's clearly a point on the line.

cursive narwhal
#

oh lol sorry i couldn't answer

half storm
#

@cursive narwhal In short I thought the standard method of proof didn't work and was going to need some help, but I see now I didn't lol.

cursive narwhal
#

didn't know the context

half storm
#

All good.

#

Does that make sense @modern palm ?

modern palm
#

yep, Im just gonna read over again so it all comes together

#

thanks

half storm
#

No problem

modern palm
#

@half storm Wait, for the proof of closed under scalar multiplication, you wrote "a point <c_1,c_2,c_3> = t_0 <b_1,b_2,b_3> for some t_0"

#

isnt that the equation for a line?

#

why is that a point

#

unless I didnt know you can write points like this

half storm
#

The equation for a line is given for r(t) = t<b_1,b_2,b_3> for any t in the reals. That is, a line is the set of all points for any t in the reals.

#

when you say that a point lies on the line, you are saying that there specifically exists a t_0 in the reals such that equation is satisfied.

#

A line is the set of all points that satfisfy that equation, a point on line the is just one of those points that is given by taking a specific real number and multiplying the direciton vector by that.

modern palm
#

so, t_0 would be a real number

#

ok

half storm
#

Yea it's a specific real number.

modern palm
#

makes sense, thanks again

half storm
#

No problem.

zealous widget
#

hey
would anyone here mind explaining why $P_1P_2=0$ ($P_1$ and $P_2$ being projection matrices of size $n \times n$) means that the vectors $a_1$ and $a_2$ are orthogonal? (the vectors $a_1$ and $a_2$ are the vectors that the projection matrices project onto)

stoic pythonBOT
half storm
#

It's a consequence of the definition of matrix multiplication.

#

So when you say that a_1 and a_2 are the vectors that the matrices P1 and P2 project onto, you're saying that for any x in F^n that the P 1 projects x onto a_1, i.e. gives you how much it projects in the direction of a_1 right?

#

@zealous widget Here's a pretty informal proof, I'm assuming that we are working in Euclidean space e.g. $\mathbb{R}^n$ for some natural number $n$. $ Let x \in \mathbb{R}^n$ then $(P_1P_2)(x) = 0x \implies P_1(P_2)(x) = 0$. Now $P_2(x)$ gives you the projection of $x$ onto $a_2$. Note that the projection o $x$ onto $a_2$ points in the same direction as $a_2$. Now consider $(P_2)((P_1)(x)). (P_2)((P_1)(x))$ gives you the direction of $(P_1)(x)$ in the direction of $a_2$. But we have that $(P_2)((P_1)(x)) = 0.$ Note that $(P_2)((P_1)(x))$ points in the same direction as $a_2$. To say $(P_2)((P_1)(x))$ = 0. Means that $(P_1)(x)$ is orthogonal to $a_2$ i.e. that the inner product / dot product of $(P_1)(x) \cdot a_2 = 0$ . and since $(P_1)(x)$ points in the same direction as $a_1$, we can conclude that $a_1 \cdot a_2 = 0.$

stoic pythonBOT
hazy gull
cursive narwhal
#

?

#

[1,2,3] are supposed to be the coefficients of p(t) under the basis S.

#

@hazy gull

zealous widget
#

@half storm How does $P_2P_1x=0$ imply that $P_1x$ is orthogonal to $a_2$?

stoic pythonBOT
hazy gull
#

think of the dot product as how much one vector is in the direction of the other

zealous widget
#

hmm

#

i've never thought of that before

#

thanks

hazy gull
#

np

zealous widget
#

@hazy gull wait

#

what I don't understand here though

#

is how $P_2$ represents $a_2$ in some way

stoic pythonBOT
hazy gull
#

what is a2

half storm
#

@zealous widget P_2 is the projection of matrix onto a_2. Meaning that any vector that you take in x R^n, (P_2)(x) gives you a new vector that is in the same direction of a_2. i.e. it is a scalar multiple of a_2. This is what a projection matrix does

zealous widget
#

hmm

half storm
#

If you've taken multivariable calculus, then this is taught there and there is actually a formula for the projection that is given. What you are doing in LA is giving that linear opeartor in the form of a matrix.

zealous widget
#

but $P_2P_1x=0$ still doesn't imply that $P_1x$ is orthogonal to $a_2$
as in I don't get where how $P_2^T$ represents a vector on $a_2$

stoic pythonBOT
half storm
#

P_2T is irrelevant to this proof.

#

You can probably use something about it for different proof but I'm using a different way of proving it.

#

(P_2)(x) is a vector right, because P_2 is a matrix that takes vectors in R^n and maps them to vectors in R^n right?

#

Does that make sense?

zealous widget
#

Yes

#

but there is only 1 vector in $P_2P_1x=0$

stoic pythonBOT
zealous widget
#

in fact the end product of that equation should be a vector

half storm
#

Right

zealous widget
#

not trying to disagree with you or anything

half storm
#

It is.

zealous widget
#

i'm just having a hard time understanding

half storm
#

I know.

#

so x is a vector in R^n so (P_1)(x) is also a vector in R^n

zealous widget
#

Yes

#

understood

half storm
#

and more importantly it is a vector that points in the same direction as a e.g. If a is a vector in R^3 <a_1,a_2,a_3> , then (P_1)(x) = k<a_1,a_,2_<a_3> for some k in reals

zealous widget
#

yep

half storm
#

So $P_2(P_1(x))$ is giving giving you how much of the vector (P_1)(x) is in the direction of a_2.

zealous widget
#

correct

#

but the result is a vector

half storm
#

Oh yes, I see what you're saying.

zealous widget
#

@half storm very bad timing, i gotta go in a few min for martial art training lol

#

finish your message

#

and we can do it again in 40 min lol

#

maybe in DMs

half storm
#

So we know that (P_2)(P_1(x)) gives us a vector that is in the direction of the a_2. e.g. if a_2 = <a_1,a_2,a_3> , then P_2((P_1)(x)) = k <a_1,a_2,a_3>.
But we also know by assumption that P_2((P_1)(x)) = 0. So k <a_1,a_2,a_3>. = (0,0,0). which means that it has to always be that k = 0.

zealous widget
#

right i really gtg now lol

half storm
#

lol go ahead.

#

I'll just @ you.

#

@zealous widget O.k. I just thought of a better proof in my head that is more streamlined. It requires a little bit of knowledge of the definition of multivariable calculus. I see that you are familiar with physics. So you should know that the general definition of the projection of a vector ,say a, onto another vector b in $R^n$ is given by $$ \frac{a \cdot b}{|b|^2} b$$

stoic pythonBOT
half storm
#

@zealous widget Consider the vector $a_1$, we know that $(P_1)(a_1) = a_1 $

stoic pythonBOT
half storm
#

@zealous widget So $P_2(P_1(a_1)) = P_2(a_1)$

#

@zealous widget Now $P_2(a_1) = ka_2 = 0 $ $k \in \mathbb{R}$ by definition of vector projection, and where 0 is the zero vector And more specifically, we know that k is defined by the aforementioned formula $$ k = \frac{a_1 \cdot a_2}{|a_2|^2} a_2$$

cursive narwhal
#

\text{by definition of vector projection......}

dusky epoch
#

you do realize you can use dollars to delimit math mode so you won't have to spam \text everywhere right

half storm
#

yea

dusky epoch
#

Now $P_2(a_1) = ka_2 = 0$ for some $k \in \bR$ by definition of vector projection...

stoic pythonBOT
dusky epoch
#

etc

half storm
#

oh nvm.

#

That is different than what I saw thinking

#

@zealous widget So $ k = 0 \implies \frac{a_1 \cdot a_2}{|a_2|^2} a_2 = 0 \implies a_1 \cdot a_2 = 0$ ; Therefore $a_1$ and $a_2$ are orthogonal.

#

lol the struggle.

#

I gotta read a TeX primer or something

zealous widget
#

aight

#

@half storm session finished

#

lemme just assimilate this stuff first

#

crap i gotta shower

#

another 15 min i guess

#

goddamn sweat

delicate zealot
#

So I just learned about cofactor expansion along rows and columns to compute determinants and it got me thinking: in the case where you want to compute the determinant and in row reductions there is a row of zeros, what's stopping me from doing cofactor expansion along that row? The determinant would then obviously be zero, and I realize that doing row operations would scale the determinant and change the sign depending on the row reductions you did, but I just have a "bad feeling" about this I guess and that it would change the determinant significantly if I did this.

zealous widget
#

right

#

fully back now

#

i'll admit

half storm
#

pretty sure there are theorems that the determinant is unique and that the cofactor expansion along any row is the same.

zealous widget
#

i have no fucking clue what multivariable calculus is

half storm
#

and that if there exist a row of zeroes, then the determinant is zero.

zealous widget
#

but

half storm
#

so I think it's o.k.

zealous widget
#

i understand the proof partially

#

havent finished reading ir yt

delicate zealot
#

ok I knew about the theorems I just didn't want to believe it lol

zealous widget
#

*it yet

half storm
#

:LUL:

zealous widget
#

the multivariable calculus formula you described is exactly the same as the one in my linear algebra textbook

half storm
#

lol i understand @delicate zealot seems too good to be true.

#

Oh o.k.

#

so that's good

zealous widget
#

except yours doesnt use transposes lmao

#

right lemme finish reading le holy proof

half storm
#

Are you a CS student?

zealous widget
#

@half storm your proof follows

#

actually no

#

i was hoping nobody would ask

#

so i wouldn't seem arrogant and braggy

#

but I'm a 13 year old asian kid

half storm
#

That's great lol

zealous widget
#

i mean

#

not to disclose my personal story but

half storm
#

If you're doing LA now, then you're way ahead of the game.

zealous widget
#

i was an arrogant dick 1 - 2 years ago

#

being ahead pumped a sense of superiority into me

#

now i dont want to return to that phase lol

delicate zealot
#

@zealous widget you very much are not the only one that's struggled with this, I was an ass in calc 1

zealous widget
#

If you're doing LA now, then you're way ahead of the game.
@half storm true

#

@zealous widget you very much are not the only one that's struggled with this, I was an ass in calc 1
@delicate zealot haha lmao

#

where was i

half storm
#

Yea, I think every person who goes through this phase at some point. You feel very accomplished. Eventually you learn to stop being this because it's going to be hard to make friends or you get humbled when the material gets more difficult.

zealous widget
#

@half storm your proof follows
but its a bit disjointed to read in its current form

#

i'll have to write it out again

#

when i get back to my pc

half storm
#

Yea It's not pretty.

zealous widget
#

Yea, I think every person who goes through this phase at some point. You feel very accomplished. Eventually you learn to stop being this because it's going to be hard to make friends or you get humbled when the material gets more difficult.
@half storm all kids go through an arrogant attention/validation seeking phase, though this lasts different times for different people. I tend to think it lasts longer for those who are spoiled more in some way - such as "cool" kiddos in secondary school (high school for the non british)

#

altho this isnt a psychology server

#

so we should stop here lol

#

@half storm thanks for the proof man

#

greatly appreciated

half storm
#

No problem ๐Ÿ˜„

zealous widget
#

love ya <3

half storm
#

โค๏ธ

zealous widget
#

๐Ÿ’

delicate zealot
#

@half storm dude I still couldn't shake it even with the theorems so I messed around with a small 3x3 matrix and found the determinant before and after row reductions and whaddya know the determinant stayed 0 the whole time ๐Ÿ˜„

half storm
#

@delicate zealot lol yea, Sometimes the only way you're really gonna convince yourself is by doing what you're doing i.e. working some examples. And then also looking at the proofs.

ocean sequoia
#

Determinants suck

delicate zealot
#

my professor gave me a giant 6x6 matrix and asked if it was invertible and I found that I could take a row and add it to another to get a row of zeros and I was like wait can I just say that the determinant is 0?

half storm
#

Whenever, there is a proof that gives an amazing result that makes the whole problem way easier I literally have to go check the proof and do some examples because it's just so convenient and I'm like "Thank the lord ๐Ÿ™" that this works. Lol gotta check it instead of taking it for granted.

delicate zealot
umbral smelt
#

I think that's not invertible

hazy gull
umbral smelt
#

take a look at row 1 and row 3

ocean sequoia
#

Pretty positive if all the rows are independent itโ€™s invertable

umbral smelt
#

When you apply r1+r3, you'll get zeroes on the 1st row, and when you get full zeroes on a row or a column, you'll get that the determinant is 0

hazy gull
#

^^

half storm
#

Oh yea definitely non invertible then.

#

@delicate zealot You can do what you did and show that the determinant is zero and thus the matrix is non-invertible.

delicate zealot
#

Yeah that's what I'm in the process of doing right now ๐Ÿ™‚

#

well actually I'm doing this:
$\det B = (-1)^1 \det A$

stoic pythonBOT
delicate zealot
#

because it took 1 row reduction to get to a new matrix and then I compute the determinant of B and divide by (-1)^1 to get the determinant of A (which will become 0)

hazy gull
#

would [p(x)]_s be p(x) from the normal basis written in the s basis or p(x) in the s basis written using the normal basis?

gray dust
#

not sure where normal basis comes in. p(x) is just p(x), [p(x)]_s is likely the coords of p(x) wrt the s basis

half storm
#

^

hazy gull
#

so [p(x)]_s should be p(x) * s^(-1)

#

?

gray dust
#

idk what that means

hazy gull
#

vector p with respect to s is the vector p multiplied by the inverse of s?

#

because im translating p to s

gray dust
#

s is a basis, no? idk what you're thinking of in saying the "inverse" of s

hazy gull
#

yes s would be a basis

gray dust
#

a basis is simply a linearly independent list of vectors that spans the vector space you're looking at, idk how you talk of an "inverse" of that

#

just to make sure everything's clear, take any vector v in the space. let B=(b_1,...,b_n) be a basis, so there exist unique scalars c_1,...,c_n where v=c_1b_1+...+c_nb_n. this is alternatively said as, the coords of v wrt B are [v]_B=(c_1,...,c_n)

half storm
#

@hazy gull I think I understand your question. That notation can refer to two things, If T is a linear operator on a vector space V and $\Beta$ is a basis for V, then the matrix representation is denoted by ${[T]}{\Beta} $ If you are talking about a coordinate vector of a vector say $x \in V$ with respect to a basis $\Beta$ for V, then the notation is given as ${[v]}{\Beta}$

stoic pythonBOT
half storm
#

I can't get it to TeX correctly but what you're notation was suggesting woudl have to refer to what @gray dust is talking about because a poynomial is not a linear operator on a vector space.

hazy gull
#

O ya sorry, I'm just trying to figure out the notation for a vector with respect to a basis and also for the change of basis because I'm confused by what []_s means exactly

gray dust
#

before going into change of basis, make sure you have this down

just to make sure everything's clear, take any vector v in the space. let B=(b_1,...,b_n) be a basis, so there exist unique scalars c_1,...,c_n where v=c_1b_1+...+c_nb_n. this is alternatively said as, the coords of v wrt B are [v]_B=(c_1,...,c_n)
see how taking a particular linear combo of the b's produces v, you take the scalars in front of the b's and put them into a list, then you have the coordinates of v wrt B

supple hemlock
#

Hey, I need some help with this problem

#

I know that det(A*A-1) = det(I) = 1

#

Why + or - 1?

limber sierra
#

first since the entries of C and C^-1 are integers, det(C) and det(C^-1) should also be integers (can you see why? you'll need to prove this if you havent already)

#

now since det(A*A^-1) = 1

#

you can apply the fact that det(XY) = det(X)det(Y)

#

to get det(A) * det(A^-1) = 1

#

but note that both det(A) and det(A^-1) are integers

zealous widget
#

@half storm just an update to say your proof worked :D

limber sierra
#

so for this fact to be true

#

either they're both 1, or they're both -1

half storm
#

Great ๐Ÿ˜„

supple hemlock
#

aij = aji/det(A) for all ij for A^-1

#

if det(A) = 1, aij = aji

#

so they're related by an integer

#

OHH, I SEE IT NOW

#

THANK YOU @limber sierra

hazy gull
#

@gray dust ok that makes sense so far, so can you give an example of what a change of basis will look like

gray dust
#

change of basis is useful but there's not much material to cover to learn them. first you should cover the matrix representation of a linear map wrt bases of its domain & codomain. once you got that, then all you need to know next is that a change of basis matrix from bases A to B is the matrix of the identity map wrt A & B, ie if P is that change of basis matrix, then for any vector x, P acts upon the coords of x wrt A to produce the coords of x wrt B

half storm
#

Need some help proving this one. I'm pretty sure I already know how to prove that this is linearly independent. I need to show that it generates V and that's where I'm struggling.

hollow finch
#

you might be able to use the fact that n linearly independent n-dimensional vectors will always span an n-dimensional space.

half storm
#

god damn it.

#

๐Ÿคฆโ€โ™‚๏ธ

#

That would certainly do it.

spice ruin
#

Can someone explain how I back substitute for the last step? I already got it to echlon form on my own and couldnt figure out how the free variable interacts with back substitution just from looking at the answer

hollow finch
#

thats a great question

#

reversing the matrix notation, the first two lines of your matrix say
$$x_1+x_3=4$$
$$-x_2+x_3=1$$

stoic pythonBOT
hollow finch
#

since x_3 is in both equations, it makes it the best choice for your free variable.

#

so solve for the others in terms of x_3 and then youll be able to split the vectors

shy mango
#

hi all, sorry to interrupt. i was wondering if i have a matrix A with nullity that is 0, how do i prove that every b in C(A) has a unique solution for the equation Ax=b? thanks in advance

hollow finch
#

by using
$$\begin{pmatrix}x_1\x_2\x_3 \end{pmatrix}$$ as your solution

stoic pythonBOT
hollow finch
slow scroll
shy mango
#

@hollow finch thanks for the tip lol, ill read it

hollow finch
#

np, we all start somewhere catthumbsup

spice ruin
#

oh dang im dumb. i was interpreting "in terms on x_3" as "solve for x_3"

hollow finch
#

nah youre not dumb. this stuff isnt easy

#

probably one of the most confusing parts of the beginning of a LA course imo

spice ruin
#

I dont think its too bad yet, just trying to get ahead a little since i have a proofs + linear combo starting in a month

#

and proofs are scary

hollow finch
#

good for you for getting ahead. yeah LA is a really beautiful subject, but many people struggle with the proofs.

spice ruin
#

LA seems pretty cool thus far, I was watching some higher level stuff that I thought was rad and everyone is telling me i need to learn LA before i make an actual attempt at some of the other stuff

#

epic math time has some coolvideos about representation theory but its pretty incomplete as a learning source

#

i took multivar already and really loved the vector calc portion too

half storm
#

I'm trying to refine my knowledge of LA so I can actually get to doing some of the more fun stuff and really understand it i.e. multivariable analysis, measure theory stats and some comp sci stuff

spice ruin
#

rad

dire bough
#

LA is powerful stuff.

#

For measure theory though, you'll want analysis more than anything else.

#

But yeah, if you're doing anything applied or computational, LA is an absolute must.

cobalt tartan
#

Quick question: For some Ax = b, where A is some matrix, if I perform elementary row operations to it to obtain A', does A'x = b? Or does it equal instead some b'?

half storm
#

The solution set of a row reduced echelon matrix has the same solution set as the original matrix. So I'm positive thats a no.

cobalt tartan
#

A no to?

half storm
#

I'm saying that b = b'.

#

You can probably prove it like this.

cobalt tartan
#

Ah yea

#

Ok that's what I thought

#

Naw it's for a non LA course, they want me to prove something else and I was like "hey wait the deterimnat doesn't change if I go and do adding/subtracting of rows"

#

LA showing up in other courses epically fatpepedab

#

saving my ass

wintry steppe
#

to answer your original question: performing elementary row operations corresponds to left-multiplying by an elementary matrix. so if Ax = b and E is an elementary matrix corresponding to some row operation, then applying that row operation gives you A'x = Eb, so it will, as you say, instead be some b'

#

(assuming A' is the matrix EA, which is obtained from A by performing the row operation that E corresponds to)

half storm
#

Suppose that A' is the row reduced echelon form of A, so we have $Ax = b$ and $A' = (E_1E_2 \dots E_N)A \implies A'x = b' \implies (E_1E_2 \dots E_N)A x = b' \implies (E_1E_2 \dots E_N) b = b'$

#

@cobalt tartan I got you I'm proving it for myself to see if my intution is correct

cobalt tartan
#

Ah

half storm
#

Just to see if my intution is correct.

stoic pythonBOT
half storm
#

So i was wrong. ๐Ÿ˜ฆ

#

So just because they have the same solution set doesn't mean that they necessarily map each x to the same thing.

#

It's just the images of the matrices are equal.

#

@vague canyon glad you came to say the right shit.

wintry steppe
#

wrong @ ?

half storm
#

I said that they have the same solution set, but I thought that for any x that $Ax = A'x$ basically.

stoic pythonBOT
half storm
#

which isn't true.

#

But that's what I told her.

wintry steppe
#

as long as they get the correct solution and as long as everyone involved works towards the right answer

#

no big deal

wintry steppe
#

@dusky epoch can you explain permutation matrices to me

dusky epoch
#

what about 'em

wintry steppe
#

yeah exactly

#

what is the point of them

dusky epoch
#

well, for every permutation on n points there's a corresponding linear map on R^n which permutes the coordinates accordingly

#

its matrix in the standard basis is the corresponding permutation matrix

wintry steppe
#

but what is the point? use?

dusky epoch
#

i don't know how to answer that lmao

#

i'm really not sure what you're looking for

wintry steppe
#

i am not sure either

#

my book spends a whole subchapter on them

#

but i don't know why

#

i am just so confused

#

like i don't understand why i had to read that

#

i don't feel like i know anything new or that i should know?

#

are there any applications of them..

limber sierra
#

the fact that the elementary row operations correspond to left-multiplication by elementary matrices is quite useful

#

permutation matrices of course corresponding to permuting rows

dire thunder
#

some linear transformations are literally just permutation of basis vectors

dusky epoch
#

"bUt WhAt ArE tHe ApPlIcAtIoNs"

wintry steppe
#

ann

#

i don't know why you're doing that

#

there's a clear, to say, the determinant

#

or even row echelon form

#

i don't see how that is the case here lol

limber sierra
#

is the ability to work algebraically with permutations not of value to you?

dire thunder
limber sierra
#

like literally every proof involving row reduction can be made far simpler with elementary matrices

#

since it can be understood entirely in terms of multiplication by (invertible!) matrices

dusky epoch
#

nah namington who needs simple proofs? real proofs take up 100 pages each and require dozens of mathematicians to pore over /j

limber sierra
#

(with nice det properties!)

wintry steppe
#

sigh ann

#

@limber sierra i don't think i was told about this....

#

so i don't know how to use them for that lol

limber sierra
#

what the fuck did they teach then

#

if they spent a subchapter on them

wintry steppe
#

lol

limber sierra
#

without giving their motivating theorem

quartz compass
#

at some point, you're gonna have to come up with your own context for why things matter to you

wintry steppe
#

that's a good question namington

limber sierra
#

in any case, permutation matrices are also an easy way to think of permutations, well, linearly

#

this is naturally useful in group theory

#

(and combinatorics kinda although usually combinatorial techniques are more high-tech)

#

reducing mathematics problems to linear algebra problems is very useful in practice

#

since we understand linear algebra very very well

#

the existence of permutation matrices, and the fact that they obey fairly "nice" properties, gives us an easy way to discuss permutations (and hence the symmetric group and etcetc) through LA

#

which again, we understand quite well

#

this is the usual way we formulate the representation theory of S_n for instance

#

but thats probably beyond your scope

#

for now the best way to think of them is "they give us ways to talk about gaussian elimination via left-multiplication by matrices with nice properties (invertibility, determinant one of two values, etc)"

wintry steppe
#

ok

limber sierra
#

"and matrix multiplication is fairly 'easy' to reason about"

wintry steppe
#

mechanical

compact basin
#

Hello. Iโ€™ve been studying DFT

https://youtu.be/ds0cmAV-Yek

To implement this in python language, I would like to understand how this work. But I could not find a good lecture notes or resources that is directly related to this video. Anyone has any recommendations? Thank you in advance

Get a free crate for a kid you love (Awesome Chrsitmas gifts) at: https://www.kiwico.com/smarter
Click here if you're interested in subscribing: http://bit.ly/Subscribe2SED
โ‡Š Click below for more links! โ‡Š

Doga's a super smart dude who writes a Turkish blog "Bi Lim Ne Gรผzel ...

โ–ถ Play video
#

What I am highly interested in is what is the input, how does it be deal with, then what is the output. I reckon that this must be in linear algebra, thus I asked here

polar cloud
#

If itโ€™s not a bother, ping me when this question is answered! I have an urgent question but donโ€™t want to impose

zealous widget
#

is it possible to have a matrix satisfying $Ax=x$, where x is a vector of dimensions $n \times 1$ and where A is a matrix of dimension $n \times n$

#

where's texit?

#

is it possible to have a matrix satisfying $Ax=x$, where x is a vector of dimensions $n \times 1$ and where A is a matrix of dimension $n \times n$ and where $A \neq I$

#

$A$

#

,help

#

,help

stoic pythonBOT
#

A brief description and guide on how to use me was sent to your DMs! Please use ,list to see a list of all my commands, and ,help cmd to get detailed help on a command!

zealous widget
#

i'll copy a previous working message to see if that works]

#

I said that they have the same solution set, but I thought that for any x that $Ax = A'x$ basically.

#

what

#

is it possible to have a matrix satisfying $Ax=x$, where x is a vector of dimensions $n \times 1$ and where A is a matrix of dimension $n \times n$ and where $A \neq I$

#

why it no work

#

oh nvm

#

im stupid

#

answer is yes

dusky epoch
#

are you asking whether it's possible to have $(\forall x \in \bR^n)(Ax = x)$ but $A \neq I$?

zealous widget
#

not for all x

#

i meant for some specific x

#

i'm stupid]

#

it's true

dusky epoch
#

so then you're asking if it's possible for a matrix to have 1 as eigenvalue

#

fkgjlsdfkhsf

zealous widget
#

i haven't learnt about eigenvalues yet

#

that's 2 - 3 chapters away in my textbook

#

but yes its easily provable to be true

#

i'm an idiot

#

sorry

steady fiber
#

also look into Fast Fourier Transforms

#

implementing a DFT in code naively is pretty slow (like really slow, dont do it that way)

#

the linear algebra behind it is quite simple, you simply multiply your input by a dft matrix

viscid kernel
#

Anyone know what the notation in red means ? Btw, โ€œstelโ€ means โ€œsupposeโ€

half storm
#

I'm guessing the family of functions that are continuous on the set [a,b]

#

Yea that has to be it.

#

Because they tell you what the set is equal to on the right.

#

Not sure what language that is but "f continu" seems very much like " f continuous"

gray dust
#

yes V is the vector space of continuous real valued functions on the interval [a,b]

viscid kernel
#

Thanks but, whats the meaning of notation which comes before [a,b]

#

@half storm continu means continuous xD its in Dutch

latent ledge
#

Let $A$ and $B$ be nonsimilar $n\times n$ complex matrices with both the same minimal polynomial and the same characteristic polynomial. Show that $n\geq4$ and that the common minimal polynomial does not equal the common characteristic polynomials.

stoic pythonBOT
gray dust
#

if S is a set, C(S) sometimes denotes a set of continuous functions on S. its definition is provided on the right anyway

viscid kernel
#

Thanks

gray dust
#

no prob

latent ledge
#

for my question, suppose that A and B are 4 by 4, and their minimal poly is like p(x)=x^4

#

they have different jordan forms, I suppose

#

<@&286206848099549185>

compact basin
#

@gleaming adder ok. thank you very much!

#

@steady fiber I dunno what the input is. But multiplication ok. Iโ€™ll google it

#

@gleaming adder I know such useful libraries, but as I said, what I want to know is that the mathematics to visualize any picture with DFT/FFT.

steady fiber
#

input is function you want a DFT of

#

sampled at discrete, regular intervals

median forum
#

start by knowing the basics of a fourier transform
then a discrete fourier transform
then finally, how the fft makes the operations faster by conveniently changing the matrix multiplications

#

but really basic stuff
like what does it input, what are you supposed to get
what is the expected frequency space distribution given an input
and so on

compact basin
#

But when and how will the actual image dataset (pixel) be used by FFD ? I supposed that it would be the input

steady fiber
#

you want to create the animation?

#

because that's different from just doing the DFT

compact basin
#

If I make you wrong, sorry. I do want to make an animation with python language. Input is any image

#

The image is exactly what I wanna implement

steady fiber
#

for that you need to use complex numbers, if you want to animate it for a 2D image

compact basin
#

Yeah I want to animate 2D

ocean sequoia
#

im actually kinda frustrated i cant figure this one out

#

im assuming it has to do with the rank nullity theorem

#

because if range T(V) was zero entries it would just take it to the null space but i cant figure out how to state it rigorously

#

i think thats why it is atleast or did you mean me?

stiff frost
#

Ignore what I deleted, it was a misunderstanding

#

What could you say about the range of T if you only had a few nonzero entries (less than dim W, say)?

ocean sequoia
#

it wouldnt be able to form a basis for W

#

because dim T(v) < dim(W)

stiff frost
#

The range of T usually isn't a basis for anything

#

T doesn't have a dimension

ocean sequoia
#

err excuse me the image here

#

so dim T(v)

#

in LADR they do refer to dim range T

stiff frost
#

So it seems you already have an understanding of why the matrix of T has at least dim range T entries

#

when you made a claim about "because dim T(V)"

ocean sequoia
#

well if dim T(V) < dim(W) then it cant be surjective for W which means it cant form a basis for W

#

could just something simple

#

like

stiff frost
#

We don't really care about a basis for W

#

I regret bringing up dimW

#

because the problem doesn't refer to it

ocean sequoia
#

it does say with respect to basis

#

wasnt sure if maybe there was like a contridiction in there

stiff frost
#

Every matrix for a linear transformation is "with respect to a basis pair"

#

the problem was just emphasizing that the choice of basis pair doesn't matter

ocean sequoia
#

oh

#

ok i forgot all about dim(W)

#

doesnt exist any more

stiff frost
#

There are few ways to think about this. We could start by thinking about the extreme case: like what if for some basis the matrix had no nonzero entries? What would that tell you about T?

ocean sequoia
#

huh let me think hang on

#

honestly im not sure

#

my gut wants me to say something like every vector in domain

#

is needed

stiff frost
#

Ok, let's forget this problem for a bit. What is "the matrix for a transformation T in L(V,W) with respect to bases B and C"?

ocean sequoia
#

its the linear transformation that takes a B a basis of a subspace V to the basis C of the subspace W

#

that is uniquely determined on B and C

stiff frost
#

False

#

For a couple reasons

#

Firstly, not every transformation T in L(V,W) takes a basis to a basis

#

Secondly, and maybe more importantly, a matrix isn't a linear transformation

#

Do you have a book where you can review the definition of L(V,W) and "matrix for a transformation with repsect to a pair of bases"?

ocean sequoia
#

i do but it refers to matricies

#

as linear maps

stiff frost
#

maybe it does, but I bet it doesn't refer to "matrices with respect to a pair of bases" as linear maps

ocean sequoia
stiff frost
#

I have no objection to those sentences. (and those sentences don't refer to matrices as linear maps, but maybe other sentences in your book do)

#

But anyway, you need to know the definition of the matrix of a linear map with respect to a pair of bases

#

we can't solve this problem without it, since the problem is about those matrices

ocean sequoia
#

the definition of a matrix of a linear map with respect to a pair of bases is the linear map $T(v_1,...,v_2)$ to $A_1,_k w_1,...A_m,_k w_m)$

stoic pythonBOT
ocean sequoia
#

where v1,...vn and w1,..,wm are basis of V and W

#

why is that definition wrong

half storm
#

A matrix is a linear transformation

ocean sequoia
#

Thats what i thought...

stiff frost
#

It's confusing to call a matrix a linear transformation when we're in a context where a linear transformation will have many different matrices

half storm
#

It's not a linear transformation from V into W but it's a linear transformation yea?

stiff frost
#

I would recommend not saying so

cursive narwhal
#

no

stiff frost
#

but some books would say so, especially in the beginning

cursive narwhal
#

there's a bijection between the set of m x n matrices and the set of vector space homomorphisms. they're not the same thing, however

gray dust
#

please listen to dirib's point on the distinction between a linear map vs any of its matrix representations (given there exist finite bases of its domain & codomain)

half storm
#

Yea a matrix isn't a linear transformation, the left-multiplication transformation of a matrix A is a linear transformation

stiff frost
#

"is the linear map $T(v_1,...,v_2)$ to $A_1,_k w_1,...A_m,_k w_m)$" this isn't really clear to me. $T(v_1,...,v_2)$ wouldn't normally be defined

stoic pythonBOT
half storm
#

I guess that's the nuance that I'm missing.

ocean sequoia
#

honestly im pulling that straight from LADR

#

here

stiff frost
#

That's not what it says though

#

What it says is fine

ocean sequoia
#

could you maybe elaborate on why what i said was different?

stiff frost
#

If $T\in\mathcal L(V,W)$ and $v_7\in V$ then $T(v_7)$ is defined. But "$T(v_1,...,v_2)$ isn't.

stoic pythonBOT
ocean sequoia
#

oh

stiff frost
#

Like T takes in a single vector from V at a time

ocean sequoia
#

i typoed

#

im so sorry

#

i meant T(v1,..,vm) where v1,...,vm are a basis for V

stiff frost
#

That's still not defined

#

T takes in one vector at a time

#

T(v1) and T(v2) are defined

#

but T(v1,...,vm) doesn't make sense really

ocean sequoia
#

ok im now very confused are you maybe able to spell it out for me?

#

hang on let me

stiff frost
#

Spell out what I was just saying about T, or spell out the definition of the matrix given in LADR?

ocean sequoia
#

give you my understanding and you can maybe tell me why im wrong

stiff frost
#

ok

ocean sequoia
#

if you dont mind

#

Ok i assumed that if $T /in L(V,W)$ and if $v_1,...,v_m$ $w1,...,w_n$are a basis of V,W then the matrix is a representation of the linear transformation T from V to W uniquely determined on the basis of V and W(which means that any transformation from vk to wk will be equal to each other)

stiff frost
#

I don't understand what you mean by "any transformation from vk to wk will be equal to each other". And "a representation" is vague in a way that the definition (say, from LADR) makes concrete for us.

#

Also w_1,... better not be a basis of V unless W=V or something

stoic pythonBOT
ocean sequoia
#

"any transformation from vk to wk will be equal to each other" I mean that if a transformation T takes takes v1 to w1 and a transformation S takes v1 to w1 then S(v1) = T(v1)

#

honestly unquiely determined has always been a bit shaky but the way i understood it is that there is only one way to take v1 to w1

stiff frost
#

That's true I guess, but most transformations won't take v1 to w1 so that doesn't really matter for this disucssion

ocean sequoia
#

of course

stiff frost
#

Rather than drilling down into what you had in mind with the "any transformation from vk to wk will be equal to eachother" stuff, I think it might be good to walk through the definition in LADR fresh. Then look at an example (does LADR have examples for you?). And then maybe come back to the problem you started with

#

Let's walk through the definition together

ocean sequoia
#

ok let me repost

stiff frost
#

I think you're okay with the first sentence "Suppose...basis of W."

latent ledge
#

there is a problem about this definition in 3a

#

you can take v1=(1,0,0,...,0)

ocean sequoia
#

hang on

#

can i finish walking through the definition? I really appreciate the problem ill check it out after

#

is that ok?

latent ledge
#

sure

ocean sequoia
#

so is the difference between a matrix and a linear transformation that a matrix takes in every vector at once

stiff frost
#

Maybe this sounds like a silly question, but it's critical to the second sentence. What is a matrix?

#

That is not a matrix

ocean sequoia
#

no worries

#

a matrix is a rectangular array of elements

stiff frost
#

Yes

#

and those elements are numbers/scalars/field elements (as opposed to linear maps or vectors or soemthing else)

#

So to define an "m-by-n matrix" here, we just need to know what all the numbers are

#

Well, they are the $A_{j,k}$ that appear in the equations that the definition says the matrix is "defined by"

#

And this is a little tricky because of all the indices.

#

n is dim V. m is dim W. j and k are arbitrary

stoic pythonBOT
ocean sequoia
#

and j,k < n

#

right?

stiff frost
#

wrong (in general)

ocean sequoia
#

ok

stiff frost
#

the definition says the matrix is "m-by-n"

#

so j<=m and k<=n

ocean sequoia
#

ok

#

im with you

stiff frost
#

j and k

#

ok

#

so What is, say, A_{1,1}?

#

Well, the equation in the defintion has A_{1,k} in it

#

so we set k=1 to find out.

ocean sequoia
#

A 1 is the first element in the first row and column

#

A1,1

stiff frost
#

right