#groups-rings-fields
1 messages · Page 88 of 1
wait I'm having a brainfart, why is this x - 1 and not x + 1
it's just that you automatically know what (b^k)^-1a^nb^k is from b^-1ab = a^2 and (obviously) a^-ka^na^k = a^n and b^-kb^nb^k = b^n
ok maybe that's one trick
conjugating powers of a generator by powers of the same generator doesn't change anything
I assume you already knew that though
ok swap a for a+1 idk
you get the vibes
lol
lmao
okay so if p(x) = p(x+1) like
expand that shit out
and you'll see that we get n=0 or smth
lol
like
proof by Leviticus 19:11-12
$0 = \sum_k a_k ((x+1)^k - x^k) = \sum_k a_k (k x^{k-1} + \text{other stuff})$
potato
and then pick the largest k with k < degree of p and a_k not 0 lol
it follows immediately from the fact that ( \abs{\bigoplus_{k \in S) (\mathfrak{R}^{\bF^\alpha(i)})_{i \in \mathcal{U}k}} \leq \aleph_1 ) when ( [\mathfrak{h}\mathcal{W} \cap \bF^\alpha(\bN) \neq \emptyset )
Compile Error! Click the
reaction for more information.
(You may edit your message to recompile.)
wait so this question i'm doing asks for me to find the simple modules over uhhhh
was tryna copy this from memory lmao
$\mathbb C C_3 \times \mathbb C C_4$, but like how do you even think about that lol
potato
Like a simple module over that will be 1 dim but idk how to even think about maps CC3 x CC4 -> End(C)
yo im sorry what is this contradicting
minimality of minimal polynomial
you'll see we get like
k=0 at some point
for some non-zero k
Like okay for simplicity let's say p(x) = x^{n+1} + a_n x^n + ... where a_n is non-zero
Then taking coefficients of x^n in what I wrote, we get 0 = a_n n
so n = 0
am I smoking pack or is that not iso to C[C_3 x C_4] = C[C_12]
what does that notation mean, like CC_3
Lol I mean it was meant to match the latex i wrote
oh like a group ring innit
ye
oh i should say ye like
my uni writes kG rather than k[G] for whatever reason lol
but ye
if you can do the latter then yes that would be the quickest way 
but finding out what happens when you conjugate the generators first is usually quicker
as like, b^-1ab = a^2 => ab = ba^2, which lets you swap stuff around in an awful word like (a^ib^j)^-1a^xb^y(a^ib^j)
ye
which can (will) lead to cancellation
i like how uh like like
representation theory is all cute and tbales and shit
group theory is like WORDS. take them or leave them
I'm not sure what you mean
you're forming a big chain of equalities starting from (a^ib^j)^-1a^xb^y(a^ib^j) by using the relations in that presentation - which will end up in b^?a^? eventually as the group is generated by those two dudes
Anyway wew do my question instead of Joe's
and then from there you will (hopefully) be able to see the conjugacy classes via some condition on the exponents
Joking
no because yours requires thought
oh this doesn't matter, cause if you have b^?a^? you can just swap them around and get a^(2?)b^?
cause of this
yes potato
ask simpler questions!
I was doing a past paper and this was a weird question on it
😭
Oh here rep theory seems one of the most popular lol#
yeah I've never seen a direct product of group algebras because why would you do such a thing
Me neither!
the old notes are slightly idiosyncratic in that they just talk about representations of modules A as being maps like A -> End(V) for osme vector space V
End
so they say "representations of C[S_3]" and stuff
representation theory gets better when they start talking about characters
and then much worse when they start talking about modular characters
No!
presentation theory is nothing if not long
Representation theory gets so much better when representation ring comes up 🤓
any word related problem is probably undecidable in general it's an icky field
that's the virtual character ring u numpty
Me when you can use spicy words like λ-ring lol
Hm what
the representation semiring is iso to the semiring of characters, that's like the entire point
semiring
nope!
Not seen that lol

you tensor with C if you want them iso as rings yes
Just like characters of actual representations
Rather than allowing for like arbitrary C-linear stuff, sure
Z-linear only for me thanks
ye fair
ANYWAY!!! do you know any results about simple modules over a cartesian product of rings lol
The stuff I have on rep theory in my essay is a bit of a pain
because everythign is unitary
which feels idiosyncratic
like unitary representatio nring
maybe it isn't too idiosyncratic though
No
wait what rep ring isn't unitary lmfao
le trivial rep has arrived
oh U(n)
no that's not idiosyncratic every rep is similar to a unitary rep
wait how do you prove that
over finite groups anyawy
finite groups
all sets are finite
Okay yeah cause you can just construct a G-equivariant inner product and shit ig
yes exactly
.... who?
Compact = finite anyway
Oh yeah I asked some people about reps of compact groups and they're like
not true as u need to write integrals instead of sums
just work with finite stuff and write compact instead
jk
Uh
Well yeah but I write my sums as integrals w the counting measure anyway
ok so what if we arty wedderburn decomp the two dudes
Wew
Wait really?
all characters are 1 dim and Mat_1(C) = C is it not?
*reps
can u tell I'm a character theorist 
I would get this wrong
so are we not just finding simple modules over C^7 now?
okay so
this is true but the thing is like we're meant to talk about them in terms of generators and stuff
I DON'T CARE!!!!!!!!!!!!!!!!!!!
oh ok
obviously you wanna say like
they're determined by like (g,1) and (1,h) with g,h generators
but then because we aren't working w the tensor product it's not gonna work out that nicely
i guess
so uh
not quite...?
unless I'm misinterpriting what you're saying
or (g,0) and (0,h)
etc
but no i mean i'm saying that's wrong lol
But if we had a tensor product it'd be way nicer
right ok
So uh ye i'm confusion
Maybe this is just smth from the old lecture notes they used to cover lol
C_3 = <g>, C_4 = <h>
C[C_3] has a basis {e, g, g^2}
C[C_4] has a basis {e, h, h^2, h^3}
as these are abelian groups their direct product is their direct sum (I'm doing this because it's easier for me to think about them like this)
is the basis of C[C_3] x C[C_4] not just the union of the two basis sets lol?
before they realised it was just TOO silly
we could also try factoring maps from C[C_3] x C[C_4] -> End(V) through the tensor product using the universal property
this is true i mean also just forget the ring structure + then clear by taking bases of each lel
yah
hm but that'd be bilinear maps rather than linear right
but ye
however potato if u just do like
like they asked us to do C[C3 x C4] and C[S_3]
both of which are like super standard
and this came before both of those lol
BLEAK
nah nvm
maybe they do mean the tensor product lol
lel
their direct product is their direct sum
literally add the characters...?
irreducible characters are of the form chi_i + phi_j, chi_i \in Irr(C_3) phi_j \in Irr(C_4)
might be chatting shite
I'm having to translate literally everything we're talking about into character theory and then back into module fuckery
this problem was so screwed up honestly like
there wasn't a single question in this paper on characters
introduction to rep theory
I am chatting shite, if we do the arty wedderburn decomp then these corrispond to 2 dim subspaces of C^7 which are obviously not simple
what a bunch of BALONEY
what's happening in here
simple modules over $\bC[C_3} \times \bC[C_4]$
Wew
Compile Error! Click the
reaction for more information.
(You may edit your message to recompile.)
Latex error in chat guys
good no I'm glad I missed that bracket yup mm hmm
ah ring morphisms from R1 x R2 into End(V) ?
yus
I guess more generally that'd be good to know about lol
what does this have to do with tensor products 
there will be some easy theorem I simply don't know
I think they just correspond to pairs of commuting representations
Makes sense
these aren't that bad
Hm
(a,b) = (a,1) * (1,b) = (1,b) * (a,1)
I mean illum that chapter isn't all about tensor products right
exact sequences + tensor products
Anyway this stuff is actually like lol more key than I realised
yeah I was thinking about taking maps (f, id) but I didn't think about it hard enough apparently
I think I missed the fact they commuted
but the actual ring itself looks kinda weird uuh
Like the p[x] stuff arises naturally when you study dimension theory
Which is coolio
uh
Yeah I might look at uh examiner's report to see if they say anything about this
uuuh
inb4 they actually meant the tensor product
Seems randomly tricky compared to like, the rest of the paper
Lol
Or at least unfamiliar
Yeah this seems most likely lol
Let p be a prime number. Let Fp denote the finite field with p elements. Let f(X) denote the polynomial X^p^4-X
Prove that all irreducible factors of f are distinct. How many irreducible factors of each degree does
f have?
actually I'm not sure of anything
it's semisimple at least 
yo is this just the finite field of p^4 elements cuz the factors would be the roots?
acting by (x,0) and (0,y) give representations of the C[C3] and C[C4] right ?
wdym "Is this"
the irreducible factors
yes
Its splitting field is that sure
yea thats what i meant
So yeah zef thing is like uh
How many irreducible factors of each degree does f have? this can be done by just that theorem from cyclic groups?
but they annihiliate each other cuz (x,0).(0,y).v = (0,0).v = 0 ?
Hm so like it's clear we will have reps but then uh
isn't this just like (A/a)[x] = A[x]/a[x]
Lol
ic
And so in fact you can say smth stronger for the bit about m[x]
(1,0) and (0,1) are projections
huh?
no
Yeah I meant the interesting thing is uh
How it's never maximal
Rather than only sometimes or smth lol
Yeah I mean it is
it is
isn't a polynomial ring over a field local or smt
so if you have a chain of n prime ideals in A then you can get a chain of n+1 prime ideals in A[x]
Which kinda anticipates stuff from uh the final chapters 
so an A x B - module rather is a direct sum of an A-module and a B-module
potato what did the examiner's report say
yeah
oh was I right then lol
if M is an AxB - module, (1,0).M is basically an A-module, (0,1).M a B-module, and M is their direct sum
hm sure, so how can we really describe A x B modules in terms of generators of R, S hm
Like in this case
Feels a lil weird
anyone boys and girls
algebra monsters
generators ?
like when you say a C[C3]-module is a vector space with an endomorphism f with f³ = 1 ?
well here you need to include projections
p1+p2 = 1
p1p2 = p2p1 = 0
f1³ = 1, f1 p1 = p1 f1
f2⁴ = 1, f2 p2 = p2 f2
uh
Oh tbh this is weird like they said to describe in terms of "algebra generators"
maybe f1 p2 = 0
do they want a full on list of relators like zef's given or can you just say "it's generated by blah blah from the duality blah blah morphism blah"
lol I'm getting confused again
this problem is very weird dw about it
yur, (f, 0) \circ (0, g) = 0
wait a minute why do I recognise this
are these (p_1, p_2) block idempotents
p1 = the action of (1,0)
and generators x of A get pulled to (x,0) of AxB
generators y of B to (0,y)
so (x,0) * (0,y) = 0
so you add 1 to your generators of each factor ring, then put everyone together and say that product of generators from different factors is always 0, and also that 1 = sum of the 1 from each factor ring
and then copy paste your relations
isn't that like counting how many conjugates people in Fp⁴ can have
the roots of X^p^4 - X are all the elements in Fp⁴
yea
yea and they are distinct cuz the multiplicative group is cyclic
idk lmao yea
i just thought that
or nvm
any hints for that?
"algebra generators" lol
etc
Kinda sus
I would read that as needing the full list of relators
what are examples of absolutely flat rings
I would give explicit actions of enough elements and then write "those generate A believe me bro"
ok so apparently I get a bunch of results when searching for von neumann regular ring lmao
are they?
they arent?
yes
Z/4Z lmfao
it says regular local rings
yes I misread something else
ah ok
lmao
an absolutely flat local ring is a domain
is that right
wait that's stupid lmao
an absolutely flat local ring is a field
🤦
are fields domains, chat?
domain is absolutely flat <=> field
local ring is absolutely flat => field
no 0×0=0
ringsdontcontainzeroringsdontcontainzeroringsdontcontainzeroringsdontcontainzeroringsdontcontainzeroringsdontcontainzeroringsdontcontainzeroringsdontcontainzeroringsdontcontainzeroringsdontcontainzeroringsdontcontainzeroringsdontcontainzeroringsdontcontainzeroringsdontcontainzeroringsdontcontainzeroringsdontcontainzero
My favourite is finite local domins
all rings are finite actually
yea
i just write phd algebra quals for university [x]
the hardest ones are the real analysis ones
yo
Let R be a commutative ring with identity and I ⊂ R an ideal such that R/I ≃ Z. Show that
there are infinitely many maximal ideals in R that contain I.
yo
Correspondence theorem
Yes
I'd not say it's an isomorphism theorem really
Hm those just give certain isomorphisms though
wouldnt A --> A/M work?
Yes
By the correspondence theorem, maximal ideals of R containing I correspond to maximal ideals of R/I
which correspond to maximal ideals of Z
yes
I thought this was gonna be smth insane
Well
I have done some interesting questions about infinitely maany primes in comm alg
the char(F) not equal 0
took me half an hour and still couldnt do it
sad
was also from a quali
Do you understand that one now though?
same university quali
Sure
Oop
like standford algebra quali was like
lmfaaaaaaao
i couldnt do a single shit problem
its like there are no free problems
no standard problems
no nothing
like for example this
Assume F is a field and F(α) is a finite field extension of F of odd degree. Prove that
F(α
2
) = F(α)
this is from dummit and foote
and its in the other uni quali
i know how to do it
nothing like this in the other uni qualis like no free bono
the first thing I see is an exercise from atiyah macdonald that I just did lmao
:ANGRY:
are you challenging me
they hard as shit tho for me tbh
bro the last exercise is algebraic geometry 
the exams are like split into morning and afternoon
oh?
i couldnt solve shit in the afternoon
next year they add night mode
and u just get fucked
lmfao
oh I see
night mode?
yea just a joke
yea ig being good at courses corelates with research
the corelation is higher than i thought
spring
oh yea you mean the first problem?
ye
yea ig its free
or like standard
by studying you should be bale to do it easy
able*(
it's like a standard exercise
yeah m3 was the am exercise I just did
oh wow
or at least (i)
yo A4 is easy too lmfao
in the afternoon
its p standard
even for like an undergrad ig
yeah
yeah
oh lmfao yea
so uptill now
i can do like
3 problems
or 4
at moax
i still get that juicy F
only thing that WOULDmake this fair is passing is from 10 points
lmfao
xd the analysis ones are literally impossible
gl
easy win
what the actual fuck 
yea
fucking curse
part 2 is just ??
u sholud get ur PHD if u pass those
not the other way around
bro
"Do all five problems. Write your solution for each problem in a separate blue book."
i think should be enough to pass
or it dpeends on which ones u can do cuz points are not all the same
4 looks doable
Don't you generally want to do well on quals and not just pass, in order to get a better advisor?
does every uni require you to do one of these qual exams for a phd
but there are easier ones
this will be a problem for future me then
not really
like
its not the type of things where like
u study hard but still do not pass
like i think if one studies , memorizes the proofs of important theorems
u can pass
Some require you to just pass a set of classes
what if I didn't do my bsc in the us
there are qualis in canadian unis
thats all ik
Let R be a unique factorization domain in which there exists a unique irreducible element up
to associates.
(a) Prove that R is a principal ideal domain.
is this saying that every element is expressed as r1 * u1r1 * u2r1 * ....
where u_is are units?
i was looking at the quals i'd have to take next year and the algebra ones are like the prereqs of whatever that stanford qual required LOL
send
also the algebra qual just looked super free
ig thats great news for you haha
yeaa
u have to take only one?
or ig two?
i need to pass 2/4
@void cosmos btw I thought you're not a math major
i am not
what made you not not think i am not a maht major
haha
you told me once
ig thats the standard like graduate level qualifying
like thats what a normal person would expect haha
yea thats true im not
i am a cyber sec student
cs
that seems like standard undergrad algebra material though >.<
u think?
maybe ur only missing like
the module stuff
like this + modules would be definitely grad lvl for me atleast
oh
lmao this is basically free
yea at the end it depends on which uni
analysis quals meanwhile like
might just be that i haven't looked at analysis in a while though
quals always seem biased towards analysis
:(
the problem isnt with the syllabus
its the damn problems in the exam itself are whats crazy for me
would 2 be done using orbit-stab?
2 is like modular rep theory lol
these look quite doable
2 looks the most fun
1 would be more fun if it was just straight up proving the pq-theorem
😠
is being able to solve qualifyings like this a good indicator that my self-studying bonafides are somewhat working?
or are those considered too easy? ( i dont think so )
i did other ones aswell
I wouldn't call these easy but I wouldn't call them hard either
ok some of them I would DEFINITELY call easy 
yea medium
i would call this medium
the one tabular post
it's the easier side of medium imo
also I did question 1 without realising I was breaking my streak of never using the sylow theorems
very sad!
hmm these are interesting
let F be a field and A,B be 3x3 non-singular matrices over F such that 2A=B^-1AB
find char(F)
any hint?
Determinant maybe?
yea but how do i get to char
I was thinking something to do with the eigenvectors yur
*values
fuck the vectors!!
You'll get an expression in terms of det A
ok
yeah ||det(2A) = det(A)|| is a bit of a hint lol
Yes
And that essentially gives you your answer
Where is this question from btw?
qualifying exam i am just goign through qualis for fun
algebra
dk which uni
nvm
its uc irvine
😦
its not easy for everyone my man
brutal
yea 😦
riemann hypothesis is trivial tfym
four color theorem is trivial
TFW thing easy for me isn't easy for everyone 
i dont know how good every uni is
i hear uc irvine is one of the good schools so
i jusut checked the qualis out for fun
maybe asia is much harder
idk much about asia either haha
just watched a documentary about taniyama
lmao
yea to each their own ig my man
u can check out the stanford qualis i linked above
i am sure only a small fraction of problems would be easy for a large fraction of people
what an odd thing to say
yea im more of a poet myself
not you
so much emphasis is placed on uni rank
which subfield of math is the department more focused at
like for example university X is like more analysis-based
i feel like for grad school uni rank matters less than the specific department for ur study field
yea
so u would expect a hrader analysis quali .. something like that
i hear for example uwaterloo are like insane at discrete math stuff
school rank is silly
Mine is an engineering school that doesn't do much math
it's just a way for us schools to justify one kajillion dollars per credit hour
I happen to be a math major there though
is it important for a career in academia?
been thinking about that, no idea
uhhhhh
i wouldn't think so?
hopefully it comes down to your research you did in grad school/postdocs
i would think how good is your own research/advisor is more importnat
i'm also an undergrad so take my words with more than a grain of salt
like an extreme case u prove twin prime at university of moamen
like a tbsp of salt
You guys pay per credit hour?
i think that's how it usually is here in the states
Sad
pay per credit hour + additional fees and whatnot
anyways back to algebra:
its not a quali problem
but its just something thats been bugging me
now suppose R is a commutative ring
with identity
now by zorn's lemma (M3 in stanford quali lol) there exists a maximal ideal
call it m
R --> R/m by natural map
R/m is a field , so it has the invariant dimension property
but we know that if the homomoprhic image of a ring has the property then ring itself does
so now we know that all commutative rings have the invariant dimension property
can someone give me an example of a ring that does not have the invariant dimension property
all basis over all free R-modules would have the same cardinality
specific
like inside a free-R module 2 basis would have the same cardinality
Could you please elaborate on this?
consider Z --> Z/3Z
latter is a field former not
or Z --> Z/4Z lol
Yeah, that statement is false
BRO I KEEP TYPING PRIMES WHEN I'M TRYING TO TYPE COMPOSITE NUMBERS
huh?
sorry boys and girls
okay okay
let f: R-->S be an epimorphism of rings with identity
then S has property --> R does
okay yeah this is the same as IBN
okay
the endomorphism ring of K^\mathbb{N} doesn't have it
now is the proof of any commie ring has IBN true?
and can anyone
give me an example of a ring that does not have IBN
cuz i am struggling
look right above you buddy
sequences in a field K
your proof is correct though
cool
if R/I has IBN then R has it
yea exactly
but R/I is S by iso
so yea
but can u prove that this counterexample works?
would appreciate it
why is this? I don't see it
consider the free R/I- module F/IF
this is an S-module by first iso
so it has IBM stuff or whatever
IBN
so like the "pull backs" of any two basis in this module would be the same in the R-modujles
oof it's been a while
this also uses a different version
okay so suppose X and Y are basis of some free R-module ( call it F )
let pi be the canonical epi from F--> F/IF
then pi(X) would be a basis of F/IF
and so as pi(Y)
( this just follows directly from linear independnace of X )
but those are equal ( cardinality-wise )
and pi is a surjection
so X would have same card as Y
is there no easier example
oh and sorry I is the kernel here
from the first iso
hmmm 😠
speaking of exams
how hard is this exam
@elder wave solve number 1 haha
this is interesting question, if someone solves it tag me please
Lol I didn’t see the « answer ONE of the following » at first for I and I thought to myself the exam looks hella long
only thing i've been able to muster is to break down [K : F] = [F(a,b) : F] = [F(a,b) : F(a)] * [F(a) : F]
hahaha yea
anyways can u help with a counterexample
yeah
yeah im trying to figure out how to conclude [F(a) : F] is 5
can't really see why it can't be 3
minimal polynomial
oh duh right
we probably need to use the fact the polynomial is separable
if K/F is the splitting field of f, then would K/F be the algebraic closure of F
since f is irred and separable
Honestly idk I’ve never heard of this concept before
heh?
After a quick search on Wikipedia though there’s a counterexample there
But apparently you need to go through non commutative rings and me no like that
Yeah
yea any comm ring has IBN
It’s surprising there are rings for which it isn’t true
Kinda gross
Anyways yeah Wikipedia says column matrices of countable dimension
@karmic moat I'm thinking like
if it were 3
then its galois subgroup would be cyclic or something
this would be overkill but then uh
the subextension on the left would be simple
and so = 1
which is not possible
haven’t gotten that far into alg :^)
yeah it's really nieche
@karmic moat lol the solution is easier than I thought
ok so
one property of the minimal polynomial is that if some other polynomial has that element as a root then the min poly divides it
right
so m_beta | f/(x - alpha)
whats m beta
minimal polynomial of beta
ah
hmmm now I'm thinking
why is m_beta now just 1
cuz like m_beta | f
and it obviously can't be 5 right
invariant cringe number
hi potato
tower law
right part is just 5
because minimal polynomial the left part is either 1, 2, 4
now I'm buffled as to why it isn't 1 for the same reason
like given [F(alpha, beta) : F(alpha)]
we need to find the minimal polynomial of beta over F(alpha)
we know that f(beta) = 0
so minimal polynomial of beta = m_beta divides f right
but f has degree 5
m_beta can't be degree 5
so why is it not just degree 1
LOL ignore all of that
I'm stupid
polynomial degree is additive not multiplicative 🤦
hm imma think about this, this is interesing
i think I did essentially thsi question
Yeah nice
imma think if there's any other particularly nice way to think about it lol
oh maybe i misundrstood lol
well
uh
Yeah okay lol
SO
The galois group G acts on the 5 roots of the polynomial and each element of G is determined by its action on alpha and beta
so that gives a bound <= 20
like 5 choices of where to send alpha, then 4 choices of where to send beta
The divisibility by 5 is easy
So that is the partial credit done at least
yeah that immediately follows from min poly stuff
tru fair lol
And then it's fine to rule out 15
i think
e.g. w galois theory ||if F(alpha) = F(beta) then we have K/F of degree 5, otherwise there are two subgroups of G = Gal(K/F) of index 5, so that the order cannot be 15 (or otherwise it's be Z/15Z)||
how does this rule out 15
like uh
What are the groups of order 15
does Z15 have two subgroups of index 5
Z/15Z only has one sub of index 5
😎
uh where does the other one come from
F(alpha) and F(beta)
distinct fields of degree 5 over F
Sorry lmao I keep getting sniped I’ll let potato speak considering it’s their solution
but i wonder if there is a way that doesn't use galois theory
I just saw "irreducible and separable" and assumed Galois theory for that extra structure
¯_(ツ)_/¯
now I can finally take a bath knowing that that question is solved

oh god it's been 1:30 hours 
ah i can use p to send it to 2 by doing p^2? because thats when 0 goes to 2
right? cz currently 0->1->2
and 2 goes back to 0
Yes
and for this how did they get the value 12?
i am not sure what they mean by recursively computing
yeah lmao
I was gonna practice the drums but now it's too late 
it's already 9 pm and my neighbors would shout at me
digga meine nachbarn sind rentner
letzte mal schon mad weil ich um 19 uhr geübt habe
L
Da hast du ja n großes L gekriegt digga, ziemlich kringelig
Rip
potato abi 😭
more like potato asi 😎
Let $\rho:G \to \text{PGL}(V)$ be a group homomorphism. Let $s:GL(V) \to PGL(V)$ be a section. I have to show that $$ (s(\rho(g)) s(\rho(h)) (s(\rho(gh))^{-1}$$ is in the kernel of the quotient projection $\pi:GL(V) \to PGL(V)$
ProphetX
it is kind of straightforward to verify that after applying the projection $\pi$, we get $\rho(g) \rho(h)$ for the first 2 terms.
ProphetX
how do we evaluate the third term?
Is this assumption correct?
if you know what an internal direct product is, the proof is very quick
but maybe you can do it regardless
Never heard of it but I'll try to find something
they're defining the equivalence relation in such a way that the following 3 points hold - I don't really get what you're asking if I'm being honest
are you asking how point 3 holds or?
The relation ~ is defined as $a~b iff a^{-1}b \in H$
Kroros
And the theorem says that 1: ~ is an equivalence relation
as kroros said, $a \sim b \iff a^{-1}b \in H$
Wew
or are you confused about what an equivalence relation is
they're in the same coset of H by point 3
where this is going is that when we quotient G by this equivalence relation we get the same thing as G/H
that's very odd lol
tbh I'd define the equivalence relation as point 3 as that's the important bit
marc
$a \sim b \iff aH = b H$
Wew
this is all motivated by quotient groups
hell, cosets themselves are motivated by quotient groups
which is why it's incredibly weird they're not introduced until "much later"
no way you've done orb-stab before quotient groups this is wacky
kind of based albeit
fairs
take a subgroup H, multiply it by some element a
that's it
no, not subgroups
subsets
and it does this precisely because this is an equivalence relation

yes that theorem holds for every subgroup
marc
no, not at all
a and b are in the same coset of H
you can see the second equivalence via [a^{-1}b \in H \Rightarrow a^{-1}bH = H \Rightarrow aa^{-1}bH = aH \Rightarrow bH = aH]
I don't see how you can't understand that, sorry
either a^-1b is in H or it isn't
it implies they're in the same coset of H
as I've said
this motivates quotient groups
G/\sim_H = G/H
Anyome have any idea?
can the notation (S)^* be used for S \ {0} or is that not common?
basically want to write a modded vector space but
(S \ {0}) / ~ looks ugly
i also now realize how bad this notation is for a vector space as it could also mean its dual
I have seen it used for that a lot for rings and stuff
But yeah for vector spaces could be ambiguous as you say
is the space given by identifying antipodal points on S^1 is RP^1? is this general to S^n
i want to say yes since this construction is basically the same as the usual R^{n+1} \ {0} modding out scalar multiples
(Also note that S^1 mod antipodal points is also just S^1, which is a special case)
hadn't heard that one before. is there intuition to it
im working on hatcher problem 2.2.10, where we're asked to compute Hn(X) for X = S^2 with the equator S^1 under this antipodal mod
is there a way to construct this as a CW complex
Oh like s1 mod antipodes is S^1?
Uhhh one way is to consider squaring map S^1 -> S^1
It is surjective and identifies points iff they are antipodal
So you get a homeo S^1/antipodal -> S^1
How do you define tensor product over non commutative rings
i have a question
is showing that there is no quintic formula
the same as showing that group R_5[X] is irreducible \
i dont know weve gotten to the end of this algebra class, i hate it so much, much im seeing these polynomial ring stuff
showing that there is no quintic formula in terms of radicals is the same as showing that the group S_5 is not a solvable group (i.e. it doesn't have a sequence of normal subgroups such that the successive quotients are finite cyclic groups)
meow meow meow thanks
that actually kind of makes sense
so whats a galois field cause the chapter is called galois fields but they dont use it anywhere
yeah like the order of the cyclic groups corresponds to the order of radicals you're taking and so on


