#groups-rings-fields
406252 messages · Page 438 of 407
Symmetric group on A letters
ah ok thanks
Does anyone know of some kind of mini encyclopedia and/or pdf of all of the ways of finding the number of albean subgroups or just subgroups of a given group/albean group?
(This is asked very often in the mgre)
@uncut girder the prime ideals that belong to an ideal are exactly the ones containing the ideal no?
@clear obsidian all finitely generated abelian groups have a certain form
I'm pretty sure it's directly in the text?
hard to do every single exercise
not home rn but I can check later
mhmm thanks, I can look it up but thanks
I wasn't talking to you but
@clear obsidian It's called the classification of finitely generated abelian groups
ah my bad & ty
so the proof i made for the problem i posted has an error
after spending all day on it, i finally fixed it
took 4 pages
@placid pond why a p-group? If it's proper take an element outside the subgroup and look at the subgroup it generates
The version I heard was "prove that if a group has a unique maximal subgroup then it's nilpotent". It's put on the 7/10th problem set after a super long problem introducing nilpotent groups to show students that sometimes all the machinery gets in the way
@tame bear good job
The average of 7 consecutive even integers is 20. What is the median?
Thanks
@hollow stag please don't ask questions in this channel again
No would answer in others, people would write over it and people answer and it takes forever.
I have an abstract Algebra question
Suppose you have a module over an integral domain
@valid elbow along those lines, if someone asks a question in the wrong place please do not answer
Does 0-> Tor(M) -> M -> M/Tor(M) -> 0 split
I think it does
Tor here just means torsion
Cause you define a section M -> Tor(M) so that a torsion element gets mapped to itself and a nontorsion element gets mapped to 0
But I can't check the details in that map cause I'm at a concert
(The integral domain condition guarantees Tor(M) is a submodule)
@bleak abyss do you know if this is true?
owo
Actually I think this is false now
It's true over PID's, because torsion free = projective
Okay now I'm here sorry @woven delta
0 -> Tor(M) -> M -> M/Tor(M) -> 0 splitting hmm
If it splits the map has to be the one I described I think
Actually maybe not
Yeah no
Split just means dsd=d
I always forget the order of the maps lmao
I guess if we wanna kill it then we should try k[x,y] or Z[x]
Okay so
If this sequence were to split
Then torsion submodules are projective yeah
🤔
Projective = direct summand of free module
(In fact the torsion modules don’t even have projective objects in the homological sense iirc)
(By “The torsion modules” I mean the full subcategory or non-torsion-free R modules)
Of*
Oh I didn’t read the rest of the convo

Wait I’m a little confused but also tired
How would your thing split? If m is a generator for the torsion free part of M it gets $m\mapsto 0 \mapsto 0$?
MaxJ:
Yeah
So it works always in the trivial case
I think
The trivial case being a torsion module
I guess I'm assuming sum of torsion free is torsion free
?
I always think of splitting as being like, a quality associated w nice epis
So idk how it would work w inclusion
Yeah it’s a left inv
Yeah that's fine
So the reason you need that generalization is you can talk about splittings of chain complexes
Which can be neither epi nor mono
Yeah lol I actually misread the def of that
Back when I first learned it
Yeah ok the naive maps you were thinking about work
Why?
Yeah I’m caught up now haha
It works if sum of 2 nontorsion is nontorsion
I can’t break my intuition from the fg modules
Or 0
Lmao yeah same
Also pids
I had to relearn tensors recently cause of doing tensors in Lee
The vector space case is too simple
first time seeing #groups-rings-fields with 50+ messages
I guess I'll ask in hopf
I would probably know the answer to this question if I read more about the Tor functor tbh
I was trying to think of something about the universal property that implies this
But I can’t really ::
😦
If it’s true I feel like it might be true in full generality
Integral domain is full generality
Well
Free objects in categories w biproducts
Oh ok
Was what I meant
Where is there a free object here?
Wait, adjoints preserve the (co)limits, so maybe biproducts work out
Oh I guess you’re right fuck
I keep associating torsion free w free
It’s true free objects I think but yeah
Yeah sum of two nontorsion is not necessarily nontorsion
Did you see the example 12 gave?
@magic owl isn't every element killed by y^2 in that example lmao
Let $T$ be a linear transformation on the vector space $V$ over the field $F$. Show how to make $V$ into an $R$-module in a natural way, where $R$ is the polynomial ring $F[X]$.
PPrincipleTwo:
Why did the problem writer give us $T$?
PPrincipleTwo:
Uhhhh
No idea
I don’t think you need it
And if the construction is natural you def shouldn’t need it
I NEED IT
PIIIINKY PIIIINKY
its v with each component multiplied by x
is that another vector in V
no
It might be an element of V' where V' is an F[x]-Module
the fuck is V'
An F[x]-Module
In order to do that
Do I need to find a way to make scalar multiplication work for F[x]?
Is that sufficient or do I need to do more?
Idk you tell me what you need to make something into a module
An abelian group and scalar multiplication over that abelian group
So then the answer to your question is
yes
Then how do you do it
well the problem is that the abelian group underlying V (called A) as an F-module is a subset of the possibly abelian group (called A?) underlying the F[x]-Module. Just because I know that A is abelian doesn't tell me that A? is abelian.
what
You're making V into an R-module, which means that you're making A into an R-module
V is already an F-module, because it is a vector space.
A is not an F-module because it is an abelian group.
The new R-module built from V is going to have an abelian group A' that has A as a subset.
No
You can make A into an F-module in a very obvious way, by essentially making into V
Okay I think I understand why you're confused
People use very loose language here
It makes no sense to make V into a module, because V is not an abelian group as you noted
V is already an F-module
What they mean is to make A into a F[x] module
Right, so it makes no sense to make V into an F[x] module because V is already a module, and thus not an abelian group
Now let's take the underlying abelian group A of V.
I know that if I have scalar multiplication defined by the subset of F[x] with degree zero, that is well-defined, because it results in another element of A.
But if I take (x + 1) * a? That is an element not in A.
Sure
But there's no reason x * a couldn't be a + a
In other words, you could have the "action" of x on a be multiplication by 2
If A is a finite group then yes there is a reason why it can't be
The cardinalities may not be compatible
what does that even mean
Hold on.
I think I understand why I was given T.
Take a map that for instance has (x^2 + x + 1) * a := T^2a + Ta + a
check that this indeed satisfies all the properties of a module
Now the problem is straightforward.
yep
I just have one question
If M' is an R'-module that is an extension of the R-module M, is it permissible for M' and M to share the same abelian group?
$1$ exists. Associativity is satisfied because polynomial multiplication maps to the composition of linear combinations of linear transformations...which is associative. Because $T$ is linear, the right distributive law is satisfied due to $T$ being linear and the left distributive law is true by definition. Therefore this is an $F[x]$-module.
PPrincipleTwo:
Okay time for the coker version of the snake lemma
I verified exactness everywhere except where d is involved
First gotta show d is well-defined. The first choice made was x'' = v(x)
Dami:
Oh
Dami:
So that's exactness at Ker(f'')
Okay gonna repost
Because I don't believe in scrolling
Okay time 4 exactness @ coke r f'
Which book is this?
Dami:
It's Atiyah-Macdonald
Dami:
And I'm done with snake lemma since I did everything not involving d at home
I noticed it happened but never went and carefully read it/thought about it
I think it's fairly interesting/useful for intuition
Might check it out at some point soon
In the meantime
Dimension is an additive function on finite-dim k-vector spaces
That's just rank-nullity
Okay to elaborate slightly on this prop
The split is
0 -> N_0 -> M_0 -> N_1 -> 0 -> N_1 -> M_1 -> N_2 -> 0 -> ...
This alternating sum cancels -\lambda(N_1) from the second SES with \lambda(N_1) from the one before, and so on
So yeah gg
Ah now time for tensor products
The thing I don't know
Any textbook suggestion for abstract algebra
Depends on how comfortable with proofs you are
I’m really comfortable
The standard recommendation is Dummit and Foote
Fraleigh has a pretty popular one too, I think the one by Rotman is pretty talked about
Hm? Why?
I thought those are two books
But apparently the book’s author was Dummit and Foote
Oh yeah, its two authors
Omg the notation used for gcd in dummit and foote is distusting
(a, b)
Who does that
@woven delta getting into tor myself
Can you give me a hint about how we think about the fixed module for the tensor?
I’m confused as to why Tor(A,B) is defined with two modules I guess
How would you define it with one module?
And what makes you think it would make sense with one module only
By fixed module for the tensor you mean B?
@magic owl
So you have a free resolution of a module A and a module B
Tor(A, B)^i is the homology of the chain complex you obtain by tensoring the free resolution with B and cutting off the last nonzero term of the complex
I’ve always seen it as Tor(M) and I guessed I just kinda
So let's show that this is dependent on both A and B
So if A or B are free
How would we pick A and B if we wanted the result to be the torsion part of an fg group
For example?
What happens?
So we would let B be Q/Z if we are working in Z-module
Oh you're thinking of the torsion subgroup
Do you have a copy of Hatcher?
Yeah
You should do section 3.B I think
It's pretty straightforward
For the Z-module case
And it motivates Tor via the universal coefficient theorem
Honestly I need to review tensor too
I hear
I had to review tensors like last week
My intuition was too clouded from tensors over a field
Is there some confusion about what Tor can mean?
If you have an R-module M, then Tor(M) is the torsion submodule
if you have two R-modules A, B, then Tor_i^R(A, B) is the i-th left derived functor of tensor product
they are related: If R is nice (or many for any ring R?), then Tor_1(R, A) should be the torsion part of A, or something like that.
@magic owl
actually scratch the lsat thing I said, Tor^R_i(R, A) = 0 for all i > 0
what is true is Tor_1(R/(u), A) = A[u] = the u-torsion in A
at least if R is an integral domain
Is there an intuitive reason why they are both called tor if they don’t seem to match up that well?
Are derived functors always defined over projectives rather than objectives?
Injectives*
Is there a notion of coderived? functors
It's called tor because of the last message I sent
it's related to torsion in modules
Tor is measuring the failure of tensor product to be left exact
and torsion is kinda what makes that happen
which is how they're related
and no, some derived functors are defined using injectives
Ext for example
(well, ext can also be defined using projectives)
I don't know what "coderived" would be.
i feel like the exercises in Foote and dummit are much better
I like this book better than Freleigh’s
Thx @mild laurel have a nice day
So I know that isomorphic groups have to have same order & cyclic groups same order are isomorphic, but if they're non cyclic then they don't have to be isomorphic right?
which is why like Z_30 x Z_30 and Z_15 x Z_60 arent isomorphic right?
A easier example is Z_4 and Z_2xZ_2
Quick question, if two groups are cyclic and are infinite, and they have the same cardinality, are they isomorphic?
Oh
^ it has to be countable
Z?
i do that all the time
nvm Z isnt cyclic right?
it is
It is
so it is Z
iso to Z
so is there exactly 1 up to isomorphism or litearly exactly 1?
up to iso
Up to isomorphism
thanks
you can just change the names of the elements in the set to make a different group
which is lame
oof
I only work in categories mod isomorphism, so they are in fact the same object
To me
ok skeleton boy
ok yeah we dont really care about equality in abs. alg. now I remember
cant 🅱ost in chill, but i made my collatz checker more than 100x faster than before
Lmao
what software is the collatz checker?
Stop trying to solve collatz and do some local cohomology
i just wrote it in python
hmm cool
reminds me that I should prob stop trying to solve zeta(3)
although I mostly did that by a few weeks ago
yeah, cuz im gonna solve closed form of zeta(3)
well I already found a meromorphic function that is holomorphic except for the whole numbers so I might not be that far from it (although still quite far probably)
is super messy though, but thats kinda hard to avoid probably
@clear obsidian
Zn × Zn is isomorphic to Z(n×m) iff n and m are coprime
So Z2×Z2 is not Z4
But Z2×Z3 is Z6
Thanks! that makes sense
what does this mean? so they're proper subgroups G?
ok thanks
gotta love this notation when you first see it
ya seriously
umm also, I guess H < G means h is a proper subgroup of G?
it makes sense because it has the analogous result for x in R (a <= b and b <= a implies b = a)
thanks!
its not quite clear to me how to use the counting principle to prove lagranges theorem. It seems like you would have to prove that every subgroup can be written as a coset, but its not clear to me how to do this either.... can anyone shed some light on this?
Do you just want to understand lagrange’s theorem? I can’t really help with the counting principle stuff
What do you mean by counting principle
You show that you can split your group up into cosets
im pretty sure i understand what lagranges theorem is, i just don't quite see why its true. I must be missing something simple because this made sense to me a week ago.
Counting formula
|G| = |H|[G : H] for H a coset of G.
right but why does a theorem of cosets extend to subgroups?
That should say for H a subgroup of G right
oh wait hold on a second
yea i think thats what I mixed up. I think i got it now thanks
in case anyone was wondering, Cayleys better theorem states that a group G is isomorphic to the Automorphim group of its Cayley graph
however a Cayley graph is both edge colored and directed
Cayleys best theorem states that a (finite) group G is isomorphic to the Automorphim group of some (finite) simple graph, ie no colors, directed edges or multiple edges
even further there's Frucht's theorem https://en.wikipedia.org/wiki/Frucht's_theorem
for any finite group G there exist infinitely many non-isomorphic simple connected graphs such that the automorphism group of each of them is isomorphic to G.
there are other generalizations for infinite, finitely generated groups, but who cares

Oh wow, I've got some reading to do
Groups, Graphs and Trees is the book that uses the term "Cayley's better theorem"
Could I have some help with this problem?
I've done everything up till part e, but Idk how to proceed
I think that if I have an element $\tau = \alpha \beta$ where $\alpha$ and $\beta$ are disjoint cycles of different sizes, then, if I pick an $n$ such that $|\alpha| = n$, $\tau^{n}$ fixes at least one element, and isn't the identity
∀ScoopityPoop, Scoop ≠ Poop:
Now I don't know what to do when $\tau$ consists of multiple cycles of the same size
that are disjoint
so I think you can prove part a by showing that there is a bijection between between the right and left cosets of a subgroup. What is the best way to make it "rigorous?" I just kinda wrote
Let y: {xH : x in G} --> {Hx : x in G} such that x_n H mapsto H x_n where x_n in G.
Is this sufficient?
You need to show that that function is well defined
And of course show that it is actually a bijection
oh yeah... will do.
need some help with this thanks!
i can prove that f is a regular element of (F(E,E),o) with f a bijection.
i can prove that f is injective by f being a regular element
what i can't prove is that f is surjective.
i can rule out one case and that is when E is a set with one element, so necessarly f is surjective.
What is a regular element?
x is said to be a regular element when it verifies the following : a * x = b * x => a = b and x * a = x * b => a = b
Oh ok
i think there is another terminology for it but idk
Left and right invertible
So you just have to pick a particular function
To show it's surjective
I think
One sec
i'll check it out
Suppose it's not surjective, and some point p is not in it's image
Consider a and b functions which agree on every point but p
Then a * x=b * x
@static robin
Does that make sense?
Yeah.. kinda ?
Cause a and b agree on the image of x
For injective you should have done something similar
for injective i took two constant functions g & h and composed them with f : f o g = f o h and since f is invertible i just eliminated it and then i'm left with g = h so x = x'.
is that right ?
phew.
i got this : we can construct two functions : g & h so that for all x in E g(x) = h(x) <=> x belongs to Im f
and by that g o f = h o f since f is inveritble then, g = h => Im f = E
and if that's true then f is surjective.
but i still can't fully grasp this idea of putting that condition on g and h
You can always construct such functions
Just take f to be a constant function and change a single value of f
And the second one is g
Got it ! Thanks !
What do you mean?
is the function that takes the coset xH to Hx even well defined
ive gotten
xH = yH => Hx^-1 = Hy^-1
but not Hx = Hy
i think i interupted the other problem, the one before mine :(( sorry
you didnt, it was an hour before
oh ok :))
There's a correspondence
Between cosets
It is well defined
xH=yH means there are elements h, h' so that xh =yh'
So (xh)^-1 = (yh')^-1
Oh I see your issue
its not big deal with regard to the question
just change the map to xH to Hx^-1
Yeah
boom, youre done
The previous map was definitely well defined though
You just gotta do a bit more work
xh =yh' means xy^-1 = h'h^-1, which means xy^-1 is in H
This tells you Hxy^-1 = H
And you're done
right, my obsession with only using cosets and not the elements got in my way
wait, shouldn't that be y^-1x = h' h^-1
Doesn't matter
But no
Wait you're right
But it still shouldn't matter
🤔
Yeah this isn't good

Ah well
:panic:
oh well
Yeah I don't think the map works actually
At all
🤔
Ah well, I shouldn't spend time on this sort of thing
Okay sanity check
If a matrix over Z/p^2 is invertible, then when we reduce it mod p it's still invertible, and reducing mod p should be multiplicative because yeah in coordinates and shit
So we have a group hom GL_n(Z/p^2) -> GL_n(F_p) that's surjective, just gotta find the kernel
If A reduces to the identity mod p, then det(A) mod p is 1, so det(A) is 1 or p+1, both are units in Z/p^2
So anything reducing to the identity mod p should be invertible itself. Then there are 2 options for each of the n^2 entries
So that should be 2^{n^2}|GL_n(F_p)|
Does this sound right?
I would just note that a matrix with coordinates in Z/p^2 is invertible iff its reduction mod p is (which you've essentially done)
but it seems like you're forgetting 1+2p, 1+3p, etc
unless.....
p=2
Yeah it keeps getting in the way
So yeah it's actually p^{n^2}|GL_n(F_p)|
That looks nicer
on part a, I know that whenever every left coset is equal to its respective right coset, (i.e. aH = Ha) then H is a normal subgroup, but I'm not totally sure how to approach it here.
With index two, you can name two specific cosets, say x_1 H and x_2 H, but it is not clear to me that the two right cosets of H can't partition G differently. Any hints?
One coset that you will always have is the subgroup it self. So, H is a coset
This means that x_1 H and x_2 H have to contain the elements of the group that aren't in H
fwd qn here?
For $n\geq 4$ and any subgroup $G \leq S_n$, we can find a set of generators of G with $\frac{n}{2}$ elements at most.
Element118:
@brisk granite so 1H=H1=H is one of the distinct cosets and the other would contain elements of of G not in H hmmm
Oh I see. Since we know 1H=H1, and the other coset would be [everything else], xH=Hx
@placid pond n log log n sounds interesting. How did you get it?
@fading wagon the number of primes dividing n!, counted with multiplicity, is n log log n + O(n)
so it's just a trivial argument
ah okay
For 24
Are commuting elements a and b just two elements in a group such that ab=ba
yes
Ok
For two elements a, b in a group, is |a||b|=|ab|?
I can see that if the group is cyclic then this is true
Or maybe not
Nvm
what do you mean by the absolute value?
The order of an element
Well I mean, a and b are elements of a group
So | | denotes the order I believe
if the group is abelian and gcd(|a|, |b|) = 1, then it's true
well, you can weaken the first condition to [a, b] = e
so a and b commute

so it's the same thing as ab = ba
Oh
But that is equivalent of saying a and b commute
Or that’s what you said
Lol
Ok
@placid pond that's a bit redundant
what is
never mind, I realized that you wanted to point out that a and b commute, and not necessarily the whole group, then it still holds
yes
So let's say R is a ring
A subset I is an ideal if it's a subgroup and if x\in I and r\in R => xr \in I
Think of multiples of a given element
@bleak abyss and what about gcd
Say multiples of 2 in Z
Sum of even numbers is even, anything times an even number is even
Turns out to be very important, and there are many examples that don't look like this
wait you said the ideal is a subgroup, but under which operation?
also very important in semigroup theory
Addition
ok
I mean a ring isn't a group under multiplication
And an ideal isn't a submonoid since it doesn't contain 1
yes
i see that the ideal is closed under multiplication
It is closed under multiplication, but if an ideal contains 1 then it's just the whole ring
Since x = x*1 \in I since 1\in I
Yeah. Since SI = S = IS then (S - ring, I - ideal)
So for the most part ideals aren't submonoids
Anyway the point here is
Ideals play the same role in ring theory that normal subgroups do in group theory
If x\in R, the even numbers example does have an analogue
Namely, you just take the set of "multiples" (in R) of x
That's denoted sometimes as xR but also common as (x)
Ah. The ring generated by x
The ideal generated by x
(Similar notation to the brackets used for span and generating sets in group theory)
Now if I'm using (x) notation, which is p standard
it doesn't have to be an ideal, does it
(S) is usually defined as the ideal generated by S, though it's all context dependent
You could look at the subring but that's way less common, and if you're doing it you wanna use a different notation
So anyway yeah (S) is the ideal generated by S (intersection of ideals is an ideal, so this notion makes sense, prove it)
Are you assuming the ring is abelian?
For now yeah I don't feel like thinking too hard
well, could of just took $RxR\cup x$ instead
I don't see what that would've done for us here
Blitzkrieg:
Wut
ideal generated by x
Okay wait lemme finish my story so you can see where I'm going
x = 1x
Anyway so
Let's assume we're chill with (S) = ideal generated by S, which we are
does it has to be a ring with identity though
Rings without identity are the antichrist
They're also ideals in rings with identity
nah. Just for category theorists
Also for number theorists
I guess maybe people who care about Banach algebras do it since C_0(X) doesn't have unit when X isn't compact
And maybe from the cat theory side you could make the case that if you don't require homs to preserve 1, then 0 is a 0 object
you can always attach identity anyway
But also who cares about that?
Yeah exactly so I find it better in any context I see to just roll with identity
I've yet to lose anything for it
Yeah sorry I was out for a sec
So to have everything in one place
Let R be a (commutative, unital) ring and let S be any subset
Since any intersection of ideals is an ideal (exercise), we can speak of the smallest ideal containing S, namely the intersection of all ideals containing S
Call that (S)
In Z, the ideal (m,n) happens to be the ideal (gcd(m,n))
So that kinda makes the notation more forgiveable
oh, I see
@smoky cypress just focus on the last few messages lmao
addition was a bit pointless imo
Wut
we didn't use it
I mean sure but (x) is only used in ring theory really
In group theory this is the subgroup xZ
I mean I feel number theory likely doesn't care about semigroups too much, tbh I'm not familiar with the pure algebra of semigroups
Chances are semigroup theory isn't established enough to even have standardized notation
What is this obsession w semigroups lol
I feel like semigroups are pretty much only a thing in like, maybe dynamics
Since you can think of a dynamical system as a semigroup action
J(x) is notation for principal ideal in semigroup theory, but it can be (x) if you want
idk, but so far I've done every exercise from semigroup theory I could, so I feel a bit in love
I mean sure you can make any notation anything if you want, my point is that because ring theory is important in number theory and ring theory commonly uses (x) notation, it makes sense for number theory to write (m,n) for the gcd since in ring theory that actually works
yes. Why was I arguing anyway
The notation from semigroup theory doesn't really have any reason to influence number theory, and if J(x) is what's common then empirically we know it doesn't. If not then chances are it borrowed it from ideal theory
That's what I'm wondering
But yeah so idk if the algebra of semigroups is at all useful, as I said semigroup actions are basically dynamical systems but I have no idea if there's any algebraic fact about semigroups that really tells you something with content about dynamics
Is gcd some kind of categorical limit?
I mean, ring theory would have similar notation if they didn't consider just commutative rings
Like if we make morphisms divides
I think it would be a limit
it would be a directed limit, just be maxj, if you set it up correctly with "divides" as arrows
Yeah that’s what I came to
actually inverse limit. directed limit for lcm
Ik, but (x) is clearly a notation from people who only consider Abelian rings
I mean, it's the notation of commutative algebra
sure
Colimit
Turns out, low level number theory makes WAY more use of commutative algebra than non-commutative
But I mean that’s up to taking the opposite category anyway
yes
And there’s no real rhyme or reason to which direction we make our arrows
So it's more likely that it'd borrow their notation
Wait no is there?
Well, we distinguish between left right and double-sided ideals
Composition might get wonky
Idk connections of NT to non-commutative algebra. I'm sure something's there since you care about representation theory
Yes we do, you're completely missing my point
No it works
some parts of more advanced NT would use substantial amount of noncommutative algebra as well. up to class field theory, some basic arithmetic geometry etc., much more commutative algebra
My point is that there are two almost different subjects
Detailed study of commutative rings
Detailed study of noncommutative rings
Since commutative rings don't have to worry about left vs right vs double sided ideals, it makes sense for them to just talk about the ideal generated by a set
So they don't have a reason to use the more nuanced notation of noncommutative algebra
Hence it makes sense that the two subjects have different notation
Although sheaves in AG probably care more about rings in general
Well, if you count bi-ideals and quasi-ideals, we have 5 types
sheaves in AG care more about commutative rings and "glueing them" with the organizational tool called sheaves
and sheaf cohomology
Now turns out, it makes more sense for elementary NT to use the notation of commutative algebra than noncommutative algebra, since it's influenced a bit more directly by non-commutative algebra
Hence it makes sense for NT to use (m,n) = gcd
I wasn’t sure about the commutative part
I don't see what's the problem here
there's quite a lot.
Lol
(of comm. ring theory at least initially. most of EGA and/or hartshorne level AG assumes that rings are commutative with 1)
Probably not. I was just saying we do
Sure and people who study aleph_{17} in detail care about aleph_{17}, I just don't see what it's adding to this discussion
I just answered an easy question and this discussion is spiraling into madness
Yes, let's stop
I used to do so much NT and AG / arithmetic geometry some years ago. I don't do much of that nowadays since I work in the industry, but I still like hearing about them time to time 🙂
(Maybe I did notice you before and my memory of internet people is just bad in which case I'm sorry 😭)
Ah nice
doubtful, since I basically just joined very recently from a recommendation at IRC
Yeah idk much NT or AG at the moment, beyond kindergarten stuff plus vague impressions
But there's a decent chance I'll go into it in the future
My top adviser choice atm is principally an arithmetic geometer
(Assuming I continue with NT/AG and like it, obv if I start working through Neukirch or smth and end up hating the subject I'll switch but...)
Idk how true it is but I heard from one doctor from America, that number theory will probably be the biggest object of studies in recent years
oh yes I have a friend who works with him currently at wisc
Those are my top 3, I have a few other possibilities in mind for sure but prob gonna end up working with one of the three
(Maxim does like, topology of singular varieties pretty much? Arinkin does geometric rep theory)
Yeah Ellenberg seems super hype. I haven't started working with him, I'm just going into first year now
But my impressions of NT and AG make them seem fun, and also Ellenberg himself seems very broad, thinking also about rep theory and topology which I love
So yeah gunning for him unless he has too many students (which may happen, NT at Wisc is suffering a bit since Melanie Wood went to Berkeley and Nigel Boston retired just now, and Tonghai Yang is chair and will soon go on sabbatical, so yeah Ellenberg is kinda the main guy, maybe Simon Marshall if you count him)
How are you liking your current industry work?

uhhhh
this is too much
i was gone for a second
then
there is like 100+ messages
not as much as I like NT and AG, but I do need some income 🙂
Lol that discussion got derailed hard, the messages from "So to have everything in one place" to when I pinged you are what matter
lol ok
and also
I'm reading Dummit and Foote's Abstract alg
I'm probably will get to those stuff fast
And yeah fair, it's prob a bit early to be thinking about this but the prospect of getting btfo'd by academia are p real so industry is on the back of my mind
Since I already know about groups and rings
Also ughhhhhh D&f is such trash
i liked D&M. maybe had a bit too much on sylow stuff though
There are two types of people
i like this book 
D&F has everything which is good but like
It's made out of the active ingredient of sleeping pills rather than out of paper
It's so boring
oh
I used to have Matsumura's Commutative Ring Theory book next to my bed too to help with sleep
Idk I feel like it's written as a sequence of facts
If you can read it then definitely read it lmao
oh oh oh
Just that I've literally fallen asleep IRL with that book
Since he just takes so long to say anything
And his chit chat just makes it seem like he doesn't like the subject either but was told at gunpoint to talk about it
I really like the kind of book just list out facts
Well
That's a bit extreme for me to say that
I like to have two books, where one is super long and talkative about intuitions, and the other is just a list of facts
you might like Eisenbud's Commutative Algebra with View Towards Algebraic Geometry
paired with Matsumura's more dry, bourbaki approach
haha
for commutative ring theory anyway
but i don't know algebraic geometry 
Contains a lot of non-standard content (Vol 1 starts with the standard group/ring/module/Galois theory, but then goes into a lot of detail on a bunch of stuff like classical groups, quadratic forms, etc, and Vol 2 is more on advanced topics), and also I feel his treatment is the most efficient for minimizing repeated work on axiomatics
Like when he does group theory he throws in a lot of stuff on monoids
I have Jacobian too
e.g. he defines congruence on a general monoid as just an equivalence relation such that multiplication descends to equivalence classes
He then proves that if you're a congruence on a group, then you're quotienting out by a normal subgroup
But does some stuff in the generality of congruences on monoids
You're thinking, okay whatever what's the point of that? Thing is, when he goes to ring theory, a ring is a group that's also a monoid with distributivity holding
And a lot of the ring theory stuff is basically just double citing the monoid result
Which I at least appreciated, sped things up a bit
Artin is supposed to be good for getting someone who doesn't care about algebra to care about algebra but idk it myself
Yeah that
But books don't matter that that much
categorical unification when done right is a beautiful thing
Who learn GT without knowing what a Cartesian product is
grothendieck was a master at this too
Lmao
I just personally get too bored, I prefer talking to symbols (e.g. module is ring hom R->End(M) instead of listing out symbolic axioms) and don't like dragging
Lol it's funny how I hate so many standard books with a strong passion
I need something to motivate my Algebra
Hatcher and D&F
That's why I like AT
So I got into algebra basically through Sylow theory
Oof
My intro was in this REU paper I wrote summer after my first year
I don't like the problems in algebra
I was like, okay algebra sounds hype, and at the time I was in this apprentice program so we had a 5 week class on linear algebra and graph theory
Ok @bleak abyss this might be too much to ask, but can you give me like some books on abstract algebra and compare them a little bit?
I need some reason to care about Algebra
And they say in the description that apprentice topics ideally should relate to lectures
I find categorical unification makes me interested in algebra
So I was like okay, algebra sounds fun, linear algebra is associated, and there's some graph theory
Like I like learning how the results come together in the more general theory
So what should I do my thing on? Group actions on graphs
Like first isomorphism in abelian categories

But I didn't know groups so the first step is to learn groups
a lot of the modern post-grothendieck-revolution algebraic geometry requires that you know tons of algebra, if you care about algebraic geometry
Yeah but that's a good reason to study it
Can you imagine being a group theorist?
I would rather work in industry
But eventually my adviser was like wait up you don't actually have to do graph theory
And said he felt Sylow would be a good holy grail for my paper
Whoever learns only group theory “I want to study group theory”
Turns out I like combinatorics
So yeah Sylow was super fun for me
I mean tbf representation theory
why you gotta say the truth
It's so hype
Rep theory of groups seems pretty cool
liquid how 'bout a study of some specific lie groups, their representations, or heck even the mysterious absolute galois group Gal(\overline{Q}/Q)
Git fuckin sniped you nerd @woven delta
I like my algebra applied but I hate specific algebraic structures lol
Lol so, when we were naming the channels in advanced math we kinda got stuck on naming the NT channel
hell breaks loose in trying to attach meaningful representations to the absolute galois group (e.g. fontaine mazur)
The current structure was in response to how we had "advanced geometry" as a channel, meant for like DG and all, and 9th graders felt they were advanced rel 8th graders so they'd ask in there
that's kind of cute
I don't think undergrads usually do much geometry
So we were like okay "Advanced X" doesn't prevent high school questions well enough, so "Advanced NT" won't cut it. Eventually decided that Galois theory was close enough to put it there. It's not optimal since Galois theory is also algebra
Outside of certain places
But at one point I was thinking of titling the channel "Representation Theory of Gal(\overline{Q}/Q)"
that sounds awesome
@chilly ocean are you a grad student?
Since my grad student mentor the second time in the REU was a number theorist and told me once that that's modern NT
not anymore. working in the industry nowadays
Oh cool
but I love hearing about these things still 🙂
Tbh I don't know anything about Galois reps aside from Tate module is a thing that exists
But yeah hope to learn soon
Me to me: brush up on the details of the many fields you’ve learned in a cursory way
Nerd shit
Also me to me: i n f t y c a t e g o r i e s
Be like me
I'm down to specialize already
Learn everything poorly but j u s t enough to survive for another day
I'm more down to work with people than to work with textbooks these days
Should I bother with complex dami
I’m slotted tontake it rn
But I feel like I won’t like it
Who's teaching?
Let me see
But yeah I'm not gonna specialize yet
I want to find an advisor by the end of the year and finish quals
NT/AG is my tentative eventual field of study, but topology and rep theory are very close seconds
So I'll want to get a clearer picture to decide
How do you guys deal with burnout btw?
I've had it before, but I've always gotten over it
Looks like instructor isn’t listed
But I have no idea how
I just start learning something new
Also even if I choose one now, in many fields there's still a lot I'd like to learn more of. In topology, for instance, I wanna learn... honestly basic AT properly, definitely stuff surrounding K-Theory, characteristic classes, vector bundles, some difftop
That's fair
But I have the freedom to do that
Spectral sequences, maybe simplicial stuff
I should play video games
Even if I don't end up going into that area
Yeah burnout I feel is best handled by taking some time to be very unstructured/understructured
Maybe abandon math for a short period of time, but even if you don't, just do math very casually/aimlessly, just for fun
Once math no longer has too much of an association with deadlines over your head and brute force work then try to organize yourself a bit
Nice
F
Yeah hopefully I pass this topology qual (and that I passed algebra today)
If so then things will be smooth re technical matters I hope
Something really weird happened like 30 minutes ago as I was walking home
Side note: we should migrate to general
Yeah
so groups of prime order are cyclic
does this mean that theres only 1 group order p up to iso?
wait a sec I guess it does nvm
bc cyclic --> albelian so order p^1 and the partitions of 1 is just 1 so theres 1 structure
If you have two cyclic groups of the same order
Map the generator to the generator for an iso
The generation by 1 element makes it easy yeah
so if I want to calculate number of groups of a large composite order, say like 460 then theres no easy way right?
run a program
im prepping for the math gre but yeah true
there are whole libraries of such things
so it just makes structures and finds iso's right?
I'm not sure if they go as far as order 460 though?
I guess you could just get it to start making arbitrary structures represented by matrices
I mean obviously they need to be groups so that narrows it down a lot
but how many computations does it take to check for group along the way instead of just making full structures arbitrarily
Yeah, I guess this is how they find them, more or less
e.g. generate an arbitrary nxn matrix
or whatever2 dimensional commands that would serve this purpose
of course with small numbers its easy but gets progressively more complicated I assume
(acknowledging that complexity here may be vague)
of order at most 2000 expect 1024, so all groups of order 460 should be there
idk why 1024 isn't there 🤷🏿
There are literally millions of groups of order 1024
They probably were just like "nah"
why 1024 though
Highly divisible? That's my guess
Are the only ones that I like
ah
1024 is super-composite
most finite groups are of order 2^n
this
Groups of order n (n=0)
lol then you don't even have identity

That’s why my book is so short liquid
🤔 If we look at groups as universal algebras, then they must contain a 0-nary which is the identity
Huh
I mean sure
But that’s pretty redundant
“Groups are defined to have identity and thus must have identity”
If $P(x)$ is a polynomial with rational coefficients, $a,b\in\bbQ$, and $\sqrt{b}\in\bbR\setminus\bbQ$, if $P(a+\sqrt{b})=0$ then $P(a-\sqrt{b})=0$
That sentence parses but it shouldn't need to be said
Whoever:
is there a generalization of this?
ever heard of galois shit?
Ik galois theory exists but haven't actually read anything about it
from what I remember, it's relevant
the zeros of a real coefficient polynomial are symmetric about im = 0
Ik, I learned that few hours ago though lol.
No idea what sigma said but sure
😠
construct $k \in \mathrm{Gal}(\bar{\bbQ}/\bbQ)$
Darkrifts:
if i is a zero of a polynomial with real coefficients, then so is -i
*k not being the identity or the loser conj boy
he said that conjugate is a root as well
its related

