#groups-rings-fields
406252 messages · Page 432 of 407
what’s the opposite of a follow-up? cause to me it is not at all obvious that that is galois, but we’ve basically not talked about infinite extensions
so excuse my ignorance if it’s something super basic
@solar wyvern by ^alg you mean alg closure?
it's generated by the limits of the frobenius
i'll let you work out what that is
(usually people will talk about K^sep instead of K^alg because K^alg/K is not galois whereas K^sep/K is)
If only the two notions coincided... that'd be perfect
@oblique river oooh
sorry I'm still not 100% clear on separable extensions but I read up a bit and think I know what they are
haven't you been asking about separable extensions for like the past week though?
yeah I'm retarded
if k^alg is the algebraic closure of k and E is some intermediate extension then [E:F]_s is the number of ways you can extend an embedding σ:k→k^alg to σ*: E →k^alg
does that work?
@oblique river it has been a pretty bad week, and apologies for the incoherent questions
if k is the base field then there should only be one embedding k --> k^alg right?
but in any case i think the definition is just "number of ebneddings E --> k^alg
idk why but conrad's notes and lang both define it as the number of ways you can extend an embedding (of the base field to a field containing its closure) to an embedding from an intermediate field E to a field containing its closure
I think the point was that for two embeddings from k to k^alg, the set of extensions of either is in bijection, so that indeed you only have to consider the embeddings E to k^alg
but once that's been shown it makes sense to only consider the embeddings
It's only the numbers of K-morphisms from L to Omega where Omega is an algebraic closure of K. ([L:K]_s) such morphisms exists by extending Id_K. And we can see that the extension is separable iff [L:K]_s=[L:K]. I don't think that its fine defining it as the number of way you can extend an embedding. Because it doesn't seem natural
If you have a separable extension E/k and k⊂F⊂E, is F/k and E/F separable?
@oblique river all embeddings from a finite field F to an (algebraic) extension are induced by applying frobenius to your coefficients, right?
applying frobenius shouldnt cause you to leave your field
so im not sure what you mean
Can't you consider elements of a finite field as a vector field over another finite field and apply frobenius to the coefficents?
yes you can but how is that goign to give you an embedding
i dont understand
are you conjugating yoru embedding by frobenius?
do what?
can you jsut say what you want more formally?
if E/F is an extension of finite fields
then Gal(E/F) is generated by frobenius
if you have an embedding K/F and K⊂E, can you extend it to E/F somehow
"embedding K/F"?
a ring map F→K
so you have F in K in E
so it sounds like F is already embedded into K
and K is embedded into E
so F is embedded into E
by your embedding composed with the inclusion from K to E?
yes
F --> K --> E
also if you are considering F as your base field then F is automatically embedded into any extensino of F
maybe I'm just doing this all wrong but if F is the base field then and A,B two fields over F then isn't an embedding t: A→B a F-linear map?
@oblique river
yes
then if A,B are algebraic over F you can identify elements α∈A,β∈B with the unique monic polynomials generating ker eval_α and ker eval_β respectively?
sure
but if you apply frob to the coefficients
thats basically the same as applying frob to ther oots
and frob cyclicly permutates roots?
yes
every galois group of finite fields is cyclic generated by frobenius
that's like the most important fact about galois extensions of finite fields
and everything else you need to know basically follows from that
What about Gal(F^{alg}/F)?
F^{alg} isn't a finite field
but in any case it's isomorphic to \hat{Z}
the profinite completion of Z
generated by frobenius
it's the inverse limit over n of the groups Z/nZ
I guess the other most important fact about finite fields is that there is a unique extension of degree n for all n
for each finite field A there's a finite field B such that [B:A] = [B:A]_s = n?
first of all, finite fields are perfect so every extension is separable
so there's no real need to talk about separability degree
but yes you are right
like I said, for any finite field and any positive integer there is a unique field extension with that degree
and the galois group is Z/nZ, generated by frobenius
(which is a bit stronger than just saying it's cyclic of order n. It's cyclic of order n but it also comes with a "preferred" generator)
sry can you fix that formatting
haha
can you see it now?
it still has weird italics
huh
and i'm not sure what you're asking
but in any case, yes, F_{q^n} is the degree-n extension of F_{q}
and the galois group is generated by the q-th power frobenius
I mean you don't really have a ton of options 🤷
even if you consider trancendental extensions of finite fields not much is different, right?
i mean there is almost no reason to consider something like F(x)/F
but if you're talking about using a transcendental extension of F as your base field
i.e. E/F(x)
then everything is different
F(x) is no longer perfect, there can be inseparable extensions
non-cyclic extensions
yeah the theory is more like the theory over Q
in its complexity
(in fact the theories are so similar that people group them under the term "global field")
global fields are completions of local fields or something?
what are global fields defined as then?
you're not going to be happy with this, but:
a global field is, by definition, a finite extension of Q or a finite extension of F_q(t)
I'm okay with this
that was my point earlier
they are so similar that people group them under the same umbrella
so this is dumb but just a yes/no question but are all extensions of Q separable? even trancendental ones
separability only happens in characteristic p
period
also
the word separable implies algebraic
nonalgebraic things aren't separable or inseparable
separable is only a word that applies to algebraic things
so no one really cares about things like separability for trancendental extensions?
that's like asking "so no one really cares about things like separability for covering spaces of manifolds"
it's just literally not a word that applies in the context of transcendental extensions
tfw your professor lies to u 
an element alpha is separable over K if the minimal polynomial of alpha is separable
if alpha is transcendental then there is no notion of separability
because there is no minimal polynomial
i guess you could think about like
if E / F is transcendental, then there is necessarily a transcendence basis {t_i} such that E / F(t_i) is algebraic
then you could ask if that extension is separable
but that just reduces to the finite extension case
which is basically the content of this: https://en.wikipedia.org/wiki/Separable_extension#Separability_of_transcendental_extensions
In field theory, a subfield of algebra, a separable extension is an algebraic field extension
E
⊇
F
{\displaystyle E\supseteq F}
such that for every
α
∈
E
{...
there's a thing on there which says E/F is separable iff F^{1/p} ⊗_F E is reduced
does that not work if E/F is trancendental?

let me step back for a sec
what is your goal?
like you've been asking about separability for a while now
and imo separability is a super technical and uninteresting thing
and you should only really get involved with it if you need it for somethign else
are you trying to do transcendental algebraic geometry?
i guess I should ask...what should I know about separability
for like a galois theory class
almost nothing
a galois theory class is only going to be concerned with finite extensions (at least for 95% of the time)
and you should know that it's a technical assumption that we need for galois-ness because it ensures that we have enough automorphisms
and it makes other stuff work, but you really should just let it stay under the hood
you should know that it's never a problem in characteristic 0 or for finite fields
is there any point where I might care about it?
"are you trying to do transcendental algebraic geometry?"
if you're doing any kind of geometry over finite fields it will come up
like elliptic curves or something
but not for a course in galois theory
i'm not trying to say that separability isn't important. it's just not important for a first course in galois theory
it's super technical
and not enlightening at all
it sorta came up in vakil so I was just curious
imo it's one of those things that you should only read deeply about if you absolutely have to
so basically once I already know basic galois theory pretty well already?
Separability isn't a key topic for intro to galois
for some reason separability qs are a huge part of our psets tho 
i will admit i'm not an algebraic geometer, but i am a number theorist, and literally all i ever need to know about separability is that "it means you're not taking a pth root in characteristic p"
i mean it shows up a bit but tbh i doubt you'll see it for a good while
yes darkrifts is correct
but you're probably right that I don't need anything fancy I guess?
it's really not something that you should be caring about for a first course in galois theory
I'm no algebraic geometer, but separability is largely separable from your academics for now
lol true
yeah i guess if I flunk out because of this I'll be pretty separated from academics 
lmao
are you taking a galois theory class right now?
no
I'd be doomed, but you're fine
@oblique river I guess one reason I was interested in separability is that separable extensions have a nice characterization in that they're in bijection with the ways you can extend an embedding (and this is invariant of your initial embedding), but for inseparable you have ways of extending an embedding....up to some multiplicity weirdness (not sure this is even invariant of the embedding you choose)?
yeah, for me i kinda think about that in terms of automorphisms
like if you have one embedding K --> E (all relative to some base field F)
then you can pre-compose by some element of Aut(K/F)
and so (under a normality assumption) that will give you all of the embeddings K --> E
so if you're separable, i.e. if Aut(K/F) is large enough, then you have lots of embeddings
ummm can you elaborate on the "if Aut(K/F) is large enough" part?
if K/F is normal, i.e. is a splitting field
then Aut(K/F) is in bijection with {embeddings K --> F^{alg}}
you're saying you think of separability in terms of how big the right side is
I think of it in terms of how big the left side is
which side is which 
the side on the left side of the line is the left side
:)
left side = Aut(K/F) and right side = {embeddings}
which is how you were saying you think of separability
yeah
Sorta wondered about this and hopefully there's a easy answer but for K/F normal (and separable i guess, so Galois), if you restrict the the automorphisms of K to F, will they actually all fix F?
Does $\theta \in Aut K: \theta|{F} \in Aut F \implies \theta|{F} = \id_{Aut F}$
flimflam:
@oblique river
when you say "automorphisms of K" what do you mean?
if you're talking about K/F normal and separable, it seems like you mean something like Aut(K/F)
in which case the answer is yes, by definition
k-linear embeddings of K into itself (which may not fix F)
where k is the base field
assuming k is the prime subfield of K (i.e. Q or F_p depending on char K)
then no
if K / k is Galois, and F is a subfield of K
then K/F is also Galois. If we assume that F/k is also Galois, then the "restrict to F" map gives a homomorphism Gal(K/k) --> Gal(F/k) that is surjective
(this is part of the "extending field embeddings" discussion: any automorphism F/k can be extended to one of K/k that restricts to the automorphism of F that you started with)
that's kinda the whole point of talking about extending automorphisms, so you can prove things like "that map on galois groups is surjective"
F/k might fail to be normal and therefore not be Galois?
yes
which is why I assumed that it was galois, equivalently, that Gal(K/F) is a normal subgroup of Gal(K/k)
(but it would be separable)
of course; subextensions of separable extensions are always separable
correct
is the compositum of normal extensions E/F,E'/F normal over the intersection E⋂E'?
compositum of normal extensions is normal, period
(normal over F, that is)
so it's certainly normal over E cap E'
What about if you have normal extensions E/F,E/F', will E/(F⋂F') be normal? sorry if these seem like gratuitous questions
nvm im dumb hahahahahaha
that is normal over Q
let me try again.......
actually it might be true
I can prove it if there is some subfield k over which E is galois
lang mentions that normal (and thus galois?) extensions don't form a distinguished class (sep, finite, fg, and alg all do), but I'm wondering if it just fails on the subextensions thing (which is the first criterion, whereas pushouts are the second)
and not pushouts (EE'/E⋂E')/pullbacks (E/(F⋂F'))
i cant think of a proof or counterexample off the top of my head
i'll think about it more as i go to bed (which is going to be soon)
thanks a lot for your help!
it's kind of an odd question for me because I'm always dealing with fixed base fields
yeah, I don't really have a good sense of things yet so sorry if this is all over the place
so like I said, if E/k is Galois and F and F' contain k and are subfields of E such that E/F and E/F' are Galois
then E/(F cap F') is also Galois
but that's not really exciting at all
because of course it's true: If E / F / k and E is Galois over k then it is Galois over F
(take my F = your F cap F')
so I feel like your statement should be false in general, and I want to construct a counterexample like
take some irreducible quintic over Q such that when you add a single root, the quintic factors into a linear factor (corresponding to that root you added) and two irreducible quadratic factors
then maybe if you add in one of the roots to oen of the quadratic factors, the other quadratic factor doesn't split
okay, I'll take a shot at that too then
for irreducible quintics, there are only 5 possible galois groups
S_5, A_5, D_5, C_5, and F_20
where F_20 is some weird-ass group
F_20?
frobenius group?
yeah
so out of those 5 options, I think the F_20 one is most likely to give a counterexample

thanks
"Let E/F be some finite field extension. Then it'd either Galois, or it's not. Let's look at a third possibility" 
(it was "not galois, but contained in a galois extension")
@solar wyvern i just figured it out, it's true
let k = F cap F' and let M be the normal closure of E over k
then let A = Gal(M/F) and B = Gal(M/F') as subgroups of Gal(M/k)
and consider C = Gal(M/E). By assumption, C is normal in A and normal in B, because E is galois over F and F'
thus C is normal in AB = Gal(M/k)
and so E is galois over k
(and so M = E the whole time)
also I am shamelessly assuming separability so that I can use galois theory
i am okay with this. surprised, but okay (i was also assuming separability throughout).
i still feel weird about it
i feel like maybe i made a mistake that i'm too tired to see
I should be able to double check this right?
I will try anyways tomorrow when I'm more awake
same
good night for real now
(this seems to confirm it https://math.stackexchange.com/questions/1780998/galois-extension-of-intersection-of-fields but i'm still interested in the case where you only assume normality)
X^4+X+1 is irreducible in F2 right?
and so is X^3+X+1?
is X^n+X+1 always irreducible in F2 for n>=2?
@key if it was reducible it would have a root yeah? What's 0^n and 1^n 😃?
@open mist that's not true. Look at the picture just above
lovely, back to analysis for me
What's the difference between irreducible and prime?
Irreducible means that it cant be written as the product of two non-units. Prime means that if p | ab, then p | a or p | b.
In a domain prime implies irreducible
prime implies some sort of unique prime factorisation doesn't it?
primes are fun
Does anyone know some good examples of applications of the first isomorphism theorem?
for groups or rings or vector spaces or what?
Groups
basically if you ever want to prove something like "G/H is isomorphic to K", the way to do that is find a surjective homomorphism G --> K whose kernel is H
and then by the first iso theorem, the image (which is K) is iso. to G / kernel (which is G / H)
Ah, okay.
ok
hmmm
i have a colouring problem
this is my shape
Find the number of essentially different ways this can be done when there
is an unlimited supply of pieces in each of n colour.
it can be rotated and flipped
orbit counting theorem in D4?
@covert vector would it just be 1/|D4| * sum of |fix(g)|
I'm just trying to be sane here
Let w be the 3rd root of unity
So w-bar = w^2
Now for any a, b integers,
We have (a + bw)-bar = a -b -bw, right?
-bar means complex conjugate
$\overline{a+bw}=\bar{a}+\bar{b}\bar{w}$
oof
how do you get that result @uncut girder
\overline
yeah
Liquid:
Compile Error! Click the
reaction for details. (You may edit your message)
um
that's clever
are a, b real?
yes; theyre integers
$1+\omega+\omega^2=0\implies \omega^2=-\omega-1$
Liquid:
Compile Error! Click the
reaction for details. (You may edit your message)
so yeah, you're right
quick urgent question
how does one work out the order of a permutation
@covert vector 😮
well that has order 6
cuz it has length 6
you need to write it as a produce of 2-cycles
then count how many are in the product
yes
this module is a very random module
covers group theory and also modulos but also proofs by induction
fixed
@solar wyvern are you trying to confuse them???
no
why talk about Z-modules then :P
they're nice examples of modules besides vector space stuff 
why are you talking about modules at all though, they're obviously in a more intro class and haven't gotten to modules yet
I'm sorry 
(did you read "modulos" as "modules"? hahaha)
hahahahaha
also you're fine, there are people in this server who are really bad though
it's like "oh you're learning about group theory? let me flex on you with some words and jargon that you have never heard about before"
Let G be any group order 17
then if g in G is not e, then why must it have order 17?
if an element has order n, then the elements {e, a, a^2, ... , a^(n-1)} form a subgroup
take it from here, @chilly ocean
yes, because of the statement I just said
oh
yeah
sorry
brainfart
🤦
order(g)=|H| ?
its a bad way of describing it
but that's sorta it
?
|G|=m|H|for some integer m where m is the number of left cosets in H
because 17 is prime, H is either the trivial subgroup or G
introduce your objects properly. before you can claim ord(g) = |H|, you must say what H is.
for g in G and x in X
orb(x)={y in X : y= g✶x}
stab(x)={g in G : g✶x=x}
fix(g)={x in X : g✶x=x}
send_x(y)={g in G : g✶x=y}
... what are you on about now
...what do they have to do with the subject at hand?
haha
these are all part of the same module for me
stab(x) must contain the identity element because stab(x)={g in G : g✶x=x}
and e*x=x
are you just hopping randomly from problem to problem or what
?
am i mentally stable in numbers and groups
😄
if y is in orb(x) , then x is in orb(y)
This is true because orb(x)={y in X : y=g✶x}
y=g✶x
x=g^-1✶y
so x is in orb(y)
because g^-1 is in G
But I do have a question now @random crag
why is the sum of |fix(g)|=sum of |stab(x)|
I can kinda see it but cant explain it formally
are G and X both meant to be finite
yes
consider the set $F = { (g,x) \in G \times X \mid g * x = x}$
ok
Ann:
oh wait, yeah I think I get it
fix(g) and stab(x) are just the set of pairs of (g,x) that produce g*x=x
right?
well one is the set of g
and the other the set of x
there are two ways to count the elements of F
sorta.
boy i love colouring problems
a^(p-1) == 1 (mod p)
only if a and p are coprime and p is prime
chinese remainder theorem
if x==a1 (mod m1) and x==a2 (mod m2)
where a1 and a2 are any integer and m1&m2 are coprime
then their solution is in the form (mod m1m2)
Does |G|=|G/H||H| even if H isn't normal?
it is, but is |G/H|=m?
the question is does |G|/|H|=|G/H| even if H isn't normal?
yes, provided the numbers make sense (ie aren't infinite)
what's [G:H]?
what's a coset? xD
...how can you know of normal subgroups and not know what a coset is?
oh
i just looked on wikipedia
so yea, basically you divide G into |G|/|H| many sets of size |H|
and call the collection of those sets G/H
and if H is normal, you can give G/H a group structure
Is it possible to have two six-cycles whose composition is a cycle of
even length?
no
why
sgn(ab)=sgn(a)sgn(b)
yes
^
even cycles have signature -1, odd cycles have signature +1
wait what
shi
shit
thank god for you Ann
😛
so the square of any cycle is always odd?
if by square you mean for composition then yes
uh
@hollow peak oui
a n-cycle has signature -1 if n is even
there's a bit of a discrepancy here
in that an even-length cycle is odd as a permutation
& vice versa
permutation a
sgn(a)=1 if it is even ( made up of an even number of transpositions)
a transposition has signature -1
and a n cycle is the composition of n-1 transposition
so a n cycle has signature (-1)^(n-1)
ok
random tangent
fermat's little theorem
a^(p-1)=1 (mod p) if p is prime and gcd(a,p)=1 (a and p are coprime)
5 always divides (n^4 -1) as long as n is a positive integer that is not a multiple of 5 because
n^4 -1 = 5m
n^4== 1 (mod 5) by fermat's little theorem
if p is prime then, all non 0 element verify a^(p-1)=1 in Z/pZ
okie dokie
what exactly is the subgroup S_A
rotations and reflections from O_2 such that they don't change the elements?
Almost
😮
The ones that don't change the set
But maybe that's what you meant
A not a
ok
so it is a subgroup because
sg1) rot 0 is in S_A so S_A=/= empty set
hmm
idk how to show sg2 for it
but i feel it is obvious
Yeah, you just use the definitions basically
You can work with equations of sets in similar ways as you would with elements
rot(a)ref(b)=ref(a+b)
But if that troubles you you can just look at single elements of the set-equation
And see how that equation translates to single elements
Sure there might be
what sort of reflection would keep f(A)=A
If A was a circle or a square for example
i feel like im missing something here
There are sets with -A = A
That are not empty
Think about what that means for a moment
If a set contains the negative of all elements in it
Like the set consisting only of plus and minus 1
okie
That's invariant if you mirror it
But the set stays the same
That's how the two notions are different
You could ask that the elements don't change or that the whole set doesn't
But the former is extremely restrictive
It's a bit weird to think about it for the first time tho
Yeah
If you're not just looking at the origin
I think I understand this Q
just wanna confirm stuff
H_1 is not a subgroup because it does not have the identity element id where id(1)=1
H_2
SG1) id(1)=1 therefore id is in H_2 so H_2=/= empty set
SG2) let a(1)=1 & b(1)=1 where a,b are in H_2
ab(1)=a(b(1))=a(1)=1 so ab is in H_2
SG3) what do I do?
oh shit
erm
let a(1)=1 where a is in H_2
a^1(a(1))=a^-1(1)
a a^1(1)=id(1)=1=a^-1(1)
a^1 is in H_2
what about H_3
id^2=id so it is not the empty set
sg2 hmmmm
Assume k is a field of characteristic p such that the frobenius homomorphism φ is not surjective. If y is an element which is not in the image of φ (i.e. there is no x with x^p = y), then I claim the polynomial X^p - y is irreducible. It’s clear it does not have a root, but how can I argue that it doesn’t split otherwise?
note: I don’t know if this statement is actually true. but it’s the only idea I have for this proof
(I need to show that frobenius hom is surjective iff every poly of the form g(X^p) is reducible)
@somber bramble you wouldn't by happen to know anything about proving sg2 doesn't work for H_3 in the image above would you?
I’m busy with my own stuff rn
sorry
I don't know what Sn is but sg2 is not true in general for this group I'm pretty sure
Or actually
Lol
No it is true but it's a little tricky
Try to show that the subgroup must be commutative
Or wait
Ah I'm so confused
so it's clear H_3 is not a subgroup because sg2 fails , right?
but finding an example of this is a bit hard
Yeah
Basically you need two 180° rotations which don't commute
Can that happen? I'm not sure right now
rotations?
oh yeah its S_N
S_n
whoops
as long as I get like 60% on the exam I'm fine lol
here's a random one
i)true because groups must be closed
ii)true because a group must have an identity element
iii) and iv) idk how to explain
v)true because all h in H must also be in G
vi)true because legrange's theorem says |G|=m|H| . ie |H| must be a factor of |G|
vii)true because legranges theorem says |G|=m|H| where m is the number of left cosets in H, and if |G|=15 and |H|=5 then m must be 3 as 3*5=15
viii) I have no idea
ix) no idea
x) false G can be abelian if a(.)b=b(.)a
@somber bramble if it was reducible, then it would have to factor. What would the constant terms have to look like?
hm, so we’d have $(X^k + \dots + a)(X^l + \dots + b)$, where $ab = -y$ and all the other products of the coefficients would have to cancel, except for the initial one
Sascha Baer:
i only care about the constant terms, and you can say more about a and b
how does the polynomial factor over the algebraic closure (or even over its splitting field)
you tell me :P
ooh, and then the constant terms would have to be a^k and a^l (for some k, l summing to p), but we’ve established that a doesn’t exist in k, so that’s impossible
wait, is it impossible
just cause a isn’t in k doesn’t mean a^k isn’t in k
(…I’m bad at variable names)
(maybe don't use k for an integer and a field :P)
you're on the right track
in this case it is true that "a not in k implies a^n not in k when p doesn't divide n"
oh, but if a^m was in k, for m coprime p, then we can get a in k as well, by uh, raising that to the right power
yes
aight, I think I can take it from here
I’ll have to fill in some details but it seems doable
thanks :)
np
actually, got any hints for the converse (if frobenius is surjective then for g(X) is irreducible, g(X^p) is reducible)?
I couldn’t really get anywhere there either
what is g(X^p)^(1/p)?
(raising to the 1/p power is taking inverse frobenius. here you will use that it is surjective.)
For part a please tell me if this proof is correct:
Let a1, ..., an be an F-linear basis of K1.
Then K1K2 ⊆ K2(a1, ..., an) and is a finite extension of K2 of degree at most n.
So [K1K2 : F] = [K1K2 : K2][K2 :F] ≤ n[K2 :F] = [K1 : F][K2 : F].
@oblique river oh my god, I had the decomposition written down and didn't see it
Let k be an algebraically closed field, f a polynomial in n variables over k. I want to prove that the map $\tau: D(f) \to X_f: (x_1,\ldots,x_n) \mapsto (x_1,\ldots,x_n,f(x_1,\ldots,x_n)^{-1})$ is continuous with respect to the Zariski topology
edelopo:
I have no idea how to do it
I have tried just following the definition but I get stuck
Actually what I want to prove is that its inverse (which is just the first n projections) is a homeomorphism, I don't know if it can be done without proving directly that tau is continuous
I'm trying the simpler case where I just take $x \mapsto (x, x^{-1})$ and I can't even do that one
edelopo:
<@&286206848099549185>
what's X_f
Oh, sorry
$X_f = { (x_1,\ldots,x_{n+1})\ |\ f(x_1,\ldots,x_n) x_{n+1} = 1 }$
edelopo:
So it is like saying R\{0} is homeomorphic to a hyperbola
hmm
what's the defn of zariski topology
zero sets of polynomials are declared closed?
Yes
I tried going down that path but got stuck
Now I'm trying to prove preimage of open is open
sounds harderto me
And we know that the D(h) form a basis for the topology
I proved that in the first part of the exercise, so maybe it is there as a hint
Is it worth it to learn homological algebra before reading Atiyah MacDonald? I realize that it's definitely not necessary, but he makes references to the Tor functor in the exercises and I was wondering if it would be nice to know
@mild laurel probably not on a first read-through
Is it accurate to say that the conjugation class of an element is it's orbit under conjugation, and the centralizer being the elements stabilizer under conjugation?
yes, I think that’s right. at least it sounds right to me
Nice, I sadly have to speedrun this algebra course so I just want to make sure I didnt miss some important distinction somehow
what’s WR?
Idk, my goal is a PB of a bit under a month
This is almost a competition math question but...
Suppose a)b = s remainder p (this means grade-school long division) and c)d = q remainder r. What is ac)bd?
@oblique river Do you mean on a first read of Atiyah MacDonald?
you probably want to use / instead of ) @bleak finch
and yes, this should be in competition math or elementary number theory
@mild laurel lol i tried (only a little) learning homological algebra for the same reason, when encountering those exercises in AM
not worth it tbh, imo
granted I also don't know much about ext/tor, so I can't rate its usefulness
but atiyah macdonald has tons of interesting stuff, would be lame to put it on hold
Yeah that's how I feel. Seems like there's as much to learn from the exercises as there is from the actual text itself and it'd be nice to know that stuff
homological algebra seems like something I'd like to learn eventually anyways, but it also seems like something that might be better to learn after learning some algebraic geometry
homological seems interesting but beyond me
@mild laurel yes that's what I mean
it kind of has a different feel than commutative algebra
of course there are links but I think you should just focus on the commutative algebra part
Give me a hint
For finding the inverse of a formal Laurent series
Sum_{i>=n_0} a_i (x-a)^i
Coefficients in C
I know this much:
In the last 3 lines I'm trying to find conditions for the inverse of f
@uncut girder didn't I show this to you once?
No
Yes
You can get rid of the tail
In an obvious way
I think that's the first step usually
Multiply by (x-a)^(-n_0)
Does it have a nice solution
The units of the formal power series are the power series with a 1 in it
ie a_0 +a_1(x-b)+....
Where a_0 is nonzero
It does have a nice solution
Find the inverse of that
And then you can convert any (nonzero) finite tailed laurent series into a formal power series of that form
Interesting
Like I'll give you an example
1+x+x^2+...
We need some b_0+b_1x+... So that when they multiply together you get 1
So b_0=1
Then that gives you b_0+b_1=0
So you can get b_1
The point is you have a sequence of linear equations with one free variable in each, so they all have solutions
and you can solve them in sequence
Yes
Well
well it can get annoying, but it’s never hard
Not generally
hm? you can write a general formula for the coefficients
Oh yeah, I guess you can
I should have it somewhere even
I just prove that solutions exist and that's enough for me
@uncut girder does that make sense
Yeah, that looks right
that’s assuming they’re both power series, i.e. no coefficients with 1/x^k
but you can just multiply stuff out so that’s w.l.o.g
Yeah, we already discussed that
As long as we're only dealing with finite tailed Laurent series
I didnt think of reducing to power series
there’s clearly a mistake in my formula, i should only range to k-1
Oof
but otherwise it’s fine
I like the ring of formal power series a lot
It has the property that every proper ideal is ring isomorphic
(if you consider rings to not have 1)
(which I do)
smh rings without 1 don’t deserve to have an i in them
I don't like the name rng
I‘ve seen some author use ryng for when we’re being agnostic as to whether it has a 1
I usually say ring with unity
That's really cool
That actually also follows from our procedure @uncut girder
I mean wats cool is how the inverses work
Ah ok
Yeah it's nice
We had to figure out the inverses for a hw from grad alg 1 in the fall
More specifically we had to figure out all the ideals of the ring of formal power series over a field k
But that just came down to figuring out the inverses
in my experience, whenever people say "ring" they mean "with unity"
very very very rarely do people (in number theory or adjacent algebraic fields) consider rings without unit
in general terminology comes out of necessity
because people so rarely consider rings without unity , it doesnt make sense really to call those "rings"
Yeah all rings without unity are isomorphic to an ideal of a ring with unity so it seems weird to study rings without unity
Wait really?
I knew that aside from maybe harmonic analysis rings always have unit but I didn't know that those without are isomorphic to those with unity
Isomorphic to an ideal in a ring with unity
It's actually a cool exercise to show this
I learnt something new.
can you just do something like
if R doesn't have a unit
consider R + Z with some multiplication operation to make (r,0) * (0,1) = (r,0) or something
then (0,1) is the unit of the ring
(and then (R,0) is an ideal in this new ring that is isomorphic to R)
okay maschke's theorem was neat
Can anyone clarify the meaning of a ring ideal written as <2,x>, or some other comma-separated, multiple-element nonsense?
It keeps showing up in my text and I can't find where it's actually introduced
Nevermind, found it on stack exchange.
for future reference, post the answer if you've found it in case someone reads this and wonders the same
it's the ideal generated by those elements, which I think one can represent as all R-linear combinations of those elements, or as the intersection of all ideals containing those elements
Actually on second look, I'm not sure if there's a difference between (r,s) and <r,s>. I think what you're describing is
(r,s) = {xr+sy | r, s in R}.
But a different thing I'm looking at is
<2,x> has powers of x tossed in, not just linear. https://math.stackexchange.com/questions/36169/show-that-langle-2-x-rangle-is-not-a-principal-ideal-in-mathbb-z-x
well, yes
here, R = ℤ[x]
so it would be ℤ[x]-linear combinations
e.g. (3x³ + 2x² - 4)*x + (5x⁵ - 3x)*2
where the polynomials in the parens are the coefficients
it's kinda hard to explain if we don't know where to start @stray nexus
what is your question?
otherwise I suggest you read it up in books, there are plenty...
so i know what group theory is, but i dont know what field theory is. and galois theory is supposed to somehow connect those two theories
im searching for videos about field theory atm
but im still confused
havent found a good video yet
Abstract Algebra by Thomas W. Judson and Stephen F. Austin looks good i suppose
it covers the basics
or abstract algebra by Irwin Kra
thank you for the book reccomendations^^
Topics in algebra is nice
Dummit and Foote is good as well, also artin
Lang if you think you're a big boy
@stray nexus
These are just the standard recommendations though
@stray nexus galios theory concerns field extentions. It turns out field extensions are closely related to polynomials in an indeterminate variable x. The polynomial is like a relation, and the roots of the polynomial are new elements that satisfy this relation. This is just the first step in a long line of steps before you can talk about the correspondence between field theory and group theory, but hope this helps you get a sense of the start.
Lang seems to get recommended a lot here. Now I'm tempted to open it
is Fraleigh a good abstract book
Is it possible to prove a set can not be a group without knowing the binary operator?
no
Not in the general case
So I wouldn't be able to prove that the set of positive and negative odd integers in Z together with 0 do not form a subgroup?
Question in the book is phrased pretty poorly if that's the case
can you show the exact problem statement
Alright if I cite it exactly?
that's exactly what i want you to do
(a) ...
(c)...
(d) the set of positive and negative odd integers in Z together with 0
a-c do not give relevant info
I don't see any super group to compare too, unless I can assume Z to be the additive group
just about any time Z is brought up as a group you endow it with addition as the operation
The 0 element kind of hinted at it
I was able to solve c without knowledge of what the binary operator might've been, so figured it was an interesting question to ask whether there was some general theorem behind it
!t,rep @fickle brook
I guess we could always biject Z to Z in such a way our operation seems like it's additive
🤔
Every cyclic one is isomorphic to z though
and every subgroup of a cyclic group is cyclic as well 👀
Yes
And every subgroup of a free group is free
What's the symbol used to denote a mathematical object has a particular property, if there is any?
I don’t think there is any general one (how would you even notate that in general with a symbol?) but there might be stuff for more specific things
if you’re thinking of sth particular
don't chase symbols
@fickle brook I feel like it's a common enough expression it would be nice to have a symbol for
as sascha said there exist symbols for particular relationships and/or properties
But there is no "has a" symbol like comp sci has for xml diagrams?
no
pity
what are you trying to say rn anyway
So
The nilradical of a commutative ring is the intersection of all prime ideals.
The Jacobson radical of a commutative ring is the intersection of maximal ideals.
Now since all maximal ideals are prime, we can conclude the Jacobson radical is contains the nilradical, right?
So taking intersections of sub families reverses the order of inclusion.
Do you mean to say contains or is contained?
Contains
Yeah that's true
Ok 👌
Why are radicals called radicals btw
Cause exponents are radicals?
radix means root in Latin @uncut girder
Interesting
Radical means "forming the root"
Nilradical would mean forming the root of 0.
Jacobson radical would mean forming the root of Jacobson.
"In ring theory, a branch of mathematics, a radical of a ring is an ideal of "not-good" elements of the ring."
So radicals can also be interpreted as badguys
Explains why all the good girls like abs alg
I'm having trouble proving in A[x] where A is commutative ring, the Jacobson radical equals the nilradical.
Omg it's so frinking simple
Just had to use x 
I can't believe I spent hours on this
Atiyah MacDonald? @uncut girder
Yes
Slow grind through the exercises
There are 28 exercises in chapter 1
I'm meeting with my prof on Monday and trying to do as many exercises as possible
Yeah I've also been reading through the book with some friends
It's been a lot of stuff like that, taking hours for a problem, then realizing it's super straightforward
Right????!?
@uncut girder AM is very very nice but I find it somewhat dry. It is super condensed. My suggestion would be to keep on reading it but maybe have a side book that you can refer to when something is not clear
For instance AM leaves all of the geometry to the exercises, but it is very illuminating for some concepts
Yes, but all of the stuff you are studying has a counterpart in algebraic geometry
For example take the ideal quotient (I : J)
Reading that from AM left me very confused
I see the point but...
But the cool thing is that it corresponds to set difference
So if you have two affine k-varieties X, Y, then (I(X) : I(Y)) = I(X\Y)
Maximal ideals correspond to points in affine space
And then you generalize to Spec(R)
I don't know
I guess there can be arguments for both
But I feel that keeping the geometry close is quite helpful
Yeah it's described in the exercises pretty well
And it's pretty cool discovering it for myself rather than just having it told
I've heard there's a book by Altman and Kleiman called "A Term of Commutative Algebra" that's basically Atiyah-Macdonald but more modern
I can't find this on Amazon
Library Genesis is a scientific community targeting collection of books on natural science disciplines and engineering.
Actually don't get it from libgen, the most recent copy is available freely
There are so many circling around on the internet
Yeah, I found a copy on my first Google Search
But from my investigations I think the most recent one is this: http://www.centerofmathematics.com/wwcomstore/index.php/commalg.html
There is no shortage of books on Commutative Algebra, but the present book is different. Most books are monographs, with extensive coverage. There is one notable exception: Atiyah and Macdonald’s 1969 classic. It is a clear, concise, and efficien
It's slightly too big for me to send the pdf directly
But it's free to download if you make an account on this website
So all of AM's exercises are in this book with solutions in the back
It would be nice if I could find it in my library
is big
dummit of anykind is good
Big is beautiful
Have any recommendations for other books on topics Dummit has written on?
Well the point is that you read it, get bored, fall asleep, drop it on your toe, and say "Dammit my foot"
loooooool
There's a MO post on errata for AM
Anybody need any help with abstract algebra?
just hang around this channel and questions will pop up
what are called polynomials modulo n
polynomials with coefficient in $\mathbb{Z}_{n}$
boilhats:
cause I want to search something about them but I can't find it's wikipedia page or relevant search results
$\mathbb{Z}_n[x]$
Zopherus:
$\mathbb{Z}[x]/(n)$
Liquid:
Compile Error! Click the
reaction for details. (You may edit your message)
$n\mathbb{Z}$ isn't an ideal in $\mathbb{Z}[x]$
Zopherus:
That's true
Liquid:
Compile Error! Click the
reaction for details. (You may edit your message)
Question, i'm trying to construct an isomorphism between $\qty(\mathbb{R},+) and \qty(\mathbb{R^+,\times})$
barrackollama:
u know there's an analysis channel for analysis questions 😢
actually probably more analysis now I think about it xD
So, prove in general that a bijective homomorphism is an isomorphism
although you're proving it's an isomorphism
Or just use the inverse that you know exists
I mean
isn't that circular?
yeah i proved that a bijective homomorphism is an isomorphism
i'm trying to prove that e^x is bijective
If you have a function with an inverse it's bijective
another way is by showing e^x is strictly increasing
ah i haven't thought of that
And log(x) is a function that's just known to be a thing
wonder if there might be an inverse exp function...maybe some sort of logarithm
and i haven't proved the inverse exists
xD
so i don't feel comfortable using it
(do it then)
i'm doing that by proving it's a bijection lmfao
If this is an algebra class I'm sure you've proven before that log is a thing that exists lmao
it's not a class
I like this route
i'm self teaching algebra
Like I don't think the point of the exercise is constructing log so much as understanding that e^x is a hom
showing exp(x) is a bijection
Oh
then showing ln(x) is the inverse
although, the increasing argument only works for real variables
but that's what you asked soo
This is the real case lmao
yeah
I'm pretty unfamiliar with what the "rules" are for proofs
Like... if i know the inverse can i just use it? or do i need to prove that i can? idfk
If you know it sure
but sounded like you didn't prove it o: so you could prove it, or find another method (or both)
I mean, if you really want to do this thoroughly, you'd construct the exp function
agreed lmao
on Q
if you're coming from an algebraic perspective
extend to R
it's a good habit to show injective/surjective
havent done orbits in a while