#groups-rings-fields
1 messages Β· Page 35 of 1
Yes, but it would probably be more straightforward that we know the polynomial has 13 different roots in C -- they're evenly spaced on the unit circle.
right
I mean, a derivative argument does work: The only point where the derivative of z^13-1 vanishes is z=0, but z=0 is not a root. But the derivative does vanish at a multiple root. So there can't be any multiple roots.
yeah
okay thanks
on that note
why do we know that if the minimal polynomials of the 'extended elements' in a field extension are separable, then the field extension itself is separable?
ah wait
it's simpler
we can use the fact that Q is char 0
every irreducible polynomial is separable in char 0
so every extension over a char 0 field is separable
got it
Not obvious at all that you joined on an alt after getting muted, you couldβve at least phrased the question differently. I saw the unedited version
here π€π©(π) is the general linear lie algebra, made of πΓπ matrices of complex number entries
π²(π) doesn't seem to be a vector subspace, because it's not closed wrt scalar multiplication?
For πβπ²(π), π§ββ,
(π§π)α΄΄ = π§*πα΄΄ = -π§*π
but we want (π§π)α΄΄ = -π§π somehow
I'd recommend you use latex here on discord, it's way easier to read
$π²(π)$ doesn't seem to be a vector subspace, because it's not closed wrt scalar multiplication?
For $πβπ²(π), π§ββ,$
$(π§π)^\mathrm{H} = π§^*π = -π§^*π^\mathrm{H}$
Mattuwu
Itβs a real subspace
this says -z*X = -zX, so you want z = z*...
Ahh that makes much more sense
My lecture notes has the convention that everything is over β, it might have missed a note here lol
Yeah so this is the Lie Algebra of the unitary group which is matrices with MM* = I
So it doesnβt form a complex vector space kind of heuristically because the conjugate isnβt holomorphic
Which well, showed up again in your computation
@chilly ocean @next obsidian thanks 
question on proving G is abelian if G/Z(G) is cyclic, for the trick showing elements of G can be written of the form x^mz where x \in G and z \in Z(G) is the following correct logic
as G/Z(G) is cyclic there exists an x \in G such that G/Z(G) = <xZ(G)>
then if g \in G we have gZ(G) = (xZ(G))^m =x^mZ(G) and as Z(G) \leq G is a subgroup this holds iff gx^-m \in Z(G)
i.e.., g = x^m z for some z \in Z(G) and some m \in Z^+
are you TAing an algebra class?
No, these are from when I took an algebra course
Yes, I took an algebra course in fall 2022

are you taking the algebra qualifying exam
No
what year are we again?
My semester ended in early December
To be really precise , its x^-mg \in Z(G) , but in this case it doesn't really matter.
potato :o
G/Z(G) is cyclic, then G is abelian.
Why?
The proof was understandable but I'm probably slow.
Says: Assume G/Z(G) = <h>, G = union of h^kZ(G)
because every element of G can be written as x^mz where z is in the center
The point is if it's cyclic then it's already trivial
Since every two elements only differ by multiplication by an element they BOTH commute with
So like, for every g,h we have g=x^m h, and we are guaranteed that h commutes with x, so it commutes with g as well
how did you get g = x^m h? :(
that's what my doubt was
G/Z(G) is the group of left cosets right?
Yes
We have that for any element, it's of the form x^m z for some z in the center
So take any two elements, they're of the form g=x^m z, h=x^n z'
Yea I forgot a prime
hmm? of the form x^m z and not x^m ?
lol
You're looking at a coset
Or rather a member of a coset
So you get that g and h both differ by elements they both commute with
Since the x^m, x^n commute with each other and z,z' commute with everything
hmm
This wouldn't work if the quotient was only abelian, because while the elements would commute modulo the center, they wouldn't necessarily commute in G
When it's cyclic tho all the elements are just powers of x modulo the center so they have to commute in G as well
What is the group U(2) and SU(2)?
I was asked this:
Compute the center of U(2) and prove that U(2) = SU(2).Z.
unitary and special unitary 2 by 2 matrices
which are?
complex square matrices such that the conjgate transpose is the inverse of each matrix
SU i think is those with determinant 1
What have you tried
Gimme a min.
Is there a way to quickly show that π±(3), the Lie algebra of upper triangular matrices of size 3x3, is not semisimple?
I currently am trying to compute its killing form using πΈα΅’β±Ό's and show that the killing form is degenerate.
I'm trying to write the group with their properties but it doesn't look like working
I'm supposed to find a general X that satisfies AXA{-1} = X
so I wrote that down
ohhhh so I take samples of U(2) to check for characteristics of center
Ah only need to spot this:
βπ β π±(3), π
(π,π) = tr(0) = 0
Right.. so I used matrices [{1, 0}, {0, i}] and [{0, i}, {1, 0}] to figure that the center would be matrices aI where I is the identity matrix. Now, what's the second part of the question asking for?
I don't understand what's the SU(2).Z. mean ... is that a typo maybe?
use that G/Z(G) is cyclic iff it is trivial iff G is abelian
this should help you show that it's not nilpotent
for solvable, use that for a group, if both G and G/N are solvable, then so is G
Hi guys!, i've got a question, assume that $R$ is a PID (i'm not sure if this is needed, but in my case i'm working with a PID) first i have that $R[x] \cong R^{(\mathbb{N})} $ and $R[x_1,x_2] \cong (R[x_1])[x_2] $ and i need to do this recoursively (i do not know if that word exists) for $R[x_1,x_2,\dots , x_k], k \in \mathbb{N}$. Do yo have any ideas for this
galois.theory
sry
R[x1, x2, x3] = R[x1][x3][x2] or whatever you want
all of these are naturally isomorphic
like generalize that for any number of variables
how do you define these objects in the first place. the proof is really dependent on the definitions
ig your definition of R[x] is just R^(N)
i.e. sequences in R where all but finitely many terms are 0
and you identify x with the sequence (0, 1, 0, 0, ...)
Isnβt this like
just the definition of normal
The degree of the extension is the same as the degree of that min poly
So it is the splitting field cuz it has all the roots
And the splitting field couldnβt possibly be any smaller
so the definition of normal means minimal poly of every element in the extension splits completely
can you explain please? I'm really new to this and it's hard trying to understand by myself
okie so since you wanna show that the group is not nilpotent, it's enough to show it's non-abelian and the center is 0
that way the sequence of subgroups you get will always stay constantly 0
Right, yeah
so non-abelian is given to us
and if Z(G) was non-trivial, then G/Z(G) will be trivial or will have prime order
which means it's cyclic
but this is a standard exercise that if G/Z(G) is cyclic, then G is actually abelian and this G/Z(G) is trivial
the proof is pretty straightforward check
say that cyclic group is generated by the class of g
so any element in G can be written as g^n * z where z lives in the center
now simply check it's abelian :3
i do wonder if this G/Z(G) cyclic => trivial thing generalises to anything else
(g^n * z) * (g^m * z') = .... = (g^m * z') * (g^n * z)
Guys can I ask something non acadmic :c
(here everything commutes with everything else, which is why we can do this
yee sure

Am I allowed to retake the course in the following sem or what-
or right away removed from the course 
this is more a question related to your university
than something anyone here can help you with
but uh usually universities let you retake
what's the general procedure though ... hmmm I see
but otherwise I would talk to some academic advisor
I could not say anything more, cause I probably do not attend your university
ty I'll see
Q) The additive group of rationals cannot be written as a semi direct product of two proper subgroups.
Why? 
wait, so a non-trivial semi-direct product would give you something non-abelian
so you're essentially asking why we can't write Q as a direct sum of two proper subgroups
mhm mhm
and this is then easy because any two non-trivial subgroups of Q will intersect non-trivially
if a/b is in one and p/q is in the other, then both subgroups contain ap
so one of subgroups would be 0 which would force that the other subgroup is the whole thing, so isn't proper

not wishing I could exchange brains with det for a day
Q is a field not a group, this is too confusing 
All non-trivial subgroups of Q must contain a non-trivial subgroup of Z, and the same result can be said of non-trivial subgroups of Z. Interesting.
this took me some time to think lol, i was initially hoping that A+B = Q would imply that either A or B is Q... but you could take A = rationals with denominator a power of 2, and B = rational with odd denominators
but then realized A n B = {0} was the problem :p
you have subgroups of R which have {0} intersection. So its false for R?
ah like Z and sqrt(2)Z
wait no not necessarily
for R, ig you can just use some linear algebra
it's a Q-vector space
pick a basis and then write it as a direct sum
wait in which case u can
yee
i wonder if there is a nice example which doesn't require you to choose basis and stuff
yea
π¬
If its false with not aoc, then there shouldnt be a way
Well ig u can like
R/piZ justify this is a group
then done
or wait no
Show R/piZ is isomorphic to some subgroup
back to beginnning
yea :p


det what are the general ways to show if a group is:
- nilpotent
- not nilpotent
- solvable
- not solvable (β γβ ο½₯β _β ο½₯β )β γβ β³β ββ β³
i only know the definitions lol
in general this is very hard
perfect. what are the definitions
for a first year course though, its often noticing right subgroups for the definitions
basically
i still don't know why one cares about nilpotent groups. ig one motivation comes from lie groups and lie algebras, but i have hardly looked at them, so dunno
it's really helpful if, at this point, I can grasp the definition perfectly
if it's not too hard, could someone explain this on VC for a bit?
well the definitions you can look up and they are pretty straight forward
try looking at them and if you have confusion you can ask us about it
ig there is a good answer for checking solvability
this is what I'm looking at!
wait wth nilpotent groups and nilpotent element of ring looks so different
,rotate
nilpotent element of ring is simple -...-
lol
-,- Shuri, I have an exam in 2 hrs aaaaaaaaa
F
F
good luck bro
Yeah I'd definitely do my best begging the teacher to let me retake the course
I would drop these 2 defns if u dont think they will be worth many marks
not so worthy of a time investment to me.
That's the point. I can only scrap whatever marks I can if I focus on the topics - Sylow theorems, Nilpotent groups, Solvable groups
is what the prof said
bruh
oops
the last part of my gt course i didnt bother with
our gt didn't do nilpotent and solvable at all uwu
yha I think we're living in different worlds for sure
i just think there's no point in doing solvable groups until you study some galois theory
i'll cheer for you
just knowing how to apply it
theres no need to regurgitate proof for sylow probably
so just learn the thms and how to apply
night night Eevee
gn uwu
Kiwi 
This probably isn't helpful for Arya right now, but I'll just throw it out there. One thing I only realized recently is that nilpotent groups and solvable groups can be realized as certain kinds of extensions
For example, nilpotent groups are built by repeatedly taking central extensions
category thing yh?
btw do you know why 1 --> N --> G --> G/N --> 1 is called extension of G/N by N?
Not really, group extensions are kind of natural to study just in the context of group theory
i think it is category though
i always confuse the directions
youll find at least
I've asked that before det but I never get a straightforward answer. I think it's just terminology that stuck
I'll see if I can find something on it or at least try to come up with a satisfying answer
(btw really cute pfp
)
Thanks
It got cold so I added a scarf
I guess one way to justify it is that if N is abelian, then it becomes a G/N-module via conjugation inside G. In this sense, you can start with G/N, specify a G/N-module N, and then consider extensions which induce this action. In that sense, the extension group "extends" G/N by N
the first one follows because G by definition fixes L^G
wait, not the best way to phrase that
like if there way no K, then also what i said is true
say G is a subgroup of Aut(L)
Quick question
what are the conditions to write G = H x K?
I remember their intersection has to be {e}
H, K normal subgroups
H n K = {e}
HK = G
is it fine if HK = G is not given but we know |H| |K| = G?
the other one is more like the argument you were giving above
yea if everything is finite, because |HK| = |H| * |K| / |H n K| = |H| * |K|
hmm .. this might just be all that I need to understand
so, how do you conclude if a sylow subgroup is normal or not? I read arguments about "there exists only one such 11-sylow subgroup. now, since all 11-sylow subgroups must be conjugates, it must be normal."
I didn't understand what it meant though
so sylow-1 says that sylow p-subgroups exist
sylow-2 says that all sylow p-subgroups are conjugates
and sylow-3 says that number of sylow p-subgroups is congruent to 1 mod p, and it divides the size of the group
what does sylow-2 mean?
it means if P and Q are two sylow p-subgroups then Q = gPg^-1 for some g in your group
if there's only one sylow p-subgroup, it must be normal, why?
Burnside theorem is: ord(G) = p^a q^b, then G is solvable right?
that's right
is an "affine Z-module" a real thing? or, at least, will people know what I mean if I say it?
I'm not familiar with the word "affine" being used to describe modules
then maybe this is the wrong term
what are you trying to describe
I mean an affine space where instead of the vectors being elements of a vector space, they're elements of a Z-module
I see
which now that I'm thinking about it
kinda ruins the whole point of an affine space because you can't take convex combinations of the points
but it's still well defined, I guess
you still get integer affine combinations of points
decent reach but you may be thinking of an (integer) lattice? in which you consider the free Z-module on some number of generators e.g. basis vectors in Euclidean space
In the Lawvere theory for groups, how are the group laws encoded?
Hello!βIs there some writing like Β«real analysis for an algebraistΒ» out there?βGiven that I understand Abstract Algebra (more or less), what can help me learn the Β«analysisΒ» stuff?
It seems that every introductory book that talks about limits and integrals was written as if algebra did not exist (unless it is an algebra of functions over β, sad laugh).
tell me if you find one :p
hmm...
Wouldn't you have sufficient mathematical maturity to take on analysis though assuming you have already done algebra
analysis just feels like remembering a bunch of random unrelated facts to me
real analysis I mean
complex analysis in one variable is gucci
[field in math] is just knowing the definitions /s

ig the question is whether you could do analysis much more efficiently once you know enough algebra
im guessing the mathematical maturity is helpful
for example, like if you're constructing R from Q, you can say consider the Q-algebra of cauchy sequences and the ideal of this of cauchy sequences that converge to 0, this is maximal so the quotient is a field something something
Quick ques, do I need abstract algebra for CS ?
instead of having to verify all the algebra by hand
do you need math beyond linear algebra to do cs?

Oh ok
ig knowing some group theory and galois theory woudl be useful
is there any efficient way of finding a primitive element of a splitting field over a char 0 field
I mean by the primitive element theorem we know that such an element exists
if you're like doing some cryptography
splitting field is Q(cbrt(2), zeta_3)
how?
just like in the proof of primitive element theorem
it says cbrt(2) + c*zeta_3 is a generator for all but finitely many c
usually c = 1 should work lol
For CS, semigroups and monoids are important. Oh and categories.
there is a exact list of c which you need to avoid
so I just compute the powers of x := cbrt(2) + zeta_3 and solve for zeta_3 and cbrt(2) in terms of x?
yea that shoudl work, but i suppose there are better ways
if F = k(alpha, beta) and alpha_i and beta_j are respectively the conjugates of alpha and beta, then alpha + c beta would be a generator if you avoid c = - (alpha - alpha_i)/(beta - beta_j)
conjugate?
roots of their minimal poly
ah
so like in this case it's better to do
(x - cbrt(2)) = zeta_3
use that zeta_3 satisfies t^2+t+1=0 to kill it off
then solve for cbrt(2) in terms of x
similarly do that for zeta_3
ok
and here if you square and kill sqrt(2), then it should give you the minimal poly for x
assuming it has small enough degree
like 6 in this case
which it should since we cubed once and squared later
cbrt(2) not sqrt(2)
oh my bad :p
okie no
so i think then it's much better to do the other way
you wanna keep the quadratic guy with x
so that the left side is f(x) + g(x) * zeta_3
this way you won't have to solve some quadratic equation
x - zeta_3 = cbrt(2)
if you cube this up, you should get zeta_3 in terms of x
and then use cbrt(2) = x - zeta_3 to write cbrt(2) in terms of x
yee this is nice
okay that's gucci
You will gain a lot in Software Engineering from understanding Category Theory, which is kind of like a branch of Abstract Algebraβ¦
(never use random polynomials)
(it's like learning integration and then trying to integrate a random function)
(it will just make you sad >.<)

What is the density of symbolically integrable functions among all closed form expressions?β¦
Sketch:
- Only a tiny amount of products are symbolically integrable among all product expressions.
- As size grows, the proportion of expressions that contain at least one symbolically non-integrable product grows.
Therefore, the density of symbolically integrable expressions among all expressions is zero.
However, when we speak of random stuff, we need to account for probability density.βYou cannot have uniform density for a random generator of finite expressions, can you?
You will tend to generate smaller expressions, so your chances of generating a symbolically integrable expression improve.
I get a quadratic in terms of zeta_3
3xzeta_3^2 - 3x^2zeta_3 - 3 + x^3 = 0
right and zeta_3 satisfies the quadratic t^2 + t + 1 = 0
so you can write this whole thing as f(x) + g(x) * zeta_3 = 0
hmm
which gives zeta_3 as a rational function of x
why
um
because it satisfies t^3-1 = (t-1)(t^2+t+1) = 0
and it's definitely not 1
have you not computed minimal polynomial of zeta_3 till now lol?
and in general minimal polynomial of z_n is the nth cyclotomic polynomial
if n = p is prime, this is just t^(p-1) + ... + 1 = 0
(everything over Q)
ah
How does commutativity imply the existence of inverses?
By definition the difference of rings and fields is that for a field also the multiplicative property is commutative
This implies inverses for every non zero element right?
But I donβt understand why
no?
Z is a commutative ring which isn't a field
Oh so itβs two commutative groups for a field right
And the multiplicative group has inverses for every non zero element?
a field is a commutative ring with multiplicative inverses for every element except 0
if it would be two groups then 0 would have an inverse
(R, 0, +) and (R\{0}, 1, *) are abelian groups
I'm not sure how I would do that
I think I found a tricky way of doing it, since zeta_3 = (-1+sqrt(-3))/2 you could instead think of the field Q(cbrt(2), sqrt(-3)). Then you could pick alpha = cbrt(2)*sqrt(-3).
Now you have $\frac{\alpha^3}{-6}=\sqrt{-3}$ and $\frac{\alpha^4}{18}=\sqrt[3]{2}$.
mOwOsity
I think this should work every time you have two or more elements where their roots (the denominator of the exponent) are relatively prime
did you find these equations by just trying out?
well I knew 2 would kill a square root and not a cube root, and 3 would kill a cube root and not a square roote
I needed to put 4 since I needed the 2 to "roll around" back to 2 again, since 2^2=4
kind of thinking group-theory-ily
like in my mind I was thinking of an order 3 and order 2 element multiplied together
that makes an order 6 element, so squaring it makes it order 3, while cubing it makes it order 2
maybe that illuminates my intuition here
I guess I could say I'm literally thinking about the group $\bQ^\times (\sqrt[3]{2},\sqrt{-3})/\bQ^\times$?
mOwOsity
because I'm thinking of it being the identity when it's a rational number again
I feel like me saying this is making it sound scarier than it actually is :x
like let's start over,
if you look at sqrt(-3), its first 6 powers look like: sqrt(-3), -3, -3sqrt(-3), 9, 9sqrt(-3), 27, ...
if you look at cbrt(2), its first 6 powers look like: cbrt(2), cbrt(4), 2, 2cbrt(2), 2cbrt(4), 4, ...
yes
that's how I think about them, then look at their products
you can kind of think one has period 2 and the other has period 3, so you can find a place where they don't line up, since we can remove rational number multipliers
don't line up?
so make a new list with the products like this:
oh I should have 2 not 8 in the last line
ugh
it should say -6sqrt(-3) if you were to multiply the 3rd entries together for instance
yes
by not lining up I mean we have only one of the original roots appearing
I could make up more examples like this if you want, maybe that'd help
$\bQ(\sqrt[5]{17},\sqrt[7]{23})$
mOwOsity
now $\alpha = \sqrt[5]{17}\sqrt[7]{23}$ will work, so we have $\bQ(\sqrt[5]{17},\sqrt[7]{23})=\bQ(\alpha)$
mOwOsity
ah
got it
thank you!
cool cool
this only works when they're different nth roots
so it wouldn't work for sqrt(2), sqrt(3)
would it
yeah
yeah so my strategy would be try this thing => try a + b => try a + cb
that's why I switched over cause cbrt(2) and zeta_3 are both cube roots
ye
oopsie, i went for some lunch >.<
3xzeta_3^2 - 3x^2zeta_3 - 3 + x^3 = 0
plug zeta_3^2 = -zeta_3 - 1 here
and collect terms with zeta_3 and without zeta_3
for same square roots, you can use some highschool algebra
(sqrt(3)-sqrt(2))(sqrt(3)+sqrt(2)) = 3 - 2 = 1
so something like (x + 1/x)/2 and (x - 1/x)/2 should give you what you want
oh nice, I'm gonna play with that
mOwOsity
ah ok
thanks
the galois group of Q(cbrt(2))/Q is trivial because its the splitting field of the real roots of x^3 - 2 and autos send roots to roots?
(x^3 - 2 has only one real solution)
is that correct?
right
the splitting field part doesn't sound right to me
cuz like for a splitting field we always add all roots over the algebraic closure, no?
A "splitting field" always has to contain all the roots.
(That is, enough roots that the polynomial factors into linear factors).
yeah
So "splitting field of the real roots" doesn't make sense.
What you want to say is "the field generated by the real roots".
Why would using correct terminology to state it cause it to break?
I wasn't sure whether the correct terminology changes anything
like if my "idea" was correct
or if it was totally wrong and the terminology was off too
anyway
yeah looking at the proof of that thing it seems to work too
thanks
You should probably state explicitly earlier on that what you're proving is that a subgroup of H is normal in G (in contrast to K normal in H, which is trivial).
true, I didnt indicate WHERE its normal
i should add that in
other than that is it ok ?
I didn't see anything else screaming to me, but I didn't bother to read it very closely.
Found two:
http://www.tac.mta.ca/tac/volumes/20/10/20-10.pdf β Algebraic Real Analysis by Peter Freud.
https://www.maths.ed.ac.uk/~tl/glasgowpssl/banach.pdf β A universal Banach space by Tom Leinster.
(Somewhat advanced but can be managed.)
find it weird you use the notation K := <h^d> when K has already been introduced
But other than that sure this is fine
well if H is cyclic then its abelian. so its subgroups are necessarily normal
they want to show that any subgroup of H is normal in G
oh
oh
okay
yeah only really works when we assume that it's cyclic I think
because C2 normal V4 normal S4 but C2 not normal S4
ig another way to see that is by using that any subgroup of a cyclic group is automatically characteristic
any group theory book >.<
i used aluffi's book. you could check the pins in #book-recommendations
aluffi tries to do algebra more categorically, so won't be nice for everyone
artin, dummit & foote were what i used
i then used aluffi more for a second pass which i loved as well
fun: I was computing the killing form of π€π©(2) manually. I'm supposed to show π (π΄,π΅) = 4tr(π΄π΅) - 2tr(π΄)tr(π΅) and I must have made a mistake somewhere π
oh no π messing up these commutators can be lethal
let me look through and see if i can find anything but the number of these involved lie algebra calculations i've messed up as well is astronomical
@ebon gyro pls don't toture yourself with my "latex", I have decided to embrace technology...
machine power πͺ
machine power !!!
lol turns out I messed up the signs three or four times, and I multiplied the wrong column and row together, missed several opportunities to cancel out terms π
Maybe shouldn
shouldn't have listened to music while doing this
Iβm showing normality in G not in H
question for proof of LaGranges Theorem. Are we using the fact that left (or right) cosets partition any finite group into a disjoint union of left cosets of a given subgroup
taking some g_1 \in G we note that the sizes of g_1H and H are the same and G = U_{g \in G} gH
so its some n times the order of H
thus order of H divides order of G?
how can I make this argument more rigorous
His name is Lagrange, not La Grange. I'm not sure what problem you're having with the rigour.
We are indeed using the fact that the cosets partition the set, along with the fact that they are all the same size.
so thats pretty much it then?
Yes
I'm curious if there's a simple example of an R module homomorphism g: F ---> F, where R is an integral domain but not a field and F is a finite rank R module, where im g^(n+1) is strictly contained in im g^n for all non-negative n
For a vector space homomorphism g, the kernels and images of the powers g^n stabilize but that's apparently not true for the image in the general case above
R = Z, F = Z, g(n) = 2n.
Lol yep, just came up with that rn. Thanks!
uwu
The reason the stabilisation fails is that that, even though Z is a PID so that every submodule is free, it's not true that a proper submodule has strictly lesser rank
If you were a cool kid you'd say it's because it's non-Artinian
Me too, comrade
Artinianity is fake. Too strong
Hey it happens!
This orbit isn't necessarily inside F, but the min poly splits in L, and we know that in a Galois extension the galois group acts transitively on roots of irreducible polynomials. To me it seems like they're proving 1 iff 3 first (every min poly already splits in F iff every element of the galois group sends F to itself)
Then they procceed to show 3 iff 4 by relating it back to groups
So in general, even though an ideal is contained in a maximal ideal, this maximal ideal need not be unique, correct? What are some examples?
Choose the ring Z. If p is a prime, pZ is a maximal ideal.
π
So yeah I guess a fairly general set of examples is any ring A with multiple maximal ideals, since they all contain the ideal 0
(i say fairly general cause if a ring A has multiple maximal ideals containing I, then A/I has multiple maximal ideals containing 0)
and since pZ is maximal, Z modulo pZ i.e., Z/pZ is a field π
just practicing my theorems π
uhhh facts
or proposition lol
...or definition
actually this is a fact that requires some proof so its not a defn lol
a field is by definition a commutative division ring
I think illum knows
... or corollary
It's more of a remark, really
OwO
Hi det 
walter!
Hi rectangle cube
call me illu or illum
Sure thing illu
at least you don't call me Iluminator03
illuminator3#0001 
that is what this one guy calls me

shy in the wrong situations
I also don't like to call myself annoying but rather say that I have a β¨ special β¨ personality

Hi det, have the vees overthrown the cats yet?
in abstract alg yee :3
nice
π
oh i didn't hear the ping for some reason >.<
okie so
for (i) => (iii),
you need to show that sigma(F) lies inside F for every sigma. (this is enough, as one can argue via degree, or another way is to say it will also hold if you replace sigma with sigma^-1)
to do this, pick x in F, and show that sigma(x) also lies in F. since F/K is galois, sigma(x) is another root of the minimal polynomial m_{x, K} of x, and thus it must also be in F (by normalness)
and
for (iii) => (i)
we need to show that F/K is normal, so pick any x in F and show that the minimal polynomial m_{x, K} splits completely over F. since L/K is galois, you know m_{x, K} does split over L, and so if y in L is another root of m_{x, K} we can find an automorphism sigma in Gal(L/K) which sends x to y. Since sigma(F) is contained in F, we must have sigma(x) in F, which says y lies in F. since y was an arbitrary root, it shows m_{x, K} splits completely over F.
@willow geyser
if G/H is a group then H is normal in G.
Is the right-multiplication by a valid here?
Proof: H = eH = aa^-1H = aHa^-1H => Ha = aHa^-1Ha = aHa^-1 a = aH
Huh
Thinking
I think no
Uhhhhhhh
This is confusing actually like
Iβm not sure if G/H is defined as left cosets or right cosets
When H is normal theyβre the same and itβs fine but like
Is saying βG/H is a groupβ fixing what side of coset youβre using?
Hmm then I donβt see how it is
I'll have to find another way to do it then
The hypothesis is that for all a, b in G aHbH = abH
Yeah so
Yeah I'll play around a bit more ig
I think because you only can ever deal with left cosets
I think you have to like do an element by element thing at some point
Iβm not sure tho
G/H is left cosets
Unless otherwise specified
its proved by first proving H being normal entails that aH=Ha and then proving that entails that left coset multiplication is well defined and then the rest of the properties follow form the properties of G and H
And H\G is right cossets
H\G is sometimes used for right cosets

Yeah my book provides the proof
I think that is G/H\G

Yeah except with different G
The set of all double cosets is denoted by H\G/K
Yeah
Ok so this is H-K-double coset
{hGk | h in H k in K} im guessing
HxK for each fixed x
ah
is the double coset corresponding to x
interesting
Oh wait
Isaacs finite group theory from like 1 week of Junior year
It returns to meeeeee
I am supposed to know this stuff since I am working with Mackey functors 
how u doin moldi
Good 
why u crying
Good

oh hey
Wholesome Mackeyβs theorem

because the map sigma : F --> sigma(F) is an isomorphism of K-vectorspaces
injectivity follows as everything is a field
surjectivity is clear
K-linearity because sigma fixes K
okie uwu?
the other idea was to say "as we proved sigma(F) is inside F for every sigma", it's also true for sigma^-1, and so sigma^-1(F) is inside F which is the other inclusion
uwu 
is there a way to define a multiplication on R^2 so that R^2 and R are isomorphic as rings?
we know that R and R^2 are isomorphic as Q-vector spaces and thus as additive groups, but i was thinking of a multiplication maybeβ¦
is it possible somehow?
use that isomorphism of Q-vector spaces to define the multiplication :p
say f : R^2 --> R is the isomorphism, then define a * b := f^-1(f(a) * f(b))
i donβt quite see how they would be isomorphic as rings then
because this definition literally makes f also a ring homomorphism
f(a*b) = f(a)*f(b)

R and R^2 are isomorphic as Q-vector spaces because they have the same dimension or?
yee
so V iso W iff dim(V) = dim(W) also holds for non finite vector spaces?
yep
Yeah
means there's a bijection between basis vectors
and then
yes I knew it holds for finite spaces
basically you also have to prove the "inifnite" version of replacement theorem, which will then also require AoC
replacement theorem?
dim(V) = dim(W) for non finite spaces compares cardinality?
yea something like if B is a basis and S is a spanning set, then there is an injection B --> S
cardinality of bases
not just for non finite ofc
I like using size for finite and cardinality for non finite
makes things clearer imo
the idea here to replace elements of S one by one with elements of B and such that at each point S remains a spanning set
ah
when you're done, B would be literally a subset of S, and so you have your injection
yeah
vector spaces my beloved 
vectors spaces are eh
idk if u were there yesterday when i briefly talked about galois
I don't like rings nor modules nor vector spaces
no I wasn't
L : K a field extension, L is a vector space over K
rings are uwu
is a nice idea
yes
my alg course is doing galois theory right now
we did fundamental theorem last lecture
ur studying bigger and better things i see 
do infinite galois theory now


.<
shush
sounds like you don't like multiplication
Z-algebras
det is uwu too 
Can anyone help me know how to find the maximal torus of some classical groups?
Tbf the linear algebra used in e.g. Functional anal is basic to begin with
What about me
chuwu
Chmuwu
what do you mean by this
tbh, I'm not sure
I'm assuming that's what the exercise is asking, no?
coz R/Z iso S^1
R/Z is the circle, but this is R^2 / Z^2
circle x circle is not circle
oh woops
it's like a circle of circles (torus)
I meant sphere, sry

Take a unit square
To get the sphere you identify all the boundary points with one point
Like you scrunch it up, and pack the entire boundary as the top point or whatever
When you do R^2/Z^2 youβre only identifying the top and bottom edge, and the left and right edge
Basically
But also idk how to put a group structure on S^2
Lmao
it won't be a nice one
I think you can't if you want it to be compatible with the topology
S^n a top group implies n odd
Adams' Theorem
why not just S^1 x S^1? 
Because
Those arenβt the same thing

A torus and a sphere are not homeomorphic
Theyβre not even homotopic
S^2 has trivial fundamental group and the torus has fundamental group Z^2
why are you guys talking about algebraic topology? lmao
this is just group theory
I was thinking just "give the points in x shape a group structure"
Because it isnβt that
because it's a precise way to explain how a torus and a circle aren't the same
Like your picture is wrong
chmuwu
why is this?
Prove it!
is it because R^2/Z^2 = (S^1)^2 and S^1 = R/Z?
what's S^3
the 3-sphere
lel
we don't have special names for high dimensional sphere, I don't think
they're just called n-spheres
S^0 is a point?
there is a cute proof using universal properties
are you familiar with those?
from cat theory?
ye
The principled thing would be to make S^0 mean { x in R^1 : |x| = 1 }, which is two points.
"Two points" is also the space whose suspension is (homeomorphic to) S^1.
tf is a suspension?
yes
the (-1)-sphere is the empty set
Question, an let me go all the way through with it before commenting, it may be elementary but the whole set notation throws me off so
let $\phi: R \rightarrow S$ be a ring homomorphism and let $J \subset S$ be an ideal show that $\phi^{-1}(J):={r \in R: \phi(r) \in J}$ is an ideal of $R$
MyMathYourMath
I remember doing that one at 2 am once
ok so using the universal pwopewty for products we have two canonical projections pi_1, pi_2: RxR->R
pwopewty
combine those with the canonical projection R->R/Z
MyMathYourMath
now you have two morphisms going from RxR to R/Z
MyMathYourMath
thus x-y is in phi inverse of J
now according to the universal property for products that means there is a morphism going from RxR to R/Z x R/Z
because J is a subring, yes
sorry yes
and the kernal of that morphism is ZxZ
subgring property
hm
RxR/ZxZ iso R/Z x R/Z (first iso)
ok nvm I don't know enough cat theory for this 
then for absorbtion by R
I'm still trying to comprehend adjunct functors
let a \in R and x \in phi^{-1}(J)
then ax \in R
and phi(ax)=\phi(a)\phi(x) \in J and THIS is by property of ideals since phi(a) \in S
yes
btw both of these hold for both + and * so you can just use \circ imo
(and you need to show both)
yeah i use a star or circ
for groups though usually for rings i put the actual sign
and to show somethings and ideal its enough to show for x,y \in I x-y \in I and for all r \in R that rx \in I for every x \in I
(or x + y in I)
and yes
wait
I think you mean
for every r in R and x in I you have that r+x in I
no its rx \in I
its absorbtion by r in R
you prolly do, I'm just too sleep deprived rn to write an answer half assed lel
sry
lol dw
if you're still interested you can ping me tomorrow
30th could be either 36 or less than 24 hours away depending on where you stay on this planet lol
we are in the same timezone 
ahh
how do I show that the galois group of $x^{13} - 1$ is $(\bZ/13\bZ)^\times$? I mean it obviously has 13 elements
$$\rotatebox{90}{β’π§β’π§β’π§β’π§}$$
not sure how I would continue though
think you could walk me through a group theory problem lol
I probably only have as much knowledge as you but sure
if not its chill
ok and heres my attempt
let N be a normal subgroup of index n in G show g^n \in N for all g \in G
so i know if N has index n then G/N has size n
thus elements of the form gN have order n
unsure if those emojos are good or bad lol
lol, your idea is correct
oh ok lol
yes!
and not that n is literally the order
yea
yee
so g^nN \subset N
I think the only thing to object to is that you used the phrasing "order of".
oh no lol ur good
oh thats right
.<
u can only quotient out by normal subgroups
you could only use lagranges theorem once you know it's a group
true
am i basically finished after the g^nN=eN step
or i feel i have more to go
i need to show g^n \in N
Hmm, but even if N is not normal, the whole group subgroup generated by g still acts on the (say) left cosets of N, so we can appeal to the orbit-stabilizer theorem, can't we?
you can try showing a more general statement: gH = H iff g is in H for any subgroup H and any g in G
one liner from the definition...
its by the closure of subgroup
why is (gN)^n = g^nN
okie i'm not sure i fully follow the argument >.<
why sully
are you prompting them with that or is it a real question
real question
eN
think cosets
lol
(gN)(hN) = (gh)N so...
yeah lmao
^^^
I was thinking (gN)^order = neutral element = eN
det is sleepy >.<
same
bump
it happens to us all
Given G, N and g, with |G|=n. The subgroup generated by g has an order the divides n. It acts on the left cosets of N by left multiplication. By the orbit-stabilizer theorem, the orbit of N itself has a size that divides the order of g, which divides n. But everything in that orbit has the form g^kN for some k, so multiplying by g must simply cycle through the orbit. Multiplying by g n times cycles through the orbit a whole number of times, so we end up at N again.
sully is best used as a "ur overthinking it buddy"
I use sully as wtf are you saying that shit makes no sense
ah, i think we're only given the index [G:N]=n
Ah, whoops.
i was also thinking how you could relate action of <g> with the size of the new orbit >.<
nvm, me go sleep now
good night 
An orbit under the action of a cyclic group is always a cycle.
gn!
Ah! Counterexample for the non-normal case:
G is S_3 and N is the (non-normal) subgroup {e, (2 3)}, of index 3. If now g is the transposition (1 2), then g^3Β·e is not in N.
NICE!
but is S_3/N a group since N is not even normal so you cant talk about its index? or that just means you cant consider S_3/N as a group
but |S_3:N| still makes sense?
Index isn't exclusive to normal subgroups
ok thats what i was wondering ^
but in assuming my problem is normal, the normality gets used from forming G/N into a group of order index of N in G?
yes
ok sweet makes sense
i had a prof who once mentioned
when you hear normal subgroup
it should scream out to quotient by it
for the most part
all but a set of measure zero lol
means "for the most part" lol
btw im glad i joined this community, ive learned tons even when not asking and just reading the chats about questions! everyones super friendly too
same
Merry Late christmas everyone and happy holidays!!!
this is good advice LMAO
lol right?!
I remember seeing this exact phrase except like "if you ever encounter a normal subgroup in the wild. you should want to take a quotient"
loooool
yeahi had a problem on my midterm that was super tough
but i remember seeing it was a normal subgroup
and needing to use to first iso theorem so i just put down a map from G to G /N and got partial points lol
i have the problem if you wanna try it lol
ooh I'm curious to see if you have it
this is a solid strategy always
MyMathYourMath
you really just need to show its a subset of N
since its already a subgroup it has the subgroup property of closure and inverse
but this problem had the entire class
i meant , prove if GCD is 1
not is coprime that doesnt make sense lmao
@ebon gyro
or if anyone wants to attack that exercise feel free
||The size of the image of H in G/N must divide both |H| and |G/N|, and it contains e||
unless youve seen it before


