#groups-rings-fields
406252 messages · Page 488 of 407
So $\chi_S(g^{-1} \cdot x)$ will be 1 if $g^{-1}x \in S$ and 0 if $g^{-1}x \not \in S$, is this correct?
Liria ^(;,;)^:
does it say somewhere the action of G on {0;1} ?
Nope
that's all of it
Yea that's what I'm caught on
I don't know what the action of g on {0, 1} is?
it says it's the trivial action on {0;1}
Trivial action = maps to itself?
that means g.z = z forall g in G and z in {0;1}
Ah and then if $x \in gS, then g^{-1}x \in S$ and vice versa yea?
Liria ^(;,;)^:
well, you have to use (once again) the definition of g.S to show that
it's all about unpacking all the definitions until you get a tiny tiny logical proof to do at the bottom of it
Can someone explain to me how polygon symmetries and cayley tables work?
That's a multiplication table. If you pick out 6 on the left, and 4 on the top, you can easily "battleship" to find that 6×4 = 24
Now, you can construct a similar table for any group
Here's a table for mod 5 addition that I pulled off Google lol
@vapid dust
So what is the difference between a reflection and a rotation?
a table of the elements
of a group
and the group action between any two elements of the group
and their output
@vapid dust Reflection is flipping an object across a line without changing its size or shape. Rotation is rotating an object about a fixed point without changing its size or shape.
...
It's worth googling "dihedral group" to see this. It's pretty hard to describe as it's very geometrical
i presume he means in terms of group action or somethin
I have to be able to describe the symmetries of various polygons, prove or disprove that the symmetries form a group, then do cayley tables.
So, I am being told that a Rhombus has 4 rotations, whereas a rectangle has 4 reflections and 2 diagonals. I am trying to process what that means.
If b is the standard inner product on R^n, what is the "Usual action on functions" of GL_n(R) on it?
Is that just matrix multiplication?
In classical algebraic geometry, what's the motivation for working in projective space? Like the most basic problem in the field is solving systems of polynomial equations over affine space, but how does projective space come into play in trying to solve those problems?
I know you can embed the variety into projective space by taking its projective closure and homogenizing the equations, but why would you even want to do that
You need projective space to make the whole intersections work like they “should”
Like two lines might not intersect, but they do in projective space
And Bezout’s theorem holds in projective space when you count intersections correctly
That’s as much as I know
But if they don't intersect then there's no solution to the system. Why is there a need to go into this expanded setting where solutions do exist
Idk, it gets rid of the anomalies
In almost all cases two lines intersect
And in almost all cases a parabola and a line intersect twice
In this context that always holds
Hmm. Sort of like working in the closure of a field when solving a single polynomial equation
I think projective space is also of geometric significiane just, inherently
Sort of, perhaps
Like projective geometry was used for like renaissance art or some shit to understand perspective
If you've seen complex analysis things, the riemann sphere is just the projectivization of the complex plane
And how things appear to humans when things go away in the distance
And the riemann sphere is used when sometimes you need a "point at infinity"
That’s a good point. You can’t really understand Möbius transforms properly unless you go to the riemann sphere, but they’re important even just in the plane
And more generally for groups of automorphisms and stuff like that.
Yeah, and another related reason is that in arithmetic dynamics (also with mobius transforms), you'd like to divide by zero in some sensible way, and projectivization allows you to do this
I don't see what any of this has to do with algebraic geometry. Or at least with solving polynomial equations
A lot of classical algebraic Geometry was really just multivariable complex analysis
And it’s to illustrate the point that sometimes adding in extra stuff provides the more natural environment to work in even if what you’re interested in is stuff in the original context
Like in real analysis you’re curious about some function, but the best proof is to extend the function to C, use the sweet structure there, then come back to R
Like computing an integral via a path integral in C and using residues
Also, I really don't think you should think of algebraic geometry as solving polynomial equations. The way I look at it, its more like studying the geometry of sets of polynomial solutions
It's always seemed like a lot more algebra than geometry to me
Mathemagician has told me he just ignores it when people talk about geometry in AG
Yeah pretty much
But that’s because I come from a not-geometrically oriented point of view
Yeah idk, I just don't feel like AG helps you solve polynomial equations at all
Isn't that backwards though? Shouldn't the subject be about using algebra to answer questions about geometry
There’s some books on it, but the modern way of learning AG doesn’t cover that stuff
Eh, the two are so related you can go both ways
Me and shamrock (actually shamrock) figured out a proof of something purely algebraic using the geometry of schemes
About localization and stuff
I think that's backwards from what auvera is asking
They're asking why AG is so algebraic if the point is to study geometry using algebra
(i might have misunderstood)
Well sort of. Obviously algebra will be used a lot but it just seems every book I read completely ignores the geometry part of the subject
I think Hartshorne does actually give a lot of geometric motivation in the first chapter iirc
Specifically when it comes to singularities and blowing up
That felt very geometric to me
It also depends on what angle you come at it from
Hartshorne’s stuff on schemes has like no geometry until like the 4th chapter when you start to talk about curves
I think there’s a trend where people try and set up the huge tools that have been developed for AG without any sort of motivation for the geometry behind it
It’s something I struggle with too deeply and I’m interested in the subject
I read his first chapter long ago but didn't get farther than that. I don't remember relating it to geometry but my memory is hazy
Personally I just pretend it’s all algebra atm and have faith at some point I’ll get it
algebraic geometry is that duckling that's so ugly it is beautiful or something
I think, actually, Eisenbud's Commutative Algebra is an algebra text that really emphasizes the geometry, so that kind of gets at it the other way around
"The Geometry of Schemes" is a must too
lol
I liked Reid's undergraduate commutative algebra because it puts CA in the context of geometry
but it doesn't cover a lot compared to atiyah macdonald or something and it's not an AG book
The first picture in there doesn’t even make sense to me tho, with the cone
Yeah me neither lol
Also, maybe a slightly more "solving polynomial equations" reason to care about projective space is that for elliptic curves, equations of the form y^2 = x^3 + ax + b, it turns out that you can put a group structure on the points of this curve over some field K, but it turns out that the identity of this group is a "point at infinity"
The rest is good but I spent like an hour trying to understand that and gave up
@latent anvil I took a class on that book, it was pretty good
We used it last quarter
Different related question, is the fact that x^2 = y^3 has a cusp related to the fact that it’s an elliptic curve with the degenerate a = 0, b = 0?
Mathemagician and I
I'm obviously biased, but I think elliptic curves are a great place to focus as you start to think about all these entwining subjects
Elliptic curves are what I mainly work with and yeah the group structure you get is certainly nice. But this seems like more of an extra feature on top of just looking for solutions and doesn't really seem intuitive
well, at first sight, the group law is coming from Bezout's theorem
but once you dig a few layers deeper, it's coming from the Picard group
and I think understanding that makes all this machinery feel worth it
I read about that in Silverman's book but he goes very quickly through it
Doesn't seem to do it justice
Hindry/Silverman does a good job going over it at a high level
every curve has a Jacobian Variety which has a group structure, and the curve embeds into its Jacobian
it's just that in an elliptic curve that variety is itself
Mkay
On a related note is there an easy way to compute the genus of a curve? Or in particular to know if it's genus 1
although I do bounce around a good bit, but I'd say my heart lay with arithmetic geometry
That last comment just sounds super cool about Jacobian varieties and embedding it and shiiit
genus-degree formula:)
but combinatorics/finite group theory stuf I think about a lot too.
Riemann-Roch?
and lately I'm focused on understanding analytic number theory, becuase I do a lot of undergradaute research projects, and arithmetic geometry is not a good topic for undergraduate research haha
I thought Riemann roch only gave existence
The degree theorem only works if its smooth, or if you accept a (pathological) definition of genus
It can let you compute it if you understand the cohomology of it IIRC
But that part of my class was sketchy
For me at least
but Riemann Roch is the "standard" way to calculate genus
but there are all sorts of problems floating around with exactly how your curve is given to you and so on
but every genus one curve can be put in Weierstrass form, so it is traditional to use that
Say polynomial equation in 2 variables?
and there is a nice formula for the degree of a hyperelliptic curve (one of the form y^2 = f(x) )
Oooooohhh we covered that. It has to do with P^n right?
@next obsidian Chapter 5 of Griffith's book talks about the Jacobian variety
At least, that's where I learned all that I know
proving the existence of the Jacobian variety is ugly
In cryptography I encounter all sorts of equations and it'd be nice to be able to tell at a glance if it's elliptic or not
but no one makes you, you can just pretend 😛
I should really learn some stuff about varieties. I really hated them on my first pass but liked schemes a ton.
So I learned nothing about them since I disliked them
well, you can turn it to "group scheme" in your head instead
I think optimal pedagogy is both at the same time
Schemes r cool
I couldn’t sleep and was thinking about how to glue affines together
It was bad
Challenge question: intuitive definition of a scheme?
no
Locally looks like the spectra of a ring
locally the opposite of a ring
@ buncho bananas talks about it here https://www.reddit.com/r/math/comments/a0dd6j/mathematicians_what_is_your_favourite_algebraic/eah33w3/
74 votes and 125 comments so far on Reddit
:^)
Like, I think you have to bounce back and forth and talk about how you are algebrizing geometry, and then being like "hey, polynomial rings are the only rings!"
oh that's a mood zeta
haha I even meant to say aren't haha
Also zoph I didn't realize that was buncho
I mean they are. All rings are polynomial rings over themselves in 0-variables
:^)
I've said dumb things and gotten called out for not knowing number theory by the user lol
number theorists are the worst
: (
fortunately there are a lot of younger number theorists that are more, shall we say, human
To study number theory
Like Ravi and Jordan, for example
Who is Ravi?
I assume buncho is much too nice to visit math overflow
But I forget you’re like... a prof
oh when I say younger, I mean like, 45ish probably
And married and so our definitions might be different
Oh
I thought you meant like
Me, aged
Or like grad student
Haha
on this server younger usually means high schooler imo
Fair
older than me, but on he younger side of people who have the power to influence the culture surrounding the discipline
As in "wow you're pretty young to be reading Rudin and atiyah macdonald at the same time"
lol
I got naynay’d on earlier by a bunch of hsers
like, number theory has historically been dominated by people who seemingly want to make you feel dumb and inadequate, and was really toxic
Hmm
who knows, maybe by now mathoverflow isn't a cess pit anymore 😛
I guess I wouldn’t know since the only number theorists I know of are like the super famous ones
Like Gauss
And Euler and shit
Lol
So like, that's kinda of my perception of math in general
I wasn't aware it was worse for number theory
That is definitely my experience, anyway. And it was pervasive enough that it kind of rubbed off on even the nicer number theorists. Like I've definitely caught myself saying things and been like "I really do not have to say it in a way that makes me look like a prick"
I think I've gotten better 😛
that kind of thing is something I need to work on
I can be very, like, showy
I need to use the word obvious less lol
Yeah...
Yeah, "it is clear after some reflection that..." is a good phrase
Honestly I think I only use phrases like “one can see that”
When I don’t want to take the time to do some argument
It doesn’t make any valuation statement on the difficulty
It just says you can see, but I will not show
or a Zagier-ism "If you sit down by yourself with a sheet of paper and attempt to prove this, I can all but guarantee success"
That’s really wordy tho haha
I use obvious when
• it's obvious
• I've been thinking about it for several hours and now it's obvious
it's for giving talks
Nice and unambiguous
The worst is when a book says it is obvious, and I stare at it and can't figure it out and think about it for an hour, and then just it is obvious, and I try to figure out what I could have said to make it easier, and I can't think of anything
I don’t know, I saw someone say that when a teacher says “this is easy” or “it’s an easy exercise to...” that their brain turns it into “don’t try to do it because it’s easy and if you can’t you’re dumb”
and this is very difficult
But I don’t know how you can like avoid that or work around that
How to communicate obvious things
Math writing is really really hard
one thing that's tough is that if you tell students something will be hard they'll think it's hard
Oh yeah go ahead
cool
If it’s algebra related yeah
ty sorry for interrupting
yea its an algebra proble,m
Let G be a finite group. Prove that for any prime p, there exists a unique normal subgroup N such that G/N is a p-group and any homomorphism is trivial on N
i missread the problem at first and thought G was a p-group
and so i thought immediately on Z(G)
I don’t get what that means for any homomorphism is trivial on N
For any homo? To where?
oh fuck yea missed hthis one
I feel like there are words missing here
the homo f is of G into any p-group
Even then I think you need a specific map
is trivial on N
Gotcha
yea sorry
so my very dumb proof would be "Take the intersection of all of them"
you only need to consider finite groups
fuck wow
And there's countably many isomorphism classes finite groups
so this is well defined
Like you don't need to take a class sized intersection
zetamath very nice tysm
Wait what
I was arguing that this is well defined
I see why you need the countable iso classes
I mean, that is a subset of the powerset of G
?
so you don't need to worry about anything ugly
But how do you show that G/N is a p-group then
G/N definitely won't be a p group
The actual collection you get is a set
Yeah sham that’s why I was sort of confused
well, maybe it will be, but not usually
Even if it's indexed by a proper class
Hello guys
how do i find the p group
sorry mb
mo2men
yo
okay yeah so the quotient won't be a p group probably
Do u mean the p sylow group
But N will be contained in this intersection
You’d have to find some subgroup of N then right?
I always tell my algebra students that if they ever think they have to worry about whether something is a set or not they don't
so I hope I don't find an exception :-{P
quicky
if G is a p-group
then the psubgroup would be Z(g)
Z(G)8
and thats trivial rright?
No
Z(G) is never trivial for a p group
if G is a p-group, it's the identity
yeah zeta I think the problem was to show there's a minimal essential extension of a module? In order to construct an injective hull
and Mathemagician zorned on the class of all essential extensions
which does not work
Yeah, but I thought you said Z(G) is trivial?
so would it be correct
Errrmmm. Maybe? I don’t see why Z(G) will be acted trivially on by all morphisms into p-groups tbh
yeah that sounds fake
but if our group is A_100 and p=7, what's N?
Let H be the big intersection
Zeta
Or Z/p^2Z
(If G is a pgroup, the identity map G to G has kernel the identith)
Ty
i think i have to use this theorem
that saays if p is the smallest divisor of order G such that [G:H] = p then H is normal
thats just waht comes to my stupid brain
tbh
I don't think that will be useful here
You don't have much control over p
It needs to work for all p, not just the smallest prime dividing the order of G
I mean
You’re the one who gave the problem dude
I’m the one thinking that seems hella strong lol
I have a dumb idea that doesn't work
haha help me guys
I think you'll see it isn't so strong once you see what is happening in the A_100 case.
Take the product to get a map from G to that big product
A_100...
The kernel of that will be the H we talked about above
Yeah
and the image is a finite p group I tho
*think
By looking at the orders of the elements of the image?
I think?
wait
Consider the collection of maps φ_α : G -> P_α for P a p group
Let P be the product of all P_α (we can choose a countable subset to make this work)
Yeah, all of A_100 is correct
We have a map φ : G -> P
because there are only two normal subgroups of A_100
and we know it isn't the trivial one
the kernel of this is the thing we care about
Yeah
the subgroup we talked about above
How do you show the image is a p-group tho
I think the image will be a p group
so if it's not, there's an element in the image with order q ≠ p
so this "very strong" result isn't saying anything deeply profound
And even if you do that, how would you go about showing uniqueness
okay boys i cant seem to follow u
Zeta are you saying that it isn’t profound because often times it’s just gonna be everything?
so a recap if u guys finish please ? 😄
Take all the P_groups
Like one rep in each isomorphism class
Err
You need to go by maps
whats rep
Representative
ok
I’ll let sham explain lol
Magician if h = φ(g) and h^k = 1, then φ_α(g)^k = 1 for all α
Does that make sense?
Oh yeah
this is impossible unless k is a power of p because φ_α(g) lives in a p group
So the image is a p group by cauchy
So every element has order some power of p
(You are really taking the intersection across all normal subgroups H such that G/H is a p-group)
Mo2men, the whole group is such an H
lmfao yea
I think I can phrase it better now
yea yea
Then you can take the intersection of all
yea
first show the intersection of two of them has quotient a p group
There are finitely many so the intersection of all of them has the same property
this satisfies has quotient a p group
Since the image is a p-group since it’s contained in a p-group
So uniqueness is really saying that the second condition forces it to be minimal
I think
Yeah that sounds right
this is a universal property
How do you show the intersection has that property tho
those come with uniqueness for free
okay yea i get u
Second?
Fuck I keep doxxing you lmao
Just do the thing we did above
Which thing
Map into the product
the kernel of that is the intersection
the image sits inside a product of p groups
And so is a p group
okay so for any prime p , the intersection of all subgroups H that make G/H p-group is such H?
dumb it down for me boys
hahaha
yes
yup
But justifying that is a bit whacky. Do you have to do that thing over all homs?
Yeah
ig i have show that N is a subset of ker(f)?
yes exactly
no
This is just automatic tho right
You're doing the thing
If f goes to a p-group
that we were just talking about
Then by first iso
cuz its asubgroup
you could also do something really dumb and define the subset {g \in G | g is in the kernel of every homomorphism from G to a p-group}
prove that set is a subgroup
i like dumb things
characterstic ==> normal is low key one of the best ways to not do work
though this is a much longer to wrtie up solution than the one discussed above
yea
cuz id have to prove this rihgtr?
i have a qauestion in proving thing sgenerally
you could also do something really dumb and define the subset {g \in G | g is in the kernel of every homomorphism from G to a p-group}
@olive mirage
when you do this ^
do you have to show existence ?
Zetamath how do you show it’s characteristic?
that such thing is there?
So you don’t need to worry
yea yea
but in general u need to show
( just like we did with the intersection )
that such 'thing' exists
atleast for a trivial case
Not really
The set will always exist by the axioms of set theory
You just would have to show it’s a normal subgroup
I.e it’s normal
and non-empty
it's minimal among normal subgroups whose quotient is a p group
automorphisms will preserve normality and having quotient a p-group
and they preserve the lattice structure enough to make that work
probably not what zeta was thinking though lol
since it's just the proof we talked about above
oh you can just do it explicitly lol
“Proof”
composing with an automorphism of G will still give a map into a p group
yeah, morally speaking, any time you describe a subgroup by this kind of property that doesn't mention specific elements it will be charactersitic
you get a feel for it
you intuited the proof magician was referring to lol
YES
shamrock:
yeah because you pretend logic doesn't exist
But it’s sooooooo goooood
but like, the subgroup generated by the squares is automatically charactersitic, so automatically normal
and so the squares in A_100 generate A_100
you get to do all kinds of nonsense like this
oh that's so sick
Squares...?
u smart boys
i dont know what u talking about gl
lmfao
ty agian
i didint care muchj about char subgroups
ddidnt know u guys think they are so cool 😄
I was mostly mentioning that because someone the other day in here was like " Idon't think charactersitic subgroups are ever useful"
and they're incredibly useful for things you define with this kind of proeprty
though they also have a tendency to produce proofs that don't tell you anything haha
yea i thinnk i saw very weird stuff, so char ssubgroups are subgroups that are trivial for every auto on G
the best kind of proof
very weird things are char subgroups
Yeah
very werid shit
and their proofs were just too scary for me
without even seeing them
Our TA is like “if there’s a subgroup you define by ‘the unique subgroup such that...’ it’s characteristic”
yea
And if that property is preserved under automorphisms then it is
But just morally that sort of thing seems to be true
if I laid out all the elements of this group on the table could you tell me which was in the subgroup? What if you turned your back, I swapped them around, and then you looked back? IF so, it's charactersitic
Yeah so sadly
that may not be useful, but that is the intenal vision I have
The unique subgroup made up of these specific elements isn’t
?
Like “the unique subgroup of S_6 which is ‘list of the elements’”
That’s just every subgroup lol
hmmm i wonder what the field fixed by a characteristic subgroup of Gal(K/k) is
sounds weird
like for normal we have a nice characterization
galois extensions of k
Zeta you said rhombuses tiling the plane is some deep elliptic curve stuff
ig Aut(Gal(K/k)) doesn't really seem meaningful
yeah, every ellipic curve over C is isomorphic to C mod one of those lattices
Is that sort of thing at all penetratable for someone who’s finished a grad course in algebra and knows a bit of AG?
Emphasis on like
oh I think thomas carr tried to teach me this
Bit
So, the proof actually runs through differential equations and so called "doubly periodic functions"
Ohhhhh
and it connects in with some of the motivation for modular forms
We did something with those last year sham
in complex?
the best book that gets at all of this, in my mind, is McKeen and Moll
yeah I think I remember you talking about those
No like 336
oh
We had a problem on them
McKean, sorry
And it was a similar flavor
honestly I don't think I remember any complex analysis
at all
that's a lie but not really
no, sham
every so often I try to remember the proof of liouville
isolated zeroes are relevant maybe?? idk
currently I'm blanking
Iirc it’s just Cauchy estimates
Complex is like the one course I've really wanted to teach but haven't gotten to
I would like to relearn it
but there's so much math
it's relatively low on the list
You can show the first derivative is 0 with the Cauchy estimates
so therefore I will just have to make my entire number theory course into complex analysis
lollll
Take any point, draw a big ass circle around it
By boundedness as you increase the radius, derivative at that point is arbitrarily small, so 0
Oh but if you do the Don Marshall
I only need 2 more classes to graduate
Power series first
you too i assume
I went to advising and they made everything official, 50x and 54x are counting towards my degree
We get identity theorem very fast
Oh I should do that
I’m so bummed I can’t take the prelim
we should move out of algebra
I’ll be annoying and email again next year
this is not algebra lol
Fair
My book says that a subgroup $H \subset G$ is normal if $gH =Hg$ for any $g \in G$. i.e. $gHg^{-1} = H$. I always thought the definition was more like $gHg^{-1} \subset H$, i.e. $H$ is closed under conjugation. Is going from $gHg^{-1} \subset H$ to $gHg^{-1} = H$ trivial or something? I don't quite see it.
kxrider:
replace g with g^(-1) and multiply over
ah i see, cool.
Any good places to learn abstract algebra? Could apply that to topology and differential geometry
check pinned in #book-recommendations
What about websites?
idk about websites
u could try ictp youtube playlist
on algebra
there is also a diff geometry playlist too
and topology
Thank you
@woeful mist It would be wise to learn linear algebra and some sort of intro to proofs before trying to study abstract algebra
is x^5-5a^4x+a irreducible over Q for all integers a > 0 ?
I know for some a by eisenstein's criteria, and that there are always 3 real and 2 complex roots
induct 
do a few chapters of velleman and then artin @woeful mist
I don't think spending hundreds of AED would be worth studying abstract algebra. I'll just have to wait for uni then.
@eager willow so if it factors, the complex roots stick together, so it's gotta be 2+3 or 1+4 or 1+2+2 or 1+1+1+2. So either it has a rational root or factors as an irreducible quadratic (with two complex roots) times an irreducible cubic (with three real roots)
this seems to simplify a little
@chilly ocean apparently it's UAE-money! https://en.wikipedia.org/wiki/United_Arab_Emirates_dirham
the more you know
If you have a rational root, a is 0 mod x, so a = bx. Then x^5 - 5(bx)^4 x + (bx) = 0, and canceling x we get (1 - 5b^4)x^4 + b = 0
I have one of those coins
then 5 b^4 - 1 divides b, whcih seems sus
like in particular 5 b^4 - 1 <= |b|, so b^4 <= |b| + 1, so b is ±1
and then it's false that 5b^4 - 1 <= |b| automatically
yeah what am I talking about. The point is that that polynomial has no rational roots
and so if it factors it factors as an irreducible cubic with real roots times an irreducible quadratic with complex conjugate pair roots
you can write that down explicitly and get some messy relations
Why not an irreducible cubic with 1 real, 2 complex roots and a quadratic with real roots?
hmm good point
not sure why I thought that couldn't happen, sorry
It's probably too late for me to do math tonight
Still much simpler
you can definitely write x^5 - 5 a^4 x + a = (x^2 + Ax + B)(x^3 + Cx^2 + Dx + E) if it's reducible
I think
lol
Yeah for rationals, not necessarily integers though
no for integers
by gauss's lemma
the stuff I did for the root only worked for integer roots anyways
wolfram alpha gives
-5 a^4 x + a + x^5 = A C x^3 + A D x^2 + A E x + A x^4 + B C x^2 + B D x + B E + B x^3 + C x^4 + D x^3 + E x^2 + x^5
not great
I was trying to separate them out with symmetric operations on the roots as well but that wasn't going anywhere
Equivalent to
-5 a^4 x + a = (A + C)x^4 + (AC + B + D)x^3 + (AD + BC + E)x^2 + (AE + BD)x + BE
I'm not sure what you mean
Using relations on the roots like the trace being 0
sorry why would the trace of a root be zero?
Because the coefficient on x^4 is 0
In the case where the complex roots pair up to a quadratic that seems false
the trace of a root will be twice the real part, right?
It's Galois conjugates will just be itself and its conjugate
The sum of the 5 roots is 0
so to me trace is defined for any Galois extension K/k
so in particular if you have an element algebraic over the rationals
You can take its trace to get a rational number
this will be the sum of all the roots of its minimal polynomial
But the polynomial isn't really important
it's better to define it without the polynomial
ahhh
sorry
I have literally no idea how I just did that
okay so
those relations are good
But I'm not really sure how to get more info about the roots
or like, what knowing about the roots tells us
We get A = -C, B + D - A^2 = 0, A(D - B) + E = 0, AE + BD = -5 a^4, BE = a
Whcih is ugly
I mean it tells us things like B, E divide a and A divides E
If we multiply the second equation by A we get 2AB + E = AB + A(B + (D - B)) = A^3
or E = A(A^2 - 2B)
Idk I don't really want to think about this anymore because it got ugly
Maybe you can do something with that
The way the question was phrased makes it seem like the galois group is the same for all a, not that I'm actually taking that as a given, but I'll look for a contradiction with those
what was the question exactly?
For an integer a > 0, compute the galois group of the splitting field for x^5-5a^4x+a
Of course it's irreducible for some a, so for some a it's just S_5
Ya
Over Q?
Yes
Do you know about the discriminant?
You can use that to cook up an example where the galois group is A5
Or embeds in A5
it's still very important to know when it's irreducible ofc
here's an example
I wonder statistically
On average polynomials have a Galois group of S_n for some polynomials of degree n
huh... i guess I hadn't seen that.
yeah it's worth keeping in mind
Have you tried adjoining a root α and factoring in Q(α)?
Would that do much good without already knowing the minimal polynomial of alpha?
Yeah, I think it'd be useful
It could even tell you things about that minimal polynomial
So there is a theorem that applies here. An irreducible polynomial of prime degree p with p-2 real roots has a galois group of S_p. But I didn't know that when I made the assumption at first
since for some root r there is a subgroup corresponding to Q(r) which is order p. Then the subgroup is cyclic order p so it's generated by a p cycle in the S_p embedding. Complex conjugation restricted to the splitting field also must be in the galois group and since only 2 roots are non-real this is a transposition in the S_p embedding. Finally, if g is a transposition and h is a p-cycle, then {g,h} generates S_p
I feel kinda dumb for asking this but what does |G|=23 mean when G is a group? Does that mean it has 23 elements/ the order is 23?
that's correct
Okay cool.
it also means G is cyclic
since 23 is prime it implies G is cyclic
I got this question here that's asking me if G is isomorphic to Z_23 if |G|=23. I was just making sure I was right on that part.
is it? didn't notice it
Also I feel like this one is a trick question. $D_4 is isomorphic to Z_2xZ_2xZ_2$. Like it's asking if that is true or not.
Soulgiver831:
God I really need to learn Latex XD
haha how can that be a trick question?
assuredly the person who wrote this question thinks the order of D_4 is 8
then also no
Like that's what I was thinking. We just haven't ever had one that's false before so I wasn't sure.
think of the orders of elements
isomorphic groups have the same number of elements of a given order
I think orders of elements is even one step harder than you need for this one (-:
Like this is the first homework problem all semester where I think I can just say "it isn't true."
Well I should probably give the reason too.
@olive mirage are you thinking of commutativity?
Yeah, I think that's easier
no
np
God these questions are getting me nervous though. It's review for our final on monday and it's kinda freaking me out ngl. Like these seem like some pretty tough questions.
Like I'm doing them fine now but I don't do good with a time limit.
So with congruences, I'm not sure if I'm doing this right. I have the congruence 7x is congruent to 1(mod 17). I looked around online (because our book doesn't explain diddly when it comes to this) and I found this.
So, I followed it and that would mean that 7p+17q=1. The only way for that to happen would be for p and q to both equal 0 right?
7p + 17q = 1 has a solution since 7 and 17 are relatively prime
This is Bezout’s lemma
I can't say I've heard of that before. How do I find the solution?
Also is p and q are both 0 then there isn’t an equality
Idk, start plugging shit in haha
I mean
Oh wait I forgot. p and q can be negative.
I'm guessing I want to keep p positive though?
Probably
since that's what's used for the thing.
That’s a good way to go about it
Okay.
I'm not all that good at that ><
But yeah that works.
So it's x is congruent to 5(mod 17)
Ummm
That definitely does work
But I’m struggling to see if it’s unique
I think it is
Oh it totally is yes
That’s the answer, because inverses in a group are unique
Like if you saw 4 <= x <= 4 then clearly x = 4
This just holds in the limit is all it says
@eager willow where you able to show irreducibility?
also yeah the p-2 real roots thing is clutch, I can't believe I forgot it
If I have a group G that acts on X, then the stabilizer of $g \cdot x$ is all $g \in G$ such that $g \cdot (g \cdot x) = g \cdot x$? Is this correct?
Liria ^(;,;)^:
No hol up.
Take an element of the set S. There's going to be some elements G such that gs = s, that is, g "stabilizes" s
If g doesn't change x, then g is in x's stabilizer.
Oh
Oh ok I see
G_x is actually a subgroup of elements of g that don't change x
For any x in X
For a given x
Oh for a ggiven x?
Yea, so x is fixed
And the stabilizer is the set of all g's that stabilize your fixed x
And, like you said, this set is a subgroup of G
So then the stabilizer of $g \cdot x$ is the set of all $h \in G$ such that $h \cdot (g \cdot x) = g \cdot x$ right?
Liria ^(;,;)^:
Oh haha yes I suppose that's true
Oh, then the above was pretty true too
Mb you have a better grasp on this than I realized
Well you've got the stabilizer pretty down
Liria ^(;,;)^:
Yeah that's the "lazy shorthand" that appears often in group theory
We write the group into the equation to mean "any element of the group can go here"
Yea I'm beginning to see that lol, it confused me for quite a while :x
And this
Basically means show tahth they're both subsets of each other?
I assume so
Like this is the whole question
Like I'm so confused so as to where g is fixed and where g is not fixed
I'll not overuse g.
Gx is the set such that hx = x, for any h ∈ G
Note that x is fixed, in this sense
Yes
G(gx) is the set such that hgx = gx, for a fixed gx
Ye
Well, I shouldn't say that. g is free here
It so happens that this is true for any g you choose, but you have to choose that g for Ggx to make sense, haha
Am I making sense?
yea
Wait hj?
Uh like this is what I have so far
hrm
Oh wait no I think I can do this directly from $(kg) \cdot x = g \cdot x$ by multiplying both sides by $g^{-1}$
Liria ^(;,;)^:
@olive mirage do you mind helping me with an AG thing if you’re free?
haha I can try!
to assume that I can do a random Hartshorn exercise is... ambitious haha
So I’m trying to do exercise II.3.7 in Hartshorne about generically finite morphism that’s dominant
Does that at all sound familiar?
Basically it suggests you show some field is a finite extension of another, so it suffices to show its finite as an algebra
But there’s some whack stuff where you have to pass to stalks and then take fields of fractions and I have nooooooo idea why finite generation as an algebra would be preserved under that
haha my AG professors were adamant I not touch Hartshorn
Oh lmaoooo
No worries then
I mean honestly, maybe that’s for the better
But I already spent some good time doing everything in the first two sections so... ¯_(ツ)_/¯
Hmmm... This sounds like a commutative algebra thing
But, in all honesty, I love and do a lot of algebra, but when I'm doing algebraic geometry I don't think about the algebra of the underlying rings at all.
(I think a lot about the Galois theory of the field extensions, and the group structure of the Jacobian and that kind of thing)
But I think mostly about smooth things mostly of dimension <= 2, so a lot of the more technical stuff I get to narrowly avoid.
Hey is this chat being used?
no
Dang sorry hold on. Family stuff.
I have a quick question
In part b over here,
How do we know that each decomposition on the left is isomorphic to the one on the rigHT/
Shamrock it’s II.3.7
But I don’t think it’s quite commutative algebra yet
I don’t see how to use the generic finiteness
yeah I pulled it up
@shy bluff it doesn’t matter the order of the product on the left right?
I don't know
Like they went and wrote it as 4 seperate disticnct abelian groups?
Is all I mean
Oh no I mean like
Ohh sorry I’m doing the first example
They have like $Z_4 \times Z_9 \times Z_5 = Z_180$
Liria ^(;,;)^:
Yeah that’s because of coprimality
Z/nZ x Z/mZ is iso to Z/mnZ when m and n are coprime
You can do it by working with elements
I can outline a proof really quick if you’d like
Like how do you know that $Z_2 \times Z_2 \times Z_9 \times Z_5 \cong Z_{90} \times Z_2$ rather than $Z_{60} \times Z_3$?
Liria ^(;,;)^:
You don’t have a 3 in any of the stuff on the left
Z_60 x Z_3 has an element of order 3
The left doesn’t
Err
That isn’t quite right Z9 has an element of order 3
What’s the easiest way to see this.
Z_60 decomposes like Z_5 x Z_3 x Z_4 by coprimality stuff
Oh I see
And that isn’t iso to Z_2 x Z_2 x Z_9 x Z_5
I see
I recommend you try and go back over the classification of finite abelian groups
I don’t think I’m doing a great job communicating it haha
No I tihnk I understand
It basically comes down to coprimality stuff
So Z_4 x Z_9 x Z_5 = Z_180 because all 3 of them are coprime
So you can group them up into “blocks” as you see fit
Twas just the coprime bit that I did'nt get
The like first one is an example where you have to do that
The explanations in this course are uh aimed at a higgher level than my understanding :p
Ahhh sure sure. Try and see if you can’t prove it, you can just find an element of the correct order to imply Z/nZ x Z/mZ is iso to Z/mnZ when m and n are coprime
As in, you can find an element of order mn
And since the group has size mn it must be cyclic
Ping me if you have more group theory questions, I really like finite groups
There are canonical forms for finitely generated abelien groups that let you check for isomorphism in the obvious way, but I don't know if your text/professor went over them
Sham, do you have any ideas about the Hartshorne thing btw?
okay so first I want to understand why/how K(X) extends K(Y). This would hold if the generic point of X pushes forward to the generic point of Y, but that's not true in general. However f is dense! Let η be the generic point of Y and ξ the generic point of X. Then cl(f(ξ)) contains f(cl(ξ)) by continuity. The closure of ξ is X by definition, so cl(f(ξ)) contains f(X), and it's closed so it's all of Y by density. Thus f(ξ) = η by uniqueness of generic points
It does
I have gotten to the point where I understand the hint lol
Yeah

