#groups-rings-fields
406252 messages · Page 702 of 407
by <3+2> do you mean <2, 3> or literally <5> - I'm kinda confused by this notation
so then <2, 3> = Z not <2>?
well <2,3> = 2Z + 3Z
but by the definition of a principal ideal domain <a,b> = <a> = <b>
<2,3>=<1>=Z is principal
oh is it not <a1,a2>=<a1>=<a2>?
no
For Z, <a,b>=<gcd(a,b)>
this is absolutely not the definition of a principle ideal domain
pid just means that theres some p s.t. <a, b> = <p>
PID => all ideals <S> for some set of elements S is equal to SOME <r> in the PID, not every element of S
yeah
for Z it's the gcd of S
does the one generator that's principal have to be equal to every other ideal?
what do you mean by that
if a is a principal ideal of a PID,
does <a> = <a1, a2, ..., an> for any a1-an in the PID
i know <1> would work for all of Z i think but would that apply in general or just this case
If a1,...,an are in <a> then yes. Otherwise no
well 2 is in <1> but <2> is not equal to <1>
Is there a name for a module homomorphism that additionally is a homomorphism on the underlying ring?
Do you mean a homomorphism M->N of R-modules where M, N are also rings?
That'd be a (homo)morphism of R-algebras
I mean a homomorphism on a module that also maps the ring under the module.
The standard definition makes it an identity.
Well it's not gonna be a module homomorphism then
Sure, I just wanted to know if that had a name.
Also you usually don't have an embedding of the base ring into the module
sure why not
maybe the action isn't something as natural as say S_n acting on n elements by the natural permutation representation
I think the homomorphism I am trying to get a name for is two separate morphisms, one on the ring part, and one on the abelian group part.
Apparently it’s by still by permutation though, Is where my confusion comes from
do the higher numbers just not do anything?
We assume our three elements are just a b c starting in indices 1 2 and 3 right
I mean any action by any group whatsoever on a set is by permutation, that's what an action is
oh, because you number the positions the elements are originally in and then they have to be in positions formerly held by other set elements or else it’s not an action?
no
an action of a group G on a set S is literally just a group homomorphism G->Aut(S), where Aut(S) is the group of permutations of S
so to have S_4 acting on a 3 element set you're just asking for a group homomorphism S_4->S_3
Aut(s) means mapping each s to where another s formerly was, right?
Which is what a permutation is once we have an established initial order for S
Yeah ofc
yeah, but in first expressing the set you have some arbitrary first element in the first spot and so on
I thought the whole point of a permutation is order does matter?
I guess you need this if you want to write these things in the usual permutation notation
but this isn't strictly necessary
anyways
Okay so technically you can say something bigger than S_n acts on n elements (call it S_m) but really it’s just whichever elements of S_n are found in S_m
Like anything you add is trivial
I don't think this is the action you want
wdym?
Like under what rule set of group action would (14) do something by permutation to a set of three elements
sure so here's the natural action: consider the set of partitions of {1,2,3,4} into 2 sets of 2 elements
there are (4 choose 2)=6 such partitions
if we forget the order of these 2 sets, we have 3 such partitions
so let's say 12|34, 13|24, and 14|23 up to equivalence
so then (14) would for instance send 12|34 to 13|24
this action of S_4 on 3 elements is quite special, you don't really get this kind of thing for other symmetric groups
no way S_4 acts on 3 elements that's cool
should i do this by expanding every term of the jacobi or only using properties like anticommutativty and such
it looks like an easy computation but me is a lil stuck 
as V is a finite dimensional vector space what other form can you write the linear maps in
i.e. you can write them as functions and something else
matrices...?
feel free to degrade me if that's dumb
though i do feel like \circ here is just matrix multiplication isnt it?
nvm the next question literally says "here is a matrix version gl(n, F)" 
yeah it's matricies
lol
so then you just show that matrix multiplication satisfies the Jacobi property

This looks approachable. What's the book?
This book helps students grasp a key concept in mathematics and theoretical physics. Includes numerous examples and exercises with solutions.
prof recommended it precisely for that reason :D
Thank you, stealing.
c o n s u m e
first chapter at least has been approachable
it helps that im also taking ann algebra course so i only recently learned about stuff like ideals and isomorphisms
i can slide pdf in dm's if you want @stone fulcrum
crimes!
we do a little trolling
need to learn lie algebras tbh
and then I can... do things... I guess
really my priority should be galois theory but I really can't be bothered
[[]]
it's literally defined
it's like
wait you haven't seen semi direct products
uhhh
it is what it is
it's just a map of maps so we tend to notate them like that
in other news, water is wet
it isn't though
literally shut the fuck up
wdym tho <3
I really don't see why this is confusing you
oh wait hold on they just use ad on it's own
wtf are they smoking
(ad x)y is, as ryu said, the adjunction of y wrt x
ad on it's own is just them doing the wacky tobbaccy
ohhhhhh wait
so is ad x just the map being written weirdly (like it should be more like \phi(x))
it's really an element of gl(L)
I'd write it as ad(x)(y) personally
you map x to a map and then put y through that map
ok i think that makes sense
the reason why I was thinking about semidirect products earlier is because you have a map f: H -> Aut(G) involved and the notation f(h)(g) or f_h(g) is used a lot
so it's a similar thing
(and gl(V) is just Aut(V) lol)
i think im just a little stuck on what it means to map an element to a map
it kinda makes sense in the context of matrices but what about generally
Fraktur gl is End considered as a lie Algebra with the commutatoe
Not Aut
ad x may very well not be injective
e.g. if the Algebra is abelian
how is (c) not just dead obvious from the fact that zeta is literally already a root of f(x)????
and all the other roots are just powers of zeta
Hey, this is kinda basic but is this a sufficient proof that the intersection of two ideals is an ideal?
Seems good
Thank you
In field theory,
2 is defined as 1+1...
Is this correct?
consider F_2
yeah, more precisely its the image of 2 under the unique map from Z into your field
can anyone give a hint? just learned about finite fields and not sure what to use here
If m and n are relatively prime, does that mean
$$[a]{mn} = [b]{mn} \rightarrow [a]_m = [b]_m$$
beeswax
first statement means mn divides a-b, second m divides a-b
so this is always true, regardless of if m, n are rel prime
If f is well-defined and injective, are we guaranteed that f-inverse exists?
No, it needs to be bijective.
Have you learned that the multiplicative group of a finite field is always cyclic?
lol this sentence is just so funny to read for the first time
F \ {0} must contain a cyclic group of order 364, so we need to find minimal p^r such that 364|p^r-1. the answer is 1093 I think
Sorry not 1093, should be 3^6=729. F_729
there are certain cases where being injective does imply surjectivity, which thus implies bijectivity and thus f-inerse is guaranteed to exist
the most basic case that comes to mind is the case where the codmain of the function is finite
u will often see this in proofs where its like take the map x-> ax and this map is injective and thus its surjective cuz everything is finite blahb lahb ah
|| ||
can someone expalin wut property 1 means here
i am not sure what $\gamma$ is suppposed to mean
JustKeepRunning
cuz isn't this just llike the definitinn of an ideal
that it has to be closed under subtraction(which in this case is division)
it means that any element of a monomial ideal is a multiple of one of the generators
note that this is different from the usual definition of an element of an ideal
for example: if $I = \langle a, b\rangle$, then any element $x$ of $I$ $x = ra + sb$ for $r,s\in R$
vov&sons
however, with a monomial ideal, we necessarily have either $x = ra$ or $x = rb$.
vov&sons
can u explain why this is true??
I sent the proof of the lemma right above
oh oops ok i get it now
thx so much
Just find the generator of Z36 and those elements have exactly the order of 36, is this what the question wants?
No. This group isn’t even isomorphic to Z36
It wants you to find all possible orders of elements of G
GCD(4,9)=1 doesn't implies they are isomorphic to Z36?
So do I list one by one like {(0,0),(1,0),.....(3,8)} and find their order one by one?
Pretty sure it is isomorphic to Z36…
Yea I’m wrong
Isn’t there a function which counts the number of each element of each order
Like the totient function?
Haven't learn about that 😦
But it depends on two variables, and I think totient is only one
So that’s obviously fake lol
But this isn’t bad, you know everything is of the form x^n
Where x is a generator right?
You should be able to determine what the order of x^n is in terms of n and 36 pretty easily
Yes, I have in my hand the generators are 1,5,7,11,13,17,19,23,25,29,31,35 so their order is exactly 36
No that’s not what I mean
Take 1 as the generator I guess
You should be able to determine what the order of n is in Z/36 easily via some sort of divisibility / gcd kinda thing
You can do it for an arbitrary n, you don’t need to just compute it for each number between 0 and 35
Like if theres a finite domain and codomain. Then f injective iff surjective
You need them to be the same size too
I think I am confused
Just compute what the order of n is in Z/36Z
You can do this just in terms of n and 36
You don’t have to compute what the order of 1 is, the order of 2, the order of 3,…, the order of 35, you can do them all at once
How do I compute that?
I think I only know how to find the generators with gcd, could you give a bit more hint on how to get the order of n?
Do you know Lagrange’s theorem? This tells you something about the order of an element
No... I just started taking this a week ago
So you don’t know that the order of a subgroup divides the order of the group?
It says the order of group represents the number of elements?
Yea, order is number of elements of a group
The order of elements and order of group are the same thing? Because I am asked to find order of element
The order of an element would be the order of the cyclic subgroup that the element generates
You’re looking for the smallest number k such that kn is a multiple of 36
There’s a nice way to describe this
This is (once you unravel them) by definition the order of n in Z/36
And in light of this fact, that number k should divide 36 for example
This is something that you can check for yourself too
I mean chm basically already said it
This could be the Theorem that I need right?
Yeah, I mean this basically solves your exercise automatically
Okay I don't know why my brain can't function now but I will try. Thanks to both of you! ❤️
Npnp
yes this is correct
how would u simplify the ideal $I=(x^6, x^2y^3, xy^5)$
JustKeepRunning
Over Z[x,y]? It looks quite simple already.
is there any way to like make it simpler
cuz i need to draw a vector exponent graph of the x and y
and the only way i can see to do it right now is just trying to add and subtract elemenets until it "seems" that they are all accounted for
Hmm, I'm not 100% sure what a "vector exponent graph" means in this context -- but if it means what it sounds like it means, then I don't think adding and subtracting elements is even relevant.
Yeah, that's what it sounded like.
So you get all of the multiples of x^6, which is the lattice point (6,0) and every point east, north, or northeast of it.
You get all of the multiples of x^2y^3, which is the point (2,3) and every point east, north, and northeast of that ...
Taking sums will not give you any new monomials, just polynomials with terms made from the monomials you already have.
oh sorry i meant products
would u just have to keep listing until it seems like you are done
No, I would do what I describe above.
Remember that for an ideal you're not looking for product of the generators.
You're looking for product of one generator with any element of the ring.
So each generator gives you a whole 90° wedge of the lattice.
codomain and domain would have to be sets of equal cardinality for it to be true, right
yes but in some instances u can sort of "skip" this part
for example take some $a\in R$ for some ring $R$ and consider the map $x\to ax$ for all elements $x\in R$
JustKeepRunning
JustKeepRunning
this is because the output is obviously a subset of $R,$ so it is surjective
JustKeepRunning
and since $R$ is finite we can conclude that the mapping is bijective
JustKeepRunning
this is jut like a specific case that came to mind
but ingeneral u would have to check for equal cardinalities
or use some other info that u are given
if u want an example of how the map $x\to ax$ can be used (trust me, its very common) refer here:
JustKeepRunning
Ahh I see. Thank u
NupurJ
tensor products* oops
Ok here's my thoughts, Res(E) and W are both CH-modules so their tensor product is a representation of H x H, meaning the character of this tensor product is just the product of the character of W and the character of Res(E), similarly on the other side we have that Ind(W) is a CG-module blah blah so the character of the tensor product is just the product of the characters of Ind(W) and E
that's where I get a bit stuck - I do believe that frobenius reciprocity is the right way to go about this but I can't seem to think of how we map the above formulation into an inner product
we also have a formulation of the induced character using the centralisers of elements in G and H but I doubt that's useful here
NupurJ
that's basically exactly what I said
good to know I wasn't talking nonsense
ah, yes, i see that now!
is the restriction of the induced character just the original character, I should really know that off the top of my head lol
I'm not sure myself lol, let me try to look it up
ah I don't think it is
Why is this true.. plz help
:every finite field has characteristic p(prime)
consider characteristic non-prime n
then n decomposes into the product of two numbers, pq = m
so in a field of characteristic m, pq = 0
so this "field" has zero divisors
which is a contradiction
But a•b isnt equal to ab
3•a=a+a+a =/= 3a
Do 3·a and 3a mean different things to you? Which different things do they mean, then?
- group theory
- r means R120
- f means to flip
I understand literally nothing except that the order of e is 1 and the inverse of e is e
how does it work at i = 0
The H_i and C_i will all be 0 when i < 0 so can start considering at i = 0, which is rho_0 = r_0
we have $C_0 = B_0 \oplus H_0 \oplus (C_0/Z_0)$
Iteribus
$Z_0$ is the whole thing since $C$ is positive so just $C_0 = B_0 \oplus H_0$
Iteribus
But I don't see why $B_0 = 0$
Iteribus
you can cut out an equilateral triangle from a piece of paper and try this out. basically, flipping twice is equivalent to doing nothing, so ff = e. Rotating thrice is also equivalent to doing nothing, so rrr = e. A flip followed by a rotation is the same as rotating twice and then flipping, so rf = frr. Similarly, fr = rrf. Keep doing this in the first problem to simplify the sequences
Ok perfect I will try now
so is rfrfrfrfrfrfrf = rf
ok so i got
rf
rf
e
rr
i have no idea about the order orbit or inverse
Useful relation on all dihedral groups:
rf = fr⁻¹
So you can swap an r and an f, but if you do, take the inverse of r
how exactly do i take an inverse
In this question, r means to rotate 120 degrees counter-clockwise
What does r⁻¹ mean?
rotate 240?
Yes that's true
So "take an inverse" means to do that instead
Well, let me put the equation again:
rf = fr⁻¹
ahh tyvm
That reduces them very fast
As part of a multiple step problem I'm tasked with finding U to be a normal subgroup of T and identifying the quotient T/U? Proving normal subgroup felt straightforward since ad != 0 it is invertible and can show tut^-1 in T. However, I don't understand how to take the quotient of these two, what would that look like?
Looking to find quotient T/U
the quotient is isomorphic to R^2. For any (a,b;0,d) from T, (a,b;0,d) is congruent to (a,0;0,d)
Why the last sentence hold
Since when $a \neq b$, $$\begin{pmatrix}a&b\0&d\end{pmatrix}= \begin{pmatrix}1&\frac{b}{d-a}\0&1\end{pmatrix} \begin{pmatrix}a&0\0&d\end{pmatrix} \begin{pmatrix}1&\frac{-b}{d-a}\0&1\end{pmatrix}$$
When $a=d$,$$\begin{pmatrix}a&b\0&a\end{pmatrix}=\begin{pmatrix}a&0\0&a\end{pmatrix} \begin{pmatrix}1&\frac{b}{a}\0&a\end{pmatrix}$$
Cogwheels of the mind
Your original picture shows the complete question can you send that again?
@terse crystal
Because K=F(β), F(β) is isomorphic to F[x]/(irr(β,F)(x)). So n=[K:F]=[F(β):F]=[F[x]/(irr(β,F)(x)):F]=degree(irr(β,F))
a doesn’t equal d not a doesn’t equal b sorry
Hi, I'm trying to prove that J = (x^2 - yz, xz - x) in k[x, y, z] is equal to the intersection of ideals (x, y), (z, x) and (x^2 - y, z - 1). It is easy to show that J is subset of the intersection but I don't know how to show the other direction. Could anyone give me a hint on that? Thanks!
Yes, and here r^-1 is r^2! That's definitely cleaner notation
I gave this some thought, and I couldn’t really come up with much. I think you can compute the intersection or (x,y) and (y,z) pretty easily, and then try to compute the intersection of that with (x^2 - y, z - 1)
The only other trick I can think of is, when you have something like “show that I = J” and one direction is easy, say J < I, you can try to show that I/J = 0
This has the benefit of, taking an element in I, once you go the quotient you can rewrite stuff using what’s in J
So as an example in this specific case, once you quotient by J, because you know xz - x = 0, you know xz = x, so you can replace any xz which shows up with an x
similarly you can replace x^2 with yz, so if you had eg x^3 this becomes xyz = xy
And stuff like that
This might make it easier to show that I/J = 0 (I in this case is the intersection)
Good luck
could someone help me parse this? I dont understand what it is asking
nvm I figured it out I think
Tysm!! I'll think about it more 
Is k an algebraically closed field? This looks like an algebraic geometry exercise
hey guys is something like $\mathbb{Z}[x,y]\cong \mathbb{Z}[x]\times \mathbb{Z}[y]$ true?
JustKeepRunning
i feel like this is wrong but i am not sure how to show it
zerodivisors
can u elaborate?
one has zerodivisors and the other doesn't
i feel like ima missing smth obvious but it seems like both of them have no zero divisros?
think about it a bit
If you pick any two random finite field extensions they probably won't be isomorphic extensions
What does the set $2\mathbb{Z} +3\mathbb{Z}$ consist of?
Scerball
2(element of Z) + 3(another element of Z)
every element of Z is
Ah, sure. Well consider e.g. finite extensions of Q which have very different algebraic properties
For example Q(i) and Q(sqrt(2)) are p different
$a\bZ+b\bZ=\gcd(a,b)\bZ$
Merosity
Scerball
Where $a, b \in R$
Scerball
And $R$ is a ring
Scerball
good question
I can definitely conclude that $\langle a, b \rangle \subseteq \langle gcd(a, b) \rangle$ if $R$ is a Bezout domain, and all PIDs are Bezout domains
Wew "Dithering" Tbh 📺
I don't think so, iirc you can get rings where every finitely generated ideal is principal, but not all ideals are principal
true, I did not consider the case of a gcd over an infinite set
just assume a noetherian ring and we're all good 😌
for Z/mZ, there will always be m-1 elements right
prove it
well now i dont feel like it
good cause it's wrong, there's m elements
proof by stubbornness
do not talk to me about stubbornness
if m is prime then there's m-1 units I guess lol?
$\mathbb{Z}/m\mathbb{Z} \cong \mathbb{Z}_m$
Scerball
isn't this true by definition
yeah
Is it?
I think the only way it's not is if you define Z_m just as the cyclic group with m things
rather than a quotient of Z
If $R$ is a domain, then there is a unique field containing $R$.
μ₂
this is false right
yes
yeah
kk just wanted to make sure
the first example of "domain" you should always think of produces a counterexample
are you asking or telling
telling with smidgeon of asking
you know this
really asking if Z is a subset of Q...
lmao
of course it isn't!
Z is a set of numbers and Q is a set of equivalence classes! 

Z is equivalence classes in N x N 🙂
the voices
believe in urself
what's special about commutative rings
they commute
I mean you probably aren't aware of how powerful a property that is
every domain is I believe
i know a domain is
fields don't have nonzero zero divisors
ooo so a commutative ring that isnt an integral domain would disprove
every domain R can be embedded into Frac(R) if you want an explicit formulation
shoulda thought of that ty
Imagine saying non zero zero divisors and thinking that you're sane 
Integral domains are exactly the subrings of fields
every sixty seconds, a minute passes in africa
We just assume k is a field, not necessarily algebraically closed.
I don’t think it helps regardless
I think this is writing a primary decomposition, but knowing that doesn’t really help much regardless
Ok so inverse maeks sense but how would one take an orbit
Hi, I'm trying to show that k[x, y]/(1-xy) is isomorphic to k[t, 1/t]. I see one way to solve this is to parametrize x = t, and y = 1/t. I'm not sure why could we just do that?
Use the first isomorphism theorem
your parameterization is describing a map k[x,y] -> k[t,1/t]
and then you just have to show that the kernel is (1-xy)
Ah I see.. Thanks! 
Could anyone tell me if this is fine? I have a matrix A over a field k, and I am considering the algebra k[A]. Would it be correct to say that k[A] is isomorphic to some quotient of the polynomial algebra k[X]?
what is k[A]?
just elements of the form f(A), where f is a polynomial
or else I think you have issues
so it all works
yeah then this is exactly right
What you've done is
you have a map k[X] -> n-by-n matrices over k
given by sending X to A
and the image is exactly k[A]
so you can apply the first isomorphism theorem
@main rover
Still looking for it?
Wait, I agree I don't know what "orbit" means in this context
My bad, I figured it out
What's the point of the last statement? Is E not already suitable enough for a splitting field?
The definition of splitting field in Dummit requires that f(x) does not factor completly in any proper subfield, which we ensure by taking the intersection of all such E
Hi, I'm trying to work on this problem. I'm a bit confused on what this question means. Do we need to show for example, B can be embedded into A, i.e., there is an injective homomorphism from B to A, and B is a k-algebra? Or we need to show something more?
If a map A-> B is flat epiimorphism and A is reduced, does that imply that B is reduced?
i think this is true because if I and J are ideals, then IJ is contained in I intersect J
no problem 🐋
That’s what it’s asking, yeah
bro this is way more abstract for this channel, try asking this in preal-and-algebra channel
i don't mean to be rude just wanted you to know that questions must be posted in appropriate channels
Hey guys, I need to find wether there exists a quadratic extension of $L = \mathbb{Q}(\sqrt{17})$ such that it is cyclic over $\mathbb{Q}$. I was thinking of using cyclotomic extension, more precisely, since 17 is congruent to 1 mod 4, we have that $\sqrt{17} \in \mathbb{Q}(\zeta_{17}) = K$, and then we obtain that $Gal(K/\mathbb{Q}) \cong (\mathbb{Z}/17\mathbb{Z})^{\times}$, which is an isomorphism of cyclic groups of order 16. Then, we observe that there exist unique subfields of $K$ for every divisor of 16, i.e., 2,4,8. I am not sure how to continue however, so any tip is welcome.
Évariste Galois
Naturally, there is $\eta_2$, the gaussian period of degree 2 in $K$ that has precisely $\dfrac{17-1}{2} = 8$ number of terms.
Évariste Galois
In particular we have $\mathbb{Q}(\eta_2) = \mathbb{Q}(\sqrt{17})$.
Évariste Galois
with $f_{\mathbb{Q}}^{\eta_2} = X^2 + X - 4$.
Évariste Galois
There was some discussion about subfields of cyclotomic extensions in this chat a week or so ago? An automorphism that generates a cyclic subgroup of order 4 is $\sigma: \zeta \mapsto \zeta^4$ which permutes the set ${\zeta, \zeta^4, \zeta^{13}, \zeta^{16}}$ so i think a good candidate for the field you are looking for is $\mathbb{Q}(\zeta+\zeta^4+\zeta^{13}+\zeta^{16})$.
Greenman
Yep, i figured it out at the end. More precisely i got that the unique cyclic quadratic extension of $\mathbb{Q}(\sqrt{17})$ is equal to $\mathbb{Q}(\sqrt{\dfrac{17+\sqrt{17}}{2}})$
Évariste Galois
By using exactly the trick you advised me to use
Nicely done
Galois doing Galois theory 
Ikr
Galois just let her go man
Not worth it
Me with a time machine
Go back and stop the duel that killed Galois
Anywayyyy
Why does this hold
Is there a way to check if an irreducible of GF(32) is primitive other than brute force?
(x-a)^2+b^2
since we're in characteristic 2, that's equal to (x-a+b)^2
Thanks though
I just found the 6 irreducible polynomials of degree 5 over F_2 now I have to find a primitive one
*F_2[x]
so I've already done this proof:
but I wanted to ask where the assumption for the characteristic of the field came in
I think i did it implicitly without realizing it
oh wait is it just polynomial long division fails
Kraft Macaroni
it's def true if it's finitely generated PID-modules from CoFGM Thm
but I can't think of anything else just yet
@woeful flint got it, third iso thm:
(M/J')/(J/J') ~ M/J
so J/J' is never trivial
np
that wasnt a question lol
lmao it's chill
well this is awkward. i should've just read the sketch of the proof for 5 and it mentions it
A polynomial p(x) of a given degree d is primitive over F_2[x] if F_2[x]/p(x) is isomorphic to GF(2^d), is that right?
Nevermind
Well if you're defining it as the set of nilpotent elements then it won't be an ideal necessary; are you viewing it as the intersection of all prime ideals?
i think its guaranteed to be an ideal only for commutative rings
that's not how nil radicals are defined on a non commutative ring
the def goes like this. The nil radical is the maximal ideal of R wrt the given property that for every element a of N, the principal ideal (a) is nil ideal.

unlike in commutative case, you can't say it's the intersection of all prime ideals
I don’t see how this isn’t well-defined?
Let S be set of all a such that (a) is a nil ideal
Claim: (S) = nilradical
I am showing that this (S) is the nilradical
Oh Hurb
Nvm my proof uses commutativity 
TFW binomial theorem is fake
The nil radical of a ring R is defined to be the radical ideal with respect to the property that "A 2-sided ideal is nil". and denoted by N(R)
Radical: A two sided ideal I in a rign R with 1 called a radical ideal wrt a specified property P if
- the ideal I possesses the property P
- the ideal I is maximal for the property P

Theorem: For any ring R the nil racial N(R) exists and it's characterized by
N(R) = {a | the principal 2-sided ideal (a) is a nil ideal}















I hate non commutative stuffs

Yeah I guess I don’t see why that’s closed under addition
Without commutativity
ChmonkaS
Oh huh I guess I do see a proof
So wait, in this case it is well-defined right?
Like it definitely is unique
definitely an ideal because it's defined to be
I just mean like this is by definition going to be the largest one with this property
And you can show that this is actually an ideal, because a priori it’s just defined as a set
To find the subfields of GF(64), they would be generated by modding out the irreducible polynomials of degree 6 from F_2[x], is that right?
Nevermind
how do I conclude the uniqueness then?
evidentially not
Apart from Lie algebras, most algebras one meets tend to be both associative and unital.

what's the problem here
nothing lol just hadnt notice the lack of a unit in a lie bruh
lie algebra -> lie algebruh -> lie bruh -> libra
I can attest to this btw
every algebra I've worked with thus far has been both those things 
is there a name for this relationship
This is a dirty lie
The unital part
It's true associativity is mostly assumed outside of lie algebras

welll uhhhh
is there notation for an ideal of a ring
like how the triangleeq one exists for normal subgroups
hm I wonder
it's a thing that measures commutativity
in group theory the commutator is (usually) defined as [x, y] = x^-1y^-1xy or [x, y] = xyx^-1y^-1 etc.
is this in a lie groups context? you can give a geometric interpretation to the lie bracket using flows
general lie algebras
xy-yx
^ basically lol
yeah it's ch1 of a UG book on lie algebras
you can kinda see why it's called the commutator in that image as well
The commutator of x and y is [x,y]
i'd be careful writing this, since lie brackets need not be of the form xy - yx. but in many contexts (e.g. matrix groups) this is fine
Yeah there's other contexts for the word "commutator" but that's not what the book is using atm
I mean there's not much to think about lol it's a definition
is the proof 1) there really enough
it feels like they just shows closure and kinda inherits the rest from Q being a subfield of C, is that enough
ok i guess it obviously is, but should they have been more explicit about it then?
If I have a left linear map which is a left isomorphism, does that mean that its inverse is also a left isomorphism?
f(ax)=af(x)
$f^{-1}(ax)=f^{-1}(af(y))=f^{-1}(f(ay))=ay=af^{-1}(x)$
Iteribus
first =: f is onto
second =: left linear
Thanks!
kinda crazy how normal subgroups are called normal cause of Galois
I'm trying to show that Q/Z has only one subgroup of order n
now the cyclic subgroup generated by 1/n is of order n, and so that works
however, the cyclic subgroups generated by 2/n,3/n etc also have order n
Now I'm assuming those are all going to be equivalent to 1/n, but I can't really put into words as to why that is. I'm certain it's because we are quotienting out Z but I can't formalise that properly bc smol brain
see if you can construct an isomorphism between these different groups
Explain
My prof said that Normal subgroups are called such because they correspond to normal extensions of fields when talking about the Galois Correspondence
Yeah it's kinda cool
Tho tbh idk why normal extensions are called normal
Although ultimately ig with the Galois correspondence you can just say they correspond to other Galois extensions right lol
True hm
Yea
I wonder if it's just to mean like it's a well behaved extension lol, hm
Normal seems to be used weirdly in maths lol
am I misunderstanding here or is this contradictory
suppose E/K is a finite extension of say, char 0 that isn't simple. then by the above we have its seperable. totally seems reasonable to me esp given the def of a seperable field
but then Wikipedia says that implies its simple? it's clearly not right or am I misunderstanding
Mathematicians suck at naming things
Learning about reproducing kernel spaces, I ask the professor in what sense is it a kernel, and it has nothing to do with algebra
lmao
Polynomials are wassup though
Every finite extension in char 0 is simple
The primitive element theorem tells you that any separable extension is simple, and any extension in char 0 is separable
That’s why your counterexample doesn’t work, no such thing exists
I know this is a dumb question and the answers don’t really matter, but I’m curious. Which do you all think is a better notation to denote the integers modulo n, Z/nZ or Z_n? If either, why?
does the alpha in the evaluation homomorphism $\phi_{\alpha}: R[x] \to R$, $f(x) \mapsto f(\alpha)$ have to come from any particular set?
beachcow
oo gotcha. i guess I was always thinking that like, Q(\sqrt{2}, u_3) where u_3 is a nontrivial third root couldn't be written as a simple extension but I guess I never thought of a single element which could satisfy both.
even though now in retrospect there's obviously one for this case
the former since it's more evocative of quotients
hmm im a bit conflicted then because you can consider roots of polynomials in R but also those that are outside of R, and my book uses the evaluation homomorphism for the definition of roots of polynomials
roots being the alpha such that f(alpha) = 0
i presume you can only consider such homomorphisms when R is contained in the set alpha comes from
I think I agree with @barren sierra
I think by former he meant Z/nZ and not "integers modulo n" though
I personally swear by it enough that I go through the pain of having to do \Z{}[x] to do my polynomial rings since I have \Z[n] be Z/nZ
That's why I use the former more frequently as well. Additionally, Z_n can be potentially confusing with the notation for the p-adic integers, although context certainly allows one to differentiate between the two.
I thought people used \Q_p for p-adics
Arr0w_04
ah gotcha
if i wanted to learn more about p-adics, what would i go into? I heard analytical number theory is one but I'm not actually sure
I think Dummit and Foote has some exercises discussing them, however there are some other books on them as well.
The first edition of this work has become the standard introduction to the theory of p-adic numbers at both the advanced undergraduate and beginning graduate level. This second edition includes a deeper treatment of p-adic functions in Ch. 4 to include the Iwasawa logarithm and the p-adic gamma-f...
I haven't read either of those, but those are two examples.
I liked this one
Very quick and dirty
Why is a factor ring formed by a maximal ideal always a simple ring?
I can never remember my isomorphism theorems
Okay it follows directly from the correspondence theorem
? There are four
Is this true, or should m be in M and n in N?
yes
So m in M and n in N need not be true?
What I meant is "m ∈M and n ∈N"
is this definition alright for tensor products? I feel something off since we are taking a map to an abelian group so kinda feels like we are loosing the module structure
A bit doubtful
Lol idk why they use a group instead of another R-module
Like what they have works for tensor product of abelian groups
So ig u could say oh and its compatible w the scalar multiplication etc
Seems slightly odd to me though
Also feels slightly funny as like
They seem to say M \tensor_R N is the tensor of M and _R N
But the subscript is part of the tensor product not N
Because the Tensor product doesn't have an R-module structure necessarily if R is not commutative. The module structure of M,N is preserved by the fact we are looking at R-biadditive maps (It shouldn't be bilinear maps because the Tensor product isn't necessarily a module)
You either need commutativity or one of the modules to actually be a bimodule to get back a module structure
Fair enough lol I assumed that R would be commutative 
you mean even if M is R right module and N is left R module, M \tensor N is not necessarily a R module?
Correct
but it's a Z-module
Aka abelian group
yes
The scalar multiplication might not be compatible with the scalar multiplication of both M and N
Associativity can break down
When R is not commutative or one of the modules is not a bimodule
kinda confused ngl
If you try and give it a module structure, then on one hand you have
r(s(m x n))= rs(m x n)
You want this to be compatible with the scalar multiplication in M and N so you want
r(mxn)= mr x n= m x rn
So on one hand
r(s(m x n))= r(ms x n)= msr x n
But on the other hand
r(s(m x n))= rs(m x n)= mrs x n
And you want these to be equal, which is usually a problem. Same thing happens if you try and endow it with a right structure
It is a Z(R)-Module tho, but looking at Z(R)-Biadditive maps instead of R-Biadditive maps mans you're forgetting the R-Module structure somewhat unless R.is commutative, so it won't be a tensor product of R modules anymore
i see
cgadski
Arr0w_04
No
@chilly ocean no. Let G=1 be the trivial group and H any group, for example. It would be true if phi is surjective
true when φ is surjective
Right, that is what I thought but I wanted to make sure. Thanks ryu sama and stain!
Hi
Im studying representation theory. What does it mean by F-basis? M might not be a free module how do we know that it has a basis in the first place
every vector space has a basis
It’s an a module but a is a F algebra, so M is also a F vector space right
oh yes thanks
Let G be a group, and let [G,G] be the subgroup of G generated by all
elements of the form aba−1b−1. (This is the commutator subgroup of G; we will
return to it in §IV.3.3.) Prove that [G,G] is normal in G.
Any tips for this? I tried showing that [G, G] is kernel of some homomorphism with domain G but I'm not sure how to find such a homomorphism.
I think directly via definition is easier. For any $g \in G$,
$gx^{-1}y^{-1}xyg^{-1} = (gx^{-1}g^{-1})(gy^{-1}g^{-1})(gxg^{-1})(gyg^{-1})$
Like what 1345631 said, you can just use the definition of a normal subgroup and things should work nicely.
1345631
Why should the right hand side be in [G, G]?
It's of the form x-1y-1xy. Try to verify this
I'm having difficulty with abstract algebra tooic sub group
we might be able to help, if you ask a question
also, what does tha matrix of a_M look like?
Can you tell me how to understand in easy way about groups, subgroups, permutation groups, quotioent groups
Is there any online teacher or videos which is helpful in it?
The concepts are really easy to get when citnextualized
You should read any introduction on groups
groups represent symmetries of some object(s), for example the cyclic group represents rotational symmetries of a flat object. an element of the group is essentially an action that applies your symmetry like a rotation or reflection or what ever else there is. the group operation is just a way to compose these actions like first rotate and then reflect.
subgroups are subsets that are also a group. they can be things like smaller sets of symmetries of an object like just the rotations for example but there are many more types of subgroups too.
a permutation group is just the set of all permutations (bijective functions from one set to itself) via cayleys theorem all groups a a subgroup of the permutation group. so you can think the permutation group as all symmetries on a set of a certain size.
qoutient groups are easier to understand if you understand if you understand integers mod n cause it's the same concept
groups are group actions
a group acts on itself so yea 
specifically group actions on vector spaces 
It seems the galois group of a polynomial is independent of my field as long as its coefficients are in that field. Am I understanding this correctly?
Well galois group of x^2 +1 regarded as a poly C[x] is trivial since it already splits but galois group of x^2 +1 in Q[x] isn't trivial
Unless you mean smth else
Hey, sorry, I've kept this message as unread for over a month in hopes that I would have time to come back to it, but yeah that didn't happen and I still know virtually nothing about group topology…
very curious fact though.
See that makes sense to me. What am I supposed to think when a question just asks "Find the galois group of the polynomial x^3 - x + 1"
I would assume they mean as a poly in Q[x]
Isn't that clear tho? The cohomology H is functorial in the group G in the first argument, and H is isomorphic to any of its conjugates
Okay I know that b and c are reducible, but how do I reduce them?
Algebra rules
Starting with b for example
assume x^3+2=(ax^2+bx+c)(dx+e) for a,b,c,d,e in Z_3.
Solve for a through e.
If we expand rhs we get
(ad)x^3+(ae+bd)x^2+(be+cd)x+(ce).
We need ce=2 and ad= 1.
ae+bd=0 and be+cd=0
x^3 + y^3 = (x + y)(x^2 - xy + y^2)
Quadratics and cubics are very special cases. If they are reducible, then they must have a linear factor in their factorisation. So e.g. sufficient to show a poly is irreducible by testing X=0, 1, 2 for these exercises and confirming none of them are roots (this does not work in general).
So e.g. X^3+2 must have X+1 as a factor, since (1)^3+2=3=0 mod 3.
And continue applying this idea essentially
must have x-1 =x+2 as factor?
Indeed, my bad I miswrote
Only love
omg I'm so dumb!
lmao I didn't think about how mod behaves with negative numbers
that helped a lot Cole Lee
Thanks everyone else
can someone explain wut a left polynomial is
vs a right polynomial
like wut is the distinction
is it just that in the general form of a polynomial in a polynomial ring $R[x],$ a left one is expressed as $\sum_{i=1}^n a_ix^i$ while a right one is defined as $\sum_{i=1}^n x^ia_i$?
JustKeepRunning
yea it seems to be in the paper ima reading
but i am a bit confused about this part of the paper
can someone explain the red part
if u want link to the full paper it is here: https://libgen.ggfwzs.net/book/81145072/cc70ba
A general theory of Vandermonde matrices | T. Y. Lam | download | BookSC. Download books for free. Find books
left/right just seems to distinguish where the coefficients are
also, "left polynomial" in the first line of the second page has a footnote that might answer your question
yea it does confirm thx
but do u get my question about the red highlighted part
idk wut the paper is trying to say
idk didn't read
Hi, I'm trying to prove that J = (x^2 - yz, xz - x) is a radical ideal in k[x,y,z]. That is, suppose there exists n such that p^n in J for p in k[x, y, z], p in J. Could anyone give me a hint on that? Thanks 
just wondering is k here commutative or no
k is a commutative field
ok ok nice
The solution I outlined before does work, I worked it out.
Compute the minimal primes over J, then look at their intersection [ which is sqrt(J)] mod J. Use relations in J to simplify the ideals in the intersection until the intersection becomes easy to compute, then conclude that sqrt(J) mod J is 0.
There ends up being very little computation
@next obsidian could u elaborate on how u can compute the minimal primes over J?
Suppose p is a prime containing J. Use the primal of it to conclude certain combinations of elements must be in it, and no matter how you do it, the ideal those elements generate is prime. They also contain J, so if p was minimal then it equals them
One example is, you conclude that one possibility for p is (x,y)
Thanks! But this problem asks us to prove it is radical first, then find the intersection.
I'm not sure if I can switch the order tho...
Of course you can
It doesn’t matter in what order you do it, computing it as an intersection shows that its equal to its radical, so it constitutes a valid proof of the first point
Proving that its radical without computing the radical as an intersection means you’d be showing if f^n is in J then f was in J and this is hardly realistic, it will be absurdly hard to do so
nullstellensatz moment
I see... Thanks! 
It really won’t help, because showing that this is the ideal to the associated algebraic set is basically gonna just be showing its radical lmao
Swag
let E be a vector space over K : dim_K(E) = n
and F a generating family of E with n element
prove that F is basis of E
you could start by noticing that every generating set contains a basis
Sorry another question. Currently I find out these three ideals and the intersection of them = J. How could we conclude they are the only minimal primes over J so the intersection = sqrt(J)?
Well if you’ve found 3 primes containing J whose intersection is J, call that ideal I
Then you know I = J < sqrt(J) < I, the last equality because you’re taking an intersection over fewer ideals
But this implies all of these < are equality
Why
any proof for that?
no
no proof exists for it 😧
r u srs?
yeah :(
i feel like u can extract a basis by removing dependent elements contained in the generator @chilly ocean
two pings too many pings
why don't you write down a proof, then you don't need to ping someone to know if you're right
still wondering how to do it
thats why idk what proof should i write kek
do you believe in doing any work on your own?
I'm telling you to figure out a proof on your own, this isn't hard
if it wasn't hard i wouldn't ask u
you haven't even worked on this for ten minutes
how'd u know?
because TTerra gave you an idea and you immediately asked how to do it
You have an idea
"remove dpenednet elements"
you could start by noticing that every generating set contains a basis
just write that down
This?
figure out why that idea proves it
i tried that i want something else
how long did you try to prove that?
using the method to extract basis from the generator?
Yes
well i just used induction on it
this is the straightforward method 
not really
Ahh Thanks! _(:_」∠)_
f: C. -> D. is a quasi-isomorphism if H_n(C.) = H_n(D.)
this definition seems completely independent of f
like if H_n(C.) = H_n(D.) which only has to do with the d's then I can shove in any f to be a quasi-isomorphism
or I guess as long as f makes the diagram commute which still isn't really any condition on f since any morphism f has to satisfy that
I need to know about books which is helpful for begginer and youtube too please duggest me sir@grand sigil
dummit & foote
Because this isn’t the definition
f is a quasi isomorphism if the map it induces on homology is an isomorphism
Im not exactly sure what is good. I personally learned most my algebra from a textbook by Fraleigh. If you want to use youtube you should check out Richard Boechards or Socratica.
Hi, could someone help me understand the Number Theoretic Transform
(I assume it's abstract algebra, though redirect me if I'm wrong) I don't quite understand what's happening in this example
is the weird letter next to X just a coefficient
and why is it to the power of 128 too suddenly
https://dsprenkels.com/ntt.html it is taken from here
During the last half year, I have been working on implementing the Dilithium signature scheme.Dilithium is one of the few remaining candidates in the NIST po...
you mean the $\mathbb{Z}_q$ or the $\zeta$?
JustKeepRunning
I'm not sure if this is an easy question. Say Gal(L/Q) is isomorphic to A_n. Is there a way to find a polynomial s.t. L is the splitting field?
should 2 not be the other way around?
the zeta, sorry, had to run some errands, I got some rundown from someone about it
Hey guys this is probably a really straightforward question but i dont understand how to go about it
This is asking how to prove that the quarternions are a subring of M(2,R)?
How do I show that ( 2Z, +, . ) is not a ring with unity
is it sufficient to just say that there exists no element 'a' in 2Z that follows a.b = b.a = b
yes
Ok thank you
How do I show that phi is onto
I know that I need to show every element of Real number set R has a pre-image in Domain R, but not sure how to approach it
are constant functions continuous?
Yes !
Ok so do you mean we can always define a continuous function f(x) =c, for all x belongs to [0,1] and for any real constant c ?
I'm not sure if this is what you're precisely asking, but this got me wondering if every finite group appears as the Galois group of some polynomial with coefs in Q.
After Googling, it turns out this is an open problem, but S_n and A_n are proven (by Hilbert) to always be the Galois group of some polynomial with coefs in Q
Constructions are given here: https://en.wikipedia.org/wiki/Inverse_Galois_problem
yeah, ||and then since c is any real number the image of all constant functions at 1/2 is the real line||
I think $\zeta$ is a primitve 128th root of unity
JustKeepRunning
Does anyone know of where I can get my hands on a complete solutions manual to Dummit and Foote?
i saw there was one on quizlet
but u need quizlet plus
for me it was worth it
Doesn’t exist
Ugh that sucks. I tried looking it up on the web and I found partial solutions to the exercises, but it was mostly for group theory. It had less and less solutions for ring theory and field/galois theory, much less the later chapters...
oh yea i saw this one too
it wasn't complete though
Yeah they would skip certain exercises, and sometimes whole chapters towards the end. It's a great book, super unfortunate I can't check my answers.
no there is one on quizlet
thats complete
i'll send it here
you need quizlet plus though
Sweet, I'll check it out.
I am very suspicious that someone has solved and collected every single exercise
At the very least that they’re correct
It says "verified" but I am not sure what that means lol
it seems to be done though?
I doubt it
at least i've been using it for like the first 5 chapters
and it sbeen pretty good
Yeah that isn’t deep enough to where I think it would become dicey
There’s a number of people who’ve done all of the groups stuff
Someone in this server did it even
yea but i think its still avaluable resource
Sure
I could use that one too, do you know where to find that?
I just am doubtful it actually has all of them
Idk I haven’t seen that user in ages
They didn’t publish them
Also, what are your thoughts on using Artin instead of Dummit and Foote? I have never read Artin, but I heard that it was comparable in terms of quality...
¯_(ツ)_/¯
I think honestly you should pick whatever you like the best
What you enjoy reading most, what exercises you find most engaging
The treatments of all the standard texts are roughly the same honestly
hmmmm ok thanks
Ppl will debate the nitty gritty and split hairs that X does this, Y doesn’t! 
But they’re so similar I think just using the one that you’ll actually enjoy using is most important
A textbook you don’t want to read isn’t gonna teach you as much as one you will read haha
Yeah, true. I just had a weird experience with calculus and linear algebra where there are books that are genuinely better than the others. The ones I took for my classes were fine, but then I figured out that Spivak existed, for example. I just don't want to make the same mistake with abstract algebra where I put a bunch of time into it and there was a significantly better book out there.
Yeah that’s fair. I think just stay away from Lang is all I can say
Lang is too hard for a first pass
LOL yeah lang is really really terse
The differences between the books are impossible to really judge for yourself until you already are familiar with algebra
There’s definitely differences, but none is really “better” than the other in total
Some just treat X better but Y worse
And if you’re new, you can’t judge which between X and Y will be more important for you
I’m sure whatever books you’re looking at, Artin, D&F, etc are all roughly equal
OK, thanks for the advice @next obsidian! Appreciate it.
Let G,H be groups and phi: G->H a group homomorphism. Suppose H is abelian and phi is injective. Is G abelian?
first iso
Nvm I got it
quiver is pretty good
A modern commutative diagram editor with support for tikz-cd.
Is there a way I can use fixed fields to answer c or do i do something by hand
Honestly, I don't see how c) is true, but I could also just be being dumb. Like, sigma_2(z) = z^2*z = z^3 =/= z
how do you know that's what sigma_2 of z is?
it only says that it does that for the root a of f
Oh, of course, I'm dumb
i know sigma1 and sigma5 are inverses and i tried to use that somehow
same w 2,4 and 3 is its own and id is its own
wait doesnt s3 have like 4 self inverses tho
Just thinking out loud, so sigma_i(z) = sigma_i(1/2 + a^3/2) = sigma_i(1/2) + sigma_i(a^3/2) = 1/2 + 1/2 sigma_i(a^3) (since sigma is an automorphism)
Assuming what I've said is true, I think that should give you the right direction to go
Depending on what the discriminant of your polynomial is.
Have you covered discriminants?
Oh that makes perfect sense @spiral wolf ty ty idk how i missed that
no
I'm trying to map it to this example
but it's hard since I don't know what L is
Ok so L|Q is degree 3 (given) and adjoinint w is a degree 2 extension on L (since w isn't already in l and its minimal polynomial over Q is the degree 2 one dividing x^3 - 1)
Yes, since it is a finite galois extension of that degree, it must have a group of that order. We really only have one order 3 group
oh group my bad that's what I meant
So what do we know about the galois group of L(w) over L?
it must be degree 6 by tower law
I got that much
oh wait no
over L
it must be degree 2
ye i was just gonna use that to derive that the extension totals out to degree 6
yea I got that immediately it's just determining automorphisms
is the only valid automorphism omega -> omega^-1
and thus this generates a group of order 2, Z/2
I don't want to interrupt your conversation, but I'm forgetting the wording for something. If I have an irreducible quadratic polynomial and I want to declare alpha to be a root of this polynomial, what do I call alpha exactly? Not just a root, right, since it's irreducible and I'm creating a field extension?
"Suppose f(x) has an irreducible quadratic factor in Q[x]. Let alpha be a ??? quadratic root ??? of that factor"
I always just call it a root, but the extension itself is called quadratic
Fair enough, wasn't sure if I was allowed to just say "root" without some qualifier explaining that it's part of the extension
Another question, in this problem I'm to show that x^5-x-1 is irreducible mod 5, which I have done. I am then supposed to conclude it is irreducible in Q[x]. What theorem am I supposed to use here?
As this is primitive, it's irreducible over Q[x] iff irreducible over Z[x]. And what would happen if it factored properly over Z[x]?
Thanks 👍
Is it enough to state that Galois Group of order 3 => Z/3 and then we have Q(omega) has two automorphisms: the identity and the map omega -> omega^-1 which forms a cyclic group of order 2? Then since omega is not in L we have these are separate fixed fields and so we have Z/3 x Z/2
I am unsure how to show this isn't S_3

