#groups-rings-fields
1 messages · Page 155 of 1
it's really easy
like
we use the iso to pZ_p
from exp_p (or ln_p)
then you can immediately see that that contains p^nZ_p
because pZ_p here is additive
okay sure let's say that works I'm not gonna check it. so then we've got that
guys when ur done please ping me i just have a quick proof check
@void cosmos
just post it
okay king
yeah and then we're done
okay swag 
Thanks guys
what have i done to feather...
not sure exactly why we needed the topology part but gg wp ez 
entering last year of undergrad
yet another undergrad showing me up
sir you are a god and i revere you as such wdym
if R is a ring , I is left primitive then I is prime. proof: suppose ab is in I but a is not in I , then since I is primitive its the annihlator of some simple left R-module call it A , we have ab in Ann(S) --> ab(s) = 0 --> a(bs) = 0 ( this is for all s) --> a(bS) = 0 --> a(S) = 0 ( by simplicity )
contradiction
does this work
I actually have no idea what I'm talking about and am just REALLY good at googling
Ah nice
me irl
Relatable but not really since 2 years (including this one) since masters concurrent
what
wait you're not phd either
uh
do any of you guys play trackmania?
I don't think there is one for I
what does this medal mean?
bro's first author medal hahahahah
I started playing this game 2 days ago
and no I don't play trackmania
Since AI = IA = A which is only zero if A is zero no?
what we doing? finding zero divisors
bro's proof was just skipped over
(i don't know what a primitive ideal is)
same
oh wait yeah I do
a primitive ideal is an ieal such that R/I is a primitive ring
it's like half a prime ideal
a primitive ring being a ring that has a faithful R-module
faithful R-module being has trivial annihlator
Yes
xy in I implies y^n in I or something
yeah lmao. Was a half troll from me
this is primiary ideal
fuckkkkkkkk
that's primary yeah, I got them mixed up before
bruh find the pair yourself obvsly
you just need two non-zero matrices that multiply to give the zero matrix

Who
you, nerdy bob junior
do I need to link any conversation we've had in #advanced-algebra
i have a genuine hint, but yh, try a bit first
not the most recent one - I could actually follow that one so yeah it's trivial
(Not an undergrad book in the SLIGHTEST) but still
but the one before where you were banging on about fusion systems
bullshit
I kid you not
I think rather you want to note that, since a is not in I, aS =/= 0. So then since S is simple, aS = S, hence since abS = 0, it must be that bS = 0, hence b is in I
Don't take my word for this, I just learned these definitions 1 minute ago, and I do not normally care about noncommutative rings
but uhh this might work?
The book is essentially a long proof of the main result tho
wait did i write something wrong?
So
It’s def not an undergrad book
But it’s literally 3 sections of the first chapter
so ur chatting about grad content and then wonder why I think ur grad 
masters sure but
idk and idk that what I wrote made sense either lol. But this is my understanding?
bro I was learning character theory in my master's year
I am in no way phd material
tbh i got lost
(might be worth posting in #advanced-algebra where it will not be drowned out)
I think it's fine in there
I learnt what a free group is in my master's year
if some sad guy or girl pings me or pings this
Bro what

you know the trace map
that's it
Based
nah you did not think I was a PhD did you
💀
I need to ascend to PhD tier this year
same
I need to shave
yoo i am seriously not this guy at all like i love spamming and shit
even though I will be doing a masters the year after but still
I need to grow a beard
Same
no canc i swear
is it really that unusual to assume people who know more than me are further ahead than me?
In actual on topic discussion, how fast should I blitz Lang & D&F?
This is a pain in the ass Shuri 
good work shuri
u cant blitz DF
I do not know more than you 
also ya D&F is omega long for some reason
Mortal
bro's having a whole ass conversation with you
Yeah idk maybe I’ll just do Lang
I have never heard of primitive ideals
I guess there’s like easy examples using almost-0 matrices
right tell us wtf u doing
I will never learn galois
Or fill in holes, say, in my group theory
yh...?
sounds legit
so give us two almost 0-matrices
(just sold rycs pfp in discussion)
are these easy examples in the room with us right now
$$$
ryc nfts
I just came up with a matrix and tried to replace numbers on a second matrix until it worked 
just checking. 2x2 was what u doing right
what if that matrix was inverible
Yes
invertible matrices are dense so it's probably was invertible
I've learnt the basic stuff via osmosis in this channel
If it was invertible you’d get I when you take the product, then you subtract I, it looks kinda similar to the eigenvalue problem but I didn’t go further with it because it didn’t make sense to me
Galois stuff shows totally transcendental fields are alg closed
it's literally the study of a particular lattice isomorphism who cares
Because like
Anyways uh
when will I ever care about this
Particular char q stuff and Kummer extensions
ok can I put u out of ur misrey
no
feather whats this one matrix uve set ur eyes on
Let me use (1, 0; 0, 0). (0, 0; 0, 1) is an easy example
ur idea sounded good but run it by us
This is roughly the statement that non-closed fields you can have super infinitely ramifying variety-things in non alg closed ones
yayyy
For right multiplication
it looks good
As in, it can ramify into countably many pieces for each ordinal
I just used (1, 2; 3, 4) for my original test lmao
I think
I literally don't know what any of that means
???
But gave up after messing up my guessing
my brother in christ
determinant non-zero, aka invertible, aka not a zero divsor
that is invertible
opencry
AG over non-alg closed fields = no
Am I on to something?
Non commutative AG uses a wholly distinct route tho
zero divisor
prove it
ANY element of a ring?
apart from the 0 ring ig
can I please just post the matrices I have the latex in my clipboard
Huh
no
Just prove for a general ring invertible => not zero divisor
Ok sure but like
show us the goods sir
yes
$\begin{pmatrix} 1 & 0 \ 0 & 0 \end{pmatrix}\begin{pmatrix} 0 & 0 \ 0 & 1 \end{pmatrix}$
Wew Lads Tbh
Wew are you PhD student?
yeah I'm 2nd year
wait wtf
Dang they let anyone in huh?
they really do
Jkjk
I'm not getting funded but yk
Also, for a general ring. An invertible element is called a unit.
Oh 
Just collab w/ me in adapting fusion systems to finite Morley rank groups
Gg ez fields medal
How is that related to what I was trying to do? I was trying to find a zero divisor FOR A = (1, 2; 3, 4), not show that it WAS a zero divisor
I’ll try to prove what you suggested
(This is a relatively longstanding conjecture solving thing it is horrible)
Just curious why A invertible <=> not a zero divisor is relevant to my problem
wtf 1k messages in 3.5 hours
I was trying to find a zd for A
I'm teaching for my funding while giving all the money I earn back to the university in fees 
Christ wew that's unfair
is it?
I’d need to learn this stuff first but dw about it
I think so!
lmfao i wish
they would lt me in
without me being a math majo
I had to pay for undergrad why wouldn't i have to pay for post-grad?
bruh if a is zero divisor and ab = 0.
Then so is b
Oh
I am significantly less worried about PhD apps 
You do, but I think most of us get funding orgs for postgrad stuff. Anyway I won't interrupt any longer. Gl my dude
Thanks wew
I applied to 12 places and only got one interview
That was actually my guess but I doubted myself :(
so yeah u had to start with a non invertible else u got no chance
Okay
the most useful skill in the world
and when I was applying I didn't know what a fusion system was
ok fair
this may seem a waste of time but u example hunt a lot in algebra 
I don't see why it's any different than finding pathologies in topology or analysis
I don’t think that makes sense nvm
So I don't think it's a waste of time
But finite RM are in particular \omega stable and totally transcendental so
And they 100% can be made to work
what do you even do with fusion tbh
They’re the native landscape for sporadic groups but
I love how everyone bleaks at my situation but I literally have nothing to compare to so I just get on with it 
???
I'll let u know when I figure it out
Based
spetses!!! woahhhHH wooohhh
what if we did weyl groups but just made them general coexter groups woahhhhhh
This class is too much Ill do it after too 😭
Well, I know some gigachads suggested finite RM simple 2-Sylow based stuff
And that might be native for uhh
“”Sporadic””/bad groups in this sense
Issue is, sporadic finite groups are still sporadic
So idk how natural it is for the “not algebraic” simple finite RM groups which may or may not exist
And the goal is either to find one via realizability via saturation
Or crush their existence
Either one is h u g e
Nah I'm just scared of that happening to mme when I apply for grad schools. I got rejected everywhere in the states when I applied to UG, all 8 or 9 places 😭
I applied to 3
gl boss
for ug I applied to 5 and got rejected from 3(?)
hard to remember it was 5 years ago
I got rejected by one
Common MIT L
Imagine how cracked I could be with a good math program 
I think so? That or Vakil is what I'll be reading
like wise, believe it or not I did mainly applied for most of ug
because there were just 0 algebra courses
for ug I applied to 5 and got in 5
for phd I applied to 3 and got in 2 one of which was my ug where I am going
cus this works the other way round, say
huh interesting
so I'm gonna be in the same place for 7 years
I guess we do
or
hmm
Annihilators of (a)
that's the word
lemme see lemme see...
well in this case it's the same thing
is this a place to ask about simple group theory questions too and stuff?
yes
oh ok
so
in a group, is the identity element in each of it's subgroups the same as the general group identity element
?
Yes
You can prove this
that's weird
The identity is unique
It's not too difficult to prove
Think about it intuitively
that's not enough tho
Why not?
If a subgroup contains an identity
Then the larger group contains that identity
But the identity of the larger group is unique
So they must be the same
(intuitivelly) I think that like, the limitation of the subgroup can make it's elements have a coincidental identity that has nothing to do with the general identity
Otherwise your group would have two identities
I cannot give any examples obviously because it's not true but my intuition says that
If youre not convinced, try to construct a proof
In fact I think thats an exercise to the reader in my algebra textbook :P
lmao
I solved it last week when going through the capter lol
oh actually it's obvious now lmao
it's the other way around
Yeah
||e is an identity in G, so e is also an identity in H. Since H is a group, e is the only identity in H||
actually not
I need to prove that the inverse is the same in groups and its subgroups
(I think it is, is it?)
fuck
but you dont have to
what
ah
a.b = a (can be done in the group and the subgroup since both are closed)
a^-1.a.b = a^-1a (can be done in the group and subgroup since in both all elements have inverses, but here's the problem, idk if the inverse is the same)
b = e (the argument supposedly is the same in group and subgroup so b = e, just e, the same e)
my problem is being the second step
Youre making it more complicated than it should be
sorry if it's too detailed, I really struggle with groups and always need to call back axioms and simple theorems to be sure I'm right
oh wait actually, if the operation is the same, the inverse works the same way always
shit
Prove that if h has the property that g•h = g for all g (or even one g) then h = e
oh I can do this, sir!! professor!! pick me sir!!
always struggle with this type of simple stuff, whyy
Takes some practice in my experience
Once you've made enough exercises using the group axioms they come a lot more naturally
also that's the second time I struggle to remember how operations are defined
hope so
I failed my first attempt at my abstract algebra exam badly because all I did was spend 4 days studying the book
abstraction is hard 😅
Im currently taking a lot more time going through it and solving as many exercises as I reasonably can and it's going a lot better
that's good
I have uh, 7 days left until the exam 
or 8
counting is hard
either way, practice is the way imo
uhh just associate a subset of the natural numbers with the days one-to-onely
what if I associate the days left with a cyclic group
That way the exam never comes
Because I always loop around
also, does that thing mean the intersection of all subgroups of a group has at least e?
the infinite cyclic group in quesiton:
Yes
that'd be amazing tbh
This is the trivial subgroup
:0
in fact, the intersection itself will be a group
wait no yeah it's always trivial lol
hmm if the universe always loop after n days, perhaps we ought to model everything in Z/n?
the intersection of two subgroups is a group though that's what I meant
unions crying rn
hmm perhaps
(as they should)
good
that's exactly why I was asking those previous questions
Looks like a good exercise
it is, it's simple and tbh easy but made me check a lot of what I thought
find an example where A u B not a subgroup 
literally first thing that comes to mind
isnt the converse more interesting
i literally do not know
like tell when A union B is actually a subgroup
what is the first thing that comes to mind
2Z 3Z
Is it even possible to find an example of AuB being a subgroup without one being contained in the other
there is an awful theorem about when the union of three subgroups is a subgroup
infinite groups are too big
no I don't think so
that's what I was thinking
beggers can't be choosers
span((0,1)) cup span((1,0)) are both subgroups of R^2 but union not closed hnder addition ?
idk about u guys but istg my first examples of groups were Cn or some crap
1997?
wtf
not that recent
Seems like a law of small numbers type of thing
the thumbs up mean my example works?
yeah
lol wtf is this
or just 7 being awful
people rag on 2 being an annoying prime but 7 is far more subtle
But it fails for numbers bigger than 7 too though right? Or is it just 7?
no clue, I'll check the paper
If it's just 7, then that is indeed totally bizarre and disgusting
ig you would ask if it is possible for groups of arbitrary size
who wants to spend their time proving that anyway 🙃
free paper
"free"
it is interesting honestly lol
I tried for a while to prove the theorem about quotient V_4 and couldn’t get it lol
we had this discussion before I think
Somebody here is doing research on 1/7

there's one in linear algebra where vector space over an infinite field can't be a finite union of proper subspaces
what
Good theorem
Im being facetious in my description but yes
good
I liked proving that
my research is on the map h -> ghg^{-1}
ye
We used it to develop galois theory lol
please elaborate
I am curious on this supposed "1/7" number
@cursive spindle
Ok so
1/7
2/7
3/7
…
They’re permutations of each other in base 10
My guy said
What if I found 1/7 looking things in other bases
Saw him working on lemma 30 in the lounge once
Number theory vaguely
he hadn’t yet shown 1/7 numbers exist in other bases
I was like "why would somebody ping me in abs alg?"
I don’t wanna clown him too much tho

Anyway use ur calculator and see the n/7 being permutations of 1/7
yeah but like
In particular, all 6 n
why should I care
by that you mean the decimal expansion?
ye
how are there even 30 things to say about this
bro idk
no one is saying you should care I think
oh in that case I care a lot
He was stuck on showing infinite repeating expansions exist so 
I get it tho
(I walked over and said coprime it and do whatever/b^k-1)
I like caring about things that have no use
are there any cool theorems
no
ok
Im of this group
yeah he directly proved the hodge conjecture
Though if there’s other ones he can find then that’s cool
typical of unemployed people

I am well employed thank you
not actually I just got fired from tutoring for not returning after summer break 
I was thinking if you were in base m with m coprime to p then because 1/p has p-1 repeating things it'll have to be transitive but that's not true at all
I cant keep tutoring cause I'm transfering unis and can't tutor at my new uni immediately cause they need to "train" me...
oh it was online, I could have
I just didn't want to because eww trying to tutor grade schoolers online sucks
e
Is the simplest example of a commutative ring with nonzero zero divisors Z/(4Z)?
probably
yeah although "for 2" is a little redundant
and I'm not sure if that's the simplest one, defnitely the smallest
maybe the R^X thing where X has at least two elements
Why? 2 * 3 = 5 equiv 1 which isn’t 0 no?
what
what
🐒
2*2 cong 0 mod 4
a zero divisor is a x such that there is a y with xy = 0
this isn't the simplest is it? what's counts as a simple example anyway?
R^2 is simpler imo
Yeah I’ll just pass that to him next I see him lmfao

Oh I never considered this lol
also zero divisors are required to be nonzero are they not?
Because (-1, 0) I think
you're about to end their whole career with this one
2 is a nonzero zero divisor
(1,0)*(0,1) = (0,0)
defn dependent
how
the direct product of rings comes equipped with addition and multiplication automatically
if it didn't it wouldn't be a ring
I meantthis
Oops yes
are there rings with zero divisors of any finite size
like 0 is just always a zero divisor
no, like 2
but for which are there
https://en.wikipedia.org/wiki/Zero_divisor#Zero_as_a_zero_divisor
here wikipedia suggests 0 is a zero divisor iff the ring is nonzero
In a commutative noetherian ring R, the set of zero divisors is the union of the associated prime ideals of R.
there aren't any for size 2,3
and I'd say size 1 as well
any higher than 4 makes me cry to think about
why vomiting? I say something wrong?
Interesting question
we won't be able to do products to get them obviously
trust nlab. 0 is a 0 divisor
it's what i said
the problem is the number of rings of a certain order is absolutely gigantic
So the underlying group is Z/pZ necessarily, and it must therefore be of characteristic p, so it is indeed the ring Z/pZ. So no, the primes oughtn't have such things.
you also have that multiplication by an element is injective iff it is not a zero divisor
SHHHHHHHHHHHH
Ya know
Trivial via compactness >:(
based statement
Thank u
feld
:breakfast:
Oh I didn't mean compactness although it helps. I meant Loewenheim-Skolem. Semi-based............
Compactness tells me there is an infinite ring with zero divisors 

lord knows why
Here's a twist: what's the smallest ring with exactly n zero divisors?
croqueta you got any idea what these geezers are talking about
Model theory 
Z[x_1, x_2,..., x_n]/(x_1^2, x_2^2, ..., x_n^2)
there is no smaller
SO TRUE...
uhhh lemme think of a serious answer
1 zero divisor: Z/4Z
in Z/nZ if ur not a unit ur a zero divisor, there are phi(n) units so there are n-phi(n) zero divisors
Not a bad first step
so pick the minimal n such that n-phi(n) is what you want
I'm happy with this answer
you have an infinite set of formulas. If for each finite subset of formulas you have got a model satisfying those formulas, then you have got a model satisfying all the formulas
or something like that
Yeah that's compactness
why does everybody know model theory
anyone know how many (unital, not necessarily commutative) rings of size 3 there are? it's at most 27, since the ring {0, 1, x} is determined by what x + 1, x + x, and x * x are... but for instance we can't have x + x = x, so that already rules out 9 of the 27
So the set of formulas, in english, would be {there is a zero divisor, there is one element, there are two distinct elements, there are three distinct elements, ...} u {axioms of rings}. Clearly there are finite rings of arbitrary size with zero divisors so compactness tells us there is an infinite ring with zero divisors
consider the formulas that say standard things about ordered fields, now for each natural number n consider the formula there exists x suh that x>n. Then Q or R satisfies any finite subset of these formulas
additive group has to be C_3
0 has to be 0
kinda forces it
multiplicative group has to be C_2
oh no not quite
could have three idempotents
Nah nah same argument as before
oh I'm not talking to you guys
We have a unit, and the ring is of characteristic 3
so it has to be Z/3Z up to iso. It's all determined
Have however infinitely many symbols and say x =/= symbol or smth 
why not just use the single formula "for all natural n there are n distinct formulas"
That is not a formula in first-order logic
So yeah it's Z/3Z up to iso. Same thing for any prime; see the argument above
*these are all first order formulas
Or uh however you do upward Lowenheim Skolem, I think something similar gets you downward?
you couldn't apply the compactness theorem in the same way
As it happens, you cannot express such a thing in first-order logic
Compactness proves so
yeah otherwise you would be able to hack the universe
You can do some silly nonsense like
First order theories on V_\omega(S)
But uh
That’s still quite bounded, even if you can work with, say, continuity, open sets, etc
oh rings of prime order do that I didn't know
This is useful for some nonstandard shenanigans, even outside the reals
Since, ya know, functions live in V_3(S), where V_n+1(S) = PV_n(S) u V_n(S), and V_0(S) = S
Or maybe it was 2? 3 should get you sets of functions? nah I think it’s 3 since f is a set of objects in the form {{x}, {x, y}}?
ANYWAY
This lets you do nonstandard nonsense topologically, taking “polysaturated models” and saying like X compact iff every y in X* is in \mu(x) for some x in X
Factually true
(This should look like Bolzano Weierstrass, for sufficiently strengthened notion of sequences)
I don’t think you need polysaturated but you want at least as big as your neighborhood bases for this one
Nerd.... nerd......
If you know what the morely rank is, braces instantly appear on your teeth and your eyesight gets worse by 50%
(I should learn what the morely rank is to get free braces)
My eyesight got much worse in exchange for no braces
Morley rank is very algebra related though
I believe
Im not an expert though so 
TIL learning model theory improves your smile
Totally transcendental field -> alg closed
And Morley rank is like the dimension of your varieties or smth
Morley degree is how many irreducible components
And appropriately generalized to generic model shenanigans
See here for Macintyre
And showing it has roots of unity again applies that Kummer extensions don’t exist in this context, in the proof I saw
Finite Morley rank also apparently implies omega stability (I don’t know how this one goes since I haven’t gotten there in my reading yet)
Presumably something about how you can’t infinitely ramify things
OK fr now we should probably stop talking about model theory in an AA channel
oh right
I'm curious about morely stuff; I might look at it another time
On a more algebraic note, this all connects back to algebraic groups
Via the Cherlin-Zil’ber conjecture
Why would we ever talk about AA in #groups-rings-fields , that's not what we do here
Which is what I was talking with Wew about before
Which states that simple omega stable groups are algebraic groups
In particular, I was talking about the still horrible problem of simple groups of finite Morley rank
Which admit a nice theory of Sylow 2-subgroups
And other p are
dead to us
We get uhh Sylow and Sylow^\circ subgroups
Since Sylow needn’t be definable, but Sylow^\circ are certainly and are the smallest definable subgroup of finite index (of the Sylow group in this case)
“Connected component”
And this somehow ties in with Fusion systems?

Yeah like in the theory of algebraic groups
I do not know anything about those 
Given an algebraic group G there's a smallest closed subgroup of finite index, G^\circ
By virtue of totally transcendental
As there is no infinite descending chain of definable subgroups
so any intersection is actually really just an intersection of finitely many or smth
Sylow subgroups can be undefinable but connected component isn’t
The idea is these things look like algebraic groups unsurprisingly
And as it turns out
They are
Almost
(The conjecture is they are, but we only have algebraic group over char 2 alg closed field or has finite 2-rank)
Where here 2 rank is dimension of maximal abelian 2-subgroup or smth like that
They actually seem to think all simple \omega stable groups are algebraic interestingly
Idk how that looks though so I can’t comment
(The proof of this is basically you make some infinite binary tree thing iirc and therefore unbounded rank)
why is it so common in commutative (at least what i've seen so far) to want to use the statement of things not belonging to an ideal \mathfrak{p} to show that it's prime
well given an ideal p of (commutative) A, it's prime iff A/p is an integral domain and so in some sense not being prime is the more "positive" notion
like, to show smth's prime you just need to find non-zero a,b in A/p such that ab = 0
whereas to show it actually is prime would need you to show that's never the case which is possibly trickier
is Z --> Z/p^nZ ( the natural projection )
a counterexample to show that the homomoprhic image of a semisimple ring need not be semisimple?
Are you sure Z is semisimple?
yea i forgot tell to you
semiseimple for me means only having zero jac radical
need not to be artinian
This is not a good notion of semisimple ring
The right notion should be that every ses of modules splits
tell that to so many books that define it that way
Its not mine tbh
This is a theorem in the text but also assumes the ring is left artinian
is semisimple + 1 = artinian semisimple?
does problem iiic work with the text's definition or the more usual definition? ( that is R is semisimple iff R is left artinian with zero jac )
what's the best way to find nontrivial orthogonal idempotents in C[G]? i wrote (z_1 + z_2g)^2 = z_1 + z_2g and compared coefficients, and got 2z_1z_2 + z_2^2 = z_2, z_1^2 = z_1. so I chose z_1 = 1, which implies that 2z_2 + z_2^2 = z_2 or that z_2^2 = -z_2, so I choose z_2 = -1. hence z_1 + z_2g = 1 - g, but (1 - g)^2 \neq (1 - g) lmfao
I think 1/2 (1 + g) and 1/2 (1 - g) work
wait i'm trying to see why 1 - g doesn't work, i must have done some arithmetic wrong
yeah, in a 2 element group g^1 = 1
yea that seems right, for 1 - g (1-g)^2 = 2(1 - g) which is not equal to (1 - g) :(
ye
!help
Please read #❓how-to-get-help
this is the wrong channel for this
i'm special, i thought (1/2 + 1/2g) and (1/2 - 1/2g) were the maximal ideals of C[G] but turns out they're both equal to C[G] lmfao rip.
now for the part that really matters
can i have a hint?
Do you know anything about having idempotents and splitting up ur ring?
no i don't i'm pretty sure
this was like the second problem i've worked on that has involved idempotents
Why
Why
Well I wonder why, of all things, it’s group rings you’re dealing with
But without like
Local rings, idempotent properties, etc
yea idk we skipped that section in lang and now we're on modules lol

it's a bit weird that we started with ring theory as well but alas
Well, here’s a small hint, what polynomial do idempotents satisfy
as in they're a zero of it?
x^2 - x and x - x^2
so i suppose i'll consider the principal ideals generated by (1 - g) and (g - 1) then
Well, what’s eR look like for an idempotent e
ah this must be connected to the first third of this question then in someway
uh
wait i'm so dumb i didn't even consider the first two thirds of the question which i proved lol
Well, if you know it’s R1 x R2, that should give an idea of an ideal
ya ok thanks for the hint, i'll keep that in mind
And to check it’s maximal, there’s that the quotient is a field
yea yuh
What might your uhh R1 x R2 isomorphism look like
Would these be good to prove on my own or are their proofs really complex
Ez
Yeah
As a hint, consider (1,0), (0,1), (1,1) = (1,0)+(0,1)
(Which makes it obviously necessary to have orthogonal idempotents)
yes they are good exercises 
If it’s an integral domain then we have no zero divisors besides 0, hence xy = 0 necessitates either x is 0 or y is 0
(Should I prove that {0} is an ideal or is it fine to skip that since it’s easy/obvious enough?)
I don’t think I’m allowed to call things easy or obvious though so perhaps I should
What is
it's exactly this statement as you noted, is what I mean specifically
I can call em ez and it is

Let x, y in R and suppose WLOG x neq 0. If {0} is a prime ideal then for all xy = 0 we have y = 0 by defn of {0} being a prime ideal. Done?
Yes but I said x neq 0
Nah it’s all good I’d rather a mistake than be wrong
yeah good then
Wow nice
i) is easy, 2) is a bit more interesting (not hard, but this one is actually pretty useful)
1 is basically the definition 
And just to make sure I understand right, the closet R/P is {r + p} for all r in R and p in P right
Closet?
Thanks autocorrect 
Coset
Isn’t a coset defined for each fixed element in the set you quotient by
Isn’t that this?
{r + p | p \in P} is the coset of r
for an r in R
R/P is the quotient ring (not called a coset itself)
Ahhh that makes so much more sense
which is the set of all r + P
Yes okay
It just inherits the ring operations from R?
(identifying together ofc the sets r + P and s + P if they are equal as sets, i.e., if r and s are in the same coset)
No that doesn’t make sense
The elements are sets
Yes
So the operation is inherited on the "r + " part
well for the first part I showed R is isomorphic to Re1 x Re2, under r --> (re1, re2). so if that's the case then C[G] should be isomorphic to C[G]e1 x C[G]e2
So (r + s) + P?
and then iguess i could consider the ideal embedded in the product
Well if you have that isomorphic, then yeah what kinda ideals does the product have
Since, ya know, iso
Ah, in particular, does that splitting look like, say, ae1 + be2?
Now, of course, there are a few things to check
one is that these are ring operations
Yes
(meh okay kinda boring whatever it should be inherited from R)
Main thing to check is that these are well-defined
As in different representations of the same coset should sum to the same thing
yup
Wdym by splitting
Just regular equivalence class stuff
Okay
I don’t understand something about cosets
Nvm yes I do

What is a
at the bottom
another ring element?
Oh yes duh
Ax
And principal ideals are ideals because if we take a product b*ax then we can write this ba*x and since rings are closed under multiplication ba is just another ring element and hence it’s a multiple of x and hence it’s in (x)
Well I’d still need to show additive subgroup
But is the logic for the absorption property right?
absorption?
yes
Okay that’s easy enough
having one of those days huh
So nZ are the principle ideals of Z

As in splits it up?
what is a)
wow you just got filtered by a TFAE statement

the situation is rough
there are no rings
all rings are unital and commutative, so it does have a 1
multiplication is always commutative and all elements have inverses
you might not have any rings. I have many rings, like the great dragon I am 
I don’t follow, sorry
So there’s a multiplicative inverse for every nonzero element
I honestly don’t know what you were confused by here but
That’s really the only property separating rings and fields? Lol
Multiplicative inverses and no nonzero zero divisors?
once you assume unit and commutative, sure!
Ah
if something has an inverse, it cannot be a zero divisor
(prove it)
Does it literally put every element into re1 + se2 for some r, s?
There is not precise meaning to that split
I’m saying it literally is breaking it up 
If x has an inverse y then x cannot be a zero divisor because then we would have xy = 0, but that contradicts the fact that y is the multiplicative inverse

why would we have xy = 0?
Bad
because x is a zero divisor
nonono
There's a element b such that bx = 0
Not that all elements b satisfy bx = 0
It's existential
You could say I’m having an existential crisis right now
Let me review my definitions

Let x be a zero divisor and suppose it has a multiplicative inverse. Then there exists a b such that bx = 0. Then, bxx^(-1) = b = 0. But we can’t have b = 0 by definition of x being a zero divisor
Huh?
That’s implicit in the definition of being a zero divisor isn’t it :/
When can I expect for this to get hard? Exercises? I think someone mentioned after 2 or 3 chapters?
Alright
I am not a chad
which book is this
AM
Yes I really am
absolutely crazy
like i said, chapters 1 and 2 are baby, chapter 3 introduces a very important concept (rings/modules of fractions), and then after that it does get hard
Yes
indeed
is this related to the field of fractions? idk ca either
generalization thereof
For the field of fractions of an integral domain, you essentially "formally invert" all nonzero elements. This needs it to be an integral domain so that this set is multiplicatively closed. We can generalize this to inverting any multiplicatively closed subset of a ring R (even with the possibility of it including 0, though this is much less interesting lol)
And many properties of interest are invariant under this process
Wait does AM claim that “ring” means “unital ring”? I don’t think so right? How do we know that x is a unit here?
A particularly important case is inverting the complement of a prime ideal (exercise for feather: show than an ideal P is prime, if and only if A - P is multiplicatively closed: that is, if x and y are in A - P, then so is xy). There's a correspondence between the ideals of this ring of fractions (let's call it A_p), and the ideals of A that are disjoint from this mult. closed subset. Accordingly, since we have taken the complement of an ideal, there is a unique maximal ideal after passing to A_p, namely, the image of p itself. This is called "localization", which you've maybe heard before and might motivate why this is important
oop
that's a rant and a half already so I'll cut it there
oo
so are they "locally fields" or something?
A ring with a unique maximal ideal is called a "local ring". A lot of things are simpler in local rings (no examples off the top of my head oop)
But an important idea is the concept of a "local" property, which is one that holds in A iff it holds in all localizations A_p. So it's useful because it sometimes allows you to consider only "nice" cases (those for local rings), and then use localization to generalize the result to all rings (satisfying whatever appropriate conditions)
damn
You are assuming 1), which is that A is a field
does topology enter into the picture at all here?
Ohhh right they’re proving i implies ii
uhh I am actually just getting to the chapter which starts to talk a bit about topology; chapter 10. Something about -adic completions? like p-adics
The first chapter also begins by saying they only consider commutative rings with identity
feather 💀
Is this inspired by the term localization :p
What
cool
you gotta assume the assumptions my friend
I didn’t pay attention to the implication lolol
it's an equivalence proof
1 is true iff 2 is true iff 3 is true
1 is false iff 2 is false iff 3 is false
Yep
I-adics
hmm I ought to rant more like Sharp does it
It’s related to the spectrum of a ring
smaller messages
Which is related to the Zariski topology iirc
than beeg paragraph
Yeah I remembered this
Zariski topology is given on the spectrum of the ring yeah
I meant the concept of localization
AM actually has a lot of exercises on Zariski topology btw
I didn’t read what you wrote fully since I’m kinda doing three things at once rn lmao
So maybe I’m totally off
Probably
par for course for feather
me too 
What’s a good algebra reference text?
Quick and dirty “skip to the section I need to review” type book, efficient but clear
I don't actually know. probably not D&F 
Lang?
Doesn’t everyone hate Lang 💀
It’s a lot of “here’s a result”-y
i think we hate lang as a person maybe
LMAO
but I'll probably try reading lang next semester in my rings/modules course
Who is Serre or Sierre or however it’s spelt? Borcherds was sucking his dick (figuratively)


