#groups-rings-fields
1 messages · Page 33 of 1
thank you:)
what is the whole article?
looks like it could be up my alley
(symplectic, poisson geometry)
wait it might not be that
it is
its about putting "compatible" poisson structures on cluster algebras
based on work by Gekhtman et al
all you can really get without commutativity is $$\mathrm{ad}_{a^{-1}} = -a^{-1}(\mathrm{ad}_a)a^{-1},$$ but that's still nice, and you still get the remark after "in particular"
TTerra
neat, thanks
thanks for the confirmation! you're right it's still nice
i got halfway there and then stopped because i couldnt see me getting to the commutative one
i proved it by looking at {aa^{-1}, b} = {1, b} = 0
ah i wrote a^{-1} as aa^{-2}, i assume amounts to the same thing
just more tedious on my end
I'm just conjecturing but I'm guessing digraphs like these can only belong to Z_n or D_n
$${1, b} = {1\cdot 1, b} = {1, b} + {1, b}$$ so ${1, b} = 0$, so using the fact that $aa^{-1} = 1$ gives $$0 = {aa^{-1}, b} = a{a^{-1}, b} + {a, b}a^{-1}.$$ multiply on the left by $a^{-1}$ to get $$0 = {a^{-1}, b} + a^{-1}{a^{-1}, b}a^{-1},$$ which is the same thing as $\mathrm{ad}_{a^{-1}} = -a^{-1}\mathrm{ad}_a a^{-1}$
TTerra
interpreted correctly, at least
the right hand side has a bit of notation abuse, i'm thinking of it as the thing taking b in P to -a^{-1} (ad_a (b)) a^{-1}
so you're really doing ad_a first, then multiplying on the left and right by a^{-1} and then switching signs
if you assume commutativity then indeed you can write this as ad_{a^{-1}} = -a^{-2} ad_a and no confusion would arise
i'm just being lazy and don't want to write the precise thing
question
i need a walk through of this proof
Let $G$ be a group with $H,K$ subgroups. Suppose $H \subset N_G(K)$ then $HK$ is a subgroup. Ive already shown $HK$ is a subgroup iff $HK=KH$. So I want to claim that $HK=KH$
MyMathYourMath
so i know one containment is trivial I cant seem to see which
it is KH \subset HK
the trivial direction
MyMathYourMath
brb restroom break ILL BE BACK
im back
hang on another restroom break lol
5 mins

dude ate that taco bell
😠
ok im bCK
so how do I show HK \subset KH and KH \subset HK given H,K \leq G and H \subset N_G(K)
one direction is trivial but I cant see it :/
what can you say about $hKh^{-1}$ given that you know $hkh^{-1} \in K : \forall k \in K$
minecraftgrimreaper69
ive done this proof before i just cant think of the trick
I wouldn't even call it a trick in this case
that h \in N_G(K)
ok
is KH \subset HK the trivial direction since H \subset N_G(K)
lemme think about this some more
you can just show it directly without needing to worry about subsets
so say i have $x,y \in HK$ and i wanna show $xy^{-1} \in HK$ then set
MyMathYourMath
$x=h_1k_1, y=h_2k_2$
MyMathYourMath
with $h_i, k_i \in H,K$ resp.
MyMathYourMath
is that because we write $xy^{-1}=h_1k_1k_2^{-1}h_2^{-1}$
MyMathYourMath
no it's because $y \in K \iff y^{-1} \in K$
minecraftgrimreaper69
where do we use that $H \subset N_G(K)$
MyMathYourMath
$hKh^{-1} = K$ for all $h$ was the thing I wanted you to realise
minecraftgrimreaper69
from this
also just realised my name is still minecraftgrimreaper69 one moment 
but how to use this in proving HK=KH or HK \leq G
$hKh^{-1} = K$ for all $h \in H \iff hK = Kh$ for all $h \in H$
i once did a proof where I showed HK \subset KH and KH \subset HK instread and i remember one direction being trivila
Wew Lads
yuR
Hello, how can I prove formally that all the subgroups of S_3 are : himself, {id} and the subgroups generated by each element (separately ofc) ?
so since hK=Kh for all h \in H we conclude HK=KH
there's only 6 elements lol just check
I know, but elements =/= subgroups lol
check the groups they generate is obviously what I meant
and ze answer will be revealled
alternatively, check that if you have a subgroup generated by two elements, where each one doesn't lie in the subgroup generated by the other, you have the whole group
that would be quickest I think
That's what I wanted to avoid, a long proof
🍔
can't blame you lol
by lagrange the nontrivial subgroups must have order 2 and 3 respectively
and any group of prime order is cyclic
so it's just Z2 and Z3
even nicer than my idea lol
do there exist field extension $k \subseteq m \subseteq l$ s.t. $l/k$ is normal but $m/k$ isn't?
rectangle cube
thanks !
ZE answer
ze answer...
Let $k=\mathbb{Q}, m = \mathbb{Q}(2^{1/4}), l = Q(i,2^{1/4})$
AoiKunie
More generally, let $l$ be any non-normal field over $k$ and $l$ its normal closure
AoiKunie
normal closure?
Essentially, the smallest normal field over k containing l
ah ok thanks
in showing if G/Z(G) is cyclic then G is abelian
the key is to first claim elements of G can be written of the form
$g=x^mz$ for some $z \in Z(G)$ and $m \in \Bbb{Z}^+$
MyMathYourMath
since G/Z(G) is cylclic there exists an x \in G such that G/Z(G) = <x Z(G) >
then for g \in G
gZ(G) = (xZ(G))^m=x^mZ(G) which is true iff gx^{-m} \in Z(G) so it equals z for some z \in the center
thus g=x^mz
I'd then argue by (x^m z_1)(x^k z_2) = x^m x^k z_1 z_2 = x^k z_2 x^m z_1
thanks
and for the backwards direction
if G is abelian then its equal to the whole center
thus the quotient is the trivial group which is trivially cyclic
right?
yes
sweet thanks
question regarding semi direct products
so the map $\phi: K \rightarrow \text{Aut}(H)$
MyMathYourMath
is the kernel of \phi the elements that map to the identity map in Aut(H)
Of course
i.e., the maps from H to H defined by sending h to h
the isos
since the trivial element of Aut(H) is the identity map?
and kernel maps elements to trivial elements
is all this reasoning correct
yes
MyMathYourMath
where G is the semit direct product of H and K
how do I show for all g \in G that gxg^{-1} = x
What does the map phi actually do
sends elements of K to automorphisms of H
Which automorphism though
of H to itself
it just sends arbitrary elements of K to arbitrary elements of Aut(H)
It's just an arbitrary map from K to Aut(H)?
yes
its a homomorphism of course
oh
take phi of ghg^{-1}?
?
wait no
im trying to show x \in C_G(H)
its the map induces by the semi direct prod
induced*
Hang on, I'm putting away my toaster
lol ok
i need to show xhx^{-1} =h given that phi(x) is the identity on iso of H
but H is normal right
I'll need to write this out, but I want to say that this is specifically referring to inner automorphisms
Oh wait I think I see
Phi is induced by the semi direct product
yes
Does this imply phi is the map such that phi(x) maps h to xhx^-1
i thought if youre in the kernel phi(x) is the identity on H
If I’m remembering my presentation theory right, yes it’ll map each element to an inner homomorphism
But I will check
Right, if x is in the kernel then it maps to the Identity
*auto
But what does phi(x) actually do?
To an arbitrary element
I'm not explaining this well
its an auto of H?
Sorry this toaster is putting up a fight
My point here is that phi being induced by the semi direct product tells us what phi actually looks like
thats ok im gonna graba cup of coffee and think about this
As in we can specify what the map actually is
(where do I start reading for what u guys are discussing)
Yes, conjugation in the semi direct product
So try proving that identity and then I think you will understand what I am trying to say
here
(to prove it, just explicitly conjugate elements in the semi direct product)
i think i got it
let x \in ker \phi then x \in K
and we need to show xhx^{-1} = h
but xhx^{-1}=(e_H,x)(h,e_k)(e_H,x)^{-1} and calculate using the definition of operation in semi direct product
Yes exactly
sweet thanks
Sorry I didn't explain very well earlier
But you got it
Semi direct products are cool
they have a twist in the operation lol
MyMathYourMath
How do i use the fact that H is characteristic in showing ghg^{-1} \in H for all g \in G and h \in H
Is conjugation an automorphism?
yeah but tats a specific auto this is for any auto of G
Well if it holds for any automorphism then certainly it holds for conjugation
???
plz more input 🙂
you have a statement that holds for automorphisms
and u want to prove the same statement for conjugations
correct?
not the same statement but that ghg^{-1} \in H for every g\in G and h \in H
but it is if we define f_g = ghg'
i.e. H is normal in G
oh nvm me ignore
yes
so phi of those is equal
So we have specific automorphisms phi_g where phi_g(x) = gxg^-1
What do we get when we apply phi_g to H?
H itself
And so we can conclude that
that element is in H
i.e. H is normal in G
Right, I guess more explicitly you say that gHg^-1 = H for all g in G
But do you understand why that equality holds?
because phi of H is gHg^-1 which is equal to H by assumtpion
oh H being characteristic
nice ok
thx again! I totally see it now! it wasnt too bad
i know I asked this but i just wanna make sure i got it right
show in G if x,y \in G the orders of xy and yx are same
does this work: Let $k$ be the order of $xy$ then $(xy)^k=x(yx)^{k-1}y=e$ $\Rightarrow$ $(yx)^{k-1}=x^{-1}y^{-1}=(yx)^{-1}$ thus the order of $yx$ divides the order of $xy$? i.e., $(yx)^k=e$.. and by symmetry were done?
MyMathYourMath
i have a big algebra qualifying exam coming up if anyone has any set of ring and group theory problems I could work on plz send them my way
sweet thanks
I guess I would just finish it by like
Multiplying by (yx)
And then observe that (yx)^k = e
Might as well just finish it off yeah?
yes thats what i concluded
I think this also works:
i concluded this
(xy)^k = e
hitting w a y
So (xy)^-k = e
Then (y^-1x^-1)^k = e
Hmmm
Idk
I feel like this would work
But maybe it does idk
i like my method of splitting xy^n out lol
and writing the inside as yx to power of k-1
which shows order of yx divides order of xy
That works - it's the same thing but I think it's easier to see that conjugate elements have the same order
Walter
waltuh
chmonkey and tterra
I can DM you some of my algebra homework assignments if you'd like
that would be wonderful
specifically the ones on group theory and ring theory, but if you want to review modules and fields as well I can provide those
no no just groups and rings
thats all im being tested on
barely trying to wrap my head around groups and rings
Ok, one sec
why not post here
I can do that too
waw
whichevers easiest for you
incoming pdf bomb
LOL

someone pin this 
i'm pretty sure most of these are from dummit and foote
@agile burrow thx so much!!
yeah i recognized some, could I ask you about solutions when stuck
Sure, I'll try to respond whenever I'm free
thanks, no rush whatsoeevr
sure just handy whenever someone asks for some problems; does happen
maybe if i ping @uneven folio itll be done within this week
.pin
so I'm having kind of a problem right now
I think I maybe have done some highschool algebra wrong somewhere? idk
so I'm trying to find the galois group of L/Q where L is the splitting field of x^3 - 3
L = Q(cbrt(3), isqrt(3))
so I take an automorphism sigma
it fixes isqrt(3) and permutes the other one
i\sqrt{3}?
You sure about that?
i have a proof solution for g to g^2 is a homomorphism iff G is abelian if you could check it
sigma(isqrt(3)) = isqrt(3)
sigma(cbrt(3)) = - cbrt(3)/2 + 1/2 i 3^(5/6)
now I want to find its order

or is that already wrong
yeah already wrong
just post here after rectangle cube gets help and someone (potentially me) can check it later
oh lmao
okie doke 🙂
so I like have no idea how to find the galois group of an extension lol
det explained it to me a lil yesterday already but it was using some 'heavy' machinery
my course has only introduced what galois group means
nothing more
why is the extension not Q(cbrt(3), isqrt(3))
.
err I guess this is fine
Is this actually an equivalent way to write it down??
like the roots are cbrt(3) and -cbrt(3)/2 +- 1/2 i 3^(5/6), obviously we have cbrt(3). for the second one I pull out the first term, the +-, and a cbrt(3), so I'm left with isqrt(3)
how does a sqrt get involved what
Idk why you wouldn't write it as Q(cbrt(3), zeta_3)
what's zeta_3
3rd root of unity
3rd root of unity
a primitive one, to be precise
Oh wait also sqrt(3)
but what you have is equivalent to this
anyways, we have a cubic, where does sqrt3 come from
uhh how I would I "realized" that I had zeta_3 there
3^(5/6) = sqrt(3)cbrt(3)
the "obvious" way to write down the roots of x^3-3 is \zeta^a_3 * 3^{1/3}
so cube root of 3 times some 3rd root of unity
ahh because (zeta_3)^3 = 1?
this is completely non-intuitive to me but sure ig
ngl im still half lost, but if ur sure
yes, and then in this case the two primitive 3rd roots of unity are -1/2 \pm sqrt(3)i/2
so that's how sqrt(3) is showing up
oh ok
right
in general if you have x^n-b you can write the roots as like \zeta^a_n * b^{1/n}
okay so you have your extension Q(3^{1/3}, \zeta_3)
and you have some subfields
Q(3^{1/3})
Q(\zeta_3 3^{1/3})
and Q(\zeta^2_3 3^{1/3})
these are all distinct
these are all cubic extensions of Q
on the other hand you have the subfield Q(\zeta_3), this is a quadratic extension of Q
okay then you know the Galois group is S_3
why isn't it C6
well for one, you have a cubic
it has to be a subgroup of s3
so the Galois group is a subgroup of S_3
ah ok got it
It's kinda easier to see it as Dih(6) imo but each to their own
also, if you look at the subfields we've written down, they should correspond to subgroups of Galois
what's Dih 6
D6
wait
dihedral on triangle
that's an aha moment for me right there
S_3 has a unique subgroup of order 3, and 3 subgroups of order 2 that are all conjugate
Like if you just draw the roots what do you get right lmao
the unique subgroup of order 3 corresponds to this quadratic extension
the 3 subgroups of order 2 correspond to these cubic extensions
question regarding sylow problems
say the break down is into primes with power 1 each say 2 times 3 times 5
if say n2=k can we say there are (2-1)k elements of order 2 and (3-1)m elements of order 3 if n3=m
but say we are given a group of order 24 which is 2^3 times 3
and i wanna assume G is simple this implies n2=3 and n3=4 (as being simple implies one of them is 1)
I forgot who is prepping for quals, but here was a hard one from my hw
Show a group of order 30 has a normal Sylow5 and a normal Sylow3 subgroup
that problem showed up on my midterm i got it right 🙂
Nice !
My professor told me the answer...
Actually when you went to his office hours he would just tell you the answer 😅
lol
Here you’ll then that at least 3*(4) + 3 elements of order a power of 2 and 4*(3-1) of order a power of 3 , which doesn’t really allow you to conclude a contradiction here
You could instead consider the conjugation action of G on the sylow 2 subgroups
Note that 24>3!
Hello
How can I find the degree of Q(zeta_35) on Q ?
I found that it is either 12 or 24 but I am blocked here
\phi(35)=24
Proof? Source? Source? Proof? Do you have a reference for that?
Wait don't tell me that degree of Q(zeta_n) over Q is phi(n) xd
it is yeah
Is it because this extension is Galois and that the group of Galois is injected in (Z/nZ)* ?
the Galois group is isomorphic to (Z/nZ)*
Isn't it only for n prime ?
no this is for any n
it's just that (Z/nZ)* isn't usually order n-1, it's usually smaller
Source: I made it up
Mmmmh okay thanks
Honestly the way I know it is you first show the degree is phi(n) and then conclude that the galois group is isomorphic to (Z/nZ)*
Q(zeta_n) is the splitting field of the n-th cyclotomic polynomial. One shows that this polynomial is irreducible and integral and of degree phi(n), so the degree of the extension is phi(n)
this then shows that the aforementioned injection is in fact an isomorphism
I don't know why but my prof only defined the cyclotomic polynomial for n prime and I searched on wiki and it is for any n
I see
that's strange
it's not trivial to see that the cyclotomic polynomial is irreducible
but it's not too difficult
if you've shown this for prime n the proof for nonprime n should be similar
and follow by reduction
Is it the same proof than for n prime ? Like we look at P(X+1)
Here we go xd
theorem 4.3 is this
in (Z,+) and (Q,*) inverse of 0 is 0?
(Q, *) can't exist
it must be (Q \ { 0 }, *)
because 0 doesn't have an inverse
a right, i was looking at ring examples
but it was (Q,+) not (Q,*)
but why (Q,*) can't exist?
because 0 doesn't have an inverse
okay but its still possible to have rational numbers equiped with operation *
yeah it is not a group
but i was thought when i write in brackets a set and an operation it just marks that (Q,*)
it usually means group
oh okay thanks
I mean, this is highly context-dependent
if you're asking about inverses sure
but in general just stating a pair of a set and an operation doesn't a priori have to specify a group
unless you say it does
yes, it's just not a group. It's a monoid
Not able to understand how this map works can anyone elaborate pls I understand that $d.d=0$ but when we apply $d^h+d^v$ on a module C_{p,q} we get C_{p-1,q}+C_{p,q-1} which is not in the complex. Can anyone please clarify this construction
A map from a direct sum is a map from each summand
Tot^+(C)_n is made up of a bunch of parts, each of which has d^h and d^v going to some parts of Tot^+(C)_n-1
So you use those maps on each summand
Similar for product, but now maps into products are maps into the individual ones
I guess this is the cochain version
So your example the arrows go backwards
But this is the idea
Is this due to the fact A+B+A=A+B in direct sums. What about products?
This isn’t true and I don’t see how it’s related
I meant A\directsum B\directsum C\directsum= A\directsum B\directsum
What
?
Look, it follows because the direct sum is a coproduct
If that doesn’t make sense, you define it on elements using basically the picture I drew
If that isn’t enough idk what else to say
not sure if this is the right place to ask this
but what is vague about "taking the reciprocal polynomial is an involution iff the constant term is not zero"
Well it doesn't seem to make too much sense to me
A function f is an involution iff for all x, f(f(x)) = x
Neither direction is true: 1/x an involution, whereas 1/(x^2+1) is not even invertible.
(f*)* = f iff the constant term of f is non zero
that's what I was trying to say
cc @languid hare
Ahh, then it’s an odd statement altogether. I am at the airport rn though. I may be able to get back to this in a little bit. :3c
can someone explain intuitively why a symmetric matrix has n real disctinct eigenvalues or vectors i am not sure?
I dont see anything vague
This is perfectly valid statement
to me it sounds like incorrect phrasing
it would be weird to say that e.g. differentiation of f is an involution if and only if f ...
yeah its a condition under which the operation is considered involution
but then again thinking of the statement
isnt a problem the roots?
like if your polynomial has any roots wont they just be poles after reciprocating
and then the domain changes so you arent using same function
How would it be true at all? The reciprocal of a nonconstant polynomial is not a polynomial at all.
yeah thats what im saying
but i think they mean reciprocal for power series
reversing order of coefficients
ig now i see some ambiguities with the question
Okay, that are two different interpretations that would both be true with a restriction to nonzero constant terms. :-)
if they did mean power series then the statement is true regardless of constant term
Well, the reciprocal of 0+1x doesn't have a power series around 0.
Unless you count Laurent series, but then it becomes ambiguous which annulus to take the reciprocal of the original function on.
if we have some field K and some extension L/K, given any automorphism f of K, there will be some automorphism g of L (not a member of Aut(L/K), it doesn't fix K pointwise) such that f(k)=g(k) for all k in K?
feels intuitively correct but idrk why
Zorn’s lemma can be used
reciprocal as in f* = x^(deg f) f(1/x) (I stated this in the sentence before, forgor to do here on discord tho, mb)
ok phew
lol
Well I think the fact that this question has spawned lots of confusion is evidence enough that it is a bit vague XD
my corrector marked the "iff a_0 is nonzero" part as vague
that's what confuses me
he also took a point away on something but didn't explain why
maybe they wanted you to prove it instead of just state it
I proved it
i dunno
sounds like a grader problem and not a math problem
maybe you shoulda said "constant term" instead of "a_0"?
what breaks it being an involution when the constant term is zero? feel i am missing something
it's not even clear to me what exactly you wrote
do it twice and see what you get
this probably
if f is of degree n then you get x^n f(1/x). if this if of degree m, then you get... what?
and what is the degree of x^n f(1/x)?
think about it
im with you, i messed up my example of x^2 + x
You dont say what a_0 is
i feel like this is a little silly but it also makes sense
like, what else could it mean? lol
reasonable from the grader though
if the course constantly (
) uses a_0 as constant term (mine does for example) then i find it silly
The grader is probably fighting the idea some students have that certain letters automatically have a meaning that connects them to each other, which doesn't need to be stated explicitly.
too late buddy
is this revenge
in a lighthearted way
I would say just because there's a polynomial called f somewhere, we can't expect that the coefficients of that particular polynomial are automatically what is called a0, a1, a2, ...
either way the grader should have specified what he's deducting points for
yeah on that note
I mean, isnt this why?
I was gonna ask about this case too
the solution is correct
I verified it using wolframalpha
oh god it's that pirate problem
nooooo you have to do it by hand nooooo
yes lmao
Its not just about being correct, you have to actually communicate it well too
I did the chinese remainder theorem by hand if that counts
And idk how well you did that because i cant read german
maybe ask the grader
scary
we can only speculate especially the people who don't speak german
graders are just students as well most of the time

how 😮 by like "successively" adding elements or something?
Successively adding elements is (intuitively) what Zorn's lemma does for you, under the hood.
As a user you just get delivered a maximal extension of some f to an automorphism on some subfield of L. All you now have to do is show that that subfield needs to be all of L, or the solution you got wouldn't have been maximal.
Let $k$ be a field. Then obviously, $k[t^2,t^3+t]$ is a subring of the polynomial ring $k[t]$. It is correct that it is not equal to the whole ring, right? How would I show this, formally? I am pretty rusty on algebra in general...
gustavn64
ok so let S={L' subfield L such that f extends to L'} is what you're saying?
Zorn's implies S has some maximal element which must = L?
Intuitively, to get $t$ you would have to take the second generator, but then you have to cancel the $t^3$, which should be impossible, I think
gustavn64
The elements of the partial order would be the actual extensions of f to automorphisms of fields between K and L, ordered by set inclusion.
View a function A -> B as a subset of A×B.
That gives the same ordering as saying "f R g iff g is an extension of f", but saying "ordered by set inclusion" is customary when using Zorn's lemma -- and it suggests how to find an upper bound for a chain, namely to take the union of all the sets and showing that produces a function with the specified properties.
Also, if it were isomorphic to $k[t]$, then the singular affine plane curve $y^2=x^2-x^3$ would be isomorphic to the smooth curve that is the affine line itself.
gustavn64
Actually, I don't think this is true. For a counterexample consider K=Q[sqrt2] and L=Q[sqrt(sqrt(2))]. If we let f be the nontrivial automorphism of Q[sqrt2] which interchanges sqrt2 and -sqrt2, then there's nowhere in L for g to map sqrt(sqrt(2)) to such that its square is f(sqrt2) = -sqrt2.
the proof is correct to show that zorn's lemma applies, right? the problem is that M (the maximal element) might not equal L
it would normally go something like "if M neq L then there is some a in L not in M, so M(a) <= L, then blah blah shows that M(a) also works, contradicting maximality", but in fact M(a) might not work
Yea you might.not always be able to extend
This always works if L and K are both galois over some base field F
I'm not sure if you can weaken the assumption further
In fact I think if L is normal over some subfield of K, and the automorphism fixes that subfield that's enough
I have to think about this tho
I'm assuming algebraic in either case
The question is if you need galois or if just normal is enough
I don't understand "This field is changed only for the steps involving the computation of an nth root."
and what the sequence has to do with them being normal
fields are closed under addition, subtraction, multiplication, and division, so you won't obtain new fields by doing those operations
is it true that if H is normal and K is any subgroup that HK is a subgroup
i know if K is normal and H is any subgroup its true
I'd think so
doesnt matter which one is normal
yeah if either H or K lie in the normalizer of G then HK is a subgroup
ok thats what i was thinking thanks
thx
right
and what about the normal thing?
if you want the sequence of fields to be normal, you can't just add in some nth root of c, as x^n-c (or x^n-c divided by the nth roots of c that are already in the field) might not split
you have to add in the roots of unity to make F_i/F_{i-1} a normal extension
i.e. you make F_i the splitting field of x^n-c
$\sigma: \sqrt[4]{2} \mapsto -\sqrt[4]{2}.$
$\sigma: $i$\sqrt[4]{2} \mapsto $i$\sqrt[4]{2}.$
$\tau: \sqrt[4]{2} \mapsto \sqrt[4]{2}.$
$\tau: $i$\sqrt[4]{2} \mapsto -$i$\sqrt[4]{2}.$
What is $\sigma\tau($i$\sqrt[4]{2})$?
Sapphire Gaming
it's the composition
sigma(tau(isqrt4))
question, how do you know which method to use Sylows theorem? i.e., when do you use the argument that the group ends up with more elements than there were originally in the group and when do you say "the remaining constituttes a sylow p-subgroup which is unique"
and say the order has a prime in its decomposition with expoennt equal to just 1 and say n_p=k
only in this case can you say that theres (p-1)k elements of order p
So, would $\sigma\tau($i$\sqrt[4]{2}) = $i$\sqrt[4]{2}$?
Sapphire Gaming
Hello, what is the minimal polynomial of $\mathbb{Q}(\zeta_9 + \zeta_{9}^4 + \zeta_{9}^7)$
Christophe*
This is fixed by z -> z^4 so I think it generates the sub field corresponding to that auto morphism or something like that
Like, it satisfies x^4 - x
Then go from there
Okay so it’s like
I determined that [Q(zeta_9) : Q] = 6, its Galois group is isomorphic to Z/6Z
So all the strict subfields are the fix ones
is this a standard trick
Wait I don't follow you
Ig the generator is the orbit sum of zeta_9 under the map sending zeta -> zeta^4 and orbit sums r common
How did you see that so easily ?
I know that the minimal polynomial is of the form X² + aX + b
you lost me with a few words
orbit sum ig
a := zeta_9 + (zeta_9)^4 + (zeta_9)^7
that sum under different mappings of zeta?
I did a² = 3((zeta_9)^2 + (zeta_9)^5 + (zeta_9)^7)
I know that (zeta_9)^6 + (zeta_9)^3 + 1 = 0
If a group $G$ acts linearly on a vector space $V$, then for each $x \in V$, $\sum_{g \in G} g \cdot x$ is fixed by $G$
potato
But I can't combine that so that my X² + aX + b becomes 0
hmm
I THINK I FOUND IT
Actually idk if this is true lol I forgot that raising powers isn’t linear lol
But I did find the auto morphism which fixes it
So in particular what we can do here is take the Galois group of $\mathbb Q(\zeta_9)$ and then consider the subgroup generated by $\sigma$ mapping $\zeta_9 \mapsto \zeta_9^4$ and then the orbit sum (from above) is the generator
All auto morphism of Q(zeta_9) are given by raising zeta_9 to some power
I did it
We also have the one that send to zeta_9 to the 8th power
potato
Yes, complex conjugation I guess
uh
z = ((zeta_9) + (zeta_9)^4 + (zeta_9)^7)
I am searching a and b in Q such that
z² + a.z + b = 0 i.e. 3((zeta_9)² + (zeta_9)^5 + (zeta_9)^8) + a ((zeta_9) + (zeta_9)^4 + (zeta_9)^7)) + b = 0
But I know that 1 + (zeta_9)^3 + (zeta_9)^6 = 0 because X^6 + X^3 + 1 is the minimal polynomial of Q(zeta_9) over Q
So I have that it is equivalent to
3(zeta_9)² ( 1 + (zeta_9)^3 + (zeta_9)^6 ) + a * zeta_9 * (1 + (zeta_9)^3 + (zeta_9)^6) + b = 0 <=> b = 0
wait yeah
am i dumb
I mean I tried thinking about t geometrically
And didn’t see why it was 0 obviously
But
it is this : 1 + (zeta_9)^3 + (zeta_9)^6 times zeta_9
It looks like it is
oop
wait I don't understand anything
The sum of two conjugate roots of unity
so uh
Is -1 right?
it is 00:00 here i am becoming crazy
No this obviously isn’t always true
Uhhhh
What’s rucking cos(120)
Isn’t that -1/2
Yeah
and so this is just 0
chmonk chmonk lmao
potato
Yeah potato good good good
yes i know and how it helps
what even is the min poly in that case
:OOOOO
x
wait what
My guy
WHAT
That’s what I linked
LOOOOOOOOOOOOOOOL
And what we’ve been saying for the last like 5 mins
lol
THATS WHY IT FIXES MY THING
F[x]/(x) = F gg
I WAS LIKE OK I FOUND A THING
lol
it is 0
rip
xdddddddddddddddddddddd
Lol
pls help
So actually
so it is 0
I was right
yes
XDDDDDDDDDDDDDDDDDDDDD
This does satisfy x^4 - x
lol
Okay actually so like this is also worth pointing otu like lol
wait what the answer is 0?
orbit sums give you 0 half of the time
fuck
lol
It’s just that the factor is x
i thought it was that quadratic
Not the quadratic
bruh wtf

gg
omg 💀
Chmowned
why?
potato
for all n
I need to find the elements of Q(zeta_9) that are fixed by <zeta_9 |-> zeta_9 ^4>
Oh lol
Isn’t this kinda like
All the zeta_9^k are independent over Q
For k = 0 through 8
lol
then think what else might be there
i mean isn't this an extension of degree 2
So write a generic element as a_0 + a_1zeta_9^1 + … a_nzeta_9^8
so you just need to find a single non-trivial element
yes
Apply the raise by 4 map
Equate coefficients
Or are the zeta_9^k not independent
Oh obviously not
?????????
Lmfaooo
like
hm
i wonder if this can just be guessed though lol like
That's what I tried and I ended up putting fucking 0 xddddddddddddddddddddddddddd
Wait
i mean think about it more
Are we talking about
Do you know Galois theory?
the elements of Q(zeta_9) that are fixed by <zeta_9 |-> zeta_9 ^4>
):
$\sigma\tau($i$\sqrt[4]{2}) = \sigma($-i$\sqrt[4]{2}) = $-i$(-\sqrt[4]{2}) = $i$\sqrt[4]{2}.$
Sapphire Gaming
interesting you did i in text
you can't pull out the -i like that
i mean fair
Try to find what this subgroup is first
sigma(-i ftrt(2)) = sigma(-i) sigma(ftrt(2)) not -i sigma(ftrt(2))
okay so like
you said the size was 3 i guess or smth and this is not correct
it isn't multiplication by zeta_3, it is taking it to the power of 4
Size of what
the group <zeta_9 |-> zeta_9 ^4> is of order 3
i just compose zeta_9 |-> zeta_9 ^4
so we don't go insane
yep
σ^2 sends zeta_9 to what
σ(zeta_9^4) = σ(zeta_9)^4
= zeta_9^16 ye
potato?
aren't you confused about order and index
ok I still got i ftrt(2).
no i'm not
Idk how you call it but like the big group divided by the actual group (the orders)
I just
do you want me to explain all my Galois stuff quickly?
yes, it's correct
Cool, thanks
np
Okay nah so basically Chmonkey and I got into some confusion but it's all fine now lol
Your working is fine.
the group is of order 3, so this is an extension of Q of degree 2
So we just need to find a single element not in Q
and the "obvious" thing (the orbit sum) doesn't work
I was making a paint ):
wait i'm thinking of this
are you using primitive element theorem
if K/F is an extension of degree 2 and x in K \ F, then F(x) is a subfield of K strictly larger than F which forces F(x)=K
so in fact to find the field you just need to find any element of the fixed field of <σ> which isn't in Q
And you can just guess one
Hi peeps, i'm trying to show that the restriction of a representation is still a representation. This is what I have. However my lecturer told me that the restriction of rho is not necessarily a linear map. I thought that restriction of a function preserves linearity. Why is that not true?
Also Christophe, if you want a more general approach @untold basin uh
Every $g \in G= \mathrm{Gal}(\mathbb Q(\zeta_n)/\mathbb Q)$ is given by sending $\zeta_n \mapsto \zeta_n^k$ for some $k \in (\mathbb Z/n\mathbb Z)^\times$ and in fact the corresponding map $G \to (\mathbb Z/n\mathbb Z)^\times$ is a group isomorphism which I think can help you like think about this
potato
Ah okay
I asked today
Well injection is easier and then the key thing is just showing that |G| = φ(n)
Which is equivalent to showing that the nth cyclotomic polynomial is irreducible
(do you know what those are)
Yep, except that we only defined the cyclotomic polynomial for n primes
I can explain, it's not gonna be helpful for this problem so it's not cheating lol
Ah okay
I got curious so I know it but it's not in my course
Ah okay
My prof said it's a lot of arithmetic
Oh like to prove it is irreducible?
Yeah it is a bit of a pain actually
Sad times
One thing that is relatively easy though is showing that the cyclotomic polynomials for p^n are irreducible
basically you just do the same argument as for p
But yeah the general case is a slight pain
(zeta_9)^7 ?
euh
forget
I am ded xd
a - 4a mod 9 = 0
(zeta_9)^3
o
m
g
i determined that Q(zeta_3) is a subfield
And i'm searching for it ?????????????????????
kill me xddddddddddddd
@south patrol thanks
wdym you're searching for it
Oh
lol
so you'd already found a proper subfield of Q(zeta_9)^sigma but lol xd
okay nice
Yeah zeta_3 was what I had in mind too
I'm having a bit of trouble with this exercise. I'll refer to \Gamma as G and \Gamma' as H.
In the hint, the first isomorphism follows from Shapiro's lemma. 6.9 states that the n-th cohomology of G with coefficients in the coinduced module M is isomorphic to the coinvariants of D (x) M where D = H^n(G, ZG). (Here, D (x) M has the diagonal G-action where G acts on D via g * u = u g^-1.) Finally, Exercise 4b shows that if G is finitely generated and [G : H] = infinity, then the coinvariants of any coinduced H-module is 0. Ultimately, I should be able to show that H^n(H, M') = 0.
I think what I need to do here is show that D (x) M is also coinduced, but I'm not too sure how to see that. I haven't used the fact that H^n(G, ZG) is finitely generated as an abelian group yet.
walter
But I don't think this uses the fact that H^n(G, ZG) is finitely generated so I'm not entirely sure
I'm pretty sure the above doesn't work because the bimodule structure doesn't work out the way it needs to
is there a property for algebras where all subalgebras its are finitely generated
because finitely generated algebras can have not finitely generated subalgebras
smells noetherian-y
🧐
except "algebra" could mean something non-associative, of course, depending on conventions and stuff
so... 
lie algebras btfo
i dont know how to make this distinction efficiently but here it goes
if the ring the algebra is over Noetherian but the algebra is not or vice versa and are either possible?
my guess is that yes the first is possible
it is possible to have an infinitely generated algebra over a noetherian ring but not a “noetherian algebra” over a infinite dimensional ting
where noetherian algebra means all subalgebras are finitely generated
and i guess yes the answer is that noetherian is this condition we want
also ig a side question is this
for rings S in R, krull dim S < R iff R noetherian?
these arent intended to be answered, sorry for littering thoughts
https://mathoverflow.net/questions/253283/algebras-whose-subalgebras-are-finitely-generated MO post on them
ty
Is this even possible? Isn't
\begin{align*}
<(2,0)> \oplus <(0, 2)> &= {(2k, 0) \mid , k \in \bZ } \oplus {(0, 2k) \mid , k \in \bZ} \
&= { ((2k_1, 0), (0, 2k_2)) \mid , k_1, k_2 \in \bZ }
\end{align*}
is what possible
DerpZ
<(2,0)> oplus <(0,2)> does not look like a subgroup of Z oplus Z
yeah direct product
direct product must result in a group
and that lives inside original group so subgroup
Anyways, this is wrong, think carefuller
its an
external direct product
that symbol is used in this book as the external direct product
huh
what difference does that make
isn't
the external and internal are the same up to isomorphism
oh they're asking about the isomorphism
if its external then it just means that product is isomorphic to some internal
I mean yeah <(2,0)> is isomorphic to <2>
idk wym
also, the last product has to be internal
otherwise it makes no sense
the object on the last line is not a group
not closed
oh
ie. some error
right right
yaeh I should've taken
x from <(2, 0)> and y from <(0, 2)> does that fix it?
huh
as in
in plainer words
G oplus H is just {(g, h) | g in G h in H}
book notation confusing sadge
in this context right

