#groups-rings-fields
1 messages ¡ Page 352 of 1
Okay so possible matches are 1st and 2nd and 3rd and 4th
yes
yes
But Z/37Z* probably isn't
And same for Z/10Z*
I don't know how to check if they're cyclic to be honest
So for Z18 possible orders are 1, 2, 3, 6, 9, 18, for S2 elements have order 1
Unsure about the Z/nZ*
s2 is 1 and 2
Wait but how?
Ohh yeah đ
Can you help me with this?
Is it a^n
Where a is the element we are checking
yeah
so this requires some checking
to understand what orders may arise in 2, notice 4 divides 36 so we may have an element of order 4
How the hell do I calculate 35^37 or any element ^37 for that matter
^36
and you start multiplying
and reducing mod 37 after each multiplication to keep things small
A3 is actually isomorphic to C3, which is abelian.
Good point.
but notice the first group has no element of order 4
do you see why?
Why 36?
phi(37)=36
.
That's a good reason.
yep
no
In a product group, the order of (a,b) is the least common multiple of the order of a and the order of b.
A element (a,b) in the product has order lcm(ord(a),ord(b))
Also how I arrived at 4,
I tried breaking these two into a product of cyclic groups
you can always do it for abelian groups
from this decomposition you can see mismatches like this
Okay, how do we compare them to the 2nd product?
the 2nd has an element of order 4 (6, e)
Looking for elements of order 4 worked great so far ...
ExpertEsquieESQUIE
Hmm phi(4) = phi(2^2) = 2^2 - 2 = 2.
true
Yup that makes sense
Okay so my biggest issue with groups in general is that, finding orders of elements and also finding how many elements of each order there is
Oh â ď¸
returning to the question
so I made a mistake and order 4 doens't help us
but actually Phi_37 \cong C36
Can you please tell me what is your thinking process? What are we trying to do after figuring out abelian/cyclic
orders
We can either count all orders of elements or count number of elements of certain order?
so I though the first didn't have an element of order 4, but I was wrong
both are possible, the first one is signficantly easier
look at 5 in Phi_37
5 * 5 * 5 = 125 = 14 (mod 37)
14 * 14 = 196 = 11 (mod 37)
11 * 11 = 121 = 10 (mod 37)
10 * (11 * 11) * 10 = 110 * 110 = (-1)^2 = 1 (mod 37)
I calculated 5^3, 5^6, 5^12, 5^18, 5^36 mod 37
basically I check the order of 5 in (Z/37Z)* is 36
so this is true
@fiery dirge are you with me?
I'm here
Because of this?
The entire group can be generated with a single element
yes
But 37 is an odd prime so it does make sense for it to be cyclic
Which ones?
what you have learned
in general
avoid manual computation if possible
unless you want to understand things more concretely
but usually its just a pain
I know elementary number theory like euclidean algorithm, cvt, eulers totient function. Then for groups nothing special, subgroups, normal groups, group actions, isomorphisms, first/second theory of isomorphism etc.
I kinda skipped some topics in between but yeah
In the next course yeah
This one is pretty much over with rings/fields and it's pretty introductory there
returning to the question
we have an element of order 36 in the 2nd group
but we don't have one in the first group
so they are not isomorphic
do you agree?
Yeah
(The relevant facts to know for (Z/37Z)^Ă being cyclic are (a) 37 is prime, (b) the integers modulo a prime are a field, (c) the multiplicative group of a finite field is always cyclic).
Um, I think (1 in Z18, 3 in Phi10) ought to have order 36 too?
fuck I hate this
xD
late night math be like
@tribal moss can you take over?
I am tired
this is so funny to me
I wanna sleep
In fact,
$$ \bZ_{18} \times \Phi_{10} = C_{18} \times C_4 = C_9 \times C_2 \times C_4$$
and
$$ \Phi_{37} \times \mathbb{S}2 = C{36} \times C_2 = C_9 \times C_4 \times C_2$$
D12 has elements of order 24, 12, 8, 6, 4, 3, 2, 1.
A3 is 3!/2 = 3
Z/14Z* has order phi(14) = phi(2) phi(7) = 6.
A4 is 4!/2 = 12
đ
Troposphere
No worries I'll go to sleep as well, we can pause here
I'm on the way to bed too.
But my conclusion above is that the first two groups are indeed isomorphic.
For the last two groups I think looking for elements of order 4 actually ought to work :-)
Bye
Z_(1-i) is not maximal ideal of Z[i]
What does Z_(1-i) mean? If it's the principal ideal of Z[i] generated by 1-i, then that definitely is maximal.
localization at 1-i
/j
ah yes 1-i the famulous element of Z
xD
it was written with a subscript. So it took it literally
i mean im sure you could make it work lol
How did you check it?
It is isomorphic to z_2
They should be maximal
yep
Intuitively: The ideal <1-i> consists of exactly those a+bi in Z[i] where a+b is even.
If we have a strictly larger ideal, then it must contain something outside <1-i>, say c+di where c+d is odd.
Then (c+1)+di is also in the ideal, because it is in <1-i>, and the difference between those elements is 1, which is again in the ideal. And now the larger ideal is the entire ring.
Also note that <1+i> and <1-i> are the same ideal, since (1-i)¡i = 1+i and (1+i)¡(-i) = 1-i.
Let G be the subgroup of S10 generated by the permutations (4, 9)(1, 3, 5, 7)(2, 8, 10), acting on the set [10] = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 as a permutation group. Determine the orbits and stabilizers of the elements 1, 6, and 10, as well as the fixed set of a = (1, 5)(3, 7)(2, 8, 10).
How do I think about this?
This is just a "remember the definitions" exercise. There's no particular cleverness to employ here -- just apply the definitions.
So umm stabilizers are only those that fix them in place?
So for example stab 1 = (4,9)(2,8,10)?
I'm not sure about orbit tho, is 8t just (1,3,5,7)?
If you need to ask that, go back in your text or course notes to find and reread the definition of "stabilizer" rather than relying on randos on the internet :-)
Also, I'd read the problem statement very closely to make sure whether (4 9)(1 3 5 7)(2 8 10) is meant as a single permutation that generates G, or three different permutations that generate G together. You get slightly different groups out of those two cases.
(I get suspicious because you wrote "the permutations" in plural, but without commas or "and"s between the three cycles, so either one or the other must be a typo...)
Usually one doesn't write commas between the elements of a cycle in cycle notations -- do those commas really appear in your original?
There are other permutations that fix 1, for example (2 8 10) -- which is in G no matter how we interpret the problem, because (2 8 10) = ((4 9)(1 3 5 7)(2 8 10))^4.
And definitely also the identity :-)
However, (4 9)(2 8 10) is only in G if we consider it to be generated by the three permutations (4 9) and (1 3 5 7) and (2 8 10) separately.
So it looks like you also need to go back and revise the definition of "generated by".
it gives you interpretations of some object in another
so studying homomorphisms is studying the relations between things
It is extremely rare to say "these two things are homomorphic".
What's interesting is the homomorphISMS that connect them, not whether some random homomorphism exists.
For example, given any two groups G and H there's always a homomophism from G to H -- at least the one that sends everything to the identity! -- but it's still interesting to study the homomorphisms themselves.
apples đ
"Homomorphic image of" is stronger than *"homomorphic to" would be.
In this context it means there is a surjective homomorphism from a finitely generated free module onto the module we start with.
It's 3 of them yeah
Anyone who wanna talk or have discussions on set theory algebra including group theory etc, linear algebra, propositional logic or predicate calculus
i just like to discuss and maybe learn alot by exchanging opinions
It might be better if you mention a specific topic and/or question you have
this is like asking for discussions about balf of what you learn in first year undergrad lol
homomorphic image of M means that it is the image of a homomorphism from M to some other module
i.e. isomorphic to a quotient of M
How do you discuss something already accepted/proven to be true like definitions or axioms?
i think they just mean talk about those already accepted notions and develop intuition for them, rather than discuss how they should be changed etc.
yea, it seems like this works best if you start the conversation with something you are confused on or interested in. somebody will likely respond
There's no developing intuition, algebra notation is just fucked up đđ
Makes analysis look easy in comparison
i disagree with this, but yea lol, it certainly takes a different kind of intuition
hard disagree lma
there's developing intuition on algebra because existence of algebraic geometry /s

If only we taught them permutations for three years
this all sounds like teacher and/or student issue not an issue with the field itself
well in intro algebra classes you quickly see concrete examples that we're all familiar with like Z, polynomials, matrices.. isn't that enough motivation ?
in my experience it's the opposite lol
with bad teachers, students dont understand the point of derivatives/integrals
my friend is a TA for calculus classes so I sit in the help room with him and i've seen this plenty
hm it wasn't really for me
i still suck at algebra
I feel like invertible functions are everywhere in math to the point that it makes sense to study them in that context
dude at my school i stg at least 90% of the students in calc class have barely a motivation for any of it
im a TA for the tutorials
engineering calc
The motivation for algebra is that itâs cute and fun /hj
SO TRUE
getting my cheeks clapped in algebra rn
missed one lecture and apparently they finished all of the isomorphisms theorems
That made me lol
which ones do you guys cover?
Im guessing groups
apparently there is 4, i dont know because i wasnt there đ
first course in algebra
us uni
so the curriculum is like
groups rings fields
ah yeah
first iso, second iso, third iso and correspondence theorem!
correspondence theorem my beloved
hopefully ill love it as much as you do
You wonât
probably not no
given that a huge part of the coherent conditions stuff relies on the correspondence theorem and third isomorphism theorem
good to know
I don't think I need help on this problem right now but I think there's a typo and I'm not certain what my professor meant
"Let y != <x>"
at first I thought he meant to assume y is not in the group generated by x, so I did (a) with that assumption. but isn't that contradictory to (b)?
nevermind.
It means that y ⏠G \ <x>
Which is not empty because G has order 8
np
Order 2 elements in S5
Partition will be
2+2+1
2+1+1+1
2+3
What should I do next?
"2+3" doesn't correspond to an element of order 2.
I got 25
Oh, you were being asked to count them? Yes, that sound right -- 15 of one kind, 10 of the other.
real
this lemma is basically one of the defining features of free modules
and informally explains why finitely generated modules are so nice in many ways; finitely generated free modules are often nice and those properties carry over
mooodssss
thank you :3
Quotients inherit some properties from the original module (ex:being Noetherian, Artinian)
when you want to prove something holds for all finitely generated modules, what you then usually do is prove it for free modules and show that, if it holds for a module, it holds for any quotient of it
e.g. properties which depend on the lattice structure of the the set of submodules
Yeah literally can't think of anything that isn't basically these two
generally, equations which hold
Oh right, that's very important
so for example if M is annihilated by some subset S â R then any quotient of M is
definitely not anything
f.e. every free module is flat but not every module
or projective
or, very silly, every free module is free but not every module is free :P
For a different example, In topology to show something is connected/compact it's enough to show that it is a continuous image of a connected/compact space
It more matters that itâs a quotient of a free module
Which is quite literally like the âmodule presentationâ of it analogous to a group presentation
Where the kernel represents the presentation
Arguably itâs a case of the former
concretely this means it's the set of all words of the generators together with rules that say when a sentence is equal to e.
it allows you to describe the structure of the module by how the generators relate just like a group presentation
Whoever decided to use the words group presentation and group representation needs to be retconned to be hit in the head with a dirt transfer shovel
but this is algebra so it's common to say things with homomoprhisms instead of concretely.
funnily enough this naming convention isn't even category theory-pilled
it's widely used in universal algebra (and universal algebraists and category theorists had slight beef lol)
A group representation is when you present a group again đ
I usually just say âgroup actionâ when a group maps into the automorphism group of something and call it a day
Based
Monoid action when a monoid maps into the Endomorphism monoid
lmao
The frantic edit of that message before someone vaporizes me
i had my keyboard ready to shoot
fear
Isnât there a theorem that says you can decompose a finite vector space rep into invariant subobjects or something like that
You can decompose it as a sum of reps
isnât that just like Jordan normal form
(Assuming characteristic of the underlying field doesnât divide the group)
yes
can you do that for actions by a finitely generated PID module
the main content is that you can do it simultaneously for all eles of the group
if the characteristic of k does not divide |G|, then k[G] is semisimple, so the k-reps can be decomposed as a direct sum of irreducible/simple ones
I had an autistic urge to see when taking the monoid ring functor for a monoid preserves Noetherianness
Like for N, N^2, etc by Hilbert basis
I wonder if applying that to F^2[M] actually gives criteria on M
Since the ideal lattice, and thus the principal ideal lattice, which you can pull back to the divisibility relation, would be Noetherian
Enough of that back to mind melting engineering work
what do u do
are u in school or are u working?
undergrad?
Yeah
Do you know the cycle dĂŠcomposition for a permutation
Lagrange theorem?
Then all option satisfied
It doesnât help
a nunber is the order of some element in Sn iff it is the lcm of a collection of positive numbers that add up to n
2+3
yes
Is there a version of Mackeyâs irreducibility criterion that applies to locally compact groups? The versions I seem to find online all pertain to finite groups https://dec41.user.srcf.net/h/II_L/representation_theory/12
For the particular case Iâm interested in G isnât compact, the induced representation is infinite dimensional, and Iâm inducing from a character
you should try in the #advanced-algebra channel
Okay will do thanks! Iâm guessing there isnât a dedicated channel for representation theory?
sort of but you need extra care with what "Ind" means and extra assumptions on W
especially in the noncompact case it's not actually obvious what "irreducible constituent" means for the kinds of induced representations which appear; representations need not decompose into direct sums of irreducible representations and you often run into representations with continuous spectra and need to work with direct integrals rather than direct sums
this paper proves a reasonably general version of Mackey's criterion for locally compact groups if you want to see what sorts of analytic difficulties are involved https://msp.org/pjm/1998/184-1/pjm-v184-n1-p06-p.pdf
The #advanced-algebra is the "real" algebra channel. This here channel was made to separate discussions at the level of first-second encounter with the topic.
I'm not sure how to approach this problem. should I be looking to construct an explicit even permutation that s_2 is the conjugate of s_1 by?
I think you should try to repeat the proof of what elements of Sn are conjugate
Or you can try to say that if they are conjugate in Sn by some g then g is actually in An
Under the conditions in (a)
hmm actually I think I'll sleep now and attempt this again tomorrow
Thanks! That's for systems of imprimitivity though, I don't see any theorems for irreducibility criteria there (a quick ctrl-F only shows two matches for irreducible at the end of the paper). Unless a system of imprimitivity implies irreducibility?
You can isolate the detail work in a lemma asking: Given some permutation sigma, when does there exist an odd tau such that tau¡sigma¡tau^-1 = sigma?
Once you have the answer to that (namely: ||exactly when sigma contains at least one even cycle or two cycles of the same odd length||) getting to the required statements about conjugacy classes can proceed at a higher level of abstraction.
fun little problem for anyone who enjoys a nice diagram chase. Found in a book of old qual exam problems; this is one of the easier ones
You don't even need to do any diagram chasing. But cute problem nonetheless
hm, can it be avoided? I chose an a in A_2 and did a bit of chasing. Or maybe there's a more specific technique called chasing that this isnt?
Like you don't have to think about elements at all is what I mean.
||beta1 is epi, so beta2=0, so beta3 is mono, so alpha1 is epi, so alpha2=0, so alpha3 is mono||
Maybe that still qualifies as chasing idk, but you never have to consider elements (or generalized elements, or pullbacks or nothing)
I feel like Iâd still count that as chasing, itâs just slightly smarter chasing
that is pretty much what I did yeah, only I guess you're using some general fact to get alpha1 being epi?
||beta3 is epi (as phi is) and mono (as proven), so is an iso, so we can invert it and alpha1 is composition of two epis (phi and beta3^-1)|| is how Iâd argue it
oh, I like that, very nice
kinda fun!
||phi is surjective so b3 is surjective. But b1 is surjective so ker b2 = B1, which means that b3 is an isomorphism. Therefore a1 is surjective, so same reasoning a3 is injective.||
this
yee
Hmm, I recall warnings that epi + mono don't necessarily imply iso in general, so this argument must be more specific to groups than it sounds like at first.
Yeah it doesnât in general, but for groups, mono and epi are equivalent to surjective and injective
(For epi this is fairly non-trivial, but for mono this is easy)
I wonder what algebraic theories have epi => surjective
Same proof works for this diagram in an abelian category too
Yeah, it just struck me that the problem statement said "injective" and "surjective", and switching to "mono" and "epi" when phrasing the argument could give the impression that the argument suddenly works in far wider generality than it does.
It works in any abelian category so I feel itâs at least somewhat justified
Yeah every abelian category is balanced, and this is typically where one talks about exact sequences
any two semisimple decompotions are equivalent, which is easy to state as perhaps a corollay of jordan-holder but what do i do for infite cases?
If S is a simple module, then Hom(S, M) is an End(S)-vector space.
So it just reduces to a dimension argument
End(S) is a division ring yeah
schur's lemma comes 2 sections later, prolly will learn about vector spaces over it then
You can avoid linear algebra as well if you like.
Just say M = Sum_i M_i = Sum_i N_i
with M_i and N_i sums of copies of some simple module S_i.
Then the identity on M can be thought of as a map between these sums. Since there are no maps from M_i to N_j for i different from j M_i must be a subset of N_i. Then similarly interchanging M_i and N_i they must be equal.
right yeah, the fact that the blocks can be different is not a problem since there are no non-trivial maps between them
is there a generalization of the "divisibility <=> roots" from polynomial rings for general rings?
like a polynomial having a factor of (x - 2) means 2 is a root
can this somehow be reintetpreted to hold for other rings?
probably using ideals, i imagine?
this is kind of a starting point for algebraic geometry i think
yeah that's what im thinking, prime ideals or somethingn
mhm
in this case, the map $R \to R / I$ for $I$ an ideal can be viewed as a generalised kind of "evaluation"
Pseudo (Cat theory #1 Fan)
if you use the ideal generated by $(x - 2)$ in a polynomial ring, you recover the factor/remainder theorem
Pseudo (Cat theory #1 Fan)
ah i see now
(also fyi i am very new to AG so take anything i say with a grain of salt, and feel free to leave if i start talking nonsense)
so for example
f = 28 from Z and an ideal (7)
on one hand 7 divides 28
on the other hand evaluating 28 at the ideal (7) through Z -> Z_7 yields 0
yeah 
a big part of AG is trying to view elements of a ring as functions on some space
lots of rings, like polynomial rings, arise this way
that makes much more sense now than a few years ago
a few years ago?
i remember watching some alg geo vids and stuff and was so confused when they mentioned using ring elements as functions
iirc i was new to abstract algebra back then
i see i see
from what i understand, a lot of classical AG is about studying solutions to polynomial equations
and what's interesting about polynomials (at least to me) is that you can interpret them in any ring, provided you know how to interpret the coefficients
like the equation "x^2 + y^2 = 1" makes sense in any ring, so every ring has its own version of the circle
indeed, though for alg geo they typically work over algebraically closed fields, so that all polynomial systems have solutions sets
yeah that part i still don't really get
but the circle thing is cool to me
and i guess one of the hopes of AG is that solutions of the same equation across different rings "interact" in a nice way
well, a polynomial like x^2 + 1 has no roots over R
oh that you can plug elements of any ring into such polynomial equations?
so that knowing solutions in one ring gives you info about solutions in another ring
yeah!
i see
given any ring $R$, you could define $S^1_R = {(a, b) \in R^2 \mid a^2 + b^2 = 1}$
Pseudo (Cat theory #1 Fan)
this is what i mean by "every ring has its own version of the circle"
(in fact, since the circle is an algebraic group, meaning the group operation can be expressed with polynomials, S^1_R is always a group)
thats cool
when R is the real numbers, you can interpret this geometrically as an actual circle
when R is the rationals, this gives you info about pythagorean triples
also technically every group would have its own "taxicab circle" since thatd be x + y = 1
you want 1 to be a multiplicative identity, though
even something like looking at diophantine equations modulo n is an instance of this
you interpret the polynomial equation in the ring Z / n Z
and use information about the solutions in that ring to help you determine solutions in the ring Z
this is also a very cool instance of this concept
where solutions over C interact with solutions over Q in a nice way
from what i can tell, the fact that the same polynomial can be interpreted in multiple rings is pretty core to classical AG
makes sense, ik you often end up working with a ring R and then also with its polynomial ring
or the underlying ring
then ig modern AG is trying to extend this to non-polynomial rings and allowing geometric intuition to happen
and a big part of that seems to be "localization"
ah yes that
still dont understand it that well
but ik its a kind of "zooming in" in some cases
Mfw non commutative alg geo
localization tends to be a little unintuitive because when you localize the ring in general gets larger
but if you think in terms of ideals the ring gets "smaller" which is whats important
and the intuition from functions
i have some intuition for it if you'd like to hear
sure thatd be nice
what is this intuition?
so the way i think of localization geometrically is as an identification of functions
if you zoom into some local region, then two functions might appear to behave the same, even if they don't globally
consider the ring of functions on the real number line (under pointwise multiplication). Then define the ring of "germs of functions" at 0, which functions defined on an open neighborhood of 0 but we say two functions are equivalent of they agree on some smaller open set
you're identifying things that have the same local behaviour, essentially
you can check that this ring of germs is indeed a ring
importantly, notice that the functions with f(0)=0 form an ideal
and if f is not in this ideal (a function does not vanish at 0) then 1/f must be defined on a neighborhood of 0
by continuity
thus f is invertible in this ring
so the ring of germs is a local ring with a single maximal ideal of functions vanishing at that point
in algebraic geometry its the same idea
prime ideals <-> points
elements of R <-> functions on the prime ideals
elements of a prime ideal p <-> functions vanishing at p
This is actually very nice
if you localize at a prime p, you are inverting all elements not in p, which is basically inverting every function that doesn't vanish at p
then in the local ring, the prime p is maximal and everything not in p is a unit
Thanks
both of those intuitions are quite nice tbh
this association is easier to understand if you've been through varieties or if you've seen gelfand duality in functional analysis
Im struggling to parse this, what is the ring of germs defined to be?
the elements are pairs (f,U) where U is an open set containing 0 and f is a function from U to (say) the reals
I do know the intuition youâre building, I remeber my UG advisor talking about this at some point but Iâm not following the specifics
but we put an equivalence relations where (f,U) ~ (g,V) if there is some open subset W contained in the intersection of U and V such that f|_W = g|_W
its a fairly natural object to think about when talking about differentability for example, since the derivative can be defined on an arbitrarily small open set and if two functions restrict to be the same on a small open set they have the same derivative at that point
Ah I see that makes sense
Iâve always wondered what geometers were talking about with germs
evidently you use germs to define the tangent space of manifolds, and modeled on that you can actually define the tangent space of objects in algebraic geometry as well
thats cool cuz im taking diff geo this term
most differential geometry sources won't actually use germs since they'll kinda cheat
basically to define the tangent space at a point of a manifold, you want a vector space of "possible directions" at that point
and the way you do that is by looking at the vector space of "directional derivative operators"
if you denote by $C_p^\infty$ the ring of smooth germs at a point $p$ (whatever smooth means, you'll learn it)
Blake
then a directional derivative operator is a linear map $d:C_p^\infty\to\mathbb{R}$ such $d(fg)=d(f)g(p)+f(p)d(g)$
Blake
Oh yeah my alggeo course did actually do that, just implicitly I suppose
so for example in R^n you have the partial derivative operators $\partial_i|_p$ defined by $(\partial_i|_p)f := (\partial_i f)(p)$
Blake
Compile Error! Click the
reaction for more information.
(You may edit your message to recompile.)
the way that most differential geometry courses cheat is that they ignore germs and instead define a derivative on the space $C^\infty(M)$ of smooth functions on the entire manifold
Blake
My alggeo course tried to minimise the amount of topology in it to a ridiculous level that just made everything harder and worse for some reason I still donât understand
b/c on a manifold any germ can be extended to the entire manifold if you muck around with topology a bit
in some way
Theyâre trying to infect the rest of maths
Those filthy agriculturalists
It is the area of topology I have a bit of a blind spot for though, like I should really learn about sheaves at some point, I had a hard time with Wibel because I didnât know about them
sheaves are a cool idea imo
I very barely missed out on a sheaf theory course at my UG which kinda sucked, that wouldâve been a very interesting and useful class
theyre starting to feel like the "true" geometric objects to me
lol
in what way
From a very good topologist who doesnât believe in exams no less (my dream course)
well sheaves are in essence "thickenings" of a topological space

which makes it "more geometric", like idk
i don't understand what this even means
you add geometry through a sheaf of functions p much
since for example real manifolds, complex manifolds, complex analytic varieties, algebraic varieties etc are all just topological spaces with certain sheaves of functions
and u can do other random things like look at piecewise linear manifolds
@.@
the prime motivation for this viewpoint are of course schemes and manifolds for me
things didn't really click to me till I saw both the alg geo variety and manifold perspective on sheaves
anyone have suggestions for books to read that follows closely to my lecturer's progression of topics. (US Univ, first course in algebra)
all the books ive looked into looks very different, and im looking for a book because he posts lecture notes so late...
things didnt click for me with schemes until i went through the motions of seeing how nice regular functions on affine varieties were
could you explain a little more?
well the Zariski topology does not give much rigidity to the points in the spectrum, i.e. doesnt carry much geometric information, because there are so little closed sets in contrast to, say the topology on the real line
this means for example that theres only a contravariant functor to Top, rather than a duality with a subcategory of it
Iâm on a train with shit service so I canât open these, but going from set theory to category theory in 4 lectures seems quick
If I had to guess Iâd say look at Aluffis chapter 0, thats a book which does category theory from the start so itâs possibly similar
if you add the structure sheaves onto the spectra, though, that for example carries enough additional information (which is also geometric in some sense, as they are to be interpreted as continuous functions with some local "niceness" property, e.g. looking locally like a quotient of polynomials in the case of classical AG) to make a duality appear
The section seems more about homomorphisms and kernels and so on, as opposed to defining what a category is.
If Iâm understanding you correctly, are you saying something like âgeometry is when spaces with local structure/dataâ?
Interesting
some data or information that links points together in any way
And that is what a sheaf is meant to capture..
exactly :3 that is what i am realizing
Ok I understand this
And that even makes sense for manifolds
If I interpret local structure as a local diffeo to R^n
yis, that is what the sheaf definition of a manifold captures
Ah fair, that seems much more standard
Which isnât exactly sheafy but still geometric
The sheaf def is more about the algebra of smooth functions right
Mhm
To be clear I still prefer the standard def
But I have a bit more appreciation for the algebra def
yea, one other thing is that he focuses a lot on using a word problem to represent a group, which i couldnt find in some of these books ive looked into
that makes sense, stuff like local coordinates seem easier to intuit
the sheaf definition of a manifold is more helpful for understanding sheaves than it is for understanding manifolds
hahaha
Iâm not sure what you mean by that, do you just mean that you often use the generators and relations way to define a group? That is pretty standard
Iâm almost home Iâll check your notes when Iâm back and see if I can be of more help lol
yea, but for some reason i just couldnt find it in the books prescribed in the syllabus (Artin and hungerford)
i might just be looking for it in the wrong place
thanks 
Ok Iâve had a look over it and my possibly unhelpful advice is to just not worry about it too much. You should definitely try to understand the section on the word problem and stuff because itâs not super important
I think most books when they introduce group presentations will present the same material, but those lecture notes are the most in depth and explicit Iâve ever seen, in practice people are usually a lot more fast and loose with the technicalities of formal symbols and words etc
Silly question but here is minimal taken to be the minimal defined in a set theoretic context
Aka if p_j is minimal there is no p_i with p_i \subset p_j
yea
mmm, ic. ive more or less understood word problems(i think at least). yea this prof makes damn good lecture notes
the problem is that he upload them quite slow
so we are currently missing 3 lecture notes
and since i missed a lecture a while ago
i can no longer understand what the hell they are talkijg about anymore
im just worried of falling too far behind
Unless there also is a pretty good description of what's going on in class I'm not sure having a book will help catch up necessarily.
You can try to ask the lecturer where in the book the relevant material is or you can try to see if you have some dilligent colleagues who will share their notes from the relevant classes.
Either way asking the lecturer what the best way for you to catch up is a good idea
the past few lectures have been about the isomorphism theorems, orbit stabilizer theorem
and the rest i did not catch
yea that sounds smart
These sound like subjects you should be able to find in any algebra book
im worried about the order that its presented in, cuz the lecture order and the order that it is introduced in the books are different
is it normal to skip chapters while reading?
for example in one book groups is one of the last topics presented
while it is first topic in the course
I don't think it's a cause of worry for a prof to skip around a textbook
Most textbooks aren't meant to be read as novels anyway (as in, cover to cover in order)
Yeah totally normal.
People learn / lecturer teach in whatever order they prefer and might not use everything a book has to offer
ic
im just pretty used to going in order of the table of contents
Some books have these fun diagrams of which chapters use theory from which other chapters to tell what not to skip
those are so good
they look pretty too
đĽ đĽ
ic
ill try to find these diagrams
thanks yall
Not every book has fancy diagram, but they should hopefully have some text about the intended reader / how to follow the book at the start
these chapter names...... they really shoulda gone into comedy
how do you even read that one
each time i remove a block i think the whole thing falls over
prerequisites support the chapters above
maybe i suck at jenga
What if your dependency graph isnât planar
write two volumes
ohhh i see it now
alternatively you dont even have to add a dependency graph
and just leave it up to the lecturer/learner to struggle to find it themselves
Me making a dependency graph that needs 6 volumes for 30 chapters
did classification of finite simple groups have any dependencies within it
I don't think anyone has ever actually seen the classification
it is lost in the tombs of the vatican đ
ah yeah just the usual coffee table book
I wouldnât be surprised either way tbh
Like I could see someone being crazy enough to print out the tens of thousands of pages of papers
But equally I could see no one being that crazy about CFSG
I don't even recognize most of these groups
It isnât unreasonable to spend a couple hundred pages defining them all if youâre aiming at a strong undergrad, and youâre not just beelining from one to the next
I recognize cyclic, alienating, Tits, Mathieu, monster and baby monster.
Would have to look up which of lie type is which and I don't know the other sporadics
I recognise all of the sporadics and most of the lie types
Get a load of this guy
that's not a good thing
Iâm aware, that much group theory is bad for the soul
how often do you use the sporadics?
they appear quite often in my area
oh damn
like, Aut(M22) = M22 : 2 was used in a counter example to a conjecture recently
M22 or M24 I forget which
it was M22 I'm not a fraud
what was the conjecture?
now if I tell you this I will dox myself but I'll do it anyway
it was about certain representations being subreps of the regular representation
oh okay i did understand that
it was quite silly in the end - it was a disproof by the pidgeonhole principle
there were simply MORE of the certain reps than there were subreps of the regular
which is absolutely digusting and it's not a surprise you need something as disgusting as Aut(M22) to do it
does M22 show up naturally anywhere
M23 and M24 appear here https://en.wikipedia.org/wiki/Binary_Golay_code
which was used as part of the data compression for the transmission protocol in the Voyager space craft
will note, thanks đ
not data compression sorry, the error checking
fuck it says that fun fact on the wikipedia page now I look like a HACK
How do you even find that? GAP go burr?
yeah
although the sporadics are usually a good place to check for "weird shit"
so probably not too much burr
Yeah same thing as the unit conjecture then I guess
is that mf still open
Narrow it down to one of two families of groups and just abuse a computer
Nope, counter example in 21
also pigeonhole counterexample?
The zero divisor and idempotent conjectures are still open though, the zero divisor conjecture in particular seems quite interesting
No just an explicit counter example found by GAP
nah the Kaplansky conjectures are actually like, complicated
is GAP like macaulay2 for group theory
since you know about the regular rep you'll understand the statement of them https://en.wikipedia.org/wiki/Kaplansky's_conjectures
oh interesting
Why do you need to know about representations to understand them? Just because of group rings?
yeah
Shameless plug if youâre interested in them
I believe my name is on that just be nice and donât dox me
although this is still super surprising to me personally. Like taking group rings is an adjoint to the forgetful functor and taking groups of units is the other adjoint. Can we just fuckin get a grip it can't be that hard.
I only ask because I know piss all representation theory lol
these statements look really innocent in nature lol
The zero divisor conjecture is particularly interesting because itâs like wrapped up in a web of other conjectures lol
representation theory will tell you about the indecomposable and simple ideals but nothing about the elements directly like the conjectures ask
Like itâs very strongly related to the Atiyah conjecture
Apparently Iâve started recognising names at least in my little corner of maths
Save me
you are beyond salvation
Does Gardham work on GGT stuff?
Heâs someone that was recommended to me to look at for PhDs yeah
But heâs not taking any this year đ˘
Sad times, is he still at Bonn?
Yes
You donât want to go there anyway (they rejected me)
i wont trust me đ đ
the only group ring i care about is the hopf algebra of algebraic groups/group schemes amen đ
anyway still plenty of rep theory in them i mean the comorphisms come from the regular representations
For context that was a 5 page report I had to write for my topics in ring and rep course on non com rings, so it could be more detailed but I was working to some strict length limits and under the assumption that everyone in the class had to understand it
last thursday or something i spent a long long time computing stuff about SL(3, C) lol
just to see where it all came from
the only group I'm scheming with is my lawyer adviced me I do not finish this joke
computing all the root systems and weight spaces and nonsense
SL(3, C) is the degree uhhhhhh
3? symmetric polynomials?
how does ts mf work again
i thought SL(3, C) was just the special linear group of GL(3, C)
I mean the associated lie algebra
3x3 traceless matrices
yeah
ok what do I actually mean
there's some way you can get the reps of sl(n, C) out of looking at the action of the symmetric polynomials of degree something in some number of variables
no clue
you should start doing tame congruence theory
do you have these ready or do you make them on the fly
AAAAAH AAAAAAH
make them on the fly
get that UGLY thing from the bottom away from me
My favorite field is the one with cardinality Beth omega 1
amazing
who tf is beth
Who knows bruh
comes from hebrew apparently
When Latin fails you reach for Greek, when Greek fails Japanese, Cyrillic and Hebrew start fighting it out.
I have never seen cyrillic and japanese in math
You need to start getting more esoteric in your interests
i recall seeing the hiragana "na" somewhere
yo for yoneda embedding I've seen
oh yeah yo sorry not na
ă
chinese is such an untapped resource... thousands of characters... no more overlaps in notation
Learning pinyin to maximise the horrific state of your notation
I cannot wait to show there is an isomorphism between ć° and ĺŚ
How long until we get Aramaic in maths
gonna write my complaint to ea-nasir and put it on arxiv
Then there's this
https://en.m.wikipedia.org/wiki/Dirac_comb
Cursed
yeah whatever
Well cyrillic you wouldn't see much since a lot of its letters look like latin or greek ones already
Flashbacks to doing a physics degree, make it stop
good
I believe that's not a group ring except for diagonalisable algebraic groups...
Do you mean Schur--Weyl duality?
i likely misunderstood then definition then
How would you prove that the first bullet point implies the second
you could prove that the first one is equivalent to normality of N, and then do the same thing for the second
Hint: ||Note that (gh)N = g(hN). What do you know about hN?||
Hello, this might be a elementary question but I encountered while studying cosets. So, what does it mean for a operation to be well-defined? I know it means for different representative of the inputs it must have the same output but
Like, take (uK)(vK)=(uv)K
if i take u_1 K = uk and v_1 K = vK
isnt (uv)K=(uK)(vK)=(u_1K)(v_1 K) = (u_1 v_1)K
this seems perfectly valid as well? am i missing somthing?
a map is said to be well-defined if a = b implies that f(a) = f(b)
it is a very subtle mistake that can be made while constructing homomorphisms
for instance I could erroniously claim that Z/2Z surjects onto Z/3Z, by sending 1 to 1.
Indeed if you checked for yourself that this function does satisfy the group homomorphism property; but the mistake was made in assuming that this was a function to begin with
so if my operation is a function then what i just wrote is fine yeah?
no, well-definedness is exactly a problem that arises with functions
you have to make sure what you have is a function to begin with
and that's what well-definedness is concerned with
but to verify its a function you have to verify its well defined, so it seems circular
no, well-definedness is how you verify it is a function, there is no circularity here
well what you initally define is a relation
usually you can just handwave the fact that it is indeed a function but with cosets it requires that you verify
is the hypothesis of locality a direct consequence of semisimplicity(the maps being either unit or nilpotent(which forms the unique max ideal i suppose))
does the locality imply semisimplicity at least for finite length
If so thatâs a connection I was unaware of. Iâll go and find what Iâm thinking of at some point today
For finite length modules, having local endomorphism ring is equivalent to being indecomposable.
You seem to maybe be mixing something in your first sentence, or maybe I just dont understand what youre saying. But if M is semisimple, then each simple summand will have local endomorphism ring, since division rings are local.
Endomorphisms of semisimple modules arent either nilpotent or unit. Maybe youre thinking of Fittings lemma for indecomposable finite length modules?
Unless you know that more about K (namely that it is normal), it is not automatically true that (uv)K and (u1v1)K are the same coset.
For example, working in S3 -- I hope you know permutation notation! -- we could take K={e,(2 3)}. Then (1 2)K = (1 2 3)K = {(1 2), (1 2 3)}.
But if we take u=v=(1 2) and u1=v1=(1 2 3), we get uv = e but u1v1 = (1 3 2), and those do not have the same coset.
isnt (uv)K=(uK)(vK)=(u_1K)(v_1 K) = (u_1 v_1)K
The middle equals sign assumes that you already know that (uK)(vK) is an operation on cosets whose results only depends on what they are as sets. And that's what you're trying to argue for in the first place.
This is potentially confusing, because there is actually a multiplication operation on subsets of the group that only depends on the sets, namely AB = { ab | a in A, b in B}. However, if that is the operation you're thinking of, then
(uK)(vK)=(uv)K
stops being a definition of anything, but is just a claim about already-defined concepts which might turn out to be false. It happens to be true if K is a normal subgroup, but that is not obvious and needs an actual proof.
"verify it is well-defined" is a conventional but somewhat misleading phrasing. There's no such thing as "a function that is not well-defined". What you should actually think of is "verify that such-and-such proposed definition manages to define a function at all". It's a property of the definition rather than a property of the function (since there is no function until the definition works).
i copied this as part of my notes in a lecture, can i check what it means to embed something into an S-module?
I thought maybe it just meant that something can be made into an S-module but that wouldnt make sense since i can just make S-action trivially so what is it trying to tell me here
What does N mean here? Some arbitrary R-module?
${}_RN$
Vibe word, technical meaning very context-dependent.
somethingwrong
a left R-module
I appreciate your explanation. 
"We can interpret the above theorem as ker j being the largest obstruction such that N can be
embedded into an S-module." I also copied this down but i dont know if it helps
Huh, I would have read the subscript R as attaching to the tensor-product symbol rather than to N. I may be out of my depth here, sorry.
oh no dont worry about it, but for my course, we would usually write something like $M_R$ and ${}_RN$ to mean that $M$ is a right $R$-module and $N$ is a left $R$-module, then write $M\otimes_R N$ to mean the tensor product of $M$ and $N$ over $R$ so the $R$ is indeed attached to the tensor product
somethingwrong
"A embeds into B" means "A is isomorphic to a subthing of B", or equivalently, "there is an injective homomorphism from A to B".
This ought to work the same for groups, rings, S-modules, etc.
Any S-module is also an R-module through phi.
So embedding into an S-module means that it's (isomorphic to) an R-submodule of an S-module.
Really a stronger statement is true, that if M is any S-module, then for any R-linear map
N -> M
there is a unique S-linear map S(x)N -> M that it factors through (using j)
Yeah Iâm pretty sure I made a mistake in my application because my rejection was worded very strangely and my friend who did practically the same as me in the degree is now studying there lol
Oopsies
Iâm not too fussed but I do mourn all of the kĂślsch I couldâve been drinking
Nah just Bonn outside of the UK, I looked at Essen but it was in German and my German is not that great lol
No Iâm aware lol, it cost me quite a lot of money fucking up the application, Bonn would be free and itâs a pretty cheap place to live
But so it goes, Iâm at a really good uni in the UK now anyway, only behind oxbridge for maths and pretty much on par with imperial (but without London living costs) so itâs all good
I was going to apply to EPFL but I just couldnât justify the cost or risk speaking French
Oh shit yeah youâre Swiss arenât you? A lot of German unis will charge you too right
Yeah TUM is a no go if you have to pay tuition lol, on top of the cost of Munich
Is it all UEZ countries that get it free not just EU?
Brexit continues to ruin my life
EPFL would be great, amazing uni and probably the most beautiful campus in the world
No but just from all the pictures and stuff I saw when I was thinking about applying
Brother itâs on lake Geneva
Though I did go on a date with a girl from Lausanne and the only positive thing she had to say about the place was thereâs good illegal raves lol
A few rows of buildings is whatever, I go to uni in the West Midlands đĽ
yea looks good same arguments work for descending chains any descending chain in a submodule K is a descending chain in M and any descending chain in M/K corresponds (via the correspondence theorem) to a descending chain of submodules of M containing K If M is Artinian those chains stabilize, so K and M/K are Artinian
yea vector space over F is precisely an F module where F is a field more generally an R module is like a vector space but over a ring R instead of a field When R = F is a field every nonzero scalar is invertible which gives lot more structure
this invertibility has powerful structure every vector space has a basis,any linearly independent set can be extended to a basis,dimension is well defined (all bases have the same cardinality), and every subspace has a complement
genuinely what do you think đ
yes, we call it that because conventially we call modules over a field vector spaces
so its just to accentuate the fact that F is a field and we have a vectorspace
type shiii
nice
yes
Pedantic note: I wouldnât use the notation K/N unless K contains N
though it does make sense as the image of K under the natural projection
(K + N)/N
or Ď(K) where Ď: M â M/N
K + N is the minimal module containing K and N
Itâs also the elementwise sum of K and N
Yeah


Correct
off topic, but i love your pfp
thanks!
you're welcome
this is the perfect joke
dude ikr
It would be if it consisted of 6 messages.
Am I right that if G can be given as a left conjugation of K then K can be given as a right conjugation of G
It feels obvious but im worried
if G and K are subgroups of some larger group and G = x K x^-1, then K = x^-1 G x
is this what you mean?
Yes
Im like 99% sure it is but maybe im not thinking about it hard enough
right, sorry i brought up semisimplicity for no reason at all.
What the hell is a left regular representation
They use the word afford but idk what it means
this is such a silly detail to get stuck on
Am I just supposed to know whether or not the word has a formal definition in the context of group theory before knowing the definition
bro, this field doesnt make any sense to me
im getting fried in my first algebra course
But im lowk addicted to this feeling of being stupid, then figuring it out

one more sully and i might just get it
anyways what are you still confused about
nothing i just read a little more
excellent
apparently affords just associates a homomorphism into the relevant symmetric group with the considered action
but it was defined in a previous chapter i skimmed over hence my confusion
affords is not a formal definition lol
Are the elements of a tensor product of matrix groups Kronecker products of the elements of the multiplicands?
but yes left regular/right regular representations are defined in various contexts by the left/right multiplcation action of a group on itself
i see
so the left regular representation is a map from G into its symmetric group that maps g to its left multiplication action
at least thats what im understanding
Just a (somewhat archaic) way to state that such-and-such representation exists.
note sense 2
Affording representations? In this economy?
it be like that
Gotcha
Seems like induces is an alternate and in my opinion more understandable word to use for that
So ill just say that I guess
this is a portion of the proof i copied to show that 1 implies 2
Let $Y' \subseteq Y$ with $Y = Y' \oplus \alpha(X)$. For $z \in Z$, there exist $y \in Y$ such that $\beta(y)=z$ since $\beta$ is surjective. Write $y=a+b$ with $a \in Y'$, $b \in \alpha(X)$, and define $\gamma:Z \to Y$ by $\gamma(z)=a$. This is well-defined since if $\beta(y)=z=\beta(y')$ with $y'=a'+b'$, then $0=\beta(y-y')$ so $y-y' \in \alpha(X)$. Since $y-y'=(a-a')+(b-b')$ and the decomposition is unique, we get $a=a'$
somethingwrong
actually, we don't really need to show well-defineness right? we can just make a choice of any y since we are just trying to define the function gamma
whats a "positive Energy representation of the Lorentzgroup" i know what a grouprep is its just about the energy part
I have a very silly question
Let's say I have a ring R and I consider the opposite ring R^op. I'll denote the multiplication in the opposite ring by â˘
Is the right way to define a ring homomorphism Ď: R^op --> S as Ď(r ⢠s) = Ď(s)Ď(r) or Ď(r ⢠s) = Ď(r)Ď(s)?
is there a good, elementary, non-casework based way to communicate (convicingly, but perhaps imprecisely if needed) that the finite subgroups of SO(3) must be the platonic solids? i mean maybe you can start by considering the orbit of some point on the sphere and take its convex hull and maybe conclude regularity of that polyhedron (or polygon)
but that seems kind of frustrating to communicate that sort of object, and even then its not very easy to convince someone that this group action must preserve the right properties
A ring homomorphism should preserve the order of multiplication, so you'd want
phi(r * s) = phi(r) phi(s).
Otherwise what you would have would be a homomorphism R -> S
i guess with that explanation i either just handwave at this convex hull and try to let the person believe its true, or go a little longer than i'd like if i am to be rigorous. so i'm trying to find a middle ground
and i just dont know the easy way to see it
Ok perfect, thanks!
Well, it's not quite true, because there are also finite subgroups isomorphic to the dihedral groups.
(Or alternatively, you need to work with an extended sense of "Platronic solid").
yes i do mean the extended sense
or not "the". an extended sense which includes those
I mean, I think this falls under case-work, but is somewhat similar to what you're describing.
https://staff.fnwi.uva.nl/r.r.j.bocklandt/notes/kleinian.pdf
The key idea is that each rotation is about some axis, and you can think about the orbits of axes by the action of G.
I think the intersection elementary and non-casework would be impossible. But I'm quite interested if there is a more abstract solution without (or at least hiding) the case work.
this is sort of the argument i was trying to avoid đ
Like if one could prove the McKay correspondence without classifying the subgroups first, then one could defer to the classification of semisimple lie algebras (or root systems or rep finite quivers or what have you)
i feel like there is some way in which you take the convex hull of the orbit of an element, and pretty easily convince (sweeping details under the rug) someone the required facts about the meeting of edges â you wouldn't like, prove the nature of the platonic solids, but if you already knew the precise solids which met the criteria, you'd be done
i think that sort of exposition still requires some weird argumentation though. like its not very obvious how the group acts on an edge
The trouble is if you just take a random vector, then the convex hull of its orbit won't be a Platonic solid.
That requires you to have randomly chosen either vertex or a face midpoint (in which case you get the dual polyhedron instead, of course).
You probably want to start with a vector that is the axis of one of the rotations
Some care must be taken for the dihedral and cyclic group, but otherwise I think that should give the right figure
Yeah, and in order to avoid picking an edge midpoint, choose a vector that's fixed by a group element of maximal order.
But how to prove that this works without first establishing what all the groups are though...
i suppose those can just be argued separately
yeah idk
my hope was that there'd be a slick way to do it
Hmm, if you do pick the axis of an element of maximal order and are okay with treating dihedral and cyclic groups specially, the polyhedron you get is a tetrahedron, octahedron, or icosahedron -- in each case with faces that are equilateral triangles distinguished only by how many meet at each corner. There seems to be some hope that you can treat those three cases in parallel much of the way.
So take an element of maximal order and pick the unit vector for its axis of rotation (with some orientation).
If all rotations fix this axis you're dohedral or cyclic. Otherwise you will get a meaningful convex hull.
It will obviously have vertex transitivity.
Then something something, the edges connected to the original vertex are cycle around by the original permutation you started with. (Maybe something about the closest vertecies giving edges and something using maximal order).
This should then give both edge transitivity and face transitivity.
Itâs a combinatorics problem, thereâs 100 cases and much suffering guaranteed
So let the original point be v and let w be the closets point in the orbit. Let g be the element of maximal order, then the claim is that the edges incident to v are exactly
(v, g^i w).
Say there is a u with (v, u) an edge. Since the distance between w and u must be at least the distance between v and w I feel like one should be able to argue this is impossible, using convexity of the sphere or whatever.
Just give it to an undergrad to boost their CV
So then G would need to be a subgroup of the symmetry group of a platonic solid, and then I guess you have to check the subgroups manually
It's not that bad. We know the correct conclusion is that there are at two infinite families and three sporadic cases (and at best the three sporadic cases can be considered a nice finite family). All we need is to find an argument that reflects that structure.
Iirc thereâs a nice way to do this with ADE diagrams that one of the lectures at my summer research briefly talked about
There's a nice bijection with ADE diagrams given by the McKay correspondence, but I'm not sure you can use this to classify the subgroups
If you can I'm very interested, but all the proofs I've seen are essentially: take the finite subgroups, compute their (reduced) McKay graphs, OMG it's the ADE diagrams!!!
Illusion!
Yeah, took a break for a while
this is meant to be extremely elementary lol
Get down my screentime you know
so ADE diagrams would unfortunately not cut it (and in particular i think using McKay is like invoking magic)
Yeah, I'm not sure what would be a good connection there anyway.
Like if you let G act on the polynomial ring S = C[x, y], then a connection is that the skew group algebra S#G is equal to the preprojective algebra of the corresponding diagram.
think i'd probably just forgo this whole thing lol. it was intended to be the last section of an expository thing on group actions and i was hoping for a fun little punchline to bring in the platonic solids. so i was hoping for some argument where i didn't need to be that careful
Are you unhappy with an argument like this though?
explaining group actions throgh noncommutative crepant resolutions
Matrix factorisations.
I think it works, like u would need to ly between w and gw say, and then if a triangle has two long legs it's height will be more than if it had shorter legs...
oh, didnt see that â thats a nice argument actually. my issue is that the audience is one ostensibly new to group theory (although bright students). so im literally defining and talking about groups through toy examples, and every additional thing i need to define about groups is taking away from the point of the lecture which should be to motivate them
i will have to think about it. i dont want to bloat the talk with definitions
Well, if your giving a talk I think it's fine to not present a very rigorous proof.
Just the fact that these are the finite subgroups of SO(3) is already interesting in it's own right
Not sure you need to go into a detailed proof of it
what is the connection? i know you get some categorical equivalences bewteen MCM modules and matrix factorizations, and these kleinian singularities should have finite CM type
No I mostly just said that as a joke because of being in the same rough domain ig
But I unfortunately do not actually know anything about matrix factorisations lol just it is kind of adjacent to stuff I like
yeah fair. i think i can probably find a middle group on what to handwave
thank you for the help :)
You know more than me lol
theyre kewl
Says u
McKay is a very neat collection of results
McKay when Mackey shows up
the relation with minimal model conformal field theories is especially fun
mukai + mckay :3
Now is there a positive characteristic variant
i think so? probably canât have characteristic 2,3,5 but thereâs some statement
As long as the characteristic is relatively prime to the order of the group I think most things go through
I was thinking more the McKay graph equals the Gabrial quiver of skew group equals Ausland--Reiten quiver of MCM modules part, not so much whatever specific classification you get
in general
unless im confused
but i think the AR quiver of the MCM category is just a completley different thing
Like if G is a finite subgroups of SL(2, C) and R = C[[x, y]]^G, then the AR-quiver of MCM R-modules is equal to the McKay quiver of G
This is part of the McKay correspondence
And I think more broadly if G is a finite subgroup of GL(n, C) (without pseudoreflections), then the same should be true if you restrict to MCM modules that appear as summands of the power series ring (viewed as an R-module)
So looking in Yoshino this R is equal to k[x, y]/(y^2 + x^n) which is not the Kleinian singularity
k[x, y, z]/(x^2 + y^n+1 + z^2)
I guess there is some 1D version that is also indexed by Dynkin diagrams...
But chapter 10 is what I'm talking about
oh i see
:D
i had only seen the 1d MCM AR-quivers before
there was a paper by iyama and some others which had them
In this article we study Cohen-Macaulay modules over one-dimensional hypersurface singularities and the relationship with the representation theory of associative algebras using methods of cluster tilting theory. We give a criterion for existence of cluster tilting objects and their complete description by homological methods, using higher almos...
Hmm, so then I'm wondering
How do these guys get their associated Dynkin diagrams
If it's not from the AR quiver...
Seems like it might be alggeo magic...
i forgot how this happens lol
i think it is just the same thing, k[[x,y]]/(f) given by finite subgroup of SL(2,k) action
Does anyone have an intuitive way to understand the tensor product of two group representations?
rho_{U (x) V}(g) is the kronecker product of rho_U(g) and rho_V(g)
Iâm guessing they mean more heuristically than just, tensor the matrices
I don't really know what this means
As in, how to interpret it
I mean, if you want a representation structure on the tensor product then I think
g( u(x)v ) = gu (x) gv
should feel pretty natural.
It's what you get from just multiplying characters.
It's adjoint to Hom_k(V, -), whose action should make sense because it has G-linear maps as invariants.
Could you specify this adjunction more explicitly please?
The action of g on f in Hom_k(V, W)
is the map taking v to
g ( f ( g^-1 v )))
And then it's the usual adjunction
Hom_G(U, Hom_k(V, W)) = Hom_G(U (x) V, W)
taking f to
u(x)v |-> f(u)(v)
fundamental definition of a function f: A \to B requires that for every element a \in A there corresponds a \textbf{unique} element f(a) \in B
proposed construction of the function \gamma: Z \to Y violates this principle until well-definedness is proven right ? procedure is as follows:
For a given z \in Z, select an element y from the preimage set \beta^{-1}({z})
Define \gamma(z) based on this choice of y
source of the problem is that the homomorphism \beta is surjective but not necessarily injectiv this means the preimage set \beta^{-1}({z}) is non-empty but is not guaranteed to be a singleton If there exist distinct elements y_1, y_2 \in \beta^{-1}({z}), the definition is ambiguous ig If the procedure yields a different result for y_1 than for y_2 then the input z would map to multiple outputs and \gamma would fail to be a function.
consider the collection of paths I -> X under path-homotopy equivalence (so two paths are path-homotopic if there is a homotopy between them such that the endpoints are constant).
this consists of the following data:
- an associative partial binary operation X^I x X^I -> X^I, where two paths f,g are composable if f(1) = g(0),
- each path f has a left and right identity (a kind of relative identity?),
- each path f has an inverse with respect to f's relative identities
are there any structures like this?
fundamental groupoid
In algebraic topology, the fundamental groupoid is a certain topological invariant of a topological space. It can be viewed as an extension of the more widely-known fundamental group; as such, it captures information about the homotopy type of a topological space. In terms of category theory, the fundamental groupoid is a certain functor from th...
ah dang. is my pattern recognition still that weak lmao
thanks
Damn bruh never thought knowing what I need to do to take my socks & shoes off would come in so clutch 
Anyone have any hints?
how do you imagine an arbitrary element of SO_2(R)?
âď¸ Officially SO2(R) consists of certain 2Ă2 matrices, but there are several simpler ways to think of it (that is, groups with a more straightforward definitions that it happens to be isomorphic to). Do you know some of them?
Could I have a hint on this problem? I'm a little stuck on where to start lol. If $\mathfrak{a} = \bigcap_{i = 1}^n \mathfrak{q}_i$ where $r(\mathfrak{q}_i) = \mathfrak{p}i$ for all $i$, then we have $\mathfrak{a} = \bigcap{i = 1}^n \mathfrak{q}i = \bigcap{i = 1}^n \mathfrak{p}_i = r(\mathfrak{a})$. I am assuming for contradiction that there is an embedded ideal, that is, there is a non minimal element of ${\mathfrak{p}_1, \dots, \mathfrak{p}_n}$, so that $\mathfrak{p}_k \subseteq \mathfrak{p}_j$ for some $k \neq j$.
okeyokay
I guess one thing I noticed is that this implies that $\mathfrak{q}_k \subseteq \mathfrak{p}_j$, which is not usually the case?
okeyokay
what is an embedded ideal?
Then in your intersection you can throw out p_j, contradicting uniqueness (theorem 4.5)
If a is radical then it is the intersection of prime ideals, so you can assume the primary ideals in the decomposition are prime
Wait so we can say that a = \bigcap_{i} p_i is a primary decomposition for a?
I guess this makes sense... the only conditions are that every ideal in the intersection is primary, and prime ideals are primary
and moreover there are some remarks on the page before that saying we can reduce any primary decomposition to a minimal primary decomposition(?), so theorem 4.5 applies
Yeah
You can just assume itâs a minimal decomposition from the get-go
Wait I'm a little bit confused about how this contradicts Theorem 4.5 - doesn't it contradict the definition of a minimal primary decomposition? For if $\mathfrak{p}_j \subseteq \mathfrak{p}k$, then $\bigcap{i \neq k} \mathfrak{p}_i \subseteq \mathfrak{p}_j \subseteq \mathfrak{p}_k$, which contradicts the definition of a minimal primary decomposition
okeyokay
Also if Z[t]/(2, t) isomorphic to Z/2Z via evaluating at zero then reducing mod 2
Yeah sorry contradicting minimality
I know you were already informed this is a groupoid, so I just want to add that groupoids can be useful for, say, group theory, not just category theory or alg top. In fact, you can prove that a subgroup of a free group is itself free(whereas the âtypicalâ proof is topological). I donât have the exact reference for this but itâs somewhere in Ronald Brownâs Topology and Groupoids
