#groups-rings-fields
406252 messages · Page 522 of 407
huh
And stacks treatment of divisors was waaay different
I haven't read through all of chapter 2 so I might have missed some stuff
It’s making me want to die but
It’s been like that since the start of doing it so nothings changed haha
are you self-studying?
are you doing it with someone else
It was very... self-driven and I got caught up in other classes
So I have he notes to help
But it’s primarily myself
And yeah just me
oh ok
The issue is like I’m an UG
which year?
3rd year. So a lot of the grad students I took the class with are like further along
Say in chapter 3
oh lol same
And my UG friends are like all just starting
Or not yet started
So I’m like in this dead zone
It kind of ducking sucks haha
I did like all the problems, with a few exceptions in II.1-4 all by myself
And I wanted to die
yeah it was pretty much the same in my class too I think, people had very different backgrounds
I did like all the problems, with a few exceptions in II.1-4 all by myself
@next obsidian noice
I need to do that
It’s just lonely haha
probably over a summer or something
Yeah I did it over a summer
I wish I had an advisor
Someone I could like just meet with once a week and get clarifying stuff or like
Some of the missing stuff that’s just you’re expected to develop idfk how
Example: a lot of properties of scheme theoretic image for Chow’s Lemma
I looked at EGA and stuff and there’s a loooot of like lemmas you basically need to prove
hartshorne/AG is super rough if youre self studying
That’s the type of stuff I feel like you learn from@others
even with a group
Yeah
Idk how the first wave of grad student Hartshorne warriors did it
Before the advent of MSE and ahit
I can feel myself connecting to my AG ancestors at least, undertaking the “do all the problems” pilgrimage
Lmfao
yeah but it might be more efficient to try other books and get back to hartshorne
Rip
I'm reading mumford right nor and it's pretty nice
Hmmm
lectures on curves on an algebraic surface
Oh not red book?
yeah not that
Tbh I heard Hart’s treatment of cohomology is good
And I can maybe catch up to a few ppl at my school
Since I’m close to being done with chapter II
I think I’ll skip differentials and the formal scheme stuff
did they not do cohomology in your AG class?
ah ok, understandable
I have notes so I can refer to those which is nice
And my prof had some like
Chad methods to do some stuff
The like “proper” way
Where Hartshorne has some more ad-hoc stuff
So it’s nice to have the notes on top of Hartshorne
Hartshorne 3 is actually kinda easier than 2
I got lost in the details in chapter 2 for a bit
I was hoping it was but didn’t ask anyone
Since I didn’t want to be disappointed
Haha
yeah early chapter 3 is super nice
I've heard good things about Liu's book too
are you interested in the arithmetic aspect at all or purely geometric?
So uhhhh
Neither
The algebra

Okay so realistically I was like NT bad
But have sort of opened up to the idea recently, also uhhh
Lots of depts are mostly arithmetic so it means I have more places to apply to
And as for geometric, bruh this shit don’t seem like geometry to me bwahahaha
are we the same person lmao
I’m in a special topics course rn tho on like resolution of singularities
And that’s helping me a bit
Honestly, maybe Brofibration
Legit I was like I really like algebra, I want to do Algebraic-something something
it was fantastic
AG was the first that satisfies that which I tried
Hated varieties
Then schemes had me pogging a bit
I liked how like you do algebra locally
And use the sheaf and topology to glue the stuff together
And now I’m just doing my thing
is AG what you want to get into?
I think so
I kind of decided it would be my thing, and my friend keeps reminding me it’s not set in stone
But for the time being I’ve kind of hard committed to it and the schools I want to go to are mainly because of AG depts
And by mainly I mean solely lmao
I'm not sure yet on what I want to do, but I'm also in the algebraic-something boat
Yeah, I haven’t tried AT yet, just too busy
AT is nice
And I think I’d want to try some ANT at some point
But like also I really fuckinf love finite groups and like AAAA
finite groups are used in AT
I could see myself doing a lot of things in the general algebra-sphere as long as it stays away from analysis
equivariant homotopy
But for now I’m enjoying AG and my school is strong with it and there’s a lot of AG-related opportunities present so I’m running with that
AG does seem like a good option
I also like the idea of geometric rep theory
havent done any tho
Is that like GGT stuff?
I know there’s ppl at my school doing geometric group theory which idk much about
nah not geometric group theory
the only geometric rep theory ive seen is where people construct reps using vector bundles and stuff
so im talking algebraic/lie groups
Ohhh
borel-weil-bott etc.
Did someone say GGT?
Nope
nope
Understandable have a nice day
but anyway, that stuff looks dope
i wanna read Ginzburg and Chriss
Oh you remind me I need to catch up on a class Ginzburg's teaching that I'm auditing
On Lie theory
Mostly yeah, though the last few lectures I wanna try on
You said you were covering flat descent
I'm more or less not gonna bother with descent
And I'm gonna just deal with sheaf cohomology
Lmao
I mean he didn't spend much time on descent
I mean that’s how you get all the real results
I guess but fibered products are so important
And it's possible he talked about a bunch of properties of base change during that time
He has video lectures so I can go back and rewatch
Yeah but until you get your hands dirty it’s kinda hard to get what’s going on
And show directly that ___ is stable under base change
I ate too many peanut butter cups
Rip
There's no such thing as too many
man who will eat more peanut butter cups
Anyway yeah Chmonkey I imagine Dima's treatment of stuff was reasonably self-contained? It's possible I just missed some of his base change material, it's possible he's not going deep into descent, or it's possible that he talked a bunch about base change at the same time
He has since moved on to cohomology of sheaves and now this "Fourier-Mukai transform"
So I might try to get caught up again
Bruh moment
I also like the book zetamath mentioned once, "Lectures on Algebraic Geometry" by Gunter Harder
First volume is mostly material that builds up to AG rather than AG itself lmao
Ffs
I just will learn so much technical stuff
Like it's a chapter on categories, homological algebra, sheaves, sheaf cohomology, and compact Riemann surfaces/abelian varieties
Then volume 2 is like
I can get to the point I can abstract things so much it’s impossible to see any geometry
Schemes, commalg, etc
Then my lack of geometric knowledge won’t matter
And volume 1 does some amount of algebraic topology along with sheaf cohomology
So yeah I might just say lol whatever to the class and take my own route through Harder's book
Why do you even need AG actually tho
Are you doing ANT shit?
I literally don’t know what you actually do besides the words modular, forms, and Automorphic
I probably mostly don't need it? I mean there's a non-zero chance I work with Jordan Ellenberg
Why do you even need AG actually tho
@next obsidian to understand math memes
In which case AG is good to know
And like algebraic groups stuff is relevant to me I feel? Also my advisor once talked about a GIT quotient
Idk AG creeps up in weird ways here
Tf is GIT
Geometric invariant theory
Seems like good stuff
But yeah the thing about AG for me is that the actual "content", even abstract stuff, seems cool
Like Hodge theory, intersection theory, algebraic groups, GIT, moduli spaces, etc
The problems it solves are excellent
But the foundations are just a slog and a half
Yes
yup, I'm doing a class which is on spectral AG. But we've just been doing stuff on quasicategories up till now
Spectral AG?!??
the build up takes super long
Like the fuckinf Lurie book?
ye
Fuck that
I mean
I’m doing a class that covers DM-stacks so
I’m already getting sort of higher pilled but
Maaaaaaaan F that
Actually you know what fuck it I'm gonna start working through Harder's book rn
Is it comprehensible? I feel like my foundations would be too weak
but it's motivated by fairly concrete stuff
I guess it’s more like for how abstract that is
I don’t see the limitations of scheme theory
To appreciate why this abstract setting is better at which point it would be like “hurr durr abstract good”
nah it's super well motivated
we want moduli space + universal bundle
use automorphism of elliptic curve to construct a twisted bundle
so we can't have representing objects within the category of schemes
Is the class covering more of the like basics leading into it at least. Like Lurie’s book like starts out just incomprehensible unless you know a lot of this general higher category nonsense
you need something that remembers some more data
Yeah my impression about the importance is just that sometimes you can't have a "moduli scheme of blah" but you have a "moduli stack of blah"
And then if you can still do geometry on those stacks
Then that's something that makes sense to think about
I thought Spectral AG is like even on higher shit than just stacks tho
Is the class covering more of the like basics leading into it at least. Like Lurie’s book like starts out just incomprehensible unless you know a lot of this general higher category nonsense
The first class did some motivating stuff, but after that we have just been doing quasicategories
Oh I think we were both talking about your class on DM stacks
Brofibration and I
"nah it's super well motivated" -Brofibration
it = DM stacks
I was talking about both
Oh I've got no idea what motivates spectral stuff
Is it spectral in the sense of AT spectra?
ye
Of cohomology theories and shit
yup
I see. Yeah I've got nothing remotely close to a perspective there
there's multiple things that lead up to SAG, one way is moduli stuff, another way is some weird link between the bordism ring and formal group laws
Tfw
:0
Idk enough of this stuff to have an actual discussion on it haha
Did someone say bordism ring
and there's also derived AG which is closely related and motivated by intersection problems
Yeah I've heard derived AG is actually geometry for sure
Or I mean only inasmuch as AG in general is geometry lol
idk what geometry is
right now geometry = sheaves
or just some structure with descent data
I’m not Chad enough to have this woke biew of geometry
Geometry to me is still triangles :(
Oh no I believe geometry is triangles too
But I have to pretend geometry = the types of functions on your space you consider
But all the courses with the word in geometry in them seem to take this viewpoint
Aka the sheaf
yup
you cant have moduli spaces of triangles in the cat of schemes too
if you want a universal triangle bundle that is
same idea
fml all the sugar has given me a headache
and the rest of the peanut butter cups are staring at me smugly
Lmao much as I'm pro peanut butter cups better to hide them away lol
And drink some water
Also I'm officially hijacking this channel to be AG commentary
Go to geometry
that's the AG channel
Algebra is for comm-alg that is secretly AG
Well yeah the first bit of this book is category theory and homological algebra straight up lol
lol
just like all books should be
what kind of homological algebra tho?
Is it like here's Tor and Ext in a like ad-hoc way
or is it like here's chain maps, chain homotopies...
here's derived functors
This guy's notation and typesetting are... interesting
oh yeah there's another motivating thing for Lurie style stuff, simplicial stuff let's you do stuff even when the category is not abelian
Yeah but I like R-mod...
so you replace homological algebra with homotopical algebra
blech
it's actually not bad at all
you have simplicial rings
😔
the thing is Ring is not an abelian category
simplicial stuff is supposed to somehow let you get over that
euch
maybe in a years time
I will be based (cringe) enough to adopt this view
but for now I like me rings
but ringed spectra are also rings
R-Points of Spec of the bordism spectrum correspond to 1-dim formal group laws over R
It's cool
I like it, apparently his writing style is nice
and I'm not super deep into it to judge it yet, but I'm inclined to agree
He uses right-actions though
which I think is more common among group theorists
and even like writing f(x) as xf is not uncommon among group theorists
So for me it's just a minor mindset shift
but it ends up being practically inconsequential
what's the point of having two different notations then? Or how'd they come about?
The main thing is mainly for functions stuff
it makes composition "look right"
since f\circ g(x) is actually g(f(x))
where as if you do the other one (x)f\circ g
is just ((x)f)g
And it's also nice for group actions
morally correct haha
Kinda not good to learn it since you have to unlearn it and that's annoying
for example if you denote conjugation by g^x = x^-1gx
this is a right action
but then (g^x)^y = g^{xy}
and things like that
I think in an ideal world this is actually the standard we all were brought up with
but it isn't, so most people even if they think the other is better, just use what's most common
but for group theory specifically I think right group actions are much better, and since they're so common more people adopt that notation
FWIW Isaacs does use functions like most people
it's just actions and cosets where he does right ones
gotcha
Does it do normal rep theory too?
I learned rep thoeyr
but can't remember any of it and want to give it another go sometime
there's a book called rep theory - a homological algebra point of view
I guess like morphisms from R[G] or whatever
I like group theory, I certainly find it easier than AG haha
But also my experience with group theory is that high-powered theorems make previously hard problems near trivial
to a degree I don't feel in other subjects
example?
I mean Sylow makes a lot of problems about solvability or simplicity of low order groups really trivial
Classifying groups of certain orders with Sylow and semi direct products becomes a lot easier
You can use a lot of stuff about the structure of p-groups, etc.
Idk, it just feels like when my friends ask me a group theory question, I'm like "oh apply __ theorem" and it's trivially done
moreso than like problems in ring theory they would ask me or something
Having developed a similar amount of theory, and at this point probably even more ring theory through comm. alg
fair enough
I have never dealt with a group of polynomials with its coefficients coming from Z_10 before and hence would like some help to understand what this group G is actually about.
Since we are talking only wrt addition,think of 7x^2+5x+4 as (7,5,4)
Addition modulo 10?
Yes
Ah okay, so identity would be having all coefficients as 0?
Yes
Okay, that makes sense. Thanks!
My gut feeling about this one is that H need not be a subgroup(since I cannot deduce any condition for closure), but I'm not completely sure.
How is it a subgroup when G is finite?
Let a be in H,then a^-n=1 for some n implying 1 is in H(Identity)
Which implies a^-1 in H(Inverse)
Which would imply ab in H,for all a,b in H(Closure)
Need some time to process this.
Okay, so if G were to be finite, every element in G will have finite order, and the inverse of every element will have the same finite order as well. How does this add up to your first point?
if a in H,By that condition you get a^-2 is in H,which implies a^4 is in H
Which means all elements of form $a^{4^k}$ will be in H
DrunkenDrake:
But,There are only finitely many elements in H
Okay, makes sense. How about odd powers of a?
This seems off. If a has order 3, how is a^(4^k) going to be 1 for any k?
But the question does not specify G being finite or not, so you can give an infinite counterexample
Ah, counterexample...
Didn't even think of that.
Although I didn't exactly process this as a finite/infinite group discrepancy so I can be excused. :p
I don't mean to say a^4^k is 1
I'll still need some time to actually understand this problem. Thanks for the help guys.
I mean to say a^(4^k)=a^(4^l) for some k and l,k Not l
@carmine fossil Yeah, but this way odd powers of a won't necessarily be in H, right? That blows up closure?
Well,you get a^n=1 for some n
This is the only thing we are getting from this
So basically it need not even be a subgroup even when G is finite?
I still don't see how you get that drake. If a has order 3, no power of 4 as the exponent of a can give you 1.
Why does it mean that?
You don't have that a^(-1) is in H
Oh, obviously it does mean that
I meant why is it in H
So what exactly should my argument look like? Should I produce a counterexample using a finite group G?
It can be an infinite group
And maybe look at our discussion here, and choose an H that contains a, a^(-2), a^4, a^(-8), etc. But not a^(-1).
Oh, okay. Thanks again.
@paper flint It says more than 3 elements of order 2, but then you only choose 3: a, b, and c
You can start with a, b, c, and d
Oh, when I was writing it in my notebook I did try the 4 element case but I had ab,bc,cd and da. Obviously ab≠bc, ab≠da for the same reasons, but again I couldn't figure out the uniqueness of ab and cd, or that of ac and bd.
just to be more clear, it is not the case that an abelian group with 3 elements has at least 7 elements of order 2, consider (Z2)^3
Yeah, that seems reasonable. I just got a bit mixed up because of 'more than three'.
,preamble
just take a,b,c d and work with ab ac and ad
wait i'm a dumbass lol, counterexample should be (Z2)^2
AH CRAP. Sorry for opening this preamble up here, the channel switched too quickly.
i got u dw
Thanks!
Aah yes, that totally makes sense!!! Tf I should've written da as ad right from the get go to see it more clearly haha.
There is? I assume a,b,c,d to be distinct non-identity elements, and G is given to be Abelian. Anything I'm missing?
But a is its own inverse, and inverse of an element is unique.
split it into cases
i recall doing problems like this in algebra class, have you considered the fact that multiplication is a bijection? EDIT: but i could be totally off, just a thought
ab=c and ab doesnt equal c
if ab does equal c then u have ab=c, ac=b and bc=a
so u can just use ad bd and cd
@chilly ocean I haven't studied isomorphisms/homomorphisms yet 😅
sorry, i can getting my terms mixed up, i meant bijection (well, i guess this is equivalent to "cancellation works")
Thanks, @pallid ember , I'll give that a try now.
Hmmmm I'm not sure I'm following @chilly ocean
yeah sorry, i am not really making sense
Ah nw. Thanks for the example.
||Start with distinct a,b of order 2. We know that each non-identity element in <a,b> has order 2. If there are more than 3 elements of order 2, there exists a c of order 2 not in <a,b>. Since c is not in <a,b>, c<a,b> and <a,b> are disjoint. This gives four more elements of order 2.||
||In general, the 2-torsion of an abelian group is the maximal boolean subgroup of the group||
Thank you! I really don't understand your second statement yet, but the first one makes sense to me.
Zheng lmfao what a statement
I wonder if you could prove this via some convoluted proof that says if you have more than 3 distinct order 2-subgroups you have to have at least 7
Which doesn't involve you directly constructing more order 2 elements
Oh wait, you can directly show you have (Z/2Z)^3 as a subgropu
use the fact that if H,N are normal subgroups with trivial intersection then HN is iso to H x N
take two order 2 elements a,b consider <a><b> iso to <a> x <b>
then that has 3 order 2 elements, so take c outside of it
then <a><b><c> iso to (<a> x <b>)<c> iso to <a> x <b> x <c>
||The overkill proof is just the Fundamental Theorem of Abelian Groups||
Let M be an R-mod
weak ass 
WeakAss(M) is the set of prime ideals minimal over the annihilators of elements of M
weak ass :GWcorbinHolyFuck:
@chilly ocean it's gotta be intentional
(this isn't particularly well-written, sorry about that)
I need help solving this problem.
I'm not sure I follow the last two sentences
But, are you familiar with the statement that a subgroup of a cyclic group is cyclic?
Haven't covered the chapter on cyclic groups yet, but that sounds reasonable.
I was a bit incoherent at the end, my bad.
The basic idea was just to show that the subgroup of Z_n generated by a non-identity even element from it has all its members even.
Other than that I just covered the trivial subgroup and the group itself. I don't know what to do if an odd element is included in the subgroup.
whotf names things weakass

the same guy who made brainfuck

And that" fucking concrete introduction to algebra"
maybe try finding a injection from H to itself that maps evens to odds and vice versa @paper flint
*bijection
How
Can I not go by cases?
(I'm a newb to the subject so I always like breaking down proofs to simplest possible cases)
Or show that a subgroup is generated by the smallest non zero element in it
Cases are trash
As in, you should try to figure out ways to always reduce the number of cases you check IMO
And then show the order is even,(if the element is odd) and you are done
Like if there’s 4 cases but you can WLOG to only show 2 that’s chad
And also a good habit to get into, since this is moreso the habit of reducing things to easier stuff
Which is a good habit to get into
Especially in algebra IMO where if you quotient by the right thing you can get a lot of mileage by “assuming WLOG that...”
I do use WLOG arguments for reducing redundant cases.
I mean idk, sometimes the two cases are mega trivial to check so like whatever
In this particular problem I can't figure out what cases to work with.
But if you can avoid a cases argument I think it’s better to
Can I not go by cases?
@paper flint yea u consider 2 cases
no odd numbers and at least 1 odd number
Also I haven’t put thought into what drunken drake suggested, but if it what he says does work then it’s probably useful to figure out why it works and how the argument runs
I did the no odd numbers bit. Now I need to get down the at least 1 odd number bit I suppose.
Oh right, I remember the problem I think
Right, I think cases is fine here I guess
I didn’t really even consider this cases lol
If it has no odds you’re just legit done
“It has only evens”
Kekw I wrote a paragraph for that.
lol wut
If it has no odds, it is only evens, so it fits
Okay now assume it has at least 1 odd, show it’s half even half odd
this man does not believe in the excluded middle
I'm just being pedantic I guess, stating things like 'an element of a finite group has a finite order' which now I realise isn't even relevant.
Nope
It’s about it’s value where you like take the most natural set of represnetatives
Aka 1 through n I guess
(Altho I’m partial to 0 through n -1)
Oh they did do that one
😎
Ah, I see. Also, if it has one odd and one even member, must it be equal to the group itself(just a guess)?
No
No
nope
The other case is it’s half even half odd
Take Z_30,and subgroup generated by 5
Ah, okay.
u mean Z10?
Does anyone want a group theory problem?
Too bad I'm telling it anyway
Determine the number of semidirect products of A6 and C2 up to isomorphism
(I'm not asking for help, I just figured this out with a friend and it was a lot of fun)
What is C2? (Well, not that I want to do this problem anyway, but)
The problem is pretty much just counting order 2 automorphisms of A6 (mod ones that induce the same semidirect product)
Conjugation by a 2-cycle is an order two aut, and all of them induce isomorphic semidirect products
most of the difficulty is in the parenthetical there
as all 2 cycles are conjugate
I agree that this is a family of isomorphic semidirect products
In fact they're all S6
yeah but there's more right
Yup
there are ones that dont come from conjugation from S6
One other trivial example I'll give you, A6 × C2 :P
Note that you didn't consider conjugation by all elements of order 2 in S6
Just the 2 cycles
yeah there are other ones too
but im trying to figure out the outer one
outer to S6 that is
Right
cant remember how it was done
This is why it's interesting for A6
was there just one?
Out(S6) = C2
So there's one up to translation by Inn(S6)
Here's an example of how to construct an outer aut: S5 has six 5-sylow subgroups. Acting on them gives an embedding of S5 into S6 as a transitive subgroup. This has index 6!/5! = 6, so acting on the cosets gives a map S6 -> S6, which turns out to be a non inner automorphism
noice
Also I did use gap for this
There's a couple explicit facts about the automorphism and the conjugacy structure of S6/Aut(S6) which I didn't want to do by hand lol
Like for instance you need to know there's a non inner automorphism of order 2
looks fun, will give it a shot in the morning
oh shoot I get to sleep an extra hour tonight
they should do this whole time switch thing for entire days
where we just pretend a day didnt happen
I think that's called a blackout
someday we'll just pretend 2020 didn't happen
what do you guys think of this playlist
does that cover the broad topic of abstract algebra or is that only an introduction
it basically just gives definitions and simple examples
it is not a substitute for reading a textbook and/or taking a course.
and certainly not a substitute for doing exercises
(most of the learning in mathematics, especially intro courses, happens in exercises)
Suppose that $G$ is finite nilpotent. Let $g$ be a nontrivial element of the center of $G$ of order $p$ for some prime dividing the order of $G$. Why is it true that a sylow $p$-subgroup of $G/\langle g \rangle $ must be normal?
kxrider:
nvm, this is part of a proof by induction, and this was an application of the induction hypothesis lol
$F$ is a field. $$\frac{F[x]}{(g(x)h(x))} \cong \frac{F[x]}{(g(x))} \times \frac{F[x]}{(h(x))}$$ is this true or something similar?
gelearndeutsch:
Just construct a surjective homomorphism from $
{F[x]} \text{ to } \frac{F[x]}{(g(x))} \times \frac{F[x]}{(h(x))}$
chinese remainder theorem?
And find the kernel of that
DrunkenDrake:
Similar to crt
I don't think this is true in general?
take g = h squarefree
Then the lhs has a nilpotent and the right doesn't
CRT says this is true when g and h are coprime but it can fail in general
Is g and h being coprime a sufficient condition?
Yes, because that implies (g) + (h) = 1
That's no longer true in F[x, y] or with more variables though. F[x, y]/(xy) and F[y] × F[x] ≈ F[x,y]/(x) × F[x, y]/(y) are not isomorphic but x and y are coprime
@chilly ocean crt has solved the problem. thanks
yes
(one thing I'd like to ask here is about the uniqueness of inverse across various subgroups: suppose I have some a\in G which is present in its subgroups H and K as well. Is it guaranteed that a^(-1)\in G is the same as a^(-1)\in H and a^(-1)\in K?)
yes
I see. Thanks.
to address ur parenthetical remark, when a is in G, a^{-1} is not just the inverse of a in H or K, but rather the inverse of a in G.
Yeah, but that is sufficient to guarantee it's also the inverse of a in H and K, right?
To make my question precise: is it possible for b≠c such that ab=e in H and ac=e in K?
Perhaps you can try proving it 🙂
Yeah
Perhaps you can try proving it 🙂
I couldn't write anything down. Intuitively, I feel the inverse should be uniquely defined since it's a property of the operation itself and has nothing to do with the elements present in the set/group.
You are familiar that, if you are just working in one group, the inverse is unique right?
sure, that looks good.
is sufficient to guarantee it's also the inverse of a in H and K, right?
by definition, the inverse of a in H is the inverse of a in G. if an element a of G is in H then a^{-1}, a's inverse in G is also in H. Same with K
You are familiar that, if you are just working in one group, the inverse is unique right?
@chilly ocean Yes.
sure, that looks good.
by definition, the inverse of a in H is the inverse of a in G. if an element a of G is in H then a^{-1}, a's inverse in G is also in H. Same with K
@thorn delta Aah okay, thanks!
np.
The centralizer of an element of a group need not be Abelian, right?
according to what u just proved, the center is contained in all of the centralizers. Whenever the center is a proper subgroup of one of the centralizers, that centralizer is non abelian.
That makes sense!
Another question(I seem to have too many, but I'll stop after this one): If G is the symmetry group of a circle, then it has elements of every finite order as well as infinite order. Proof: For a finite order n, we mark n equally spaced points on the circle. Then under rotation, one of the points will have order n. This takes care of all finite orders. I'm not sure what to do in the infinite order case.
Hint: characterize all angles for which rotation by that angle has finite order (maybe this is not that helpful)
right, so for finite order, you have the nth roots of unity. for infinite order, you need to find a rotation s.t. repeated applications of that rotation never returns to 1 (on the complex plane)
Aah makes sense. Thanks!!!
i was about to say xd
anyone have a hint on this? Let $G$ be a group and $H$ be a subgroup of $G$. Suppose that $[H, [G,G]] = {e}$. Then show that $[[H,H],G] = {e}$.
kxrider:
i would probably just try spamming random substitutions tbh
Oh actually [H, G'] = 1 is very concrete
yeah, it means they commute
Right
So H <= C_G(G') which means H' <= C_G(G')', and we want to show H' <= Z(G)
So it suffices to show C_G(G')' <= Z(G)
And in fact this is equivalent by taking H = C_G(G') in the statement
So if x and y both commute with all elements of the form g h g^-1 h^-1 then x y x^-1 y^-1 commutes with all of G
what is C_G?
The centralizer. For a subgroup K of G, C_G(K) = { g in G : gk = kg for all k in K }
If y is in C_G(G') and x is arbitrary then x y x^-1 = x y x^-1 y^-1 y = y x y x^-1 y^-1 = (yx) y (yx) ^-1, so x^-1 y x commutes with y
not sure if this helps
then if x, y in C_G(G') we get [x, y] = x y x^-1 y^-1 = y^-1 x y x^-1 = x^-1 y^-1 x y = y x^-1 y^-1 x
I think
Wait I think this might actually follow from the hall witt identity
So if x and y both commute with all elements of the form g h g^-1 h^-1 then x y x^-1 y^-1 commutes with all of G
This follows I mean
Hall Witt says
${\displaystyle [x,y^{-1},z]^{y}\cdot [y,z^{-1},x]^{z}\cdot [z,x^{-1},y]^{x}=1.}$
shamrock:
Where $[a, b, c] = [[a, b], c]$
shamrock:
If x and y are in the centralizer of G' then $[y, z^{-1}, x]$ and $[z, x^{-1}, y]$ are both trivial, since they're the commutator of something in G' and something which commutes with all of G'
shamrock:
This means $[x, y^{-1}, z]^y = 1$, so $[[x,y^{-1}],z] = [x, y^{-1}, z] = 1$. Since $y$ was arbitrary we get that $[x, y]$ commutes with $z$ for any $z$ and any $x, y\in C_G(G')$
shamrock:
@thorn delta here's a proof depending on a really weird identity that I happened to know
the superscripts denote conjugation, idk if you're familiar with that notation. The identity is very easy to prove, just expand and cancel terms
i see, thanks. I was actually trying to apply this identity from an earlier exercise to see if i could get anywhere:
[ab,c] = [b,c]^a[a,c]
but idk idk
I have never really liked these group theory problems. They just seem like random symbol manipulations to me
I mean this one is very much symbol manipulation lol
The hall witt identity is, I mean
But I don't think all group theory problems are like that
I need to prove that every finite group with more than one element has an element of prime order. I think I can easily prove this for finite cyclic groups, but how to go about the general case?(or should I approach this by contradiction instead)?
Did gallian not give you hints?
None.
Do you mean an element of each order p for each prime p dividing the order of G?
That would be cauchy's theorem
Grim, think about reducing from the general case to the case of a cyclic group
Ok,nvm mb
Just take a random element
A power of that random element will have prime order

(Say a^n=1 and p be a prime factor a^(n/p) has prime order)
Arbitrary element
How do I reduce the general case to cyclic alone? It need not be the case that every finite group has a cyclic subgroup I guess? @latent anvil
r a n d o m
Hmmm, I haven't covered the chapter on cyclic groups yet.
Gross
well think about it
Okay, then this becomes straightforward.
You are arbitrary
you know G has some nontrivial element a
Can you use a to construct a nontrivial cyclic subgroup of G?
Hmmm, makes sense. It would have the order 2 at the very least, and since it is finite, at most as much as the order of the group itself.
So the order of this arbitrary element could be a prime itself, or...
I don't know. 
Just write a few groups down
Okay.

which groups are you familiar with?
For finite groups, I'm mostly familiar with U(n)(multiplication mod n with its elements as positive integers less than n and coprime to n), Z_n(addition mod n with elements as 0,..,n-1), dihedral groups primarily.
actually nvm, you said you can prove it for finite cyclic groups, what's your proof?
also, do you see why showing that every group has a cyclic subgroup is sufficient to prove the claim (after you prove the claim for finint cyclic groups)?
Uhhhh I initially had the contorted idea that a cyclic group of order n generated by an element a will have powers of a through 1 to n. For even n, a^(n/2) has a prime order(2)...
My brain's jammed. Need to think about this later. 
it's easier than you think
dont overthink it
I thought you didnt cover cyclic groups yet?
No, I haven't.
The definition was dropped in the current chapter on subgroups, but the next chapter is dedicated to cyclic groups exclusively.
yea you dont need cyclics for this anyway
Can you give the answer(with a spoiler)? 😓
You barely need the notion of cyclic groups
And anyway, you mentioned you already know them (Z_n)
|| let |G|=m and |a|=n, a in G, if n is prime then youre done. Otherwsie n has a prime factor p, so n=pq, and thus a^q must have order p.||
Ted you should derive a formula which tells you the order of g^a given the order of g
Ted you should give a talk
Hi, I have a question about group theory : can someone tell me how to have an intuition of what is a linear representation and irreductible ones ?
I find hard to internalize it
isn't there a usual example that we can think of every time we wonder what is a representation ?
Like S_3 acting on the vector space R^3 by permuting the basis vectors e_1, e_2, e_3
@open torrent but here for instance, where is the notion of representation ?
me neither
and that is the problem haha
Viburnum:
and this matrix is the representation of (12)?
ok I will think about that, thanks for you time
actually I am studying it for physics
I'm following a group theory math lecture that focus on application in particles physic
It is said that "an elementary particle is an irreductible representation of Poincare group" (what a sentence !), I think it is a central notion that I need to understand haha
i know its true that given a group $G$, a subgroup $H$, and a normal subgroup $K$ contained in $H$, we have that $H/K < Z(G/K)$ if and only if $[H,G] < K$. Is there any true statement like $H/K = Z(G/K)$ if and only if $[H,G] = K$?
kxrider:
Suppose that [H,G] = K. Let gK be in the center of G/K. Then for all x in G, [g, x] is in K which is contained in [H,G]. So we have [g,x] is in [H,G], but i don't think that is enough to conclude that g is in H 
This is even false for abelian groups, I think
rip, okay
I am finding the cosets of {1,-1} in {1,-1,i,-i} under multiplication and am I correct in saying there are only 2 distinct cosets since the coset formed by multiplying by i and -i are identical?
They are the same
Yes(Doesn't matter if you take left or right cosets in this case)
Hi ! Someone is familiar with birdtracks here ?
If inside the tensor product $M\otimes N$, the simple tensors $m\otimes n = m'\otimes n$ for all $n \in N$, can we conclude that $m = m'$?
Chmonkey:
xD
do you have a geometric interpretation of what it means for a ring to be cohen-macauley?
Nope
I haven't really even gone into what the ring-theoretic definition is, it's about regular sequences right?
yup
regular sequences sorta correspond to complete intersections right?
nvm
in the cohen macauley case they would I think
Hi, this might be a simple question but I'm having a hard time with the topic at the moment
Hi lol
I should show that the ring Z[1/2, i*sqrt(5)] consists of elements of the form a + bisqrt(5) with a,b \in Z[1/2]
Yeah I don't know how to alternatively write the left one
I understand the definition but idk how to use it in a proof
Z[1/2, i*sqrt(5)]
So we're looking at the smallest subset of C that contains Z and {1/2, isqrt(5)} right?
Yeah but how can I use that definition for an inclusion proof
Well subring instead of subset
More concrete
Oh right perfect thanks
Is it ok if I ping you if I run into problems with either inclusion?
I think I have a good starting point
Ok so i was able to show that a + bisqrt(5) with a,b \in Z[1/2] is a subset of Z[1/2, isqrt(5)]
But I cannot find a general element of Z[1/2, isqrt(5)] to show that it can be described using a + bisqrt(5)
Any ideas?
How are you defining this ring?
You should be able to say this is the same as (Z[1/2])[isqrt(5)] but proving that depends on the definitions you're using
oh, I see you've done it via smallest subring
Ok so i was able to show that a + bisqrt(5) with a,b \in Z[1/2] is a subset of Z[1/2, isqrt(5)]
@astral maple Once you do this, it suffices to show that the set of a + bisqrt(5) where a,b in Z[1/2] form a subring
You have already shown this is a subset of Z[1/2,isqrt(5)], but if you show it's also a subring then Z[1/2,isqrt(5)] is a subset of it by virtue of being thew smallest subring containing 1/2 and isqrt(5)
Note that 1/2 and isqrt(5) are also in the set of a + bisqrt(5) where a,b in Z[1/2] if you want to be very thorough
Really, in general you should show that Z[x,y] = Z[x][y]
The definition of Z[x,y] in words is "smallest subring containing Z,x, and y"
while the definition of Z[x][y] in words is "smallest subring containing Z[x], and y" while Z[x] is "smallest subring containing Z, and x"
you can show the two are subsets of each other really really easily using this "smallest subring containing..." nonsense
Oh wow I find that approach very nice
With showing that it’s a subring
I’m trying to find the definition we used in the lecture since I always work with the book and it’s really inadequate in this case
Hiding here is the fact that you are embedding Z as a subring of C
Which is why the first thing I asked is how you even defined Z[1/2,isqrt(5)]
you can make sense of this in a way that doesn't include an embedding into C by means of a quotient of Z[x] which also let's you do the same sort of thing and show that Z[a,b] = Z[a][b]
Yes I think we also used the definition with the general form of the elements
I think
But it's important to understand what's really going on here
This for example is important if you want to make sense of F_2[i]
You really mean you just adjoin some arbitrary element i which satisfies i^2 = -1 = 1 in F_2
although actually F_2[i] might be really really bad now that I think of it because of char 2 shenanigans
It’s in German but essentially the definition with minimal subring and general elements
Yeah
This lends itself to this proof nicely
And the second equality was proven
just show that S[a,b] = S[a][b]
in general
Given an embedding S as a subset of some ambient ring R
And that would make the proof trivial
Under some natural choice of identificato9in
Oh yeah that has been shown
It’s essentially trivial lol
You just turn two sums into one
I’m still surprised by the approach with the proving that it’s a subring lol
It’s so elegant
Ok now I have to show that Z[1/2, isqrt(5)] is a Euclidean ring with respect to the norm 2^{2n}(a^2 + 5b^2) for minimal n such that 2^na, 2^nb \in Z
If we write a = k/2^m, b = l/2^p with k, l in Z we can see that n = max(m, p)
I’m not sure that helps
Okay so
this works for a lot of things
one of them is Z[i]
I'm not going to bother looking at the actual formula, I'm ALMOST certain this should work
but if you have p, and want to divide by q and need the remainder r
p/q might not exist in Z[1/2, isqrt(5)] but it does exist in C
if you think about it hard enough, you'll realize Z[1/2, isqrt(5)] inside of C forms a lattice, it's a grid of points
so p/q falls inside of one of these sort of "boxes" which Z[1/2,isqrt(5)] forms
so you want to estimate p/q by the closest point of Z[1/2, isqrt(5)]
Let this be called r' for now, the closet point
then p/q - r' should be small, hopefully less than 1 I think?
multiply through by q
then you get that p - r'q should be less than q
Try and make this idea work I guess
The idea is just what I said
Division with remainder is like
approximating the actual division
you go "okay so p/q might not actually exist in this ring, but like I can get close enough"
and you just want the remainder to be small
so you can just cheat and go to C where p/q DOES exist
Yeah it’s just difficult because I’ve just been introduced to the topics
then if you can estimate p/q by an element of the ring closely
once you clear denominators things work
This is the definition we’re working with
Now the multiplicativity is clear so we just need to show that phi is a degree function
Right, which is that the euclidean algorithm works
which is what I described above
i used different letters
p and q are g and f in the above definition right?
Yup
so under this notation
the element of Z[1/2,isqrt{5}] which best estimates g/f is called q
so d(g/f - q) < 1 is our desire
then when you clear denominators you should get that d(g - qf) < d(f)
Oh yes
Oh, so the remainder is going to be g - qf
so you can write this as like g = qf - (g -qf)
so g -qf = r
Makes sense yup
but d(r) < d(f)
Showing (i) is just a matter of using the definition right?
And what happens in case r = 0
Which would mean that our point lies on one of the edges of the boxes (from the “grid” you mentioned)
Anyway, this should be sufficient?
The reality is I haven’t done this specific case with that specific norm
But I’ve done similar stuff with very similar norms
No worries
I’m new to these problems so it helps to have someone offer insights
I see
I can understand the proof sketch now but I’m still having difficulties formalizing the thoughts
I mean the entire “pretending fractions exist”
And the geometric intuition
I want to show that the function f(x,y)=x/y, f(0,0)=0, defined on the curve parametrized by (t^3,t^2) is not a polynomial function, but I'm not sure how to do that
It seems like it should be straightforward, but I don't really have any ideas except assuming f(x,y) is the restriction of some polynomial F and trying to approach y=0. Not sure how to do it though
are you asking if t is in k[t²,t³] ?
Okay, I got all the way to subring, but what is the maximal ideal?
It looks like it has a whole bunch, everything with a denominator divisible by q where q is a prime not equal to p looks like an ideal of Z_(p), right?
Oh wait that's not right, 1/2 + 1/2 takes you outside that
Okay so I don't think it has ANY ideals except the trivial.
Is Tekkitbot asleep?
Merosity:
Okay but it claims only one ideal of Z_(p) is maximal.
Which strikes me as... well, wrong.
yeah
the other ideals look like p^k Z_(p)
try to reason out why these are ideals first at least
and then which ones are contained in which
Okay so you end up with things of the form pa, if you're saying cancel the denominator
so basically the b in bp^k gets ||swallowed by the denominator since it can have b no problem||
but it can't ||swallow the p power since it can't have any ps ||
@eager kindle no no
Oh I get what you're saying now
But yeah, whole numbers with a factor of p is what I was getting at
I notated weird
with n = p^k * m
with m not having any p factors
then the m will get swallowed
but the p^k will remain since the denominators can't have any p factors
so it becomes p^kZ_(p)
does that vibe with you
Okay so the maximal ideal is specifically pZ_(p)

Okay
Thank you. 🙂
np
Is the nth root of unity not isomorphic to real numbers under addition?
if by "nth root of unity" you mean "group of nth roots of unity," no

not even isomorphic in Set 
Oof thx
Wait @chilly ocean just to be clear the group of nth roots of unity is not isomoprhic to the real numbers under addition?
Ahh ok just checking sorry discord didnt load for me
One of them is infinite the other has n things.
Something something ker f to M to im f is an SES something something direct product
(no idea if this is right)
Probably not lmao (I meant the nonsense that I wrote)
Oh
I think this follows fairly trivially from definitions
maybe im being an idiot but how can you use the frobenius automorphism to find the roots of the polynomial here?
Yeah, it's the obvious thing to do
I guess by frobenius x^2=x, so evaluating the polynomial will give you something of the form x+a (ie there is one root)?
But this sounds wrong... Or maybe not?
Okay, what's the obvious thing to do with the generators of the image?
Yes
Now suppose f(m)=n, how to decompose m?
Okay, n is in the image, so the coefficients of the pullbacks is obvious right?
You don't need f injective
Sure, they are not equal
Just think a little harder
Maybe I misunderstood what you meant
Qcrually
I know that f(m) = f(sum over pullback + sum over kernel generators)
@chilly ocean
What are the sums here?
(I'll get on my computer)
slimvesus:
in fact, for any beta_j
this sort of works still
okay, here's a clue, m and that sum you have agree under the mapping m, so they agree up to...?
yeah, they agree up to an element in the kernel
$\phi(x)=\phi(y)\implies \phi(x-y)=0$
88ddda:
I was gonna say snake lemma
Although on second thought what I had in mind woildnt quite work
i guess i should learn more about these diagram stuff at some point


