#groups-rings-fields
406252 messages · Page 559 of 407
(a+b)^n+m
Have you done (a) @bleak crystal
Whatever
Be it n or n+m
yes
It's because then you expand and in each term you'll get like a^n or b^m
how do you expand that
i don't understand
Wait
Here
I think he’s saying
Suppose n is the integer where a^n=0
And m is the integer where b^m=0
If you expand (a+b)^(n+m) you will get a^n and b^m terms in there
why does that matter
i don't know how to expand it
oh
Bruh
Dont care about that
I'm so fucking tired
what do i do
how do i expand this
i don't know how to do this
Just write it's equal to $\sum {n+m \choose k} a^kb^{n+m-k}$
Jean-Jérôme
^
Does that make sense
That’s literally the formula for binomial theorem
Plugged in with (n + m) for the exponent
And think about "is k bigger than n? Is n+m-k bigger than m?"
what
i don't follow at all
god i fucking hate this class, i still don't understand why I'm taking it
If k<n then n+m-k > m and b^(n+m-k) = 0
such a waste of time
Is this abstract algebra
yes
Nah dog it’s lit
it's such a waste of time
It’s annoying because it’s tedious in the beginning and a bit lame
Haha
it's been tedious all semester
i have yet to find a single reason high school teachers take this class
No complaints you're a math warrior
it makes me want to fucking scream
This is a high school class?
you dont understand why they'd want math teachers to know basic algebra??
yes, abstract algebra is basic algebra
Wait what? You’re required to take this to become a teacher?
mhmm yup sure
yes
Huh I never knew that
"algebra" in a mathematical sense yes
Wel that’s pretty cool
Oh
I'm shooting for a C-
Hmm
as long as i pass this class I don't give a fuck
i will literally NEVER use this in teaching
"hey kids, today we're gonna learn about zero divisors!"
Dude I gave you the answer
Well obviously you wouldn’t use this in teaching, unless you’re literally teaching this course
the point is for the teacher to know more than their students
But there’s a lot of stuff you learn that you don’t teach lol
it's really driving me nuts
calc 3 is literally 2 years beyond the scope of high school
None of my math teachers know this stuff and it’s depressing, so I feel kinda happy bout it
linear algebra is beyond high school
Maybe
Dude you have to know more stuff than they do to be a teacher
i transferred schools just to take calc
they literally would have had to make a special course for like 3 kids in my class
Their point is that this feels artificial, like why would they learn it for the sake of knowing more
Right? Idk
yay, I'm smarter than a bunch of 16 year olds!
what a surprise!
okay I'm done ranting. just needed to vent a little
well understanding the basics of how algebra actually works is pretty important if you want to teach a botched version of it (which is what HS algebra is)
imo
It's not about being smarter
Hahaha HS algebra is botched abstract algebra
It's about having a deeper understanding of the field
also FWIW the binomial theorem is like
standard content in high schools
at least here in canada
A tad deeper
i appreciate math less because of this course
so you should probably know it
modular arithmetic is cool
Dude I’m guessing it’s just really boring rn
my school had a TERRIBLE math department
Yes modular arithmetic is super cool
Man the exercises you're solving,I learned them in first year of uni
i just learned how to complete the square THIS SEMESTER
i literally never learned it
So it's not that far
The best teachers I had in high school had graduate degrees in mathematics
oh i also learned the rational roots theorem because of abstract algebra
you had teachers with grad degrees in math?
people who have a deep, real understanding of math beyond the high school level will be able to teach everything up to the high school level better, will be able to make everything feel more motivated, and will be able to generate better examples
holy fuck i grew up poorer than i thought
i think my school had ONE dude with a master's
one had a masters, one had a PhD and used to be a professor, but retired to spend more time with her kids + to help high schoolers
I went to a very wealthy high school that was like 2 hours by bus from my house lol
My high school is def not poor but we don’t have any teachers that know math beyond calc 3
but anyways that aside, the teachers who really really knew math got me into math
I'm lucky i got to go to a magnet school for the last 2 years of HS lol
man I'm gonna be teaching calc 2 at MOST
because of how lackluster my high school teachers were, i decided to become a teacher
Calc is great
it's beyond fascinating, it hasn't ever lost its charm for me
every time i tutor it i appreciate it more
holy shit
Jesus Christ
holy shit I don't think that's legal here
every high school needs to offer calculus, and lots of university programs straight up require it for admission
what country are you guys in?
I'm Canadian
CALC IS REQUIRED FOR ADMISSION
NO FUCKING WAY
dude my university offers algebra 2 equivalents
most science (especially physics)/engineering/math programs require you take calculus in high school
people like you are the reason i want to teach
importantly, here the high school calculus course covers no integrals
lol
I should've said ontario, you're right
IB and AP classes here do too ofc, but like normal math courses
though they didnt do much beyond derivative formulas / integration techniques / basic word problems, extrema, curve sketching sstuff
it was a fairly light course
I've never seen a school with IB
also high school teachers here are paid decently (most of my HS teachers made around 80k-100k), which means more qualified teachers in general
my first high school had like 1 AP course, comp/lit
100k??? oisdfoisodijfs
that is insane
thats canadian BTW
wanna guess the minimum in my state?
we also pay COL in canadian
do ya?
take off about 30% to get USD values
but we also pay for things in CAD so
should you convert?
first person within 5k gets a high five
35k
US employs people they pull off the street
yeah since CAD prices are higher
THIRTY TWO
ever looked at the prices on a book label
you got a high five!
yeah
canadians still pay for health insurance btw
well more accurately, its deducted from their paycheque by their employer
Cassius you said you liked modular arithmetic
but this isn't for general medical care, it's only for like dental/vision/mental health/physiotherapy/etc.
and focuses more on dental/eyecare/cosmetic surgery and stuff
yeah but it doesn't make sense to make a salary so low AND not include insurance
stuff that isnt covered by the national plan
32 fucking thousand, can you believe that?
yeah a lot of stuff is covered by the national plan
I'm moving to wyoming either way, indiana sucks so bad
fair, teachers in many regions are certainly super underpaid
https://www.ontario.ca/page/public-sector-salary-disclosure-2020-all-sectors-and-seconded-employees here's a list of ontario public servants who earn > 100k, that's how I knew about my hs teacher who made over 100k
insurance that covers mental health? damn
there are 160 000 teachers in my province, and 27 000 of them make over 100k
highest paid a teacher can be here is like 120k ish? 110?
there's a standardized progression
this pains me to hear
i read that hs math teachers in Wyoming make like 60
also land is VERY cheap there because low population density
luckily i don't have to stay here forever basically
anyway, math
$\sum {n+m \choose k} a^kb^{n+m-k}$
Cassius
what do i know about this summation
if you can figure out a way to prove that the sum is zero, you're done
i see
well since a^n = 0 and b^m = 0 (what we defined), you could try to prove that k is always bigger than n, and n+m-k is always bigger than m
do you see why that would make every term 0?
yes
yes
hmm
how could i argue k>n
$$\sum_{k=0}^{n+m} {{n + m}\choose {k}} a^kb^{n+m-k}$$
abs_0
is this the sum
yeah I think it is
ok
well immediately that method won't work because k starts at 0, and n>0
right
but maybe we could try something else
yes?
\begin{align*}
\sum_{k=0}^{n+m} {{n + m}\choose {k}} a^kb^{n+m-k} &= \sum_{k=0}^{n+m} {{n + m}\choose {k}} a^k b^{n-k} \cdot b^m\\
&= \sum_{k=0}^{n+m} {{n + m}\choose {k}} a^k b^{n-k} \cdot 0\\
&= 0?
\end{align*}
abs_0
wait but
there's more?
do we know for sure that $0 \cdot n = n \cdot 0 = 0$ for all $n$ in this ring?
abs_0
frik
that's what 0 is
I feel like i'm being dumb rn
the 0 identity in this case
well in the normal sense of thinking about it
ok cool
that's the standard defintion
yeah so since communtativity the sum is zero
right
oh you're trying it too huh
I kinda finished it although last question needs to be more formal
okay so it's all zero
yeth
And bonus question is “im too lazy”
0+0 n+m times
nice
so a+b is nilpotent
alright 1/3 done
with this question
then one more
well $(ra)^n = r^n \cdot a^n = r^n \cdot 0 = 0$
abs_0
yeah
that was significantly easier lol
i actually was thinking that believe it or not
yay im not completely stupid!
1+a is a unit
interesting
haha
yeah thats the logical choice here
you can prove this very quickly
0 * x = (0 + 0) * x
= 0 * x + 0 * x
adding the additive inverse of 0 * x to both sides gives 0 = 0 * x, and an identical argument works for x * 0
ah
that's clever
rings have distributive property + additive inverse + if 0 is around you're assuming it's the additive identity
so you're guaranteed it
\begin{align*}
(1 + a)^n = 1 + {n \choose 1}a + {n \choose 2}a^2 + \cdots + {n \choose n}a^n
\end{align*}
abs_0

we're proving $1 + a$ has a multiplicative inverse
abs_0
There with more details
wow
i wish i followed that better than i do
let me go over again
lines 2 and 3
how does that work
like the transition between
wait no i see
he distributed the sum to the 1 and a
I don't get what's after that tho
also seems very random that you would choose that sum to multiply it
it's like, okay cool it works, but how did you come up with that particular sum lol
well $$(-1)^k(\text{something}) + (-1)^{k+1}(\text{something}) = 0$$ because they're being subtracted
abs_0
ye
how do you make that transition between 3 and 4 though
combine it into one sum
abs_0
I take this sum because it’s equal to 1-a^n
ah
It’s the formula
^^
That’s how I got there
I’m struggling with bonus
i'm struggling with life
Let’s talk about it after yeah ?
unfortunately it's pretty basic
I mean bonus, not life haha
covid, lockdown, etc
Hahahaha
and this fuckin class man
it physically pains me
i can't say i follow part e
the handwriting too
do you wanna see something funny
e and f are not easy either
what is "check this out"
man this assignment is tough, it makes me feel as though i'm in way over my head
it's a hint he offered on the problem
right
yeah i really don't follow the handwriting on e lol
u+a is a unit
abs_0
yeah
Ok handwriting bad got it
whip naenae
abs_0
yes
uh
what was I thinking
u^-1a is nilpotent, so....
wait why is that
a previous part you proved, part c
$a$ is nilpotent, and by (c) we have $u^{-1}a$ is nilpotent, and by (d) we have $1 + \text{nilpotent}$ is a unit, and a unit times a unit is a unit? lol

abs_0
yea, that's right abs
wait but is a unit*unit a unit
What abiut handwriting now ??
haha it's lit now
yes better
So in bonus I manage to prove a0 is unit but no clue about the others being nilpotent
@bleak crystal do you see this
wow these hints are coming in clutch
lol
imagine coming up with this
it's not actually that bad, but without the hints it would be super ridiculously cringe
I like algebra ^^
Basically because of this
Sometimes you can just parachute a solution
Yep !
that's exactly what they're telling us
nice
now, is f(x) itself nilpotent
it is right
oh sorry
the a1,a2... sequence is nilpotent so f(x)-a0 is nilpotent
so f(x) is a unit
and that extends to the polynomial ring
is there any reason it shouldn't?
or couldn't?
damn, what a problem. riveting
here's his #11 walkthrough
christ
What are you guys working on btw
mirzathecutiepie
What is $(U\cap v)$ ?
Jean-Jérôme
that bad?
Is it the smallest subgroup containing U cap v ?
nah it's longer than I expected
v is also a normal subgroup
i see
its just funky notation
Hmmm I’m not too familiar with those layers of group theory, is it obvious that U cap v is a group ? I mean v is normal in V
Sorry if dumb question, im curious )
pretty sure yeah, since the intersection of two subgroups is another subgroup
Oooooooh
Hum
Is it ?
But i got that we dont need it to be a group
Yeah ok it is a group
mirzathecutiepie
I am not familiar with this kind of diagram
But I think you should explicit some stuff
“An easily seen fact” and “normality bs”
Ok
idk but i thought normality wasn't transitive so i'm not sure if the last step holds
,ti --at karachi
The time in Asia/Karachi is 09:01 AM (PKT) on Thu, 25/03/2021.
Stain is 12 hours behind, at 09:01 PM (PDT) on Wed, 24/03/2021.
nice lol
Same
truly 
Where are u
what is the weird p lookin thingy regarding homomorphism like p:R[x]->R
What are u talking about

It’s a greek letter
is it fai or fee
Fee
It’s used as an f in modern greek and russian
no they're asking how to type it in the word typesetting program
Fai
You heathens
mirzathecutiepie
Oh idk about word
its fee in OG greek
but fie in english
(actually it's pee in really old greek)
even "pee" isnt quite accurate
it's more like
"peh-eh" where the first "eh" is high pitch
and the second "eh" is middle pitch
ancient greek was somewhat tonal
in modern greek its just "fee" though
nothing fancy
since modern greek isnt a tonal language
mirzathecutiepie

Doesnt this work ?
Haha
I won !
Hum let me see
Because its in v
Aaaah
Ok
Good remark
Yes you are right
Exactly
Yes
Gg
Lets go
I actually have to teach this on friday
So thanks
I havent really read the course yet
Whats N
Normality bs is actually a technical term
Hey
Actually i feel you could do everything at once by using the $xH = Hx$ characterisation of normality
Jean-Jérôme
shouldn't you be considering gCAg^-1?
mirzathecutiepie
yeah i think this works
idk i'm still learning this stuff. i'm pretty smol brain
i don't really know about this stuff
mirzathecutiepie
what's the difference between this and a lattice of subgroups
uhhh is there like a general way to prove something is surjective?
like how do i prove that every b has some a
You just do it
There’s not much you can do other than like
Applying the definition
And it really depends on understanding the objects and the morphism involved
relax with that homie lmfao
magic words magic person
so i legit just say $\varphi(c_0+c_1x+...)=a=h$
cRaZyNiChOlAs12

Well, You can say that's the same as constructing a right inverse
Hey mirz can you post the theorem again ?
Thanks
So isnt there something like an isomorphism theorem that could kick ass in the last part ?
Oh ok
Isomorphism theorem mvp
Since Lagrange
subtraction goes in #prealg-and-algebra

mirzathecutiepie
are you going to sleep soon or no
👏
isnt the squaring the circle problem fairly easy? i dont see where field extensions come in
why is it easy
then write a shorter paper
but i mean youre right
in that all you really need to prove is the transcendentality of pi
which isnt hard
and then a basic field theory argument applies
If $F/k$ is galois, then that means that for any two embeddings $f_1,f_2$ of $F$ into $\bar{k}$ such that they restrict to the identity on $k$, $f_1(F)=f_2(F)$.
(gelfond-schneider)
Have a Banana, Bitch
Is this statement true?
I'm pretty sure this follows from normal
and F being a splitting field
i cant namington, the paper has to be 4000
well perhaps you can pad it appropriately with historical context and whatnot
or introduce more complicated galois theoretic constructions or whatever
oh, my guess is that this is true regardless that F/k is galois. but i am not that smart at field theory
You definitely need galois because there are 3 ways to embed Q(cube root of 2) into the algebraic closure
ah hm
at the least, a result like this does sound familiar from galois theory class
Is the second part of this trivially easy?
Since there is only one way to embed K into an algebraic closure if K/k is galois (by that I mean all embeddings have the same image), they are equal
But then I don't see why we need F to be galois
well how do you define composite of 2 fields?
that depends on the chosen embedding of F in k bar, and all have same images when the extension is galois
Haven't we fixed an embedding though?
When we say $F \subseteq \bar{k}$, we're fixing some isomorphic copy of $F$ to become the canonical copy of $F$ in $\bar{k}$
Have a Banana, Bitch
This seems like a badly worded problem
if you're fixing... then i don't see any problem
Thanks
so i have to prove that T is closed under subtraction and multiplication right?
Could i say something along the lines of $x=(b_{0}+b_{2}x^{2}+...+b_{2k}x^{2k}) and y=(n_{0}+n_{2}x^{2}+...+m_{2k}x^{2k})$ where x and y are both in T
cRaZyNiChOlAs12
Yeah so x+y will belong to T and so will x*y since an even number times an even number is in an even number. Also, R is a ring so the new coefficients after the multiplication will belong to R. However, do not take my word for it since I am not that good at this
Do you guys have any "medium" exercises? Not too hard but not too easy
na that makes sense, but what do u mean by the new coefficients
like the $(a_{2}b_{2})x^{2})$ ?
cRaZyNiChOlAs12
Yes exactly. Those coefficients will belong to R since it is a ring and multiplication is a binary operation. This means that the polynomial will belong to T
so am i able to just say that we know a even integer minus a even integer is an even integer or do i have to actually like write out the proof of that
the proof is like half a line
In ring theory?
Doesn't really matter
Hmm
I don't know what you know or don't know
Have you showed that Z/pZ is a field if p is prime?
Yes that I have done
And have you showed R/I is a field iff I is a maximal ideal ?
No, that I have not done I think. Let's try it out!
Oh, I did not notice that!
I should have mentioned R is a ring with identity, for that to hold
I'm used to rings always having identities
Oh, okay!
Quick question. When looking at whether $(A_v,v)$ is a subring, does closure under addition imply $v(x+y)\in A_v$ or $v(x)+v(y)\in A_v$?
dackid
I'm pretty sure it's the first, but I want to make sure
v(x) shouldn’t ever be in A_v
v(x) takes values in some ordered group
Closure under addition would mean that if x,y satisfy v(x)>= 0 and v(y) >= 0 then v(x + y) does which follows by the condition valuations must satisfy in addition
(Greater than or equal to the min)
Oh my apologies. A_v is the set and v(x)>=0 is the restriction of the operation v(x).
I understand now, thank you
It’s not a restriction on the operation
It’s a restriction on what belongs to the subset A_v
Ah okay. So v(x) can do what it wants, but we are only taking a subset for what x values follow the rule v(x)>=0
Yes
Well the function v doesn’t exactly do what it wants
We’re assuming it already exists for A
Since A was a valuation ring
But it just stays doing what it was doing
It does have some restrictive properties
Yes, in order to be a valuation
You need those properties in order to show A_v is closed under addition and multiplication
Oh, so is (A, v) the ring?
Yes
Lastly, is a field of quotients, K, the field where the inverse of A exists?
A never existed, my bad
v was a valuation on K
And you’re finding a subring of K
Which consists of all non-negatively valued elements
But if K is a field, what's ring?
Sorry, I meant ring
What’s a ring?
Know, what is the ring in this scenario?
But a subring is a subset of a ring right?
Right
Well every field is a ring
So if you need to think of A_v as a subset of a ring then consider K a ring
Ah in that case, what exactly is a field?
A field is a ring where every no -zero element has a multiplicative inverse
Example Q
What isn’t a field is Z
So it is a field of quotients?
Because 2^-1 doesn’t exist
I mean... sure
But that’s an odd way to think of them
Well it says K is a field of quotients.
So I'm trying to understand what that means exactly
It looks like it says K is just a field
A field of quotients is something you can associate to certain rings
You just add in all fractions
"which has K as a field of quotients."
So everything gains an inverse
Yeah
So if you have a ring A where the only zero divisors are 0
So K is a field, but in relation to A_v, it is a field of quotients.
Then you can make a field of quotients
Yes
Well
It is A_v’s field of quotients
A field of quotients is something you do to certain rings
True, I need to be more specific
Any field of quotients is a field
Field is the type of algebraic structure it is
Where as field of quotients is like...
Something associated to certain rings
So a field of quotients contains the multiplicative inverses of A_v
In a sense it’s the smallest field containing A_v
All you do is add in the inverses of everything
And then the ratios
So every element that is not in A_v must be the inverse
I agree, but, I see what you're getting at
So you take all non-zero integers and add in 1/x for them
But also you have say
3/2
Why is that the smallest field then?
This isn’t the inverse of an integer
Why not just have 1/x's?
It’s not closed under multiplication
Try doing 2* 1/3
This has to exist but 2/3 isn’t a 1/x
So you’re adding in as little as possible in order to make a field
Oh shoot you're right! Do rings need to be closed under multiplication?
Yes, by definition
Multiplication is an operation so you need to have the multiplication of any two elements in your set be in that set
Oh duh, multiplication is a binary operation
Quick question: what exactly is a unit element?
an element which is a unit
But what do we mean by unit here?
So the identity?
just say 'multiplicative identity'
no
usually it means an element with a multiplicative inverse
but sometimes ppl use it to mean the identities
confusingly
So when you say it has a multiplicative inverse, do you mean the inverse is contained in the group? or it just doesn't have a unique inverse at all?
What is Z4?
Oh, Z\4Z is how my book writes that
That makes sense too, the congruence class of 1mod4 only has odd numbers
I'm not sure if my explanation is right, but I do get the idea
uhhh
i don't think it's about congruence classes from like Z or whatever
it's just that it doesn't have a multiplicative inverse
What I mean to say is 4k+1 is odd for any k
yeah, i'm not sure that's related
And so multiplying anything by 2 will never give an odd number
that's more like it
That's the logic I was trying to get at
but 4k+1 being odd doesn't have much to do with it? or
oh well
ok i see it now
i don't even think about conjugacy classes now when doing modulo
So what exactly about this claim makes this a maximal ideal?
anything bigger contains a unit
Is that enough to conclude something is a maximal ideal?
yeah any ideal that contains a unit is the whole ring
Ohhh, interesting
it's cause 1 is in the ideal in that case
and the ideal generated by 1 is the whole ring
Thank you all so much for the help. My research has lad me to a grad textbook where I need some understanding of abstract algebra, which I do not have much. I was able to get the research I needed done today thanks to you all. 😀
Nope!
Yes indeed. We learned that the best way to think about matrix multiplication for our intended goal is with rings.
Not in the way you're thinking tho 😁
If you are interested, I can share after I finish eating my food. It's definitely something I'd rather draw out than do on LaTeX
Actually nevermind. I may mention it tomorrow once I gather a better understanding.
What's this book abt
What are you reading it for
I know a little about valuations 
Well, for the moment I am reading it to get an idea of why {x\ in A|v(x)>=0} is a subring of A and what the maximal ideal is for this ring
Once I actually understood it, it's honestly pretty straightforward. However, I haven't taken an abstract algebra class or learned too much about it, so that was a big jump for me
Then the goal is to try and see if two matrices are diagonally dominant w. r. t. P-adic absolute value, then the Product of the two is also diagonally dominant.
That's the end goal
A similar thing goes for the inverse
Hi.
I have a question about rings.
I'm struggling to see why ri (r is any real, i is the square root of 1) fails to form a ring.
slimvesus
yes
it needs to be an abelian group, be associative and distributive under multiplication
for some reason I can't think of a scenario where it doesn't work
I'm pretty sure the reals are.
Well the reals are under complex, so you'd still be closed, no?
Actually that's where I have a question
so this is a complex set
if I have a number not including i, I guess where r = 0, am I still closed?
ok
what if I have just 5 or something
so maybe 5i * i
that's -5
so this isn't a ring
it's no longer in the set
What is diagonally dominant?
It's a little different for normal absolute value, but we are dealing with an ultrametric distance, so the respective inequality is considered instead.
So the absolute value of the diagonals of each row is strictly greater than the maximum of all the other entries in the row.
Ok
you're only restricting it to be greater than the entries in the row not the column too?
according to your definition these are two diagonally dominant matrices which multiply to make a non diagonally dominant matrix: $$\begin{pmatrix} 1 & -p \ p & 1 \end{pmatrix} \begin{pmatrix} p^2 & p^3 \ p & 1 \end{pmatrix} = \begin{pmatrix} 0 & p^3-p \ p^3+p & p^4-1 \end{pmatrix}$$
Merosity
could I ask a question?
seems like the question's done so I'll go ahead
anyone know how to do this? I'm not sure what a semidirect product is but I've proved homomorphism
this is what I have so far
Uh, I feel like you should go look up or learn what a semidirect product is before trying this problem?
I haven't really been able to find anything concrete googling
If this is an exercise for a class, then have you guys not covered semidirect products? Or if it's an exercise from a book, then it should be in the corresponding section?
I'm just looking at practice problems at the end of the chapter, I guess it's assumed that I knew what a semidirect product was beforehand
it's ok tho I'll look at the wikipedia, appreciate it
That is definitely something we may have to do.
yeah considering I gave a counter example to what you're trying to prove heh 😛
Whats the purpose of considering these matrices
there's something called the Gershgorin circle theorem
basically tells you stuff like if it's invertible, where the eigenvalues are, and helps with computing eigenvectors/eigenvalue algorithms
Yea, we proved that a while ago. Now we are just trying to see if there is any variance with certain matrix operations and ultrametric diagonal dominance.
if we define 'totally dominant' to mean a matrix that is both row and column dominant, then I was able to prove the product of two totally dominant matrices is totally dominant
and then realized we can loosen this to if A is row dominant and B is column dominant then AB is totally dominant
so a little less restrictive, I guess a simple corollary is if X is column dominant then X^T X is totally dominant, which is kind of interesting
I haven't proved it yet, but I've definitely made that deduction.
On another note, how'd you jump to X^TX being totally dominant?
Ohhh, I see.
Because X^T is row dominant 
Since you're already 5 steps ahead of me with this stuff, I think you can also see if A is totally dominant, then so is A^-1
interesting, I see how A^-1 is guaranteed to exist now if A is totally dominant, but I guess my next question to ask myself is, when can we say like, A, C are totally dominant and we have A*B=C does this imply B is totally dominant? Does it imply it's column dominant? Or none at all?
obviously A*A^-1 = I as a special case of that
ty ty
Well, I think we can answer that question quite nicely.
Since both A and C are totally dominant, and inverse exists and is also totally dominant.
So $A^{-1}AB=A^{-1}C \Rightarrow B=A^{-1}C$
dackid
And we have already established that product is totally dominant
Well, you have. I still have yet to prove it. :P
I never proved the inverse was totally dominant yet, I was hoping to prove it by this but
I haven't thought about it yet either lol just a bit occupied with something else atm
Man can you give me the ref of your book, I think it's pretty nice
Is a refinement just a longer tower ?
Ty
So is it j=s ?
Okay
Lang loves algebra at any level and in any form
Wow it's a bourbaki member
In regards to this, it says in the next page that K/v=A_v/P_v. Why is this exactly?
Here, this may be needed
the residue field of k is defined as A/P
Can someone explain to me how these function compositions make sense? Topics in Algebra 2nd edition
iirc Herstein writes his composition in the opposite orders, so that phi dot psi means do phi first and then do psi
the composition of permutations?
oh my god...
why, just why
iirc he also writes function application in the opposite direction too?
So he writes (x)f instead of f(x)
oh maybe i was messing them up
oh yeah
are you sure? are there other editions?
im sure
its the normal notation
which edition is this?
wdym
its just "Abstract Algebra"
oh yeah
third edition
yeah composition of permutations is normal in this book too
one is called topics in algebra and the other is abstract algebra so they're different books I think
Is there a slick way to do this or do I have to suffer?
maybe it'd help to note that the irreducible factors of x^n - 1 over Q are exactly the dth cyclotomic polynomials for d | n
i don't know if this is really any faster than just calculating though
This method is MUCH faster than direct computations right?
FOILing stuff out is gonna be a pain
yeah probably
oh, you can also use mobius inversion on that fact I mentioned earlier to solve for the cyclotomic polynomial instead
$$\Phi_n(x) = \prod_{d \mid n}\left(1 - x^{n/d}\right)^{\mu(d)}$$
Zopherus
I used wikipedia
oh I didn't realize this was on the wikipedia page
Can we classify problems like these as cruel and unusual punishment?
(i remember doing this by hand 😶 )
(only to get sad that cyclotomic polynomials can have coefficients other than 0,1, -1)
I hope you didnt do them by hand untill you found that out
lmaooooo
whats the best way to do this?
firstly, how do i efficiently get initial sylow 2 and 3 subgroups?
Is there a result like every p subgroup can be placed in a sylow p subgroup? Then maybe starting with a 4 cycle like (1 2 3 4) can be a starting point
i see
(Finding a sylow 3 subgroup is trivial)
But I'm not sure if that statement is true, I just pulled it out of my ass
it is
what i did was
consider the subgroup generated by (1 2 3 4) and (1 2 ) and got it that way, but that just a guess
Er, I don't think that generates a sylow 2 subgroup
maybe i did something wrong lol
(1 2 3 4)(1 2) = (1 3 4) is a 3 cycle
er
let me check
$\langle (1 2 3 4), (1 2) \rangle = {1, 1234, (13)(24),(1432),(12),(134),(234),2413}$
Yes
maybe i did something wrong?
I didn't check it, but it looks like you agree that there are 3 cycles
But sylow 2 subgroup of S4 is order 8
So there should be no elements of order 3 right?
im not sure
This follows from lagrange's theorem
how
If x has order 3, then the cyclic group generates by x has size 3. but 3 does not divide 8
But you said so yourself, that subgroup contains (1 3 4)
