#groups-rings-fields
1 messages · Page 357 of 1
for a counterexample i should probably be looking at some non abelian groups right
Yes, theres a small non abelian group that works
😭
order 8 and non abelian wtf
hmmm
is it smth ive prob come across
Yeah
is it a subgroup of S4
It is indeed
dimension 4
colossal
It’s uncountably infinite mate
yeah it was a bad joke
Morally, this result shouldn’t be true: imagine G was a really big non-abelian group and H was a normal abelian subgroup, it would be surprising if G normalised every subgroup
Yup!
i'm not very used to dihedral and permutation groups
i shouldve been last year
but i didn't take groups serious
It’s the smallest group that has a counter example so I thought it would be good to go for
Ok just think of it as <r, t | t^4 = r^2 = 1, rtr = t^3>
so like (12)(43) is in D8
I’ll try and think of another example using a matrix group
don't spoil though
i would rather figure it out with hints
Ok I’ve got one
how could i make sense of this through geometry
why would you
as in
t is the rotation r is the reflection of the square
isn't D2n meant to give the symmetries by an n gon
best question i've ever seen
You gotta go back: #geometry-and-trigonometry
:(
thats uncountable i hope you know that
yeah i was being stupid 😭
forgot that Sn exists
looking at cantor distributions in probability mightve fried my brain a bit
decomposition series would be great if this were true
I am so tempted to overkill this
I’ll spoiler this but like
Come up with an actual example because it’s informative
||Pick a group with two non-conjugate isomorphic subgroups which are mapped to each other by an outer automorphism
Take the semidirect product of that group with Z, where the action is by said outer automorphism||
You can take S_4 instead of D_8 if that helps you
it'd help if i look at D_8 so i actually try to understand other groups 😭
i did take S_4 originally but
thinking about all the elements sounded off putting
In some sense this example is universal, in that every possible example either has a subgroup that looks like this, or the same thing with ||Z/nZ||
Does S_4 have any normal non-characteristic subgroups?
how so
Oh wait I’m dumb
lol
No this is still right
It’s centreless and Aut(S_4) is S_4
its right if one of the subgroups were normal
We’re just proving that normal doesn’t imply strongly closed in a generalised fusion system it’s not that deep
Oh yeah that was implied 🙃
smh
I just remembered what my username is I gotta change ts back
yeah we're just proving that groups do not in general have the congruence extension property smfh
probably a banger idea
where does rtr = t^3 come from?
no i dont think i used that phrase right
Reflect rotate and reflect back yields the same rotation just in the other direction
But really this is the definition of D_8
The fact that it acts nicely on a polygon is coincidence
ahh okkk
oh 😭
an era that lasted like
half a day
Im gonna be called unhinged for this take btw
And it is not historically accurate
so the way i would go to generalise this is:
D_2n = <r,t | t^n = r^2 = 1, rtr = t^n-1>?
well yes because its a pattern
or does this differ with odd n
okay lessgooo
It’s the same
that D_n acts nicely on the n-gon is not a coincidence because its a pattern 
now time to look at the actual problem at hand
Mere coincidence that they admit that particular representation
Or a definition

then its a pattern that theyre coxeter groups
Groups should be defined abstractly it’s just the way of the world
THIS is acceptable
hell you could also let D_n act in the obvious way on R^2 and define the n-gon as the polygon defined by the orbit of (0, 1) ig
Now we’re talking
let me cook guys let me cook
The point is to emphasise the symmetry’s structure rather than the object itself
focussing on single objects or structures often doesnt reveal their structure enough
the point is to emphasize maps around the object than the object itself 🤤
Im the worlds leading expert on groups of order 8
Groups should be defined as isometry groups of metric spaces
Someone ping mods immediately
Fundamental groups of topological spaces also sometimes ok
THAT is an insane take
/ban Wew
so
every group
Sometimes ok
Not always ok
Find me a topological space with any of these as it’s fundamental group
i can remember the set of isometries on R^n carrying some quandle structure
And do NOT give me that classifying space shit
They’re finite so they’re virtually trivial so we don’t study them
Go back to your #combinatorial-structures 🙃
No frob enjoyers?
every group is the quotient of some free group so wedge some possibly infinite amount of circles together and glue relations using discs
AHEM
the only frob i care about is the ring endomorphism
Might as well be
idk man do i LOOK like i know any algtop
Alls well that ends well
or whatever tf classifying spaces are from
I love Frobeniï
We should algtopify you
NO I DONT WANT TO BE A TOP
8 elements sounds small
Ts mf just reinvented the nerve of BG right in front of my eyes potato
it's annoying asf to even get the permutations of D8
Why are you doing that? I gave you a presentation
Embrace the cute algtop
bro used to the right latin conjugation
oh wait you use the presentation itself 😭
Misplaced full-stop/period
Perhaps S_4 was the better suggestion
😭
oh homology i can do
learned it by doing rack/quandle homology
I feel sorry for you
the classic
Unfortunately I don’t have any homotopy notes that aren’t handwritten
Mods?
its okay I've got Bredon
Eh handwritten and typed up are the same up to homotopy
But the space of such homotopies is unfortunately non-contractible
The best type of quandlestuffs
omg i have mine too at home
Lol Wew can I tell u smth frightening
I need to actually think about topological spaces for something now
Prthsod
As in rather than homotopy types
Im gonna be sick
i think the first book i bought was hoffman-kunze
apparently in trying to construct a top space for some fundamental group i described essentially what the claasifying space of a group is
Did ng force you
Oh wait I misunderstood
For linear algebra? Ok cool
they have another one?
ah okay
Another book with two German-surnamed authors
many such cases
Ur one quandle away from reinventing homotopy colimts
You know a nice basic but sometimes troll question
What is the fundamental group of BS^1
enpeace homotopy theory arc is something yall arent ready for
What’s B even mean here what are we delooping
Well S^1 is a group
News to me
hey it could be worse
Like what
whuh but S^1 isnt finite how can it be a group
I mean okay at least these spaces are not far off being manifolds
First year group theory be like
Finite groups don’t exist
No groups larger than 7^4 exist
Actually S^1 is a finite space
Behold, Z/1000Z
for a suitable definition of finite space
My theorem remains unchallenged
where does 7^4 come from
idk anything worse than topological spaces
Behold, Z/10000Z
Idk I mean like these I am considering are at least locally compact Hausdorff
That’s easy, pi_1(K(S^1, 1)) of course
Could be horrible ig
personally find them quite nice but i am used to working with algebraic closure operators so
Q lol
It micophobic that mico no was able to to calculate
Loud incorrect buzzer
WTF
thats abelian, doesnt count
can barely be called a group atp
D_10000
damn youre good
Metacyclic doesn’t count
I don’t care about optimal lower bounds
Metacyclic groups when amazoncyclic and googlecyclic groups turn up
S_10000
Valid
Has at least 10 elements
Consider the group of permutations of quarks in the universe
I can give 9999 elements
oh yeah? name them
(12)
(13)
(14)
…
mathieu groups?
(1 9999)
Hydrogen helium lithium beryllium boron carbon nitrogen oxygen fluorine neon
They’re sporadic groups not groups
(11),(12),(13),(14),(15),(16),(17),(18), (19) and (139 193 184 999)
M11 × M11
Good road
ummm @delicate orchid after quite a lot of distractions i think i got it
take the subgroup of all t in D8, this is obviously normal since rtr^-1 = t^n-1
the subgroup of all t is cyclic of order n for all t since t^n = 1 so the group itself must have n elements
wlog call it H = {e,t,t^2, t^3}
then, K= {e,t^2} is a normal subgroup of H but rt^2r^-1 = t^3 which is not in K so K is not a normal subgroup of D8
that was much easier than i thought after being given that definition of D2n 😭
You picked the only normal index 4 subgroup. t^2 is central
rt^2r = (rtr)^2 = t^6 = t^2
Well no both are true
The idea is that r and rt^2 (or rt and rt^3) are conjugate in D_8 but generate an abelian subgroup
Anyway it’s midnight I gotta go to bed
goodnight
good night wew
maybe let the bedbugs bite.. this time...
I haven’t checked it out formally, but I think this can actually be extended to find a space with fundamental groupoid(restricted to the right basepoints) isomorphic to some arbitrary groupoid?
Take some groupoid G with some presentation. The 0-cells are the vertices of the graph in the presentation, the 1-cells the edges, and glue 2-cells along the relations as above. Then, the fundamental groupoid of that space, restricted to the 0-cells, is the original groupoid I think?
Haven’t been interested enough to actually try to prove it or google it though
Could very well be wrong
well the problem it seems is that the objects of the fundamental groupoid are taken to be the points in X
so if you have some fundamental groupoid on a finite number of objects youre gonna have some serious problems lol
Yeah that's why you restrict the fundamnetal groupoid to the 0-cells.
ah you said restrict to the 0-cells
uhh yeah looks about right
i mean i cant see any reason why that wouldnt be the case
yeah it sounds right to me but I haven't actually tried proving it haha
just wanna make sure I got this all right. A ring is a group closed under addition and multiplication, with associativity and the distributive property holds. A field is a ring with an additive identity and multiplicative identity? so when is a ring not a field?
that seems to follow my professors slides, but maybe im missing something?
if rings have to be abelian, then they have to be commutative, no?
The addition + is commutative but multiplication doesnt have to be
oh i totally did not mean to say subtraction in my first message. meant multiplication
a ring is not just a group, it has two operations (formally it has 5 but we often dont explicitly write negation, 0, or 1), one of which we call addition: this forms an abelian group, and the other we call _multiplication: this forms a monoid (it is associative and has an identity element, just like how in the real numbers multiplication is associative and we have the identity element 1). Furthermore, multiplication distributes over addition.
oh ew you guys dont require identity
whats it with math courses and using the most horrible notation for operations + not requiring unity
ts pmo
okay these notes really pmo man
pissing me off
didnt feel like going to sleep tbh
why does it look like a word doc
why does it use oplus and otimes
fr
ig they are trying to emphasize that like
if it walks and talks like addition then it is addition
wait if these are slides...
is this made in powerpoint...
based burnside ring enjoyer
ye
im sure that was the thought behind using oplus and otimes
lol
oplus is a noninvertible operation in my eyes idk
or I guess the representation ring
and it looks kinda ass and cluttered ehen its that small
yeah
when
now
what about invertible modules....
was talking more like "not in general invertible
istg if i make any more typos im gonna hurl my phone into a wall
yeah i just playin
I will say burnside rings/representation rings are really cool rings imo
although they're basically just polynomial quotients but still
Serre's book on reps has a chapter on it iirc
any time where u take isomorphism classes of some object and make it into a group/ring/etc
its cool shit
its related to K0 right
picard groups or k theory or etc
idk if directly related there are a bunch of times in math where u take iso classes of smth and make it a group/ring
well its the grothendieck construction for a group out of a commutative monoid right
yeah
tbh I feel like that construction is too simple to be given the name "grothendieck group"
it always feels like the name sounds more complicated than what it actually is
that’s the fun of it though
what is math if not a speedrun to work with an object named after grothendieck
grothendieck group is like the credits warp
SNES mario wrong warp ahh
"I was just fucking around with monoids WHY IS GROTHENDIECK HERE"
eh utrechts alright I guess
luckily its not Wageningen or smt
or Amsterdam
idk man dont really go there
nah
Delft campus looks like a prison
+its applied which makes it a minus 1000000 immediately
everything is grothendieck
is there a non-brutal way this can be done
ive shown that these are all the subgroups of that form as there are p+1 of them and they each contain p-1 elements that arent found in any other given subgroup
but that doesnt prove that there arent any other subgroups
notice that E is a Z/pZ-vector space, so every nontrivial subgroup is principal
so we can also treat is as the set of ax + by with a, b in Z/pZ
im really not sure we can use vector spaces
the notice that <ax + by> = <x + b/a y> for a≠0
thats the problem
if youre doing group theory then no way you havent had linear algebra
yes but we havent talked about vector spaces in group theory all semester
dont see why you wouldnt be able to use it, LA is general math knowledge every math student should have
so im not sure if its like currently out of scope
i took it with the same prof last semester
and we only went over R-vector spaces
barely C-vector spaces i guess
everything works the same so it really doesnt matter
ig besides the existence of a norm
i guess i could say like "there is an obvious isomorphism from E to Zp x Zp"
which is basically the same idea
yeah
and then let ax + by, cx + dy be linearly independent and G their span
=> (ad - bc)x in G
and theyre linearly independent so ad - bc ≠ 0
=> x in G
same for y, so G = E.
this would be a sketch of a proof that every nontrivial subgroup is principal
yeah
always has been
Every element has order p, so each nontrivial cyclic subgroup is Z/p. Z/p has p-1 non-trivial elements.
That's (p^2 - 1) / (p-1) = p+1 subgroups
I see
I ended up having to generalize it to p^n
But i finally got it solved I think
Sort group elements into equivalence classes based on if they generate the same subgroup
By construction these classes are subgroups
Each class has p-1 elements
So there are p^n - 1 / p - 1 subgroups
So if R = C[x1,..,xN] then are we considering R[y]/(gy-1) ?
Yes, which is the same as C[x1, ..., xN, y]
How is this the same as [x1,..,xN, y] ?
I mean R[y] is
Okay
So here substitute y = 1/g means? Are we mapping this equation to R[y]/(gy-1)?
You might be able to think about it that way, but I think it might be better to just think of it as a polynomial identity that holds whenever g is nonzero.
The final formula clearly also holds when g is 0, so then just holds on the nose
OH right that makes sense yeah thanks so much
So it is exactly the substitution of R[a,b] ring of polynomial over R in two variables to a = sin x and b = cos x ?
Yeah, all polynomials in sinx, cosx
So it is isomorphic to R[x,y]
I mean isomorphic to R[a,b]?
Thats R[a,b]
What if I send a to sin x and b to cos x ?
Oh there is relation between sin x and cos x
This might be important
Yes
If I have to show it is an integral domain, is there any better way than computation?
Can I see this ring isomorphic to some familiar ring?
I think yes
Using this
hi im confused on the notation used here. We've learned that S_X is the set of all bijections from X to X. what does S_2 mean and why does its multiplication table have matrices? how does function composition work w matrices
How?
I think you can build an isomorphism to R[x,y]/(x^2+y^2-1)
And x^2+y^2-1 is irreducible
These are not matrices.
You write a permutation of 1,....,n as where it sends each element
And the notation is that in the top row you have the inputs
1 2 3 .... n
And in the bottom row you have the outputs
f(1) f(2) .... f(n)
I see
Sorry to ping @rocky cloak, can't we just directly take a variable y such that gy = 1, so then y is a function in C[x_1,...,x_n] but what if g is zero somewhere then how do I define y?
they're not matrices, they're permutations written in two column notation
the WORST way of representing them 
Any hint for e?I know some of kernel elements are x^2-y, xy-z, x^3-z, y^3-z^2
imagine not using cycle notation
how can you not like cycle notation
congrats on graduating middle school
I like cycle notation, one line is diff
One-line is u write ur matrix in two lines then throw away the top one
just use cycle notation and put a lil 🖕 at the end
Thanks bro cant wait for high school… I’m a bit nervous, are seniors really bullies?
yes theyre all psychopaths really
At the board should I write 🖕or do the gesture or both
i love how this is actively harmful notation
It’s the standard in flag varieties apparently
My prof said “one line is used in flag varieties and cycle notation everywhere else”
Or maybe he said alg combinatorics idr
It’s a headache
red flag varieties perhaps
W
I keep making errors because i start writing one-line then accidentally switch to cycle for one step
Then everything falls apart
ehy cant you just use cycle notation
I gotta drink the kool aid
the aura is on another level 
Can you please explain this?
Ya theyre gonna shove u in lockers
And theyre also gonna say give me ur lunch money nerd
Shoving me in a box call that filling in a young tableau
they broke ass
WE are mathematicians WE are broke 🥀
preach
I'm not sure what you're asking exactly.
When g is nonzero you can pick the value of y to be 1/g. When g is 0 there's obviously no such y.
In the beginning you have an equation that holds for all values of x1, ..., xn, y.
In particular it holds for the choices of x1, ..., xn such that g is nonzero and y = 1/g.
Thus substituting in y=1/g you get an equation that holds for all x1, ..., xn such that g is nonzero.
Uniqueness:
I am trying for uniqueness, if T and T' are two objects which satisfy the given condition.
So by universal property, there exists unique j such that j : T -> T' such that j(g) = g', similarly there exists unique j': T' -> T such that j'(g') = g.
h = j(j') : T' -> T' such that h(g') = g'. Now is it comes from the universal property that h = id, because universal property says there exists unique mapping k:T' -> T' such that k(g') = g' and identity can be the choice for k, and it is unique so k = identity
so h = identity
Thats a good guess for the generators, but notice that if x^2 - y = 0 and x^3 - z = 0 it already implies xy - z = 0 and y^3 - z^2 = 0. To show that they generate the kernel try showing every polynomial f(x,y,z) in C[x,y,z] can be written as f = g(x) + (y - x^2)h(x,y,z) + (z - x^3)k(x,y,z)
in an isomorphism, do same order elements map to each other?
yes
As a general rule to guide your intuition, you should think of an isomorphism as equality for algebraic objects. That is, if you only look at the algebraic properties of your object, they should be completely indistinguishable. That being said, you should be able to prove this result pretty quickly from the definition of a homomorphism
If $H \cong K$ with $H$ and $K$ normal subgroups of $G$, then is $G/H \cong G/K$
Tiessie
no
unforunately no, consider Z/4Z x Z/2Z with normal subgroups Z/2Z x {1} and {1} x Z/2Z
Yeah no
G/H depends on the specific inclusion i : H → G rather than the group structure of H
That is crazy
Basic question but if K1/N = K2/N can you conclude K1 = K2?
Yeah this kinda flies in the face of my general intuition advice given above, but no its not true unfortunaltly lol
= as groups?
Everything is preserved under isomorphism they said
algebraic properties of the group itself are preserved
well yes, that is true! so the correct interpretation would be that G/H ~= G/K implies H~=K
the isomorphism class of G/H is not an algebraic property of the group H
i have doubts believing that
tbh
Which 1
this
I guess my question is like the reverse lol
Yeah im sure thats untrue for rings, and I suspect its also not true for groups
yeah I'm actually having second thoughts as well
I think basically the same counter example as above works
Take like Z_2(+)Z_4 and the subgroups Z_2(+)<(0,2)> and 0(+)Z_4, those should both give you Z_2
this is fairly poorly worded because if K1/N = K2/N then yes of course K1 = K2 but thats like trivial. It is not the case that K1/N ≈ K2/N => K1 ≈ K2
I guess a trivial example could be rings R\subsetneq S and then take N to be the ideal generated by a unit in R
Edit) im just a fucking idiot
I think that works, both should just give you zero
It’s not trivial to me, something about it confused me
well K1 is the union of all elements of K1/N and K2 is the union of all elements of K2/N
so if K1/N = K2/N, then K1 = K2
i just dont think its useful to think on the level of sets and elements lol
Lets pretend I didnt talk about ideals over a field for a minute
i was about to ask "ideal generated by a unit"?
Im doing galois theory rn im a bit field coded
But yes I think my example does now work lmao
Well no I guess it still doesnt, im a fool
But theres something out there, ill come back when I decide to have a brain wave
Yeah thats much better lol, idk why I didnt just keep running with that as an example like I did for the question before
Z4 x Z2 has two subgroups Z4 x 1 and 2Z4 x Z2 which are nonismorphic, but which give isomorphic quotients (Z2)
Yah this is the example I put above
But u need to for that dont you
K1/N = K2/N is thinking on the level of sets and elements
Context was for showing the bijection in the correspondence theorem
Yes for the same reason, we can just think in terms of sets and elements ? No algebra?
yes
If its of interest at all, I had to painfully spell this out in my first ring theory class lol
Haha
We were specifically told to be extremly specific and clear so it does stick in my mind, which I guess is/was helpful
Hello good ppl
I am struggling with part c
Wait
hold the phone
Max ideals of Q[t]/(t^2(t-1)) correspond to max ideals of Q[t] that contain t^2(t-1). As Q[t] is a PID, its maximal ideals are genereated by a signle irreducible polynomial, so this ideal looks like (f). The condition (t^2(t-1)) \subset (f) means that there exists a g such that gf = t^2(t-1). So surely f = (t) or f = (t-1) ?
hmmmmmmmm
Would appreciate any hint
Please note this is a homework problem
Looks good to me so far. Is this the comalg hw?
yeah
Ive heard people are struggling haha
the first homework sheet hasbeen tough icl
Q1 is striaght up just a classic example in AG
I've spent like 3 or 4 days on it
just about broken through
I think he's trying to get rid of ppl
Yeah I dont think youre alone, it does seem tough though
It's been really satisfying when the right argument has come to my head though
I think he just assumes people are cracked, he wants me to work on some open K theory problem 
oh awesome
Well, he suggested that to me, wants me to is maybe strong
lol
i'd prefer the lecturer assume im competent rather than assume im stupid
like in galois theory
actually kill me dawg
Tbf, people gave him reason to assume were dumb
The first lecture I went to bro was pissed
also q3 is disproportionately easy lmao
oh yeah LOL
the first lecture he gave a high level overview of galois theory, got a few emails and then went back to basics
I cant blame him, ive never heard people talk over a lecturer like that and it seemed that people emailed him all sorts of dumb ass questions
yeah
Bruh u guys are at the same school?
Yeah
Bruh
I did fall asleep in this one icl
like i was so bored
Yeah Ive been to that, and I techinically attended last friday and thats been it
todays lecture was good. shame you missed it
Im only doing it because theres fuck all else sem1 algebra wise
it was gareth tracy doing some group theory. he's so enthusiastic and kind and nice
and we proved a nice reuslt about S_5
well two actually
Where on earth are we? Theres nothing to suggest where we should be from week to week
A5 being simple?
no
it was that S_n has a unique subgroup of order n!/2 and that (12345) and any transposition generate S_5
the argument is super neat
big fan
I think we're far behind is where we are
the second result can be generalised to Sn
Im at 6.6 just now, im guessing were around there?
Oh
Didnt he cover splitting fields in lecture 1 lmao, whats happened
yeah bro idk
im just as confused as youa re
also there were about 20 ppl at the lecture today
lmfao
weird lectures you got there
just this module
I mean im not fussed, ill take an easy course because my next semester is cooked
Lean is worse, not a clue whats happening there, weve still not done anything
average lean moment
Okay i actually need to find the maxmial ideals of R/I now
then q3 is easy and im done yay
Yeah sorry, and I should get back to doing some galois since ive not attended any of the lectures
q1 took me so long and then i realised everything is just the evaluation map
lmfao
lol no worries. you're way ahead dont worry about it
Yeah people on the warwick maths discord seemed to be struggling, I wouldnt worry lol, its also a pretty classic example in AG though so its good to understand
oh i should actually use that server
Its not like super serious from what ive seen so far tbh, but its nice just for info about courses
yeah
free objects my beloved
I've honeslty really been enjoying the difficulty of commalg so far. Like the level of sophistication is a breath of fresh air and has let me see the objects in a different light yk
like when he defined a subring of a ring R to be a ring S such that there is an injection S to R
same with quotient
and also being forced to work with quotient rings is actually really nice
like I needed someone to shove C[X,Y,Z]/(some bullshit) down my throat
and i feel more comfortable with them now
also this is the first time i've actually used maps to study algebraic objects
at least properly anyway
my first instinct for any question is 'what map can i use to make this easy'
its been really good
big big fan
hopefully my request to take this module gets accepted, my tutor and the lecturer already agreed so just need dugs to agree
and im now free
assignment has been done
yippee
Oh are you just in year 2
But also yeah I know how you feel, my noncom course last year was the exact same and it taught me more maths than any course I can think of in my UG, like more than just the content it really helped my maturity and how I look at algebra
I unfortunately cannot say the same of my comalg class, that was a joke. I did get highest in the year and an almost perfect result though so I’ll take it
hm
And just RIP comalg2
do number theory
I mean it’s hard, all miles Reid courses are hard, but I would’ve actually got to do some ring theory (the thing I want to study)
I’m instead now just taking algcurves with miles meaning I’ll get cooked on a subject I’m worse at
Also taking Lie algebras, category theory and cohomolgy and Poincaré duality that semester, can only end well
i've heard lie algebras is okay
Yeah I’ve also been told that, apparently it’s quite chill
no
yes
And I’m trying to pre-study cohomology, but I’ve heard that John sets a fair exam
If only the man could respond to an email as well
john slightly terrifies me
he strikes me as very old english
especially his voice
idk
maybe thats just me
lmfao. this reminds me i need to start emailing round for urss
Maybe I’ll get to find out one day if he ever responds to my email asking to chat
My other options for supervision I’m not currently in love with, but I’ve got another meeting next week so we’ll see how that goes, it’ll probably be an alggeo topic though so meh
not k theory with marco?
Thats probably the current front runner. The other option I have sounds really cool but im not sure that I can get much done with it in 3 months, and I didnt have the most amazing first impressions of the supervisor

Im metting with Gavin Brown next week though and although its AG, it seems like cool AG and he seems like a really nice guy
gavin brown is a top bloke
and it is cool ag
its like blowups and cuspodial points and stuff
I had linear algebra with him and i went to every lecture jsut because he was so sound
Which like meh I dont love, but he does cool non-com deformation theory stuff
So this semester you have commutative algebra
yes
you are making me jealous 😵💫
Does your professor maintain notes ?
cannot take more then one course this year
I want to do commutative algebra too
yes but they're mega terse. like a whole semester of content in 46 pages
its fucked
thats very dense
🥲
my proffesor's CA notes were 300 pages
Its likely similarly, or possibly less, dense compared to A&M
the lectures are good though
Could I please have a hint for <=? I am assuming that x is not a zero divisor, so that x \notin (0:a) but x \in p. I want to produce some ideal q such that (0:a) \subseteq q \subseteq p, which contradicts the minimality of p. My instinct was to look at (x) or (ax) or something but that didn't work
What is the notation (0:a)?
Just the annihilator of a
x such that xa in (0)
I see.
I feel like this would be a lot easier of the zero ideal was decomposable
I mean what would make sense would be to look at a maximal ideal between (0:a) and p that doesn't contain x and show that this is prime.
Haven't checked if that works, but that would make sense
Sorry wdym aren't maximal ideals prime
Usually yeah, that's why that would be my guess
hm
usually?
Yeah, if you pick the poset completely arbitrary (say just containing one ideal), then obviously being maximal says nothing about primality
oh lol like that then yeah
does every group have a set of generators?
wait that's a stupid q
😭
ofc every group does
i guess you could also have an infinite group with infinite generators with finite order right?
yes
take a direct sum of a countable amount of copies of Z/2Z
then all the elements of the form (0,......., 0, 1, 0, 0, ....) generate this group and they are all of order 2
not every group has a minimal set of generators though
direct sum?
tuples where a only a finite number of their elements is non-zero
this forms a group where the operation is done element-wise
In other words: any vector space over Fp can be viewed as an abelian group where each element has order 1 or p (in fact this is the same data). If you take an infinite dimensional vector space over Fp then this gives you an abelian group as you desire
(in fact this is the same data)
Hmm, in which sense?
Consider F9 = F3[i] as a vector space over itself. The abelian group structure is just (C_3)^2, and that doesn't seem to preserve knowledge about how to scale a vector by i.
Okay sorry I mean Fp
Okay, then. :-)
Could you expand on that? I’m not sure I’m seeing what you’re saying
Potato was generalizing the answer to Pentium's question "you could also have an infinite group with infinite generators with finite order right?"
Z/2Z is just the group consisting of residue classes of 0 and 1 right?
AKA the (unique up to isomorphism) group with 2 elements.
i hate this weird notation 😭
it's so similar to quotient vector spaces
oh wait
quotient groups
are quotient vector spaces quotient groups 😭
Like point was you can view this as a question about vector spaces where the answer is clear
Yes
ohhh
The underlying group of a quotient vector space is the quotient of the underlying groups
this comes from ring theory, where we quotient the ring Z by the ideal 2Z
And quotient rings are also quotient groups.
yes xD
In each case, with additional structure that is preserved under certain conditions on the subgroup you're quotienting by.
just forgetting the ring structure and keeping only the abelian group structure
okay so these form an infinite dimensional vector space right
yes
Can someone tell me if my proof is right and if there are any other nice ways of targeting this problem?
Prove that every infinite group has infinitely many subgroups.
So I split this into the case where the group either has a finitely many generators or infinitely many generators.
In the case where the group has finitely many generators, at least one of these generators must generate an infinite group which we can call <g>. However, we have infinitely many subgroups of <g> being <g^n> for each n \in N.
In the case where the group has infinitely many generators, we can take the cyclic group generated by each individual generator and then we have infinitely many subgroups.
Sounds good, just I would be careful with the infinitely many generators bit as you need to justify why you get infinitely many distinct subgroups
right, I was about to ask why that's so
also for the finite generators part, how do you know you end up with infinitely many distinct ones from the <g^n>
I would write it like this: suppose every element has finite order. Consider the finite subgroups H. Since they're finite, each omits some element g, but then <H,g> is some bigger finite subgroup, so there must be infinitely many of them
And I would have said like if you have an element of infinite order then you reduce immediately to Z where it is obvious. But this is just a rephrasing lol
I just think it is cleanest to divide like this (by orders of elements) rather than the "number of generators"
Let X be the set of <g> for g ∈ G. Suppose X is finite. Considering any element g, then by finiteness there must be some n, m for which <g^n> = <g^m>
=> g^n = (g^m)^k = g^mk for some k
=> g^{mk-n} = 1
=> g has finite order
=> all elements of G have finite order .
Thus X is a finite set of finite groups which cover G (every element of g is indeed contained in a cyclic subgroup), so G must be finite.
no cases needed
Or even just like, consider the finitely generated subgroups. If there are only finitely many of them, then chuck all the generators together to get a maximal finitely generated subgroup, which is nonsense
How about a middle way:
Consider all the subgroups of the form <g>.
If there are infinitely many of them, then we're done.
However, if there are only finitely many, then at least one of them must be infinite, because together they cover G. But if there is an infinite cyclic subgroup, then there are infinitely many of them, a contradiction.
basically what i did lol
I just wanted to get rid of the nitty-gritty about exponents.
I like this, this is pretty slick
I think I would’ve come up with enpeaces proof but this one is nice and simple
Hmm, that goes a bit fast for my taste. It's not assumed that the group is abelian, so a finite number of elements each of finite order can generate an infinite subgroup. So how do we know <H,g> is finite?
no, take the extreme example of C2 \ast C2
Oh yeah good point
Hm isn't it a finitely generated group where every element has finite order, hence finite
I mean, it probably is finite since we have assumed all elements have finite order -- but that assumption doesn't seem to be used explicitly on the way to <H,g> being finite.
I am using that implicitly
whats an infinite nonabelian group where every element is torsion and the set of orders of the elements is finite?
Ah i am still wrong. Interesting
Burnside's problem
Thank you for pointing this out
oh lol ofc this turns out to be an open problem
Nah it was answered but in the 60s
I just forgot about it lol
But yeah there are weird examples of fg groups where every element has finite order but the group is still infinite
I guess it sounds plausible if you have crazy relations lol
nontame groups huh
I should not do nonabelian groups
Well damn, I thought your solution was nice but I guess it was too nice haha, for the best though because I wasn’t aware of burnsides problem, that’s a really cool result
And from a brief scan of the Wikipedia the counter examples are weird
Or perhaps not weird, but like, big
lol it was solved by a theorem in noncomm homalg
what's it with stuff of 3 elements and breaking everything
Yeah this is something I am like happy to be wrong about as I have learnt smth lol
i wonder if burnside problem is true for groups generated by 2 elements
two different generators generate different groups no?
isn't that kinds trivial
no
g and g^2 generate the same group if o(g) is odd, f.e.
wait
how do you get o(g) if you have infinite order
(im half asleep my bad)
its a finite order set right
if your group has finitely many subgroups, its easy to see that every element must be of finite order (although you still have to prove that ofc), the hard part starts there
say o(g)= 5
so we have
waittt
they do generate eht esame group
yeah realised with ±1 and Z
The Wikipedia article seems to say it's an open problem whether "2 generators and every element has order 1 or 5" forces a group to be finite.
Ah, but it also says that there are infinite groups with two generators and all elements orders <= 8000.
xd
I really wonder how you actually work these things out, like presumably there’s at least some amount of pruning done, certain properties the groups either must or couldn’t have, but beyond that, do you just make GAP chug away?
I should look some stuff up about this tomorrow, that’s a cool problem
is the rest solved? weird
thats fucky
why cant groups just be niceeee
do share if you find smt interesting abt it
theorem: all groups are free, and they admit a natural lie group structure
preach
in fact, every algebraic structure is in fact free in every variety it belongs to
i will not take any questions
Theorem: all rings are unital and commutative and noetherian 🤤
approved!
Lfg
theorem: if φ is a Noetherian coherent condition such that Fφ is closed under taking direct limits, then F√φ is too
🙏 🙏 🙏 🙏 i beg you
@annals can we look into this
i am missing lore i think 
The math journals
Like that theorem was so awesome we should get the big math journals involved
oh lmao
well i do suppose the theorem says a lot
a corollary is that, if K is closed under embeddings, equationally Noetherian, and closed under direct limits, then ISP(K) = Q(K)
determining when ISP(K) = Q(K) is a pretty important problem Id say
ISP(K) = all algebras which can be embedded into an arbitrary product of members of K
Q(K) = smallest quasivariety containing K. A quasivariety is a class of algebras axiomised by formulas of the form
∀x1 ... ∀xn ( p1(x̅)=q1(x̅) ∧ ... ∧ pm(x̅)=qm(x̅) → t(x̅)=s(x̅) )
a great example is reduced rings
Bro is speaking but no one’s hearing 👂
crying tbh
axiomised as the class of commutative rings satiafying the set of sentences ∀x (x^n = 0 → x = 0) for all n = 1, 2, 3, ...
ISP(K) is called a prevariety
these are also axiomisable but by implications where the LHS can be an AND that ranges over an arbitrarily large set of equations over an arbitrary amount of variables
(you may also run into size issues with proper classes and such? but i think i saw a theorem somewhere that says its all okay)
but this is horrible to work with
lets be real
So in the case of reduced rings, what does ISP(K) = Q(K) intuitively mean
I.e. why is it important to know
it means that reduced rings are decided by a property that can be checked ""locally"" i.e. on finite sets (or finitely generated subrings)
Oh nice
it turns out that, when K is nice (so-called equationally Noetherian), then Q(K) is actually the local closure of ISP(K), that is, the class of algebras A where every finitely generated subalgebra of A is in ISP(K)
I am pretty sure™ that this local closure property is equivalent to the φ-radical being an algebraic closure operator
but thats beside the point
Could there be different sets of sentences that axiomize the same class
oh yeah def
Yeah id imagine so
Wow thats pretty cool
thats why, in theory, you usually want to work with the set of all such sentences that are satisfied by the class.
You dont want to leave one out?
This yields a "Galois connection" between classes of algebras and sets of quasiidentities (sentences of the form described above). I put it in quotations because the collection of classes of algebras is of course not a set
And is the formalism here like in propositional logic or smth?
here an "algebraic closure operator" is analogous to a closure operation on an ideal?
it then turns out that the "closed classes" are exactly the quasivarieties, and the corresponding closure operator is given by ISPP_U, which is very nice if you know model theory lol
algebraic just basically is a lattice-theoretic characterisation of the "being able to be checked locally"
This seems like some hardcore shi ngl
ah okay
formalism here is model theory
Oh ok, idk about that
but you dont need to know anything abt it haha
sharp knows model theory
and ultraproduct
like the user ultraproduct not the thing
all the class operator stuff (the I, S, P, P_U, Q things) is mainly universal algebra to me
oh i guess you're in #foundations so you already know that oops
the connections with logic are nice but the moment im studying them algebraically
or... geometrically in a sense?
👀
(technically)
Bruh
(universal^{TM}) algebraic geometry
its called algebraic geometry because youve got a contravariant functor to Top okay
At a certain point do you know still what youre studying
I guess u do if you have intuition for it
its hard to characterise
is it a sheaf 👀
not yet sadly
neuron deactivation 💔
havent found a good substitute for "local quotient of polynomials"
frustratingly, general algebraic structures do not come equipped with a multiplication which is commutative and distributes over all the other operations
im sorry 😔
not distributing is crazy
try not having any binary operation at all
i think people just call those sets
oh joy
yup
Uhh
Lol
Nvm this sounds kinda silly again
like the best i can do is the sheaf of local polynomial / term operations, but for varieties this is the constant sheaf 💔
In mathematics, an algebraic structure
(
R
,
T
)
{\displaystyle (R,T)}
consisting of a non-empty set
R
…
wtf
Oh Hell Nah!!!
this reads like no one other than Marshall Hall has ever used it
no i can feel it in my bones. something big is coming soon in the field of planar ternary rings
W
well it does seem really interesting
just, people dont care about ts anymore
its all AG now
those darn kids
as it should be
when in doubt just sheafify
well the problem is that the affine spectrum sheaf is so specialised to prime ideals
like it relies heavily on the properties of prime ideals
properties which would need to have an analogue for any class closed under embeddings both contained in and containing the class of integral domains
this shit is just too general 💔
why am I ranting about my shitty researxh here I should really go to sleep
cya
trick question ive been trying that for 3 hours alr
last night i watched a bunch of youtube videos on like super mario 3 tas and how some guy got it in 5 miliseconds
after going down that rabbit hole for a while i went to sleep satisfied
could be the move
that's how it often goes
imma be fr ts is keeping me up
it feels so close
maybe you'll dream up a proof or counterexample
5ms??
i had a prof who said that they dream about donaldson-thomas invariants
a counterexample would be detrimental
ye
lemme find the video
it was super interesting
this was the first one i watched by this guy, he explains a 0.2 tas which was done some number of years ago
https://www.youtube.com/watch?v=fQYX_AVxGq0
then that guy made a 5ms tas and explains it in this one
https://www.youtube.com/watch?v=pK7hU-ovUso
Have you ever wondered how the shortest* TAS to be published on TASVideos works? https://tasvideos.org/4567M
*Update: As of March 1st, 2025, it is no longer the shortest TAS to be published on TASVideos.
In this video I'll be explaining how subframe inputs are used to beat SMB3 in a little over 0.2 seconds.
Join my discord! https://discord.gg...
In this video, I showcase "Intercycle Cartridge Swapping" as a means to run arbitrary code on the NES, and use it to beat some NES games absurdly fast.
Console verification by decrazyo: https://www.youtube.com/watch?v=BGvvY5FOTL8
Check out my game Fantastic Fist: https://store.steampowered.com/app/2119470/Fantastic_Fist/
The TriCNES emulator ...
damn i didn't even know that song had a name
toby fox music has been getting popular too
i am very normal about toby "radiation" "tricky tony" "mr annoying dog across time and space" "specimen" "SPAMTON G SPAMTON certified" "gave toriel a homestuck typing quirk" "tricky tony v2" fox
it did?
okay i think ive ran out of funny things to put there
damn... fake ass fan...
i mean its a fucky wucky algebraic structure what do you expect
true
it truly is a shame
i could never live up to the hype
Lol
i don't think i've played undertale nor deltarune
though i've watched playthroughs of undertale
you might ask "what hype" and id agree
i havent played a videogame in like a year
undertale and deltarune were life changing for me
tbh
undertale is really that good?
i play old school runescape because it's mostly tedious like math
depends on your personality
i think my life changing games were probably super mario galaxy 1 and 2
i wouldnt say life changing for me but i played a ton of those as a kid
personally it resonated with me because toby tox humor is like exactly my kind of humor, and im a sucker for metanarratives
and overall the whole story and music just worked for me
is it turn based rpg?
mixed with bullet hell
super mario galaxy 1 and 2 made me fall in love with video game soundtracks
zelda for me^
as far as gameplay goes deltarune is far superior imo
deltarune and undertale solos
ill look them up
not biased at all btw
in super mario galaxy 1 the sound as the game progresses
but imma say no prolly
as u fix ur starship and it gets better and better
haha yeah thats fair
tru
and everything starts lighting up and bro omg the way the music changes
wow nintendo sucks ass now hey
the music works best in the context of the game when you recognize all the different leitmotifs
instruments get added every time you improve your ship
i used to be big fan and still am but not if theyre bad
literally chills every time i listen to it now
i think i actually cry lol like it's so god damn awesome
as do all big companies
true
zelda botw was also good in that aspect
thats me but UT/DR music 
and minecraft music
botw soundtrack is good but not close to the other games
i can't remember the name of the town but it's the one you build yourself and u invite ppl from each of the four regions over
terry town or smth
volume beta >>>
and when someone new comes to the town the instruments associated to their region are incorporated into the theme
yea terry town
what y'all know about wii tanks tho
{ You can support me on Patreon:
https://www.patreon.com/scruffymusic
{ Hear my music on BandCamp:
https://scruffymusic.bandcamp.com/
{ And follow me on Twitter for more updates!
https://twitter.com/Scruffy_Tweets
Wii Play (2006) had a great assortment of little games, each with a little gem of adaptive music, but none got as intricate as the f...
i love that vid
rivals beethoven and the like
i love scruffy's channel
super good high quality stuff
Oh that's interesting; how so?
Bruh too real
they were a huge part of my childhood
you must listen to the celeste soundtrack 🙏
it was basically my first experience with mario games outside of the DS
and i used to play that one, among other mario games for the wii, with my dad a lot
idk where the wii went so we dont play it anymore
ive heard its great
you two just popped out of nowhere 
@delicate orchid knows a lot about celeste soundtrack
the fucking name xhange again 😭
it's even better
i should change my name
yeah its peak
it's got me thinking like damn maybe i need to drink booze and gamble too
never got bored of it after like 200 hours on the game
peak.. you say? i know peak...
~~althgouht tbf 100 hours of those were mods with diff soundtracks ~~
i played celeste obsessively for like a week or so
did you finish it
i tried getting the corner jump (?) down
a friend of mine is bugging me to play in stars and time apparently its music is great too
no i ended up raging so hard i stopped playing
corner jump in the first week 💀 💀 💀
mega skill issue
yo
well i started playing celeste because i found out about it through this server
namely ryc and wew, both who liked speedrunning it
celeste speedrunning is so cursed 😭
it looks so awesome
im a sucker for games where u can min max everything
hence why i love old school runescape
its all like chained ultras, cboosts, spinner stuns, crouch dash, and other funny gm-level speed tech
yea tbh i dont think i even played the game that much i just spent a lot of time trying to do crouch dashes and corner jumps
noooo 💔
crouch doush u can keybind
corner jumps are js really annoying
i treid learning them but you need like good input timings and i couldn't get it realtively consistenl
for me keybinding takes some of the fun out of it
the fun is in the pursuit of precision
holy poetic
but yeah i like the process of learning those things more than actually doing them
what a quote
doing all of this as soon as you get the game is crazy work 😭
"there are cathedrals everywhere for eyes to see" ahh
