#groups-rings-fields
406252 messages ¡ Page 500 of 407
I think anything in the realm of Z/nZ won't work
matrix rings aren't commutative
I don't think quotients of polynomial rings of fields seem very nice
Suddenly most of my examples for rings are gone lmao
there are examples in quotient rings of polynomial rings
to introduce nilpotence
this one feels weirder to me than the continuous function one
but it uses polynomials
This seems more like something I'd stumble upon
but also I literally never think about continuous functions for rings so
I should probably try to consider them more lol
U is a polynomial of x and y
this is just a product of elements of the polynomial ring k[X,Y]
oh is U(x, y) just any unit in K[x, y]?
it came from the unit $u$ in the quotient
there was a unit in the quotient? Is this not the quotient by xy^2?
No
They start off by saying they use lowercase for the image of stuff in the quotient
they said assume that ux = x(1 + y) in the quotient
Ok
this turns into a statement U(X,Y)X - X(1 + Y) in (xy^2) in the polynomial ring
By taking representatives
What do you mean by taknig representatives
like
x, u are equivalence classes
you jsut take an element in that equivalence class
you do this everytime you move from a quotient into statements in the lareger ring
yeh
then they do some stuff to prove something about U(X,Y) I think
to show that u is in a maximal ideal
so that it couldn't be a unit
even tho you started off by assuming it is
đ
yoo where tf am i lmao
The algebra zone
ah im p pissed rn
Ok so from that paper
With K[x, y, z]/(x - xyz), we get that x = xyz
And y and z aren't units?
You ever feel like cheating when you use a technique from a problem you've seen to solve the problem you're currently working on?
You ever feel like cheating when you use a technique from a problem you've seen to solve the problem you're currently working on?
@vestal snow I feel the opposite
I feel like âIM LEARNING!â
Haha I guess I'm in the "glass is half empty" camp
I wonder what commutative algebra would be if we assumed the negation of Zorn's Lemma
Is there any text/paper about this?
Is there a typo here?
where it says $P_3, \cdots P_r$ are prime, maybe it should say $P_1, \cdots P_r$
The formerly edible banana:
ok so from this,
why do they have x ~ xy?
THeir definition is that a ~ b if Ra = Rb
Oh is x ~ xy their way of writing (x) = (xy)
Is there a typo here?
@vestal snow no, you only need the ones past 1 and 2 to be prime
Usually anytime you use this all of them will be prime
But prime Avoidance is satisfied when the first two arenât necessarily prime and Iâm pretty sure you want to do something like that
@marble heath both groups are commutative
You canât show theyâre non-isomorphic by showing one is commutative and the other isnât
Just write out multiplication tables
Then both of them have to be conmutative if they are a group
Yes so you do it a different way
With 4 elements you can just write out multiplication charts until you find them
Thereâs other ways to show theyâre not isomorphic
So I have to find another thing
Look at the order of the elements
But the order will be the same if the groups have the same properties
I think it is a hard ex hahaha
This is not hard
One of them has an element of order 4
The other doesnât
Just find a group without any elements of order 4
With 4 elements
Maybe I m wrong
But, if they are 4 elements
Then I cannot repeat one of them on a row or column
That is not going to asure me that the order will be the same for the 4 charts ?
You have to look at your charts
And follow repressed multiplication by the same element to figure out its order
If you do it you will discover a group with 1 element of order 4, 2 of order 2, and 1 of order 1
Versus one with 3 elements of order 2 and one of order 1
You are right
I thought that the 4 possible groups had the same order
Could you please tell me what Groups and Rings are useful for ?
groups arise naturally any time you need to describe symmetry of any kind
Ok so I've been trying to figure this out, and by their definition, a ~ b is if Ra = Rb, which is the same as (a) = (b) right?
So then we'd have to have that Rx = Rxy
And I see that all of Rxy would be in Rx, but not necessarily the other way around?
Like in the earlier paragraph of this they have that
So I guess that I need to show somehow that q(x) = q(xy) right?
And in this quotient ring we have x = xyz, so 1 = yz?
I guess I'm asking what exactly does x and xy get sent to in this quotient ring
Does the fact that R only has 1 finite degree field extension has something to do with the fact that every polynomial with real coefficients can be split into linear and quadratic terms?
so a UFD is also an integral domain, so there are no nonzero zero divisors, and every non zero element is cancellable under multiplication right? So if u and s are in a UFD R, then u/s, s/u both have meaning/exist?
I know the notation for "is a subgroup of" is $\leq$, but is there any notation for "is a Sylow p-subgroup of", or is it actually necessary to write out all of that (or does anyone have a nice short way of writing that)?
Tubular Cat:
I encountered this problem in my topology course and realized my group theory was really rusty
But how can I show that Z^2 and Z^3 are not isomorphic as groups?
Suppose $\phi\colon \mathbf Z^2 \to\mathbf Z^3$ is an iso. Consider the subgroups $H = 2\mathbf Z^2$ and $H' = \phi(H) = 2\mathbf Z^3$. This gives isomorphisms $(\mathbf Z/2\mathbf Z)^2 \cong \mathbf Z^2/H \cong \mathbf Z^3/H' \cong (\mathbf Z/2\mathbf Z)^3$. But the first has 4 elements and the latter has 8, so these can't be isomorphic.
NielsK:
For any two groups $G,H$ let $\text{Mor}(G,H)$ denote the set of group homomorphisms from $G$ to $H$ . Assume to the contrary that $\mathbb{Z}^2$ is isomorphic to $\mathbb{Z}^3$ via an isomorphism say $f:\mathbb{Z}^2\rightarrow \mathbb{Z}^3$ . Now consider the map $h:\text{Mor}(\mathbb{Z}^3,\mathbb{Z}/2\mathbb{Z})\rightarrow \text{Mor}(\mathbb{Z}^2,\mathbb{Z}/2\mathbb{Z})$ given by $h(g)=g\circ f$ since we assumed $Z^2$ is isomorphic to $Z^3$ so $h$ should be a bijection but clearly $|\text{Mor}(\mathbb{Z}^3,\mathbb{Z}/2\mathbb{Z})| > |\text{Mor}(\mathbb{Z}^2,\mathbb{Z}/2\mathbb{Z})|$ hence a contradiction .
Hrmmm
WhyamIsohot?:
Does the fact that R only has 1 finite degree field extension has something to do with the fact that every polynomial with real coefficients can be split into linear and quadratic terms?
@smoky cypress you can do a proof which exploits this, and uses only this fact, along with a few others. So Iâd say yes
You really shouldnât
Since / isnât an operation, itâs supposed to mean you multiply by gcd(a,b)^-1 which might not exist
Hrm
But usually youâd just say let c be such that gcd(a,b)c = a
Also I still want to clarify some stuff about the queshion from yesterdy but I'm in bed right now lol
Oh
True
And Iâm not even certain that such a c is unique
In an integral domain it will be
By cancellation
Well I'll ask more about that in a bit, I'm in bed right now and can't remember what I wrote down regarding that
Well in a UFD
I guess you can say like
âAnytime a | b, I will denote by b/a the unique element c such that ac = bâ
But in general if youâre doing a/b and you donât know everything has inverses people will be a little suspicious
Yea but like as somebody pointed out earlier, say 2/3 doesn't exist in Z
Yeah
So if you have x,y in Z and wrote x/y
Iâd be like, woah woah woah, why is that in Z?
Well in a general UFD, if d = gcd(a, b) I can say that there exists a unique element c such that dc = a and some other unique e such that de= b?
Yup
Uniqueness is just
Suppose that you have c, d such that ca = b and da = b
Just use transitivity
ca = da
Then you can cancel to get c = d
Unless a is 0 lol
Yea
Wrapping my head around this is still a bit hard
Uh other question
So from the paper last night linked in the mathstack discussion, they had this
So I guess that it's saying that q(x) = q(xy) where q is the quotient function from K[x, y, z] to R
But why is that true?
I donât think thatâs true
I don't really get it
What does ~ mean
a~b means Ra = Rb
So same ideal generated?
But in the first screenshot above, does the bar not denote quotient?
Yea nor do I
Actually I do
They just claim it and I'm ????
the more I think about it, the more this example seems really clever to me
the whole point with trying to find two elements which generate the same ideal is you need to find some a and b which are both multiples of each other
Like I see that xy in x
the easiest thing you can do is take a = x and b = xy
But not that all of x is in xy?
then b is clearly a multiple of a
Like I said
but how do you get that a is a multiple of b?
I think there's something fundamental that I'm missing
in the ring R, x is literally equal to xyz
Yes
The elements (xy)z in (xy)
That I get
But (xy)z = xyz = x
because
xy is a multiple of x
this is the whole point of the exercise -- we are trying to find two elements a and b in a ring which are multiples of each other
so that (a) = (b)
so in this ring, we're taking a = x and b = xy
Do you believe that x = xy * z
Do you believe that xy*z in (xy)
yes
Then x in (xy)
Yes
This gives you equality of the two ideals
Now you have to show that they arenât associate
the more I think about it, the more this example seems really clever to me
@oblique river yeah same
ok yea I think that I can figure out the second half now if I stare at it for a while
That first half confused me lol
what do they mean by setting y = z and x = 0 though?
This is a polynomial
Youâre just plugging in values
Y = Z means the same arbitrary value
oh
So this turns the polynomial of 3 variables into a polynomial of 1
didn't know you were allowe dto do that
I mean if you want to reason you can just plug in W for Y and Z
Then itâs a polynomial in only W
But thatâs the same thing as just calling it Y
i feel like this problem is too tricky for an intro algebra class
at least i wouldn't have been able to do it during my first algebra course without a hint of some kind or just looking up the answer
shrugs
Yeah this is kinda fucked haha
I tried googling some of the material and half of what shows up is like grad level stuff at other schools lol
Seems pretty arbitrary how they go and ste things up
o.O
I know that University of Toronto has pretty difficult intro sequences in Analysis and Algebra as weed out classes
I'm guessing Waterloo is the same
@next obsidian Would you recommend skipping some sections at the beginning from Matsumura?
Idk, I found them refreshing
They also cover some stuff you might not have seen before
Like section 2
They are much better written than A-M imo so I don't mind
has a proof that any projective module over a local ring is free
where as there's a much easier proof for finite projective
the general case used transfinite induction
and I thought it was mega cool
and I actually did a proof of the finite case for a midterm once, and knew it held more generally so seeing the proof was sick
Yeah and it's just in the second section haha
I really like the book
The style of proof you'll see also is like
really clever with picking elements and doing element manipulation stuff
which I'm not a fan of normally, but I like how it's done in the book and it makes me want to get better at it
Also my general thoughts on it are that it isn't the best option for a first introduction to commutative algebra, but once you know a bit it's good and if you do the entire thing you're in a great spot to do anything in AG or ANT for the most part
Mmmm I've decided to wait until classes are in preson to take the next algebra course, galois theory, as it seems that online learning is not greate for me lol
are you specializing in algebra?
no, but I'm interested in it
Galois theory is really cool, but if online learning isn't working no one can fault you
I don't know what I'm specializing in, for now I'm just treating this whole thing as a "hey iunno what I like but I think that this is interesting so imma go take a bunch of courses on it" kinda thingi
And perhaps retake this coursee in the future tbh
when i struggle in a class usually ill try to sit on in the lectures the next time it's offered, but unregistered
Ah problem is that my school is doing all online again next term
i guess you can take the lame courses online in the mean time xD
yea
Or at least ones that aren't as specialized?
I'm taking uh number theory, cryptography and combinatoricial enumeration instead lol
sounds like a fun semester
"the big theorem" lmao
It's this
dunno about you all but i thought unique factorization was the most boring topic ever
Oh thatâs a cool@one
It becomes more interesting in the context of algebraic NT
Itâs an exercise in Matsumura
I donât know if it really qualifies to have that name tho tbh haha
the name is nearly as suggestive as "fundamental theorem of ___"
Is it considered bad practice to introduce a UFD as an integral domain such that the latter condition holds, then make students show it's equivalent to unique factorization
lol
Is Galois theory lit
yes
easy and fun
for me i think it was finally the moment where i turned
definition-thm-proof into ideas
that i can play with and so on
its cool
Ok so for this question I got it going in one direction, if I is prime and nonzero then as R is a PID, I is maximal, and so R/I is a field, and fields are PIDs, but I'm not really sure how to approach it from the other direction?
If R/I is a PID, something something
I feel like there's something to do with the quotient?
The "big theorem" that Liria posted looked familiar.
I literally saw it in Matsumura yesterday lol
@solemn rain what are the prerequisites
group theory/field theory are must
and some knowledge of how polynomial rings work
if you knwo groups and rings most galois theory textbooks/sections will begin with fields
Can someone explain how we got the commutative diagram?
I don't know what theorem I'm supposed to look for in the appendix
If R/I is a PID, something something
@shy bluff R/I is an integral domain if and only if I is a prime ideal
well that's the question lol
@solemn rain Iâm a high schooler, I know some group/ring theory but not polynomial rings. Do you know of any books that might be good for me
check pinned in #book-recommendations
Oh thanks
a 'guide' into abstract algebra textbooks
just use the definitions @shy bluff
Integral domain has no zero divisors
it's nothing tricky
I feel like there's a definition that I'm missing
So an integral domain is just that there are no zero divisors right?
I assume GT means Galois theory? lol
yeah, and commutative with 1
you want to prove I is prime, so take a,b in R such that a*b is in I
you want to conclude a or b is in I
well ab is in I, so ab = 0 in R/I right?
yup
Oh and because it's an integral domain, then neither a nor b can be zero divisors
So either a or b is in I?
yeah that's it
Ohmright R is also an integral domain
Can someone explain how we got the commutative diagram?
@vestal snow construct it explicitly
You want to think about elements and where to send them and stuff, I forget exactly
At one point you map to like inverse images of stuff
It isnât quite that bad
So take basis element v_i in L_1
then look at f(v_i), as N -> M is surjective, take some w_i in N such that phi(w_i) = f(v_i)
Then map v_i to w_i
that makes the diagram commute for that square
you can do a similar kind of thing for the map L_2 -> K
Would you recommend doing all the exercises or is it fine to skip a few?
For example, one in section 2 requires a homological algebra
Is it fine if I skip it or should I go read the appendix?
I did all of them
if you can I'd say go for it
but I'd get familiar with homologial methods
1: they're powerful
2: I enjoy them
Got it
2: I enjoy them
@next obsidian Also by this I don't mean, "I like them so learn them reee", but me and a lot of other people I know found homological algebra fun so you might as well
Haha I'll keep that in mind
@next obsidian Are you sure that the map is well defined?
It doesn't matter
you pick arbitrary things in each fiber
Multiple such maps can work
I don't think I follow
So you chose things in the fiber of f(v_i)
to map v_i to
like you picked some w_i such that phi(w_i) = v_i
you might have multiple choices in such w_i
but it doesn't matter, you just pick one
Ahh gotcha
all that matters is existence
which is implied by exactness
for the other map
you do something similar, but you need to use the fact that whatever thing you want to map to is actually in the kernel
or something like that, just use exactness to know such a thing exists
Got it
Since the map K-> N isn't surjective
This way of defining the maps only works because L_1 is a free module right?
Yup
There is no linear relation between the generators, which is why we don't get contradictions
If it wasn't you'd have to check some relations are satisfied yup yup
Oh right lol my bad
You can get a free module L2 there alwyas if M is finite
But to know it's finite is presentation bit
Also
This is the lemma I told you about
if you remember
I did!
Pretty neat haha
I was surprised to use it outside of like
the problems immediately following
which are concocted to be solved with it haha
*problem
I don't see finite presentation stuff talked about that much but Matsumura talked about it a bit so I was 
Do you remember what the problem I asked about was?
If M -> A^n is a surjection and M is finite, then Kernel is also finite
Yup
I see
I think some of the problems in section 2 are best solved via snake lemma
I remember a few were kinda tricky
but I have solutions written up so
It's pretty neat seeing how free modules are analogous to polynomial rings
if you get stuck and don't want to look in the back lol
Ah
yeah so polynomial rings are free algebras
since the indeterminants form the like basis elements wrt algebraness
Ah yes category theory, the thing every non-math major asks about when I tell them I'm a math major
Do they actually
You'd be surprised
I usually just get "wow you like math?"
Or
"Wow I sucked at math, I was good until they introduced letters"
I havne't once had someone ask about category theory haha
maybe you're talking to computer scientists or something???
A lot think it has something to do with philosophy
Yeah
and the general philosophy of "we care how things map to things more"
I think someone once tried to tell me how I can make any equation true by using category theory
what uni do you go to if you don't mind sharing? You said you're going into your second year?
Lmao
and taking it to a universe where it is true
...
I'm going into my second year at University of Arizona
Oh I've heard some nice things about them
Also, the people I was talking about do not know anything about category theory
I'm pretty sure they saw a youtube video or something
Hah that might be it
I had someone once tell me about how like the odds can be in my favor if I could count the number of ways to buy different lottery tickets
and it was literally countable by an nCk
and I just told him right there how many combinations exist
and how like
no
you statistically lose massive money
it was a nightmare
and I was doing something like at a desk
That's what I like about math as opposed to other subjects
It's really hard to bs your way out with mathematicians
yeah lol
If you have significant clout you can try and pull a Mochizuki thing but
in general no haha
I'll dm him and ask him to explain
DeletedUser #2480
Are you taking your school's grad algebra sequence next year?
Or did you take it last year
Yes I am
Ah, I did that my second year as well
I took the freshman sequence
I had so much fun
They didn't let me freshman year
But it worked out for the best
I wasn't in a position to my freshman year so it worked out fine for me
I started doing like actual proof based math my first year so
It would've been rough to say the least
The professor who's teaching it next year also taught me in the undergraduate sequence
at my school algebra was "self-contained" so it's the only grad class you could theoretically do for the first take
but man it would be rough
And I got a research thing with him next semester
If you're into Algebraic Geometry maybe you've heard of him
He's into arithmetic geometry though so idk
What's his name?
Hmm, yeah I'm not familiar. Granted I don't really know many names in any field honestly
I think Zeta knows him
That makes sense I think he went to Arizona
for grad school
And did ANT so probably brushed shoulders with an arithmetic geometer
I think he graduated more than a few years ago
since I think he's at a teaching position now
Ah right
But
I wanna say he's not doing like a tenure track standard thing
so maaaaybe he did it right after graduating
not sure though
That would be funny if you have though
he has a youtube channel you could try and listen to his voice
and see if you recognize it LMAO
I think it's just zetamath
Also, there's solution in Matsumura
but I also have done every one and texed them up till section 6 which I'm on rn
so I'm down to talk you through any of them, unless you end up passing me haha
in which case I won't have them done yet lol
Section 9 or Chapter 6?
Cool, we can work on it together!
I was stuck on the second exercise for a while
but it's just false
and the example given in the first exercise is a counterexample LOL
for context it's "is it true that..."
So it's not a fault of the exercise the statment is false haha
Answer: No
yeah
I did that on a midterm once
I got hit with the "Counterexample?"
it seems really interesting
Also 6.6
Is something I did already for a final
lol
it's also on wikipedia
Yeah honestly I don't see why people recommend this book more
It's rough for a first introduction I think
I mean
Haha, yeah
It took an average of 2 hours per problem
It's really RIP
Honestly the exercises were like
took a long ass time
or like
This was trivial wtf
or "I know this already"
But a lot of them were of the first category
But some of them also are like
fuck you I'm not gonna do some shit about Boolean lattices
I actually liked that one
I just didn't think it would ever be useful
I think I liked it because it helped me figure out stuff like Lattice Isomorphisms by myself
Ah
So I learned algebra in winter and spring of my first year
in a study group Shamrock started
because we weren't in major until fall
both of us were 1st years
like midway through the quarter is when we got accepted
Shamrock couldn't take algebra because he wasn't in major
and the sequence already started and he wanted to do grad algebra the next year
so he just made a study group
Stuff works differently in my university
Then him and me continued it this past year with us leading it like as the teacher I guess (the previous year it was our analysis TA)
So a lot of the basic ring and group stuff I got really solid on that second pass
the stuff I kinda was eh on the first time
You could usually just go into the math department and ask them you want to take whatever undergraduate course
and they just take an oral exam about set theory and some proofs
and basically you're good to go
That's what I did to get into the algebra sequence
oh lol
Also, my advisor allowed me to switch out diff eq and vector calc for two semesters of grad algebra
Him being the professor for the grad algebra course probably played a role
Yeah
the math advisors at my school aren't teachers
the math dept kinda sucks like
you don't wanna work through them
you wanna email teacher directly
Mine aren't either
get permission
this was my faculty advisor
and then be like "pls register me"
does everyone get one at your school?
or are you just a baller
I don't think so
I had one for my first year because I basically went to every algebraists office and was like "please do research with me senpai"
lmao
One said that I can't do research but he's willing to be my faculty advisor
I see haha
Idk if our school even has faculty advisors
that reminds me tho I should email my algebra prof and ask what I should do for research stuff
and grad school I guess
I think we're on pretty friendly terms so
Tropical Geometry is something that was recommeded to me
Because it's a fairly new subject
In terms of research I see
and if you're doing the research with a prof, there's a reasonable chance to get a publication
Vaguely
Idek if anyone at my uni does tropical geometry
It's more combinatorics/optimization related I would say
No one at my school does either
I asked my professor if he would be willing to do it
and he said yes
Oh wow the wikipedia has only really recent citations
dang that's chad
Will you do this research with me
that they don't already do
I think he's waaaay too busy to do it
I know that this research won't be his main focus
I asked if he could do a reading course
and he said he was just too busy
He's like a fairly well-known algebraic geometer so rip
And he himself said that he doesn't really care what the research is about because what he really wants me to learn is how to do research in math
sounds like a nice guy
Worth a shot imo
I might give it a shot haha
Definitely
Tropical Geometry is like
he told shamrock he should just do all of Hartshorne and try to do research in his senior year
and we're in a similar boat I think
same year, know a lot of the same stuff
Classical AG but replace + with min and * with +
He said it like
in his second quarter of second year tho
so the idea was he could finish in 2 years
Oh that's doable
Yeah
I hope so
still massively hard for someone like
doing full workload for their degree tho
And now I'm tryna finish it by the end of next year so
I should get on that
Online courses
Yeah
I just do all my gen eds online
Really actually I'm taking some AG stuff next year
I struggle to do gen ed and math at the same time
messes up my workflow
What i do is this
I do really well with the 1 assignment every week on same day
So this past year I was taking only grad math and same next year
Then my senior year is like do gen eds and separate math stuff
not in classes
- Find an online class that fulfils the requirements
- Grind out the entire course over a weekend
- Profit
lmao
Idk if any of them have it setup so you can just do it all in 1 go like that
if there is I would totally do that though
what's an iCourse?
are you not taking it through your university?
Also, I have a lot of gen eds from community college
Asyncronous online
so that really isn't a problem for me
No they are through my uni
Huh
Honestly tho my senior year idk what I would take
I'll take real analysis
but at the end of next year I'll have
Graduate?
I thought about it
but I still do need gen eds
but in terms of math
I'd have a lot of AG, Algebra, Manifolds, Complex Analysis all at graduate level
I guess I could try like combinatroics
and reals
Do french
Damn that's a lot of courses
and I only need a few more out of major credits
I usually do 2 math classes/semester
Yeah haha, 2 years straight I'd only take grad math courses so
Yeah I'm rocking 3 a quarter this year
and 4 next year
but that's fine cuyz
2 are AG and like sort of linked
Here's my plan:
so It's sorta just 1 I think
Sophomore: Grad Algebra and UG Real Analysis
Junior: ANT and Complex, both grad
Senior: AG and Topic in Algebra, both grad
Maybe we should go to #discussion
yeah
Hello world! I have a question here: let the ideal generated by f_1,...,f_s be J. So, the marked equality is clear for me, but what happens when we take the right hand side to be I(V(J))? The equality is still true, right?
The marked equality isnât always true
The left hand side has to be a radical ideal for it to be true
If thatâs the case, then yeah, I(V(J)) = J as well
okay, so the extra condition is that J has to be radical, right?
ahh, okay
thank you đ
under what condition is an ideal its own radical ideal?
How do we get $I$ is generated by $(u_1,\cdots , u_n, v_1y,\cdots , v_my$?
The formerly edible banana:
Yeah you just have to bash it out
for this question, what excatly is Z[alpha]? Is it just a + balpha such that alpha is purely imaginary?
And what exactly is |x|^2? Is that like the magnitude of it?
presumably yes
Can't I just be like "As N(x) defined as |x|^2, we get a value that is greater than or equal to 0"?
whats the question
|n+im|^2 = n^2 + m^2
Yea
show that N(xy) = N(x)N(y) and rewrite x | y.
x | y is the same as saying y = sx for some s, then we can show that N(x) | N(y) if there exists t such that N(y) = tN(x), so you basically want to go and show that s maps to t?
well you can define t to be N(s) but you still have to show the equation N(y)=N(s)N(x) holds
not sure if that's what you were asking
Wait question, @woven delta, I emailed the prof to clarify but he hasn't gotten back to me yet, but uh in general, for Z[alpha], would you say that |a + b(alpha)| = sqrt(a^2 + b^2alpha^2)?
So for Z[sqrt(d)], the norm is N(a+bsqrt(d)) = a^2+db^2
If d <= 0, then this gives you a norm which is always nonnegative
An integer?
Yea e
The question is uh
like Iget that the two of them differ by one term
Which is like bleh so close yet so far 
so iunno what I'm doing wrong
I see
I fuckede up somewhere but idk where
Yeah one sec let me check your work
Oh I think you are defining the norm wrong
Oh
No it's correct
I agree with your first computation
Let's see if I agree with your second one
hrmmmm
Liquid:
why? How?
Which is why it is always positive when d is negative
Yea
It needs to be a map from Q(sqrt(d)) to Q.
Sorry I got confused
Yeah
Lol you can define the norm for finite field extensions of Q
pardon?
In terms of the galois group of a galois extension
And that's where the - comes from
Yes, these indeed always coincide for Galois extensions (you will have repeated conjugates for non-primitive elements though)
Because the norm of an element x of Q(sqrt(d)) is the product over the elements of the galois group of Q(sqrt(d))/Q of sigma(x)
I .... We have'nt learnt that
That's fine
Sorry I just thought it's important to know it comes from somewhere
I wonder if there's an easier way to come up with the norm
But ok so I should do it again but this time with N(x) = N(a + balpha) = a^2 - b^2alpha^2?
Yeah
Ok
For the case of non-Galois extensions (really extensions in general), the norm is the product of the images of alpha over all the embeddings L into an algebraic closure that fix K (of which there are always [L:K] of them for separable extensions by the primitive element theorem).
Yeah
Sorry for the digression @shy bluff
It's ok
So what you just said is how you define this stuff yea?
I just haven't learnt enough yet to understand it
Thereâs a deeper theory behind the definition
o okie
Basically the only automorphisms of Q(sqrt(d)) are the identity and congugation. The norm is if you apply both to an element and then multiply those 2 numbers together
oke I got it now
THank you!
How do you show that a ring satisfies the ascending chain condition for principal ideals?
Like how do you show that there is no infinite strictly increasing sequence of principal ideals?
Actually what does it mean to have an infinite strictly increasing sequence of principal ideals?
So you should figure this out by looking at examples
And proving that certain classes of rings satisfy the ascending chain condition
A nice non PID that satisfies it is Z[x]
Try proving that
Also there's a good theorem that makes the ascending chain condition make sense
Prove that a ring satisfies the ascending chain condition iff every ideal is finitely generated
Oh for principle ideals
Lol
Yea for principal ideals
I thought you just meant the ascending chain condition
Okay, so any ring that satisfies the ascending chain condition satisfies the ascending chain condition for principle ideals
So that's an example
Like my understanding is basically that
- principal ideals are just sets generated by a single element that are closed under addition and multiplication?
- If it stabilizes then there exists an ideal that contains all other ideals?
So stabilizes means that your ascending chain is eventually constant
what does that mean?
So call your ascending chain A_n
Wait another question, what do they mean by "ascend"
It means that you have a sequence of ideals with
$A_0 \subseteq A_1 \subseteq A_2 \subseteq ... \subseteq A_n \subseteq ...$
Liquid:
That's what ascending means
So each ideal is contained within another ideal
Each ideal is contained within all of the ideals of higher number label
Each ideal is labeled by a natural number
Sure
Eventually constant means that all of the ideals labeled with a number greater than some number k is the same ideal
Oh so it's saying that eventually you get a big enough ideal that you can't go any bigger?
Yeah
Err that any bigger ideal will just be the same thing
Like it means that you can't have a strictly increasing chain of principle ideals
Oh so that's what the (A_n) = (A_k) thing is about?
Yeah
Did you guys talk about the ascending chain condition in general?
Or just for principle ideals
just for principal I think
Oh okay
I'm mildly lost right now because his lectures have been increasingly disjointed as we near the end of the term and he realizes that he went too slow at some point and is now rsuhing to complete
That sucks
Yea I think we only did principal ideals
But yeah the ascending chain condition on principle ideals makes sense if you think about divisibility
hrmmm what do you mean?
Also seperate question, just from proving these two bit scan I say that Z[alpha] is a euclidean domain? As we've shown that there's a function N: R -> N u {0}
I donât know what exactly youâve shown, but you have to still show the Euclidean algorithm works with respect to that norm
I donât think it follows directly from the divisibility thing at the end of (a)
Each ideal is labeled by a natural number
@woven delta isnât ascending chain condition for arbitrary length chains, not just countable?
I feel like I once had issues because of this
I think I was trying to show Ascending chain <==> finitely generated ideals but doing it the wrong way and countability threw a wrench in it
Hmm can you try to reconstruct where it fails?
@next obsidian
It means that for any p,q
There exists some a such that
p = aq + r
And N(r) < N(q)
Itâs just division with remainder
I think this is for non-zero q or you have to be careful if N(q) = 0 or whatever
Yea non zero q
Also Liquid, I donât actually remember
Anyway you have to show that the norm you construct
Works like that
Thereâs a lot of conventions here, but if all you needed was A norm
Then everything would be a Euclidean domain taking the norm N(x) = 0 when x = 0, else N(x) = 1
The presence of the norm isnât what makes the domain a Euclidean domain, itâs that using that norm you can do the Euclidean algorithm / division with remainder
ÂŻ_(ă)_/ÂŻ idk what your norm is or where
Like in general
But like you probably saw this done for Z[i]
Lol
Idk
An example that we have is this
Which seems to be done as if they're just descrbiing that you go and add it a bunch of times
Idk
They are talking about Z[sqrt(-d)]
I donât really have a lot of practice showing it
I think Iâve only shown two things are Euclidean domains
Z[i] and a polynomial ring over a field
Usually with these problems I just stare at it and eventually I figure it out lol
Idk offhand how I do it
Yeah Iâm with Liquid on this one
Can I just be like "As Z[alpha] is a ring, it's closed under addition and multiplication, so we can go and repeatedly take multiples of x until we have some number s of x's such that N(sx) > N(y), but then we reduce s by 1 and taket he difference between y and (s-1)x to be r"? 
idk if that makse sense
I mean
You need to figure out something specific to this ring
I see
Or these class of rings
I'll think about it later liria
This is actually a thing I should know for my Qual lol
Ehhh I think I canfigure it out lol
So my thought is
Do you remember when i outlined the proof of why Z[i] is a Euclidean domain?
You basically estimate the quotient in C
By the closest element of Z[i]
And the distance you go is < 1 (from the actual quotient and the thing you estimate it by)
So when you multiply back through by the thing you want to divide by
You get the necessary N(r) < N(q)
I think the idea is the same??
Just instead of a nice 1 x 1 square grid
Z[alpha] makes a different lattice
hi all, just curious, what are you trying to prove?
Wait are you even trying to prove itâs a Euclidean domain?
what is alpha?
ÂŻ_(ă)_/ÂŻ
(which is why I'm trying to figure out what you're tryign to prove)
Yeah I only spoke about it because she asked if we can say itâs a Euclidean domain so I said youâd have to show the Euclidean algorithm works
Alpha is just some purely imaginary number
Uhh I'll send the question again in a minute, I'm cooking
you could have just said "it's not" :P
@oblique river at the time I didnât know what alpha was either
@oblique river part b over here
What book is this liria
oh, yeah that is just going to follow from part a
if you have an ascending chain of principal ideals, look at the norms of each generator in Z
what can you say about that sequence of integers?
you'll also need the fact that the only things with norm 1 are units in the ring Z[alpha]
I don't really know how to do that and I was just going to prove that it's euclidean because that's ... easier to w rap my head around?
no

did someone here tell you it was?
ok uh what do youmean by look at the norms of each generator in Z
i'm going to go beat them up
oh okay
Because I saw that we had N
And I thought that we could make the conditions for euclidean true
just because it's called N doesn't mean it satisfies the euclidean condition
But I guess not
it's just a norm, not a euclidean norm
Ok
if you ahve an ascending chain of principal ideals (a1) subset (a2) subset (a3) subset (a4) ...
look at the norms of the a_i
those are integers
how do you know that
know what
Well fo rone thing, where are you getting a_1, a_2.. a_n from, and why do you know that they're integer
How do you know that*
they're principal ideals
so they have a generator
the a_i aren't integers
their norms are
Yes
each of those has a generator
Following so far
great
now the fact that (a1) is a subset of (a2)
what does that tell you about how a1 and a2 are related
All of a1 is contained in a2, which means that all multiples of a1 are in a2?
Oh
what does that tell you abotu how a and b are related


What if Mochizuki is on this server?