#groups-rings-fields
406252 messages ยท Page 478 of 407
I understand
so my aim would be to construct a function
that is bijective and homomorphic
and since G, G' is arbitrary thats the key
In case it wasn't clear, if two groups are isomorphic they're "essentially the same group but the elements may have different labels"
Yea ive seen that definition
Cool cool lol this convo would be weird if you haven't seen that
in the case of groups with order 4, the reason why there are 2 groups is because there does not have to be a generator right?
namely in the second case that it has 2 subgroups of order 2
in general not all groups are cyclic
alright
@chilly ocean
It is a good observation that V4 can't be cycled with one element, which differentiates it from Z4
Also note that Z4 has elements of order 4, where V4 has none
ic
Is by any means this isomorphism right? $Z[x]/(x^{2})\otimes Z[y]/(y^{2})\simeq \mathbb{Z}[x,y]/(x^{2},y^{2})$
SMC:
I am a newbie in homological and cohomological algebra and Hatcher does not really make it easy for me ๐ฆ
Seems good, right? You could for example write down a morphism $\mathbb{Z}[x,y] \to \mathbb{Z}[x]/(x^{2})\otimes \mathbb{Z}[y]/(y^{2})$ mapping generators in the (fairly) obvious way, prove that this is really a morphism and finally that the kernel consists of things which are spanned by $x^2$ and $y^2$
The important thing is that, using that $x^2 = y^2 = 0$, all elements in both spaces can basically be written as just finite sums, namely $a + b \cdot x + c \cdot y + d \cdot xy$, where $a,b,c,d \in \mathbb{Z}$
should we not treat xy and yx differently?
xyx it's not clearly zero while yxx has to be, is this not true?
I'm assuming you're working with commutative polynomials
I think that's the context in which hatcher works too?
that's what im not getting
it should not be commutative
i mean i am almost sure that my isomorphism is not right
the problem is that i don't understand why nor how it should be isomorphic to
Hm, I see
Let x and y be the generator in H^{1} i can tell that
I think the problem is a difference in multiplicative structure or so?
$x\smile y= - y\smile x$ via degree
SMC:
but i do not understand how to relate this to a ring structure
yes, the problem has to be related to some cup product property, I am almost 100% positive about htis
this
and via kunneth theorem i am almost sure that the structure has to be the tensor product on the left, the tricky thing is that you cannot "smash" polynomial ring in that way when considering tensor product
Isn't that exactly the problem though? In $\mathbb{Z}[x,y]/(x^{2},y^{2})$, all multiplications are commutative, where in your ring, you want $xy = -yx$
Lartomato:
And if you understand the tensor product as a tensor product of graded rings, this antisymmetry is baked into the definition of the tensor product
or, in the definition of the multiplication on the tensor product of graded rings
So the isomorphism that you started with holds if you view the tensor product as over $\mathbb{Z}$-modules, but if you consider it as a tensor product of graded rings, it's not true anymore
Lartomato:
Something like that?
yes ok now I understant that the problem is that i am mixing the notion
So the point it's that I should be happy in seeing it as the tensor product of the two ring with the relation stated aboved about degree in cup product? it does not traslate in any easier algebraic structure that i should be familiar with, is this right?
Because i read reference about exterior algebra and stuff like this but they were never touched in my algebra courses
Yeah, I think you got it. This is about the tensor product of graded rings, so you'll need to think about the multiplication a little differently.
Appreciated
Is it the case that $\mathbb{Q}(\sqrt[3]{4}) \subset \mathbb{Q}(\sqrt{2} + \sqrt[3]{4})$
Kraft Macaroni:
bertwit:
bertwit:
@cloud walrus Thus was dumb sorry
@woeful flint I claim $\mathbb{Q}(\sqrt{2} + \sqrt[3]{4}) =\mathbb{Q}(\sqrt{2} , \sqrt[3]{4})$. \ Suppose not. Degree of $\mathbb{Q}(\sqrt{2} , \sqrt[3]{4})$ is $6$. So the minimal polynomial of $ (\sqrt{2} + \sqrt[3]{4})$ must have degree $2$ or $3$. Show that this is not possible over $\mathbb Q$
bertwit:
How can I do this problem
by using the definition of kernel

Kernel is the set of values that get mapped to 0 (in this case 0+12Z)
Start forming the cosets.
You've got the subgroup <(4,4)> which is one of them.
Now, take an element not in <(4,4)> and add it to every element in <(4,4)>, this will give the coset that contains that element
i dont know what 'compute' means
but just keep doing (a,b)+(factors of 4, factors of 4)
where a in z6 b in z8
'Compute' meaning 'give a simpler representation for this group'
Oh yeah @solemn rain sorry if I confused you. I didn't mean "representation" as an actual "representation"
Compute means "express as a simpler group"
Well in this case it's not hard to show that the quotient is abelian
So a good representation might be as a product of cyclic groups
What's the problem with that?
Lol yeah it's a bit of a circular definition isn't it
It means that there is a natural map of Z to any ring
what
how is it circular
I assume they mean nCk as a regular integer, when they say "taken nCk times"
on rings
n choose k is a perfectly well-defined integer
It just means add 1 nCk times
So you define nCk in Z
they define n choose k in another way buncho
in the remark
n choose k is 1+1+1... nchoose k times
lmao
wtf does this mean
And then take the image of that under the map from Z to R
just listen
For example
3C1 = 3 in N
So in R it's 1 + 1 + 1
n choose k is an integer
yea goti t
then in R
yea yea
1 may not be 1
add up 1 that many times
yea got it
that's "n choose k in R"
why cant n choose k be n choose k
n choose k is an integer
because 1 in R may not be an integer 1
what does "n choose k in R" mean
ty
not helpful
u talking to me?
lmfao
Ik lol
u can always induct
yes that is one way
yea cool
man rings are awesome as fuck what seperates them
from like the things we did in algebra in middle school
or high schol
whats missing?
oh nvm
Lol
Inverses haha
They're "like matricies" that's how I think of them
lol what
yea matricies are big part but like
Except even rings get to be commutative sometimes
polynomials are like BIG shit here
Most high school students don't know what a real number is
why
i dont know what they are
okay guys for problem 26
the part that i am not sure about is 3 which is not shown
proving that any integral domain has char p
or 0
yea 3 isnt there
proving that any integral domain has char p or 0 where p is prime
so what i tried was this
i was just wanna check solutions
Let n be the minimum number st n*1 = 0
so now i use this map defined above
and call it phi
wait
damn ur fast boys
thats not what i didi
can u check for me solution?
Lol
:^)
now let this map defined above be called phi
it was not an entirely serious suggestion
suppose for the sake of contradiction R is an integral domain that has composite char not = 0
let char(R) = mn
for integers m,n
phi(mn) = 0
phi(m)phi(n) = 0
m and n are not 0
contradiction
?
I mean jsut using def of id should be neough?
im bad
You don't
Just say "suppose $nm1=0$, then $(n1)(m*1)=0$"
Liquid:
whats nm*1
Gross
So I'm using that to signify adding up 1 nm times
yea
yea damn
wow thats cool okay got it
okay 1 more
R and S are rings with homomoprhism f : R--->S , if x is a nilpotent element in R then f(x) is nilpotent in S
proof: let x be nilpotent in R
wrong
qed
glad i could help
XDD
wtf
let x^n=0 for some n in N ( positv intg
phi(x^n)=phi(0)=0=phi(x)^n
since phi is a group homomoprhism
qed?
Yeah this is trivial
yea thats subjective no?
no
do i prove
that (a+b)^p = a^p + b^p in ring of char p
using binomial theorem?
and removing the terms that have p since they are 0?
ye
col
do i hve to read all this shit?
ppl who did dummit and footer
for examples?
or jsut one or two will suffice?
those examples are cool read all
they look so boring XD
I mean I will say you can literally write that example in like
2-3 lines lol
Namely if (2,x) = (a(x)), then a divides 2 and x. Uh oh.
So actually less than one line
DF takes far too long yeah
cool
shiould i switch?>
i am still in beginning rings
so it shouldnt be that bad right?
or hsould i just hang on?
Eh if you haven't gotten far you could probably stand to switch yeah
all i know are rings , homomorphisms , quotient rings, and ideals
and some examples like group rings polynomial rings and matrices
oh and integral domains
are math textbooks supposed to be just def them proof literally
like lang?
or this like df?
or in between/
Lang has good problems
Dummit and foote has some bad problems
No
Yes
I have a copy of DF in my bag rn actually
no need
just pick a section in lang ( that is in df obv )
and watch
i really hope we are on the same page and talking about grad lang
not undergrad alg lang
If there is a section in Lang that is not in DF
but id saay both are the same
Then I win automatically
umm
well df is big so i can have a chance
i mean what would lang have df doesnt?
df has everything no?
No
Okay the problem in Lang that tells you to do all the problems in a homological algebra book
It does
not in 3rd edition i think anymore
like it was in first edition of lang
okay new rule
and maybe second
He never specified the edition
yea yea now i do u player
So I'm okay with it
There are a ton of sections in Lang not in DF
but like im pretty sure that lang's section on homological algebra still is very different from DF
tbh iw ould doubt but idk
He's right
i have 3rd edition on me rn
dont u have a pdf of it?
This is so annoying to watch
ik tree3 but he started it ๐คทโโ๏ธ
No I didn't
๐ถ
I know that Lang talks about ses's a lot earlier than DF
So there are probably many ses questions early on not in DF
well that cancels out
you know why?
i have my ace in the hole
groebner bases
he doesnt talk about that does he
lang
But I doubt that there is much intersection
Why does that matter
You made a statement that DF has every problem in Lang
damn i agree tbh
1 sc
@solemn rain
wait the other account is gone hwo the fuick\
okay i agree
i mean DF is still garbage tho
yea i tried to read atiyah mc for rings but turns out too hard for me
im really getting sick of the long texts
No shit
You don't know linear algebra
half of it modules lmao
i dont like artin
then read linear algebra book first
Read Hoffman kunze
how do u do AM w/o LA
i dont like hoffman kunze
Or even axler
i wanted to try serge lang ug algebra
but turns out it has like
3 sectios on rings only
I honestly like axler
so i thought it wouldnt be that much of good
it doesnt talk about these domains
which have their own chap in df
ufd pid ..
it almost definately does?
I like the way DF does linear algebra tbh
what else would u teach in intro ring lmao
even then why would it not talk about that hmm
and he does like
modules in a very weak way compared to what is ee in df
like he doesnt tlak about sequences
which are alot of shit in df
thats how i compare atlesat
exact sequences to be exact hahahaa
artin seems to be the way to do algebra and linear algebra in one go
also artin covers some nice things that other linear algebra books do not
i dont like artin for some reasona
i personally recommend it, and it really picks up in later chapters
Lol
read one of his ring theory chapters lol
That's dumb
i jsut want to learn vector spaces just as i woudl learn groups
read finite dimensional vector spaces by halmos
Or axler
its the underdog LA book
yeah or axler
Axler doesn't like matrices so much lol
lmao..... too old school
XD its like the first text on VS
But matrices are nice
Yeah you just need to cure yourself of this anti-matrix syndrome lol
It's one thing to be like
i dont like them from HS
I don't wanna put 25 matrices into rref
go do some physics ull start appreciating matrix more
i felt so bad at myself for not being good at gaussian stuff and turnign a matrice into fuck -fuckery echelon form
so i just quit it
Go calculate some homology
idk what that is
You'll appreciate matrices more
df doesnt assume LA from reader

df is also not a LA book
DF doesn't assume non-trivial linear algebra background
thats when i knew it i can learn LA from it
@bleak abyss i knwo how to add matrices , and i google multiplicationevery time
artin does a lot of LA. its a bit matrix heavy but most of it is "abstract". i think you just havent seen matrices enough lmao
But the question is whether just reading it gives you enough proficiency as if you went through like
Hoffman-Kunze
i started hoffman kunze cuz jacobian recommended me it ( he was the nicest guy ever )
i enjoyed the later chapters but the first chapters were so fucking hard for me
and it was the first time to read an actual math textbook
and mind you im very bad at math
so it didnt work out
The answer is to improve lol, if that's too hard you need more basic experience with proofs
i meant like 2 months earlier
now idk about it but i just have this bad feeling so i dont try it

Convo moved to #math-discussion if you want to catch up
@solemn rain
Let x,y be generators, and
xyยฒ = yยณx
yxยฒ = xยณy
What group is this?
It is haha.
Design an algorithm that will tell if a finitely generated group is the trivial group
@solemn rain
really?
Yeah
oh, seems about right
why is it impossible
yea thats what i hate about these shitty stuff
i i would have never knew that
if u hadnt told me
dont do this again
wdym no
I will do this again
no u wont
bare minimum if its hard then no
Also have you decided if you are going to leave the server
Or do every problem in axler
this is why i love abstract alg
Do every problem in axler then
okay im realy down to learning lin algebra since u guys know better
but can u choose another text
?
i hear axler is p bad
and not hoffman too
Nah it's alright
are u sure? im of low math matuirty ๐คทโโ๏ธ
Except for the fact it doesn't do determinants
But that's not too bad
You'll encounter those elsewhere
It's more important you do the rest of the stuff
i have a question
jsut ask ok

i think you should honestly do some intro to proof mo2men
from me tbh
oh wait u already did intro to proof?
yea
Bruh
i really dont know whats missing aside from that countable stuff
Thatโs not abstract algebra @chilly ocean
but okay u know btter
@chilly ocean wrong channel; see #prealg-and-algebra
where did you do intro to proof
yeah i know it
^ first book ever
yea why not
bruh if u read it once ure good
what am i missing
like try doing some exercises rn w/o reading ch
if u can solve them then ur good
if not, yeah you need to review
(of vallemen)
axler looks nice
as in like book
not content
like its beautiful
yellowish
blue
The content is good
Do you know the proofs of the theorems in algebra
Or do you just cite them
what theorems in algebra
Like let's say first isomorphism theorem
the isomoprhism is basically defined as
phi(n) = f(Pi(n))
where phi is the homomorph
and pi(n) is natural
f is the iso
this goers to f(nH) = phi(n)
Well obviously
i just gave out the isomoprhism
Like at the stage you are you can't just say "the rest is details"
okay
okay ur right
let G and H be groups
f:G--->H be homomorphisms
define phi:G/ker(f) ---> img(H)
phi(gK) = f(g)
where K is ker(f)
first the function is well defined
suppose gK = hK
--> h^-1g is in K
so f(h^-1g) = 1 ---> f(g) = f(h)
now phi is also a homomprihsm
phi(gK)phi(hK) = f(g)f(h) = f(gh) = phi(ghK)
thats it?
phi is naturally surjective ig
@woven delta
inejcitvyt
XD
okay
yea mb
okay so suppose phi(gK) = phi(hK)
proof of 1st iso thm: define the mappings, rest are details
Details are hard
yea sorry
about that
what am i doing now
am i done
no
suppose phi(gK) = phi(hK) ---> f(g) = f(h) ---> f(g)f(h)^-1 = 1 ---> f(gh^-1) = 1 ---> gh^-1 is in K
---> gK = hK
am i done ?
Looks fine
cool
But anyway the whole "rest is details" attitude is bad
yea i thought those were easy tbh
Because a lot of people just memorize theorems
And cite them instead of actually doing math
yea i know about those
and i just didnt want to be one of them
but
there are theorems that i cant prove
that ik about
like fundamental theorem of abelian groups
i cant do this 1
or
You shouldn't cite them then
Fundamental theorem of finitely generated abelian groups isn't so bad tbh
You should know how to do cauchy
yea just boring induction xd
It's the only nontrivial step in the proof of sylow
tbh I feel like I cant prove any multivar calc theorem
No you don't
proof of cauchy is like
jk
not that bad
Because you don't know how to do cauchy
or you could understand it
cauchy proof was like very tricky right?
my prof said its his favourite proof
given one step it's p. easy
hmm the proof i saw for first sylow doesnt use cauchy, but proofs cauchy as colloraly
and its been unproven for a long time iirc
i really wanted ap roof of the fundamental theorem tho
but the text just asid
'yea you take those in modules u prove more generlized stuf bye'
it didnt prove it for me
then prove it yourself
^
nah
The proof isn't so bad
i cant do it
yeah the proof i know uses matrix
what is the theorem
wahts the fundamental theorem of algebra?
we are talking fundemental theorem of finitely generated abelian groups
its not if I think thats the polynomial thing
should I just google the statement
That's another theorem you should know
Yeah
yea lmao Xdx
its just play with matrix to get nice form
@woven delta i mean why didnt the text put it at first then
basically
like even without matrix
What?
Because it's usually proven in an analysis class
analysis a prereq of algebra?
Cause the algebra proofs are hard
But the analysis proofs are easy
It's a theorem about the complex plane
Which is an analytic object
theres a nice proof that uses the fundemental group of the circle
which is somewhat algebraic
one step at a time
You should learn what countable means first
Okay mo2men, prove that a countable union of countable sets is countable
Not here though
okay where
In general
Does anyone know the name of the algebra you get when you take the Dynkin diagram for B_n or C_n and remove the orientation? Wikipedia calls it BC_n, but I can't find any other references to that name
Hi, I need help showing that given a ring homomorphism, the preimage of a prime ideal is a prime ideal
what did you try
I showed that it's an ideal first, and we're using the definition that if p is a prime ideal, then if AB subset p, either A subset p or B subset p
so if f(p) = p' where p' is prime, I let AB subset p
but I wasn't able to construct a something like A'B' = p' that let me use the fact that p' is prime
Is this for when A and B are ideals themselves?
yes
I'm a bit confused with what you're doing: "so if p = f(p') where p' is prime, I let AB subset p" wouldn't you rather want the preimage?
Or is this a typo
that was a typo
Ah, alright, so you assume AB is a subset of f^{-1}(p'). So you can conclude that f(AB) is a subset of p'
And then it seems to go pretty straightforwardly if you use f(AB) = f(A)f(B)
(which should be a consequence of f being a ring morphism)
but then aren't f(A) and f(B) not necessarily ideals?
Ah, I guess that's true. I thought images of ideals still might be ideals
wait arent they?
if you let f(x) = x from Z to Q be a homomorphism
Hmm, maybe something can be done with the ideals generated by f(A) and f(B). I'll think a bit
Need assumption its surjective as well I think
Our instructor noted that f does not need to be surjective, since someone asked
Hm, okay, so first one can show that if f(AB) is in p, then the ideal generated by f(AB) is in there as well. Is this by any chance equal to the product of the ideals generated by f(A) and f(B)?
Yeah, I'm also not 100% sure about that, but I've got a semi-good feeling about it
because otherwise I'm out of ideas lol
The inclusion from left to right is true at least 
Yeaaah okay now I'm also not so sure about that anymore though
A small silly question: Are your rings commutative?
yes
oh
well I assume we can just take that for granted
Yeah that seems important, 'cus in the noncommutative case this is false
But in the commutative case I think (f(AB)) = (f(A))(f(B)) is pretty easy
Given an element in the right-hand side, by distributivity it's a linear combination of elements $r f(a) f(b) = r f(ab)$, and those are also in the left-hand side
Lartomato:
(I reordered a bunch of things which needs commutativity)
I think this should lead to the right idea, yeah
(using that now (f(A))(f(B)) is in p, hence by primeness (f(A)) or (f(B)) is in p)
how would A relate to (f(A)) then?
f(A) is in (f(A)), so if (f(A)) is in p, then f(A) is in p, and then preimaging should give you what you want
(of course note that A =/= f^-1(f(A)), but A lies in that preimage)
so if (f(A)) in p', then A subset f^{-1}((f(A))) subset f^{-1}(p') = p
with messy parentheses but I think I get it
Ye if you write it down slowly and nicely it'll clear up
That was fun, even though I thought things were noncommutative half the time, lol
and: https://math.stackexchange.com/questions/399579/inverse-image-of-prime-ideal-in-noncommutative-ring for noncommutative rings this is not true
tyty
If every prime ideal of $A$ is maximal is equivalent to $A/\mathfrak{N}$ is absolutely flat(AM chapter 3 exercise 11), then doesn't this imply $\mathbb Z$ is absolutely flat(which it isnt)
ariana:
oh right XD
For an isomorphism between 2 representations of a group, must it be the case that the same vector space isomorphism also gets applied to the images of the group elements? Or is it possible to transform the elements and the space in different ways that still yield an isomorphism?
usually you talk about isomorphisms of representations of a fixed group G
you just require a phi: V --> V' such that phi(gv) = gphi(v)
np
Actually, follow up: I ask this because I feel like there should be an isomorphism between two representations of Dn that choose conjugate roots of unity as their "rotation generator". The representations I had been working with were over C^2, where rotations multiplied the two coefficients by opposite nth roots of unity and the flip would swap the two coefficients. Would the isomorphism I'm looking for in this case just be a swap between the two coefficients?
it's not clear to me that those are necessarily isomorphic
for example, if your group if Z/4Z, then having a generator act on C by multiplication by i
is not isomorphic to having it act by multiplication by -i
Well that's cyclic, no? I agree in that case
Hi! Is this correct deduction: Since $\frac{1}{\sqrt{2}}=\frac{1}{2}\sqrt{2}$ we have that $Q [\sqrt{2}] = Q (\sqrt{2})$ and thus ${1,\sqrt{2}}$ is a basis for $Q(\sqrt{2})$ and now we can form an isomorphism between the basis of $Q(\sqrt{2})$ and $Q (i)$ which is analogously ${1, i}$. Thus they are isomorphic as Q-vector spaces
but like, I don't see how making your group more complicated could fix that
oh hmm
PAHUS:
Nice! Thanks!
Alright, I think I formulated it better. Say w is an nth root of unity. One such representation would have its rotation generator be
(w 0
(0 w * )
and the other's would be
(w* 0)
(0 w)
These two should be isomorphic if I choose my vector space isomorphism to be a swap between the two elements, and my group isomorphism to send those generators to each other. For some vector (a,b), applying the first group element and then applying the isomorphism will yield (bw*,aw). But applying the isomorphism first and then applying the second group element (aka the image of the first group element) will also yield (bw *, aw). Is that not an isomorphism between the two?
can you have infinitely many generators in the group?
https://crypto.stanford.edu/pbc/notes/group/ anyone know if this is an ok intro to group theory
@chilly ocean Q is not finitely generated
It is as a Q vector space
Suppose $G$ is a non abelian group. Is it possible for $f:G\to G$ defined by $f(x)=x^n$ for some integer $n$ to be a homomorphism
Whoever:
I was about to say take n=1
lol
or -1
-1 is homo iff abelian tho
If some integer n has the property that n(n-1) is relatively prime to |G|, then this being a homomorphism implies that G is abelian
iirc this is almost an if and only if condition, except for a couple counterexamples
here's a fun fact
if the function f(x) = x^n is a homomorphism for 3 consecutive integers n
then the group is abelian
wrong
ok
can someone lmk if the above link is a decent intro to group theory
So I've been stuck on this for a long time; If I have a field extension L/K and A is a collection of algebraic elements in L w.r.t. K. How do I prove K(A)/K is algebraic?
I think I can represent all x in K(A) as f(a_1,...,a_n) for some algebraic {a_i}, but thats about it.
Showing that the sum of two algebraic elements is algebraic and the product of two algebraic elements is also algebraic would be enough
@granite compass
@snow flint well it's ok if you just want a online but like better to use a book with proofs and exercises
yeah, thats waht i imagined. Its just that like i want something to fill in the gap now that classes are over, without fully investing in like an actual textbook or smth
thx
l i b g e n
@snow flint Langโs โUndergraduate Algebraโ maybe
jacobson basic algebra is uwu if you can lin alg
what I have for now it's the following: An element $\varphi \in H^{n}(S.(X)\otimes S.(X))$ correspond to an homomorphism:
$$\varphi: S{i}(X)\otimes S{j}(X)\to \mathbb{Z}$$ where we let $i,j$ be all the integers that sum to $n$.
For every element in $S{n}(X\times X)$ we have a correspondent element in $(S.(X)\otimes S.(X)){n}$ via EZ. The composition $\varphi\circ EZ$ is then an homomorphism from $S{n}(X\times X)\to \mathbb{Z}$ and we define $\alpha{n}(\varphi)=EZ*\varphi$
Stephen:
Any hint? Does this seems a viable way?
what's the S thing and what cohomology groups are the H^i(X,Z) again ?
By S I mean the chain complex it might be C.(X) in the literature? I think Hatcher refers to it as C.(X) the set of all continuos map from the i-th simplicial โ->X
The cohomology groups are the coker/ker of the cochain complex Hom(X,Z)
I don't know why the latex erased all my _ in the indexing of the groups, sorry, @hot lake
it's bc you copy pasted the text on discord which parses _ with text styles, to keep all the symbol you need to modify your message to get de "source code" (not parsed message) and copy/paste it
Thanks I will try next time
For the math related question any hint on how to proceed? Or is this just a dead end?
I even tried a more "theoretical" approach but it seems too obscure to me
We know that $EZ$ is chain homotopic to the identity, this implies that $H_{i}(S(X)\otimes S(X))\simeq H_{i}(S(X\times X))$.
We recall now that if our chain complexes its free we have: $H^{i}(Hom(Y,\mathbb{Z}))\simeq Hom(H_{i}(Y),\mathbb{Z})$ in our case, using the fact that all the $H_{i}(X)$ are finitely generated free abelian groups, we have then:
$$\bigoplus_{i+j=n} H^{i}(X)\otimes H^{j}(X)\simeq H^{n}(Hom(S(X)\otimes S(X)),\mathbb{Z}))\simeq Hom(H_{n}(S(X)\otimes S(X),\mathbb{Z}) $$ $$ Hom(H_{n}(S(X\times X)), \mathbb{Z})\simeq H^{n}(Hom(S(X\times X), \mathbb{Z}))\simeq H^{n}(X\times X)$$
the requested isomorphism.
Stephen:
hi, im an undergrad year 2 learning about hopf algebras so im sorry if this question is silly as my understanding of hopf algebras is only rudimentary: why does the coproduct on an element $x^n$ result in a finite linear combination indexed by i, where i runs from 0 to n? shouldnt an element in the tensor product $\mathbb{C}[x] \otimes \mathbb{C}[x]$ be an infinite linear combination ? (since $\mathbb{C}[x]$ is itself infinite-dimensional)
xy:
so why is $\Delta (x^n) = \sum\limits_{i=0}^{n} x^i \otimes x^{n-i}$ ?
xy:
<@&286206848099549185>
Is C[x] infinite dimensional?
yeah
Are you sure?
its just polynomials with coefficients in C
hmm
yeye
yeah so im not really seeing why the result of a coproduct acting on an element x^n results in a finite linear combination 
could be a typo
I notice that there are other typos in that pdf
(I found it online)
hmm im not familiar with the comultiplication stuff itself. but it seems they are saying each basis element is that. theres still infinite basis of the form Delta(x^n)
also given a basis, an element is defined as a finite linear combo of elements of the basis, as there is usually no concept of covergence of infinite sequences in a general ring(i might be wrong as i said im not familiar with this specific thing)
well comultiplication is like the "dual" of a multiplication defined on an algebra
so $\Delta : A \to A \otimes A$
xy:
and it has to satisfy $(id \otimes \Delta) \circ \Delta = (\Delta \otimes id) \circ \Delta$
xy:
hmm i see
anyhow the C[x] tensor C[x] is still infinite dimentional, as theres infinitely many Delta(x^n) which are the basis of this
atleast from what im understanding
yeah, so im thinking that in the most general form , the coproduct should result in an infinite linear combination of basis elements in the tensorproduct, which doesnt seem to be the case
its still gonna be finite combo of these basis
๐ฎ
its like, whenever you see generated for general rings or something, its gonna usually refer to finite since there is no concept of converge of infinite sums for example
(theres exceptions ofcourse, like ring of formal series over some ring)
what I have for now it's the following: An element $\varphi \in H^{n}(S.(X)\otimes S.(X))$ correspond to an homomorphism:
$$\varphi: S{i}(X)\otimes S{j}(X)\to \mathbb{Z}$$ where we let $i,j$ be all the integers that sum to $n$.
For every element in $S{n}(X\times X)$ we have a correspondent element in $(S.(X)\otimes S.(X)){n}$ via EZ. The composition $\varphi\circ EZ$ is then an homomorphism from $S{n}(X\times X)\to \mathbb{Z}$ and we define $\alpha{n}(\varphi)=EZ*\varphi$
@chilly ocean any help with this?
Stephen:
yeah, also just think polynomial rings
like R[x]
its generated by 1,x,x^2 .... as an R module right, but a polynomial can only have finitely many of these
xy:
like, they chose these in particular to define the coproduct
its prolly cause it satisfies the commutative diagram when taken in the summation
it certainly does, but is there a way to "derive" it? because from the looks of it, this is a natural, intuitive way to obtain a coproduct ๐ค
(though im not seeing the intuition)
i mean yeah i suppose if you played around with it a bit you could force it out. like from what im seeing if we said $$\Delta(x^n) = \sum c_i (x^{a_i}\otimes x^{b_i})$$ then using the diagram we can figure out some stuff, and then get in some good guesses ig
JohnDoeSmith:
hmm i see
also this is likely just 1 way to define the coproduct on this
apperantly another coproduct would be using binomial coefficients instead of 1 as coeffs of each x^i tensor x^(n-i)
I have a subset of complex numbers, that consists of all complex numbers, whose modulus is equal to one, under multiplication. Which group is it isomorphic to?
Should it be isomorphic to the group of rotation of the circle with radius one?
oh, and also - would such group be a topological group?
I have a subset of complex numbers, that consists of all complex numbers, whose modulus is equal to one, under multiplication. Which group is it isomorphic to?
S^1 ~ R/Z
consider the homomorphism phi:R--->S^1
phi(r) = e^(2pi*i *r)
look at the kernel
@chilly ocean
may I have a hint for this? I don't rly know where to start.
<@&286206848099549185>
@solemn rain thanks
H isnโt free abelian so they canโt be isomorphic
and you shouldnโt be able to have an injection either
a free abelian group has infinite cardinality while H has cardinality 2
if H is Z/2Z and oyu have both an injection and a surjection then G must also have cardinality 2 and thus be Z/2Z
as that is the only group of that cardinality
I have the following situation:
I have a sequence $X_i$ of free groups on $2โฑ$ generators with injections between them (can be more specific if necessary) and $X$ is what I believe is called the direct limit of them? (itโs the union of the $X_i$ modulo the relations that we consider things you can get to via the injection to be the same). Inclusions of each $X_i$ in $X$ induce a injective group homomorphisms. Then $X$ is free, supposedly. I donโt have to prove this but Iโm supposed to provide a source and Iโm bad at searching for them. Does anyone happen to know a theorem that implies that and a textbook that proves said theorem?
(I donโt know a whole lot of algebra and in particular have basically not done anything about free groups)
Sascha Baer:
I think the proof wouldn't be too difficult if you already understand the direct limit of these groups; Construct in an analogous way the direct limit of the generators, then I think it should be not too difficult to show that the direct limit of groups you constructed is isomorphic to the free group generated by the direct limit of generators
So again disjoint union of all your generators, modulo the relations that you mentioned
Does that make sense? @somber bramble
it does, Iโd have to see how long the proof ends up being
doesnโt sound like itโd be too long tho
I think it shouldn't be terribly long, and it's probably less work than finding a very specific citation ๐
well itโs entirely possible thereโs some well-known theorem that has this as a special case
I just odnโt know many theorems about free groups
I don't think there is, this seems like a very general, almost category-theoretic statement actually
Because once you have some intuition for both the direct limit of the free groups, and the free group generated by the direct limit, it should become fairly clear how you can write down an isomorphism between them
just mapping generators to generators, checking that relations are fine
And direct limits are really useful objects to get some intuition for anyway, so the time spent understanding those is not wasted
hmm yeah this can definately easily be extended to free R modules in general if i did my math right
JohnDoeSmith:
@upper pivot I'm not sure this holds when you work in R-modules, since every flat module is expressible as a filtered colimit of free R-modules, but there are flat modules which are not free
oh hmm
I think over Z everything works out nicely because flat=free (if I recall correctly)
Maybe there's something nice about the diagram we're taking a colimit over being the natural numbers?
hmm i dont see a flaw in my reasoning for the general module case. i might be missing something. So my reasoning was as follows:
JohnDoeSmith:
hmm im not sure whats wrong here exactly @spice bay , but i do think i might have made a mistake (i only recently learnt about directed limits)
@upper pivot that looks pretty much correct to me - I agree that a set of generators for M is the union over the generators for M_i, so if there is some relation among finitely many generators, then there is some j big enough so that this is a relation inside M_j, which can't exist
My concern is something like this: take $\mathbb{Z} \to \mathbb{Z}\times \mathbb{Z}$ as inclusion into the first factor. Then take $\mathbb{Z}\times \mathbb{Z} \to \mathbb{Z}\times \mathbb{Z}\times \mathbb{Z}$ as inclusion into the first two factors, and continue like this. Taking the colimit of this (in the category of groups NOT the category of abelian groups, this is important) you get what's called the Baer-Specker group, which is not free.
brouwers_bane:
Although @upper pivot your argument definitely seems correct, so I'm curious where the incongruency is here
hmm yeah there has to be an inconsistency if there are counterexamples
It's an interesting problem - you can also prove it (for groups) with some topology and categorical yoga
i see, i dont know much cat theory presently though, but i'll keep this in mind for when i do learn it
Does anyone know an example of a nilpotent polynomial?
@last ether depends in what ring - for example the polynomial $x$ is nilpotent in the ring $R[x]/(x^2)$ over any ring $R$, but it isn't nilpotent in $R[x]$
brouwers_bane:
try proving a general result actually
$a_0+a_1x+\dots a_nx^n \in R[x]$ is nilpotent $\iff a_0,a_1\dots a_n \in R$ are all nilpotent
JohnDoeSmith:
^over commutative rings ๐
yeah commutative right
Hi can someone help please?
I need to show that there is such an isomorphism
So I should start by showing that itโs a homomorphism?
Consider the determinant map $\text{det} : \text{GL}_2(\mathbb{Q}) \to \mathbb{Q}$
brouwers_bane:
Its kernel will be a normal subgroup of GL_2(Q)
Okay so I show that if for some x,y matrices in GL_2 and I apply a mapping, then it is the same as applying the map to each of those matrices and adding them together?
And the kernel is all matrices that map to 0?
No you shouldn't be adding anything, G is a subgroup of GL_2(Q) under matrix multiplication not addition

