#groups-rings-fields
1 messages · Page 274 of 1
Just don't interrupt someone else asking a beginner's question
You're more likely to have people who remember what a sylow is in this channel tbh
alright cool thanks
who? me? noooo never
A sylow (noun) :
(1) great mathematician who inexplicably works as a high school teacher most of their life
"Dude, I had this total sylow in the 10th grade, now I can finally shitpost on mathcord"
40 years as a highschool teacher damn. Dude had a calling
i’ve dug up some short early 20th century articles by thoralf skolem about sylow in norsk matematisk tidsskrift i’m excited to read when i find the time 
I just find it funny that three greatest Norwegian mathematicians of history all have families of groups named after them.
Did it go down hill after he died or something?
i probably should not have mentioned this when i do not want to elaborate
Which school even is it. Wikipedia lists some school in Denmark, which isn't correct
hartvig nissen
Right, he was there for like two years or so. And then he worked at Fredrikshalds lærde og realskole, according to snl
Nissen is nice though, not sure why that would be a mistake
personal circumstances
oh i wasn’t aware of this second place… i guess it’s probaly mentioned in skolem’s article i’ve yet to read
is it true that a p-group has subgroups of order p^i for all i
as long as p^i<=order of group of course
im guessing not
Have you heard of Sylow
it was used in the proof of sylow
im dumb
wait no
only if every proper subgroup has index divisible by p
if its abelian it must have all subgroups
p group has nontrivial center so G/Z is smaller. then induction and we done
this correct?
stupid question: what would be an example of a group G with order |G|>|R|? obviously, the additive group on R has an uncountable order, but are there any uncountable order groups with order aleph2 or alephomega?
This does reduce things
Ok so
Dumb answer: free group on X generators has cardinality |X| + aleph_0 with choice
I’m afraid I dont remember all the conditions and corollaries regarding Sylow offhand, but I thought it said we had a p^i order subgroup for each sane i?
Also, aleph_2 or aleph_omega need not be above |R| anyway
But that’s sorta irrelevant to the intention
hm? wdym?
o theres probably some variations to tthe theorem
if that's true, i don't think i understand aleph notation lol
thanks tho
i thought aleph1=|R|
Probably some include some corollaries in the statement
oh shit. well if i say aleph1 to mean |R| is that generally well understood? i know the CH isn't decidable, but i would certainly prefer it be true lol
Not really but it’ll get the point across most of the time
And usually just being uncountable is enough
CH is independent of ZFC so it’s fine to slap on too, but not needing it is always better obviously
I’ve slapped it on for some elevator pitch sketching for small model saturation stuff in a PDE fever dream
I’m not sure I get the last 2 bijections
H mapped to (G/H, H)?
Is it to specify which coset is taken (in this case the one with identity?)
A pointed G-Set is a G-Set with a chosen element
The chosen element of G/H is H in this case
So H is the coset with identity right
Just to make sure
Yea
Alright thx
reading through an abstract algebra book, i just reached the section talking about subgroups and cyclic groups. i found this proof. i didnt write it, i just rewrote it by hand so that i can understand the steps as i was reading. my question is, in the third highlighted step, why does the author point out that $a^{n - m} \in \left < a \right >$? is this because we don't automatically know that $a^n (a^m)^{-1} \in \left < a \right >$? in other words, we know that $a$ to some integer power is an element of $\left < a \right >$, but not two elements multiplied.
Yeah
proofman
That condition is equivalent to <a> being a subgroup so if we were to assume it our argument would be circular
Trying to understand the notation in this cyclic subgroup. From what I understand the elements are getting added. So if 2(-1) = -1 + -1, what is -1(-1)? somehow $\left < -1 \right >$ generates the all of the integers. i am failing to see how that is possible.
proofman
-1 times -1 is 1
and then it's pretty clear that 1 generates all of the integers additively
wait a second, so this is multiplication?
how is writing multiplication as concatenation notation abuse
i think you understand my question
that's very silly
abelian groups are Z-modules there is nothing wrong with writing it multiplicatively
this is very nonstandard 
yes
but i think this is what the author does in this example
but then how does (-1)(-1) work?
in an abelian group the notation nx is often used to mean the same thing that in nonabelian groups is written x^n

please stop writing addition multiplicatively
@limber thorn @hidden wind does this seem right?
^
the inverse of $-1$ should just be $1$ i think
proofman
^
so when the author says $-2(-1)$ that's like saying... add the inverse of $-1$ twice?
proofman
author is Gallian btw
does this make sense?
so in this m times n notation, or whatever he is using, which one is supposed to "be like" the exponent?
sure, i am open to that
my brother in the heavenly lord you are multiplying integers
you did this when you were 5 years of age
I don't get what the confusion is
I think he's asking whether ab in additive notation is like a^b or b^a in multiplicative notation
it doesn't matter
think of it as either if you want
you're just trying to show that every integer is a multiple of -1
btw, why did you ask him to go to DMs, then delete all your messages?
which is trivial because (-n)*(-1) = n
yes, but more generally, i just dont understand what is going on
<a> = {..., a^(-2), a^(-1), a^0, a^1, a^2, ...}
set a = -1
Note: I've written the group operation multiplicatively, and repeated application of the group operation as exponentiation. When you're in Z the group operation is addition, and repeated addition is multiplication. This can be confusing, because when we write a+b we could be talking about a generic group operation in an abelian group, or we could be talking about literally adding together a and b
So it's not really a matter of multiplicative vs additive notation, it's just that when you're in Z, the group operation is addition
makes sense, thank you!
I think my brain was not working cause I wake up and this makes sense
The pointed G-sets represent the same G-set and they map to conjugate subgroups of G, but if we take the operation in reverse the need for a pointer is removed if we instead remove all conjugates of subgroups
Well I need to also exclude the empty set cause it never works
I want a hint if someone can help Suppose R is a ring of 10 elements. Prove that R is commutative.
i'm not entirely sure what I'm supposed to show here, that the prime ideals act as a basis for the jacobson topology on prime(z)?
if I have a homomorphism R[x, y] -> R[x] that sends x to x and y to x^2 how do I show the kernel is exactly (y-x^2). Having trouble showing the kernel doesnt contain any more elements
So one way to do this is to try and look at an arbitrary element of the kernel and then reduce it in some way
So we have some polynomial f(x, y) = whatever
Now suppose it has some power of x in it somewhere, x^n
If f(x, y) is in the kernel, I can substitute something else I already know is in the kernel and get another thing in the kernel
So what I mean for example is that x^4 is in the kernel iff y^2 is
So I can 'reduce' this thing to include only single powers of x
WLOG I can assume that f(x,y) = g(y) + xh(y) for some polynomials g and h of y
And now I can think about when these would be in the kernel
If I can prove that this is in the kernel iff it's in (y-x^2) then, since I have only used manipulations due to (y-x^2), I have shown that the kernel is (y-x^2)
@coral spindle can you maybe give me a hint for the the question of 10 elements in a ring
I have no idea. Also please don't ping random people.
can you explain this part more carefully? I get that the reduction thing works for monomials, but why do we expect it to work in general, like maybe the sum of monomials is in the kernel even if each monomial is not
But that's not what I've claimed
Hint: What can the characteristic of such a ring be?
Let me give a tiny example
the thing is we did not yet learn over the characteristic of a ring
so i tried to prove it using contradiction
The underlying abelian group is cyclic
oh I know! pick me pick me!
my idea was we know that two of the 10 elements are {0,1} and with contradiction we know that ab \neq ba for all elements in R and plus a \neq 0 \neq 1 same for b
Does that finish it?
I feel like that + the unit of the ring commuting finishes it
Idk tho
Maybe I’m wrong
I feel like the unit has to be a generator of the abelian group and then you go woohoo
I feel like I would write out this argument as well, but yeah that's basically it
Let's say we're trying to discover if f(x, y) = x^2 + 2yx + 1 is in the kernel. Now we know already that (y - x^2) is contained in the kernel -- this is obvious. Therefore f(x,y) is in the kernel iff f(x, y) + (-1)(y-x^2) = y + 2yx + 1 is in the kernel. In particular, f(x,y) is in (y - x^2) iff that latter sum is in (y - x^2).
Idk i still find it difficult to be fair
Yeah, that's okay
thanks got it!
i know but can you give me like what you meant with the chracterstic so i know where to go
i know what a unit is
So 1 commutes with everything. So also 1+1 commutes with everything, and 1+1+1, etc.
The characteristic is the smallest n such that 1+1+1... (n times) equals 0.
Notice that 0, 1, 1+1, ... forms an additive subgroup of your ring, so this limits what the characteristic can be (by Lagrange)
Notice also that x+x+... = (1+1+...)*x, so if the characteristic of your ring is n, x+x+... (n times) is 0
And what can you say about abelian groups where all elements have order 2 for example?
i do not know if im right with what i mentioned
an abelian group whose elements are all order two is a Z/2Z vector space
make a cardinality argument
I'm not totally sure what you mean here...
i mean because they are of order 2 right
Yeah, so that means a+a=0
exactly but that means as well that a^2 = 1
because a ring has two operations right
like + and multiplication
Sure, but we're just talking about addition right now
sure agree so this mean that a has chracterstic of 2
but how that is going to help us with proving the statment that 10 elements implies commutative
im actually unsure if levy is a good reaction sticker or not
Well, it will tell you what the only ring with 10 elements is
Sure but I mean I do not know what are the elements of that ring so how come I’m going for example to guess that each element has order of 10
In such a way that a+a 10 times equal = 0
I know I’m asking stupid question sorry but I do not see it yet
So do you know what the finite abelian groups are?
Yeah, but I mean do you know which groups that is?
Like the classification for example
Like do you know what the abelian groups of order 10 are?
Not really
But I guess it’s going to be
Module 10
Because they are always ableian
In addition
And multiplication
Hmmm, okay, so what tools do you have? Like do you know much about groups and rings besides the definitions?
the characteristic determines the order of all of your non-zero elements, and the characteristic can only be 1, 2, 5, or 10
they can't all be order 1
it can't be 2, since R would be a Z/pZ vector space for p = 2
it can't be 5, since again, R would be a Z/pZ vector space for p = 5
so all the elements have to be order 10
the rest follows from the classification of finite abelian groups
Or maybe you can just argue like this:
The characteristic must be either, 2, 5 or 10 (from Lagrange, clear?)
If it's 2, then take x not 0 or 1. Then {0, 1, x, x+1} is an additive subgroup of order 4, is this possible? (Think Lagrange)
If it's 5, {0, 1, 2, 3, 4, x, x+1, x+2, x+3, x+4} are 10 elements that all commute.
Similarly if it's 10, {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} all commute.
I see let me try that approach
(the characteristic 5 example doesn't actually exist, but I guess that's no hinder to the argument)
yes that's how you prove it
It has to do with sizes of subgroups
i see
oh yeah? watch THIS
nvm they're right
Wew when 5^2 \neq 10
it was earlier today
Can someone show me how to use gauss' lemma about polynomials to show y^2-x^3+x is irreducible in k[x,y]?
why do you think you need Gauss' lemma?
this is a quadratic in y
I thought that was the standard method to show this. Why is it being quadratic obviously imply it's irr?
if it were reducible then x^3-x would be a square in k[x]
Why would x^3-x be the square of something?
Does this have to do with there being no mixed terms like xy?
If it were irreducible it would factor as (y-a)(y-b), where a,b are polynomials in x
right?
Right I agree with that. But then ab= x^3-x right? Where does the square come from? I can find an example of a and b e.g. a=x and b=x^2-1.
I guess you can use gauss lemma to see this. Like gauss lemma tells you that this is irreducible in k[x, y] iff it is irreducible in k(x)[y].
And in k(x)[y] you know how to factor quadratics
If it is irreducible in k(x)[y] it is trivially irreducible in k[x][y], it is the other direction that is not trivial (which is not needed here)
You can also just sort of write it out explicitly though
the point is that the coefficient of y is zero. So a+b=0
Ohh I see thank you that makes sense! And then squares of polynomials have even degree so this can't happen and it follows y^2-x^3+x is irreducible in k[x,y]. Thanks again!
Is this seemingly intuitive statement true: If we have two modules $M\cong M'$ and submodules respectively such that $N\cong N'$, then $M/N\cong M'/N'$
adi
how do you cook up subspaces which make the quotients non-isomorphic?
There's also a very simple counterexample with small finite abelian groups
not sure i'm seeing the full picture
OK so broadly, you're suggesting an infinite-dimensional vector space H with a proper subspace $S\cong H$, so on side you have nothing and on the other you have whatever $H/S$ is?
adi
Yes
thanks! yeah it didn't strike me that you could come up with such subspaces in an infinite-dimensional setting
just out of curiosity, what's this one?
Z/2Z x Z/4Z
Where is my thinking going wrong with this? I take the automorphism of Q that maps x to the multiplication by 2 map on Aut(Q). I take the semidirect product of Q and Z with respect to this automorphism. I'm supposed to still have Z as a subgroup of Q in this semidirect product.
But I'm sort of lost about how this works out with the actual definition of the semidirect product and the identifications used for Q and Z.
In the product we identify Q with {(q,1) : q in Q}.
We also identify {(1,z) : z in Z} with Z.
But {(q,1) : q in Q} has a second subgroup iso to Z, it is {(z,1) : z in Z} (and is a distinct set from the other Z, but by our identification we ought to technically also call this Z too).
So, isn't the claim that in my semidirect product Z <= Q sort of ambiguous?
Here are pictures of the section from df I'm talking about:
G is the semidirect product of H and K
it's this one
if it was the other Z then xZx^-1 = Z because x is a generator for that Z
Okay, I see it now. This is some fucked up naming/identification lmao. 
it was kind of obvious from context
they really did just have to write Z < Q < G though
Seems like they ought to point out that Z here refers to two totally different subsets of G though.
The <x> thing is called iso to Z but not identified 😔
Ah yeah that's true. Didn't realize that technicality.
Anyway, they also point out Z < Q, and Q has a pretty uhhhh distinct choice
yes.... {x/101, x in Z} is the clear canonical choice
If we callin that Q maybe I should just Q-uit
I have changed my mind. I hate Z iso to K. Z=K as god intended.
All categories are skeletal
Remove my skeleton
no I'm a lazy fuck
NO MARLINS
I don't have time for that crap with physics
wait should i apply to ross this year?
I'm doing a lot of the basic super easy exercises in judson
yes
ross was best 6 weeks of my life by a very high margin
there was exactly one kid at ohio who had done abstract algebra
and he tied for most sets finished along with some other ppl
I LOVE ARTIN DUDE
wait this is
for fun
highly trivial i fear
i cant do any math until i solve it
go torment amukh or smth
there's a complex analysis indy study at my school rn actually
but I have no time to join it
o_o complex before real?
idts
I still need to take linalg in the spring after absalg this semester
any good comple text assumes some familaiority with pst
🤡
idk lol
I have a math phd to explain it to me
oh good
:)
read lang, its super boring but super interesting
if that makes snse
I mean I still want to take the class ofc so I can turn the "jumbled picture in my head" into an actual understanding
joever
too lazy though the textbook for my class in Strang (sadly)
for those of us without such a privelage, we have to follow hte prereqs
erm ... not slay at all !
hehe
:DD
i miss zorn
yeah idk lol
joever
i am, but im not doing the measure theory seminar
huh
i have too much schoolwork, i would drag them all down
is the RA thing officially over
this is so real
im following folland at a slower pace
my research project is eating my time
and i have a friend who is vetting my proofs
unironically 20 hours a week
wait this is goated
is that why i didnt get in
cuz ross thought i would have know everything already
not really
they did accept ppl with a decent amount of background
what about this
they don't accept everyone with huge amounts of background
idk
maybe you just got unlucky
i had huge amountts of background bruh
there's a lot of people who I think should have gotten in that I know that didn't
and some people that I met that maybe weren't taking full advantage of it
is it better to show not a lot of background on psets
cuz i used field extensions on pset
i think that may be reason for no accpet
I mean you also have to explain where that background and knowledge came from
if you just randomly used field extensions
it probably looks like you're cheating
💀
wtf
🤷♂️
and just pulling out a lot of high powered theory is pretty cooked, especially if the other problems have more elementary solutions
high schoolers typically dont know what a derivative is
the demographic that applies to ross prob does tho
no
the majority of ross application pool is comp math kids
no no
i am comp math kid ...
comp math "people" when they see showers
my entire school is comp matth people
its a struggle every day
joever lol
isnt ross mosty elementary nt tho
even if you have high powered theory
😔
comp math kids know that
elementary number theory has hard problems
i meant
wait im actually ass at nt
the camp
do they know the uniqueness of F_p^k?
but that isnt elementary nt
ur not like tese other girls kevin
do they know hensel's lemma, quadratic reciprocity, pell's equation, etc.
doesnt this follow frm teh fact that any two fields with the same # of elements are iso?
most oly kids know qr
some know pell
you're confusing the Ross application demographic with like the application pool for PRIMES
lol
some know hensel corollory
wait u shoul;d apply to primes
i feel like u would get in
I'm not good enough for primes
arti could prob do it
o i have that book
the pset is very oly styled (and they weigh oly, which I'm crap at), there's graph theory that I don't know, etc
its strange
oh i like graph theory
read diestel
o ive told you before
isnt that a gtm
ye
yes
but its not hard
idk some GTMs are accessible
you dont need gt knowledge
ireland and rosen is accessible after one UG absalg book
I'm planning to take an indy study out of ireland and rosen with my math teacher if he approves
next year
what is ireland and rosen lol
but he says he doesn't actually understand the book
the de facto "intro to advanced NT book"
well both alg nt and analNT
well it appears to have less numbers
ireland and rosen does some o fboth
dont you need commutative algebra and gal theory for those
ireland and rosen is an intro
💀
o
it teaches some of the basic comm. alg iirc
and presupposes some of the gal theory
2 semesters of UG algebra hopefully covers galois theory (if it doesn't, wtf are you doing with your life lmao)
marlins making my inferiority complex grow by the second
idk any of this crap
I'm 3 weeks into absalg right now buddy
we proved Lagrange yesterday in class lmao
💀
3 weeks for lagrange
well 1.5 weeks was on prereq set theory and ENT and stuff
fair enough
oh
for people that hadn't taken number theory/intro proofs beforehand
grop theory as an intro to proofs is weird
well it's not meant to be an intro to proofs
oh but i go to a sweat school
so everyone just learned prof based LA in the womb
intro to proofs just do oly lol
🤓
some of us, marlins, go to public schools that cut their funding for toilet paper last year

only benefit of oly is knowing how to write proofs and college apps
I live in a residence hall that was scheduled to be torn down 10 years ago
oly teaches proof wrirting?
and clout in math community
all oly problems are proofs
oh yeah
lock in
but the proofs i wrote for usajmo and the proofs i write now are
imagine making usamo
VERY different
🤓
in terms of rigour and generality
wait
college apps is cooked
yeah you could have gotten into ross this year lmao blackbeard
only 5/60 people at ohio were JMO/AMO quals
and they were mostly more cracked than the rest of us
I barely kept up with them
i am also jmo qual
🤓
but i didnt get in ross
orz
wait no
dude i am 11th grade now and its 2024?
2022 jmo is hard
what uear was i in 8th graade for?
I got a 4 on AIME this year lmao
2021
bc I sillied 3 questions
ok like numbers are hard
i got above the median score, but i didnt place in the top 35 or whatever
i did alright but not enough to justify the amount of time i spent studying
my roommate at ross missed MOP by 2 points
from JMO
motherfuckkkk
it's ok I pure math pilled him
good.
he's applying to primes now :DD
gooood.
who
damn the ross memories are hitting hard lol
preach the gospel of rudin
Aiden Jeong
🙏
he's grinding dummit and foote
id ont know
sully
wait fukcing ew
tell him about artin or jacobson
what
cmonn
artin is so bad bruh
WHAT
its only about matrices
joever
but it covers everything comprehensively
d&f problemsets are boring as all hell
idk
my class uses fucking judson which is a trimmed down book for students without much mathematical maturity
not my best take
im lockded
bro
im doing artin and AoM at the same time
theres always some interesting parallels
yeah ur cooked
apush is cooking me rn
we fr turned this chnanel into discussion-1 😭
I have creative writing next semester it's so joever
oh i rly like writing
I like it a lot
and I have my favorite english teacher teaching it
but it's gonna be so hard
lol
marlins
how do i convert my yucky classmates into pure math
i was reading munkres in class and
some kid gets on my ass for messing up a weird computation in multi 😭
Put them in the pure math grinder
they are so mean to me
"whats the point of proofs"
"put munkres away, this is english class"
Munkres is an English text
Let k be a field and consider the integral domain A=k[x,y]/(y^2-x^3+x) and it's field of fractions Q. Even more consider [x]/1 in Q with [x] the equivalence class of x in A.
then how can I show [x]/1 is transcendental over k?
Suppose kn( [x]/1)^n+...+k0= [0]/1. I think it follows that kn x^n+...+k0 in (y^2-x^3+x). But since the only non zero elements of this ideal has a term with a y factor maybe it follows that kn x^n+...+k0=0. But we know x is transcendental in k(x,y) so this can't happen.
Does this argue that [x]/1 is transcendental?
I dobut they actually believe this
or say this
lol
just don't sell in multil ol
you have to give them interesting but simple questions
so they can think deeply abt simple things
I'm wearing a tshirt with that on the back rn
i gave one quesiton ab thomae's fucntion once
its been a year
i learned multi alr so we are chilling
more elementary
i should show ss if it didnt have their names
yeah i did
i asked them to prove the uniqueness of exponentiation
apparently thats so "pointless" and "trivial" and i am just being overly pedantic
don't just straight up give them boring ass proof problems like this
its interesting to me
it is worth doing the exercise
but you have to motivate even "why we want to study the integers so rigorously" first
i constructed R
by explaining why the integers are interesting
this is also a highly technical argument
i used cauchy
marlins i tried
bruh
give them like legendre symbols
or talk about sums of squares
cuz like ill be doing a basic anal problem
or sumes of cubes
and they look over and see a few symbols
💀
... they are comp math people, not 4th graders man
nah they just dont care abt that i think
and explain how that gives you Jacobi's number of sum of squares representations result
idk
sometimes there's nothing you can do
what is this glorified chat here
Any recommendations for a rigorous/higher level counterpart to my current first semester of undergrad algebra course to read after class? Would Milne's Group Theory work?
naw they need defeated sanity
umm artin ?
dummit foote
nathan Jacobson
do you feel like giving pros/cons of these
our current textbook is Fundamental of Abstract Algebra by Malik/Mordeson/Sen
oh chatgpt does a great job of tha
there's so many channels in this server I've yet to discover
ty
these notes are well made too
richard borcherds in his channel did a great job altho its not proof based and u dont get the notes
i have it all handwritten by myself
1 was great problem
need help with 2a
i mean is trial and error the only way or is there other way around
thats how i would do it
idempotent doesnt work either, its at exact 7 its becoming identity
and 3x3 is hard to see if its invertible or not
yeah joever
GL(2, F_2) very good
its D3
🤫
doesnt this group have order 168, meaning a matrix of order 7 is possible by lagrange's theorem since 7 divides 168
or am i tweaking
,calc (2^3 - 1)(2^3 - 2)(2^3 - 4)
Result:
168
oh yeah
thats it
by the possibilty of existence its conjectured
$\text{GL}_3(\mathbb{F}_2)\cong\text{PSL}_2(\mathbb{F}_7)$
yeshua
cauchys theorem
oh yeah u are correct
how fool i am 🤦♂️
7 a freaking prime, should have striked earlier
let aut(G) be cyclic group then G is abelian group. Since G/Z(G) is isomorphic to inn(G) and inn(G) is cyclic so G /Z(G) is cyclic thus G is abelian.
Is it correct?
yes thats correct
okay thank you
Is $\text{Aut}_{\mathbb Q},\left(\mathbb Q(\sqrt[3]2)\right)$ trivial?
a.b.s._.0.
[automorphisms fixing Q]
Yes
💵
To show that $\mathfrak{S}_n$ is $\mathfrak{A}_n \rtimes <(1 2)>$, Does it suffice to say that the subgroup on the right is of order 2, and why ?
rraanto
Oh the intersection is trivial and the order of $\mathfrak{A}_n$ is half that of $\mathfrak{S}_n$
rraanto
Don't you also need to specify the action
To determine the centre of ring M_n(R), may it be enough to determine the centre of {e_ij | i,j= 1,2,..,n}.
I don't know how to write correct proof but my guess is a scalar matrix will work.
I think we need R to be commutative
If R is not commutative then the centre of M_n(R) is identity.
Is it correct?
Guys
Sry it's in french
I have X³-bX-b
Which "cancel" a lmao what the word in eng
Like P(a) = 0
P ... a
Anyway, how do I prove that P is irreducible in k(b)
a is transcendant btw on k
rj
<@&268886789983436800>
The center of Mn(R) is Z(R)*I
To determine the center it's enough to determine what commutes with re_ij
Muted for spam.
Yes
And to determine centre of e_ij then? I tried so I get scalar matrices
Yeah, that sounds right
But I am not sure how to write properly, should I worry about it or just skip it ?
wdym by R is commutative
its a field right?
What does M_N/{+-1} mean?
Surely it means modulo the diagonal embedding of {+1, -1}?
Strange thing to write though
but (a,b) could have order N while (a,-b) no
real but they don't have order N unless N = 2. This is dumb
Uh
they should've just put \pm m and \pm n
Am I just missing something
I'm pretty sure (1, 1) and (-1, -1) have order N in (Z/NZ)^2
oh oops I read what you wrote as (1,-1). But still, (a,b) can have order N while (-a,-b) not. In any case, M_N is not a group or anything. Well I suppose you have to include some factor depending on whether N is even or not
it has to be the group generated by elements of order n or something
I understood multiplicative order
yur
because the condition (m,n)=1 already gives (m,n) has additive order N
Might be time to inspect the context 🙏
woke
Ur right the context is filled with snowflake liberals
We should apply facts and logic to it
lmao what
Fun fact: you are allowed to make jokes while doing math
So true.....
okay this is pretty horrible notation. The order is actually additive order. They are just picking a set of representatives. Like the lifts of an element (m',n') of M_N/{+-1} to elements m/n in Q with m,n coprime forms an equivalence class
Grody
proof?
See above
Suppose n is a homomorphism of R into R' and n is epimorphism. Does this imply that n is an epimorphism of the groups of units of R onto the group of units of R' ?.
No because we can take n:Z -> Z/pZ then it is not true when p >2 and p is prime number.
Is it correct?
the prophecy is true
Yes
You mean it implies that n is an epimorphism of the groups of units of R onto the group of units of R'?
no the exact opposite
My counter example?

I got the clout soz boss. It's like top trumps
Sorry I don't get it what is correct or what is not
I should start speaking in riddles instead of saying things plainly
When I feel confident in my theory then it will be found wrong 😭
it doesn't even descend to a group homomorphism in your case
Thy proclamation... its verity is plain as the day is long; blatant as the grass is green
wait yes it does
Yes
Actually they define n is homomorphism when n(1) = 1
Oh this is true
In any ring which has unit element
But no we need a surjective for that
So they define n(1) = 1
Calling a homomorphism n is the most fucked up thing
Boytjie
Thanks
I like that when Latin and Greek made their miniscule H, they both took n and made one part a little longer
Just a different part
my dumbass was literally about to ask what the latin one was
If R is a commutative ring with prime characteristic p then a -> a^p is Endomorphism of R. But it is not necessarily automorphism, right?
Because take R = (Z/2Z)[x] then it has characteristic 2 but it is not surjective mapping.
Yes if it is a finite field then it will be true.
yup, good counter example
Me when perfect fields
some things are best left to erode in the sands of time
What is that?
Fields being perfect is rly important.......
The tl;dr is that a field of characteristic p is perfect if x |-> x^p is a surjection
Thank you
what's an example of a subset that's not closed under this topology on Prime(Z)? for instance, if I take any subset of prime ideals of Z and consider their intersection, it's just going to be their product - but the prime ideals which contain this product are only going to be the prime ideals which are in the intersection originally, no? Hence, it looks as if every subset is closed
There's a prime ideal that is special, different than the others..
You asked about Z
It can be closed
well if it's just 0 right
If it's just (0) then it is not closed
There are nonclosed subsets that don't contain (0) though
They might not be finite though..
what if i forgot all my algebra
?
Shouldn't require much more than knowing what the prime ideals are
{(0)} is not closed because its closure is not {(0)}
the closure of {(0)} is Prime(Z) yes, since every prime ideal of Z contains (0)
i really have no clue about the infinite case lol
that is if we take an infinite number of prime numbers and consider their product
wow i just turned blue
What is the intersection of infinitely many different prime ideals in Z?
well if you have some integer in this intersection, then all the primes divide Z, of which there are an infinite number of them
There's no such thing as infinite product of ideals, but you want intersection not product
yeah, but something tells me that the intersection of a number of prime ideals will be equal to (product)Z
that only makes sense when there are only finitely many
What integers have infinitely many (prime) divisors?
If the ring has a prime characteristic then not necessarily the domain ring.
Let Z/2Z such that addition under modulo 2 and ab = 0 for all a,b in Z/2Z.
Right?
Are you asking if any ring of prime characteristic is a domain?
Then that is indeed false, and you've given a non-unital example. You can also find unital examples.
Sorry but not necessarily unity in my ring
{0,2,4} under modulo 6, it is a unity ring with characteristic 3, right?
Wait
Yes, though it's better known as Z/3
Yes, that works
Thank you
If the ring is a domain, non - commutative ring with unity then characteristic is prime, is there any need R to be commutative?
There are noncommutative domains with unity whose characteristic is 0 like the quaternions
But I don't understand what you are saying
There is a result that if R is an integral domain then R has characteristic 0 or prime
And they define integral domain as commutative ring with unity
But it seems we don't need commutativeity
Do you know how to prove it?
Yes
Indeed
The proof should be the same, yes
Yes
I think we don't need unity either
I used that but maybe we don't need
I have a question too. If R is a ring with unity of nonzero characteristic n. Then the cardinality of R is a multiple of n, right? Because we can do an equivalence relation x~y iff x=y+k for some k=1,...,n. And each equivalence class has n elements. Is this still true for rings without unity? (define characteristic as the smallest n such that nx=0 for all x)
But not necessarily R is finite
Take a polynomial ring over Z/2Z
Doesn't matter, you can still define multiples for infinite cardinals. But if that confuses you you can imagine I added the finite condition to my question
Then {0, 1, ..., n-1} is a subgroup of order n
Additive, ofc
I don't know what a characteristic of a nonunital ring means exactly
Infimum of all n's such that nx=0 wrt divisibility order on N (N includes 0)
If the infimum is achieved by some x then the same argument works
But if it is not, I have no idea.
Yeah and if it's nonzero then it must be achieved by some x because this poset is uh locally finite or whatever its called when you remove 0
Because given a nonzero n, there are only finitely many things smaller than it
If the ring has zero divisor can I say there exists an ideal which is not {0} and ≠ R ?
Otherwise {0,2} mod 4 is a counterexample
Any hint to show that?
Look at the ideal generated by the zero divisor
Yes but there is a possibility that the zero divisor has one sided inverse
Or you mean ideal generated by zero-divisors
I think Boytije was thinking about commutative rings
there is a possibility that the zero divisor has one sided inverse
Is there?
Think this through.
There is if the ring isn't commutative
Really?
Yes
In fact rings of matrices over a field are simple
Despite having zerodivisors (for n>=2)
Right, right, you need some sidedness on the zero divisor's complement. I see.
Take (a_1,...,a_n,..) maps to (0,a_1,...,a_n,..) it has left inverse and also left zero-divisor
You can if R is commutative (and unital). If it isn't, you can't
There is a question that if R is simple then it's characteristic is 0 or prime
Does R have unit?
Yes
Hint?
Suppose the characteristic of R isn't 0 or prime (or 1)
There's already a hint given
What must the characteristic be like then?
Yeah but it's more than just a non-zero zero divisor
Which non-zero zero divisor are you thinking of?
If n = ab, then I take a as zero divisor
What would need to happen for (a) to equal R?
Does it?
We are not sure
A priori it's more complicated than that, but thankfully a commutes with every element of the ring
I see
Suppose ax=1. Can you reach a contradiction from here?
How?
a commutes with every element so xa=1 implies b = 0
Yeah
Thank you ❤️
Alternatively, a commutes with every element so if it had a right inverse it would also have a left inverse
Yes
But zero-divisors cannot be invertible
It's okay, I also only noticed after you said this because I noticed this wouldn't be enough to prove what we want
Now I wonder if there can be a noncommutative nonunital simple ring of composite characteristic
To show if I and J are relatively prime ideals then R/(IJ) is isomorphic to R/I × R/J by x + IJ -> (x+I, x+J) it is surjective by chineese remainder theorem and if x-y in I intersection J then x-y in IJ, so it is injective.
Right?
Times Miz thinks simple rings means no nontrivial proper sided ideals instead of two sided and confuses the fuck out of himself: 4
Yes, consider the additive group of R and use the classification of finite abelian groups
Overkill as we can still prove it without choice (there can be infinite cardinals which are not multiples of n without choice)
can I ask a problem from an assignment or is that frowned upon
okay cool. So I've been asked to give an example of a simple module wherein two (nonzero) elements have different annihilators.
to begin with the only easily constructed simple modules which come to mind are Z_p, but those won't work here because that's just a field
but uhh yeah if anyone has an idea of the approach here i'd appreciate a nudge in the right direction
One thing you might notice (or try to prove yourself) is that if the ring is commutative this never happens
Another thing that could be useful is that any simple module is isomorphic to R/m where m is a maximal left ideal
Is there a way to find what this is without doing it by hand (here D8 is generated by (13) and (1234))
if each of those are actually different copies of D_8, which I'm 90% sure they are, then this is the largest normal 2-subgroup of S_4
which is <(12)(34), (13)(24)>
the intersection of all Sylow p-subgroups of a group is the largest normal p-subgroup, if you haven't seen this before it's a good, fairly easy, exercise
But yeah these are the Sylow 2-subgroups of S4 as u probably guessed
It’s obviously normal because it’s the kernel of an homomorphism
they're also the Sylow 2-subgroups of A6
That’s cool
Le Sylow theorem 2 has arrived
||if thats H then H<=P for each sylow p-subgroup P. So conjugation fixes H because conjugation permutes the sylow p-subgroup. If H is a normal p-subgroup then H<=P for some sylow p-subgroup P. conjugating this we get H is subgroup of all sylow p-subgroups||
kewl
A ring, I, J ideals. Let v(I) denote the set of prime ideals that contain I. Find an ideal M of A such that v(I)Uv(J)=v(M).
I found M=IJ, but the solution tells me M=IΛJ. Are both valid?
If you contain I, or you contain J, you contain the intersection
Yea but I also contains IJ, cause IJ is contained in both I and J no?
Yep, so then the question is if there can be a prime p which can contain IJ but not I n J?
My answer is no, cause if P doesn't contain a j€J then still it contains ij for every i€I, and being prime it contains every i€I.
So once you contain IJ you contain one of I or J, hence I n J, and IJ < I n J, so….
It doesn’t seem like it matters right?
Products of ideals are nice, however, so IJ would be the suggested answer
Ok thanks
is the set {x^3,y^3,xy^2,x^2y}?
Pretty sure it should be
yup
how the fuck
i tried to write (12) in this set but i couldnt
as like generated by this set
can u do that
bro im doing this qualifying exam
they dont even allow books in this shit
XD
i can't just bring a computer (or can i)
practicing
idk there's at most 50 different combinations you can try so I'd suggest trying all of them

