#groups-rings-fields
406252 messages ยท Page 681 of 407
ok lemme stare at it again
show me the money
Nice
imma go watch dragon ball and avoid my problems
I was told to read the proof in this
by algebraic nt lecturer (just stated the thm)
warwick 
c shouldn't be of the form (a - a')/(b - b') where a' is a conjugate of a and b' of b
Or maybe it was the reciprocal of this
Just make sure that it isn't either
that's a lot more specific then I thought
does this generalise to longer sums in a nice way?
Induction
I thought so

so that just has to hold pairwise for all elements in the sum
I don't think they state the condition in the proof
oh they kinda do
so we're looking at......
Ye they make that an implicit relation

i see i see.
what are 'these'
nuts
"these" nuts answers
shh
Good professors 
moldi, tell us how you do it
moldi knows what's good
are you an AI

lend me some
ill give them back to you in the same condition
I imagine moldi's course on galois theory wasn't cancelled by their hack fraud university 3 months before I was due to start it
๐ผ
well tbh im not even halfway through my galois course
maybe i will be 10% as smart after it

comparing yourselves to others 

$$K(a + cb) = K(a, b) \iff (\forall a', b')\quad c\neq\frac{a - a'}{b - b'}$$
Did I get that right moldi
๐๐ก๐ฎ๐ซ๐ข๐๐๐๐
c = 0 doesn't work because a = a'
but if b is a conjugate of a
or something dumb
what are the conditions on a and b
K is a field
a, b algebraic
?
Let $L:K$ be an extension. Let $a, b\in L$ algebraic.
$$K(a + cb) = K(a, b) \iff (\forall a', b')\quad c\neq\frac{a - a'}{b - b'}$$
๐๐ก๐ฎ๐ซ๐ข๐๐๐๐
oof
Yeah maybe you can tweak it somehow so it's not strictly necessary here
I'm just thinking about the case when a, b are cube roots of unity say........
and then K(a) = K(a + 0b) = K(a, b)
not again 
i think it is only a reverse implication
Ye it's just reverse
or am i thinking dumb
D:
oki oki
Let $L:K$ be an extension. Let $a, b\in L$ algebraic and separable.
$$(\forall a', b')\quad c\neq\frac{a - a'}{b - b'}\implies K(a + cb) = K(a, b)$$
๐๐ก๐ฎ๐ซ๐ข๐๐๐๐
So is this good ๐ (edit maybe I forgot a minus sign, am unsure for now^)
It doth look good
waw
Ofc b โ b'
(I like symbols, what are words again?)
Since in denominator
slightly confused by the forall ๐ตโ๐ซ don't numbers only have one conjugate?
No
conjugate in the polynomial sense...
This is not complex conjugate
I wasn't thinking complex conjugate
If you have a minimal polynomial f
All roots are considered to be 'conjugates' of each other
right?
yay

oh right yes of course
But that said, I don't think the conjugates partition do they.....
or maybe they do ๐ค
aaa
partition what
uh so

f = (x-a)g(x)
h = (x-a)k(x)
Is it possible for f and h to both be minimal polynomials
in some uh
field?
Minimal polynomial is unique
Let f, h, g, k in L[x]
f = (x-a)g(x)
h = (x-a)k(x)
Can f and h both be minimal for something in K[x]
not necessarily a
Irreducible polynomials can't share a factor
yh thats my Q
So it comes from the fact F[x] is an ED
hmm ima think about this
So you get factorisations of both
Basically you have to prove that gcd doesn't change if you go to a larger field

moldi... what's a polynomial...
x
bro....
bro like....
squaring things...? what if like... dude they're... like rectangles instead bro...
An element of the free commutative R algebra over a singleton is a polynomial in 1 variable over R

you failed moldi I actually know exactly what that means
Alternatively the free pointed ring on R
ok now you've done it

back to before, so if L : K, if we take a ~ a' in K[x]
This relation partitions everything in L that is algebraic over K
right?
Yes
is it an interesting partition ๐
A name?
D:
Prove that any K-homomorphism from an algebraic extension F/K to itself is an isomorphism
WIll try, ty
I am used to seeing F : K
Me for a small while: F/K, F/K, what is this quotient
I think I done this exercise in a homework
*Oh F/K
As my prof said 5 times every lecture
Roots go to roots, and any root can go to any root
Important to remember when working with algebraic extensions ๐
Didn't you have it write
Yes

f(a) = 0 <=> phi(f(a)) = 0 <=> f(phi(a)) = 0
I think this is the steps to showing it

right I was mulling over this and don't think I've fully grasped it yet
If L : K is an algebraic extension, if we take a ~ a' in K[x]
Then any K-homomorphism from L to L must leave these classes invariant
Like kinda
$\varphi:L/\sim \to L/\sim$ is the identity map
use \sim
๐๐ก๐ฎ๐ซ๐ข๐๐๐๐
\simp
_ _
Ye
Like I might think about K(a)
And the K-homomorphisms permute a, a', ...
but not about other elements
Yes
And given any pair (a, a') with a ~ a', you can find some endomorphism of the extension which maps a to a'
I feel like there must be some kindof partition of K-homomorphisms... how to describe it.
Assuming algebraic extension
If 3 of them map a1 to a2.
Then 3 of them must also map a1 to a3
Which means if the degree of the minimal polynomial of a is coprime with the degree of the extension
Yes
Conjugates behave similar to each other
Because there's always an isomorphism of the field with this property
yh been meaning to get my head around this
hmmmmmmm
L : K
We can consider K-homomorphisms from L -> L (elements of the galois group)
We can also consider K-homomorphisms from L -> L' (L' being the closure of L)
I've been trying to get my mind around the difference (for me, the top crops up in Galois, the bottom in Algebraic NT)

They're the same if your extension is normal
In particular if your extension is Galois
I am familiar with normal, Galois haven't seen it yet
But I can see how it 'makes sense'
Ye since you have all the roots there anyway
Galois = normal + separable
You have all the roots and no repeated roots
I have been thinking all my examples in Q, R, C so it's a bit of a struggle to internalise separable.
Char 0 everything is separable
Right, the example I saw was F_p(t) : F_p(t^p)
Ye
X^p - t^p
Because finite fields also everything is separable
Is there some 'intuition' for the concept of separable?
And that's the simplest infinite char non zero field
'good'
I think I am familiar with a linear algebra analogy kinda
I mean this
what's infinite char field?
Lol

Infinite, char non 0
waiiiiiit wait wait
Is what I meant
๐
oh
Lol

trolling

I think an analogy for separable is Jordan Normal
Separable is like diagonalizable
non-separable you get 1's in jordan normal
idk if thats a good analogy (maybe not at all)

whats triangulable again ( ๐ค )
what is
Shuri-Jordan lemma
wat
๐

nice
there is a basis wrt which the matrix is upper (lower) triangular
I think my Linear Algebra is too weak (it literally stops at eigenvectors, diagonalisation, jordan-normal lel)
i thought you could do that for all matrices
it comes before jordan 
I just intuit linear algebra
You don't mean diagonalisable by this???
i like thinking about separable like you can separate double roots
in nonseparable fields they stay stuck
No
Like you can keep extending the field and they'll always be stuck? Or wrong
i mean like if your polynomial has a double root then you can separate them :D
u can take algebraic closure
You can't tho 
Eigenvalues 
Eigenvalues when the field is algebraically closed 
I can't find the term 'triangulable'
Isnโt this like, the exact condition required for non-separability lol
Yeah i brainfarted it
oh yh so if we have non-separable
(x - a)^2 being minimal polynomial
And we consider K-homomorphisms
a can map to itself but not force the identity map
is that the idea?
Wrote that bad lel
===
K(a) : K
min_a(K) = (x-a)^2
K-hom f : K(a) -> K(a)
If the extension is generated by a, then it will force identity
Ok so K(a) === K[x]/((x-a)^2)
Normally when you quotient by a irreducible quadratic
You will have (x-a)(x-b)
And your galois group will have order divisible by 2
or just 2
K[x]
Yes
When non sep ye
Separated would be a better name I think
Roots are separated
Ok I think I get the idea though
From each other
If the roots cannot be separated
You have elements of the Galois group
'glued together'
kinda
a mapping to itself forces the identity

As long as you are in a ufd you don't have to worry about the difference between primes and irreducibles? Ping when answering thanks
yus
wow CHEATING
๐ข
PID is sufficient right?
Thanks
I was trying to look for sufficiency
UFD is a sufficient condition I think
PID => UFD
aren't irreducibles primes in a PID?
PID implies UFD
they are but PID is a stronger condition than required
I think UFD is as low as you can go?
right right
GCD domains are slightly lower
Does (prime <=> irreducible) imply the ring is UFD?
cause then you can still do the funny bezout's (iirc)
yeah
Oh ok cool
Can someone fix my statement
(2) is not maximal in Z[X] for instance
I got a quiz in a few hours
(prime <=> irreducible) => ring is a GCD domain
there's a gcd domain? 
๐
there are so many stupid ring domains
Call it stupid one more time and det will haunt you
domain domain when
I imagine they do the proof that UFDs mean irreducibles are primes and then are like "oh we technically just need a notion of a gcd so lets define gcd domains and now this result is slightly more general"
Is gcdd>ufd>PID>Ed then
yeah
with bezout domains in there somewhere
someones going to prove this is impossible just for you, i bet
Exceptional domain
I hate not being in a ufd
I was about to try
I remember not long ago
we were fcking about in Z[x]
and had no clue
unique factorization but not commutative
Z-algebras 

(2, 3x+1) <-- 'is this maximallllllllllllll' or some sht
oh I remember that
me: lets try euclidean on it
It do be maximal tho do it not
me: wtf how do we do that
yeah I just gave up and showed the quotient was a field
How is that giving up
it's literally cheating
Bruh
isomorphism

Lol if this is wrong I don't want to be right
R[Q_8] be like YES FUCKIN FINALLY LETS GOOOOO

like the author calls a skew-field module a vector space
ok seriously, what?
it just ISN'T
yes
addition would kill lel
addition is always an abelian group
That one I am fine with
die
moldi when uhh
Modules over division rings are sometimes called vector spaces
wait wait whats an example of a non-commutative field
Their study is much more similar to vector spaces
skew-fields are fine but it's very bad to call them fields
these things are called skew-fields?
(Av)^T != v^TA^T (^T being transpose chat chat that means transpose)
I think, if it's non-commutitive
yeah skew fields are non commutative fields
yeah we're talking about skew vector spaces
souns like crazy sheet
what about non commutative integral domains?



GL_2(Z)
I think
moldi are there zero divisors in that bithc
yeah, these are just called domains
skewb domains
Not closed under add lmao
no i mean should u call a non commutative .... a integral domain
@rigid cave domain domain just dropped
the integer quaternions are an example of a domain which is not an integral domain
omg pog
Are zero divisors a pain or are they cool
a pain
they can be a pain
a complete nightmare
but they are important to consider sometimes
I've seen Lang call non commutative domains "entire" rings
I think they're cool just because it's different
yeah they're incredibly important to be aware of
might end up dividing by 0 omegaLUL
when i see the word quaternion I think physics. Is this just a big no. or quantum mechanics something
quaternions do show up in physics
quaternonic representations 
so do octonions

wat da physicicists doin
octonions are kinda awful
That's algebra I want to learn probably after galois
onion when
they're non-associative but still close to associative in a precise way
they're anti-associative
oh this is ryu
right?

cross product type memes
no it's like
Pfp change is tragic
any subgroup generated by 2 elements is associative
yeah
Well the options are like R C and H so lol
that's what you have to do for octonion computations, you always like, pick a pair of elements and then do computations inside this associative subalgebra
it's nutty

Doesn't it model behavior at a quantum level?
so there's some like
nutty construction for the standard model particle generations in terms of octonions
although I'm not sure that this is like
necessarily the best way to think about it
I thought it was spin group memes
it's related yeah
lmao wew pfp change
and I know there are quaternionic representations (of some) of the spin groups
That's just wild that our constituent particles are just algebra
yeah
there's a very general principle that relates classification of particles with representation theory
algebra > all
Symmetries and rotations
but yeah octonions come up any time you deal with the exceptional Lie groups
that's the sense in which they're natural
Irreducible means that f=gh implies g or h is a unit, right?
Oh ok
'Irreducible' only applies to non-units, and non-0 for my notes
Think that makes sense. You want prime <=> irreducible in GCD domain and you don't want to think of units as primes in general
being dumb, how does the below follow D:
ab = ac => b = c
Hmmm oh
a(b-c)=0
Or b is c
see this definition doesn't require it to be commutative

ic ic
ya but most (all) authors do require commutativity

gnir
$\vbox{\ialign{\hfil$#$\hfil\crcr r_i\crcr\noalign{\kern-.6ex}g!{\font~cmr12 at15pt\lower.4ex\hbox{~n}}!\crcr}}$
๐๐ก๐ฎ๐ซ๐ข๐๐๐๐

i know theres no algorithm to find automorphisms, but is there a mthod i can use to identify inner automorphisms from automorphisms
Given an automorphism (somehow), identify whether/not it is an inner automorphism?
or did I misunderstand
check if it maps conjugacy classes to themselves
if it does for every conjugacy class it's an inner automorphism I do believe yes quite
yep
could u give me an example, im a little confused by that statement
call the automorphism f
I think you are looking at what repeatedly applying f on an element does
f(x), ff(x), fff(x), ...
That would be the orbit of f
oohh group action memes I like it
Now why is this helpful... god knows
I think this is the relevant bits for thought ๐ค
we established last time we talked about this that outer automorphisms act on the conjugacy classes right?
I wasnt too awake
lol
ok yeah so Inn(G) is the identity element in Aut(G)/Inn(G)
is the id map
so if an automorphism maps conjugacy classes to themselves it must be inner
(as all automorphisms preserve conjugacy relations (x ~ y => y = gxg^-1 => f(y) = f(gxg^-1) = f(g)f(x)f(g)^-1 so f(x) ~ f(y))
i think you would need to check the classes of the generators of G only?
not quite
since automorphisms are bijections we should only need to check permutation of conjugacy classes that are the same size? right?
wait yeah I think so, that's clevar
oh ho ho ho ho shuri you've done it again
im only guessing around
(who proves stuff smh, just intuit and get things wrong half the time)
uhh waitttt ttt
what if the generators are conjugates
eh whatever
it'll work out I'm sure of it
doesnt that imply......... something
deep
$\Rightarrow$ something
Wew Lads Tbh (200 ๐) โ
idk!
i knew it
maybe generators is no good now i think about it
Given $x^G$, what do we know about $(x^2)^G$?
๐๐ก๐ฎ๐ซ๐ข๐๐๐๐
yes linear characters yes... constant on conjugacy classes just like inner automorphisms yess yes we must map the inner automorphism group of abelian groups to the irreducible characters yes yes bijection
wait fuck this is just a proof that Inn(G) is trivial when G is abelian holy hell I'm an idiot 
y = gxg^{-1} => y^2 = gx^2g^{-1}
spoookkyyy
so y ~ x => y^2 ~ x^2
$x^Gy^G = (xy)^G$
๐๐ก๐ฎ๐ซ๐ข๐๐๐๐
๐๐ก๐ฎ๐ซ๐ข๐๐๐๐
isomorphism type beat
y = gxg^{-1} => y^-1 = g^{-1}xg
yeah ok I'll believe you but I don't trust you
huh what
wait
does it not follow from the algebra
u typoed
do we care about this
I care
it basically means that if the automorphism swaps any two conjugacy classes it cannot be inner
doesnt this show conjugacy classes form a group or am I being silly
there's no binary operation between conjugacy classes there 
seems like you two are saying diff things
literally everything there is within one conjugacy class
wth
what went wrong there
isnt there smth we can do like
y = x^-1
finding isomorphisms to Aut(g) and then its related to its normal group
ok ok i wrote it wrong completely lul
yh yh yh
๐
what yall talking about man
does "gxg^-1hyh^-1" look like a conjugation to you?
being dumbbbbbbb
alrighty im out

I speak the truth and nothin but the truth
x ~ y
x^n ~ y^n
yall gonna confuse me before my exams
except for polynomial and integer multiplication I don't cover that
hahaha
sry lel
What we do know is Out(G) := Aut(G)/Inn(G) acts on conjugacy classes
do u guy sknow about smth like this
yeah it permutes those mfs
what do you mean "its normal group"? is inn(g) the only normal group chat chat is it the only normal one?
I have concluded that it is
Inn(G) is the identity element in Out(G)
All of the automorphisms in Aut(G) can be classified using Out(G)
Out(G) acts on {x^G : x in G}, the conjugacy classes of G
Now suddenly I'm unsure
@delicate orchid when u back help D:
no
nvm nvm nvm nvm nvm
Let $f\in \textnormal{Aut}G$
$$f(x^G) = f({gxg^{-1} : g\in G})$$
$$= {f(gxg^{-1}) : g\in G}$$
$$= {f(g)f(x)f(g^{-1}) : g\in G}$$
$$= {gf(x)g^{-1} : g\in f^{-1}(G)}$$
$$= f(x)^G$$
checks out
๐๐ก๐ฎ๐ซ๐ข๐๐๐๐
idk what x^G means tho
The definition is written in the first line
unless thats ur notation for all conjugations of x
yh
never saw it until today
why does f(g)=g?
oh
i see tho
But this holds cus f is an automorphism
i guess it isnt that f(g)=g
its more of a substitution
but it seems slightly misleading to have same variables ig
I'm like viewing g in f^-1(G)
its no sub actually
call em gโ or something
no no, its the same g
it isnt tho
it is tho
or is it not
lol

i can see why my bad lol
yeah
staring staring
your second line is the g such that g in f^-1(G)
basically if f wasn't an automorphism this would fail in one direction or the other
f(g) in G
equiv
g in f^-1(G)
yeah
u were just rewriting it
oh
ur showing this ^G action of conjugation is a homomorphism?
im just thinking if this kinda writing works for preimages rn ๐ค
what are u trying to prove?
I was convincing myself all automorphisms act on conjugation classes
Hence Out G = Aut G / Inn G also does
In particular I want to show f in Inn G iff f is an identity action on the conjugation classes
oh ok
yeah ok
i guess i forget
this is ur next step?
yh
well one direction is obvious
Let $f\in \textnormal{Aut}G$
$$f(x^G) = f({gxg^{-1} : g\in G})$$
$$= {f(gxg^{-1}) : g\in G}$$
$$= {f(g)f(x)f(g^{-1}) : g\in G}$$
$$= {gf(x)g^{-1} : g\in f(G)}$$
$$= f(x)^G$$
I think I wrote the above wrong lel
tripping myself up by sticking to set notation
๐๐ก๐ฎ๐ซ๐ข๐๐๐๐
๐๐ก๐ฎ๐ซ๐ข๐๐๐๐
yuh
for integers
it comes down to partitioning by a multiple of some number
so think of a number n
we knows nZ is a subset of Z
and a subgroup
have yoy learned about quotients b4 i continue
yesnt
because this is where they come in handy
ok
well
say we have 3 in Z
and we look at the set 3+nZ
what does that look like you might ask
well nZ is the set of multiples of n
and +3 is adding each element by 3
now what happens if we look at 4+nZ
or n+nZ
well 4 is like last time and is just adding each element by 4
but n is adding each element by n
n+nZ is in nZ
but if we do that we are still in nZ
yea
it turns out that if you look at the set of all cosets
its not only a set, it has a multiplication also
it gives the set of cosets of a subgroup a group structure
is that a thm
well it depends on the subgroup you are looking at
they have a condition called normal which means it stays fixed under conjugation, but it isnt important
it is a theorem
infact this group structture makes something called a quotient group
yeah its grouping
You do the same for abstract structures as you do for numbers
quotienting only works on a special type of subset called a normal subset though
yeah you probably need to cover conjugation and normality to talk about it next
what else in ur slyabus screenshot?
what in the speed run is this
@delicate orchid would you like to keep shitting on my prof
not right now sorry I'm busy making a mockery of latex
i remember spending a lot of time on symmetric groups/group actions/sylow subgroups
what are you supposed to take away from ur class?
oh this isnt the full thing
the straight jump to ring theory to a cocktease of galois theory at the end
that's starting from week 6
yeah
though 1-5 weren't the best either tbh
but im sure u didnt talk about group actions at all
a group action on a set is a function F:G x X -> X

have u seen it b4
in this channel yeah
we didn't do group actions in our first group theory course
i applied for that school too
dont.
wht the fuck
isnt group actions main way people think about groups
because symmetries on objects
ok coset though, can i just think of it for now as like multiples of a subgroup
I see
it also is very helpful to study group actions
cosets are just a set of mofos multiplied by some mofo
like its only way to talk about symmetries of surfaces without sounding handwavy
yes but in a first course?
times of the thing is the thing of times
I do think they should be in there but towards the end
i did that in a first course
yes but this time that's literally all there is to it, a coset of a subgroup is just some element times that subgroup
group axiomz
thats all
bruh wasted 6 weeks
i iwish
no, no you don't 
truth algebra
boolean "algebras" or as I like to call them, fields, are a fake construction
structure theorem of fin abelian groups was last topic i did in my first course
wtf lol
we were based i guess
I learnt about that through the structure theorem of Z modules
horrifying and yet ZASED
or plus right?
and i was confused because i didnt know it at time
yeah
operations arw arbitrary
plus notationally implies you are in abelian group
times implies not necessarily abelin
same thing
literally same thing
could be fuckin
uhhh
ACKCHUALLY
there is just linguistic context i guess
Just use :checkmark:
plague
let <a, aโซ12 = e> be the group of chromatic notes under the operation of transposition up by a semitone 
I wrote a little paper about group actions in music actually
for latex practice
turns out all symmetries of the chromatic scale is $C_12 \times C_2$
Wew Lads Tbh (200 ๐) โ
wow looks like that latex practice was fuckin worthless
,w unmanly
wait random thought
_{..}
by definition if H is a subgroup of G then order of H is less than G right
no
think about integers
if A is a subset of B, then |A| \leq |B| (assuming finite)
infinite, a similar statement about cardinality can be said
yeah
okay nvm 
no
were you going to construct a chain perhaps
going to apply zorn's lemon were we?
for infinite groups it gets weird
i was gonna make a sea shanty
they are all necessarily infinite
but the cardinalities can either be equal or less than
I'm not sure about this
even simpler, I was thinking $\bZ/2 \leq \bZ/2 \bigoplus \bZ$
e is trivial
$\abs{A}\leq\abs{B}$
๐๐ก๐ฎ๐ซ๐ข๐๐๐๐
I mean, this notation is still well defined for infinite sets
it just means something slightly different
why the big one lel
Wew Lads Tbh (200 ๐) โ
big big chungus big chungus big chunugs
its still not true
there are no non-trivial finite subgroups?
i need more conditions
oh
=...=
If the order of all the generators are infinite
then maybe we can say something
yeah
there cant be finite order generators but then thats trivially saying that the group is infinite and has no finite subgroups
I think this has finite subgroup
๐๐ก๐ฎ๐ซ๐ข๐๐๐๐
like free group and ab=e?
yh yh
abab=e?
yh
bruh lol
am i writing dumb
yeah
so if it isnt necessarily true
This is the lattice in Z^2 right
yeah
๐๐ก๐ฎ๐ซ๐ข๐๐๐๐
which one?
idk
we do not
free groups work
idk if its possible yea
any finite relation you put on generators implies the group has finite generators
after the abelian part
$$\langle a, b \mid R\rangle = \langle a, b\rangle/\langle\langle R\rangle\rangle$$
๐๐ก๐ฎ๐ซ๐ข๐๐๐๐
langle my rangle
Must any finite subgroup of the left
be a finite subgroup of <a, b>
?
๐ค
maybe not again.....
shuri
i can prove that any abelian group with finite condition on generators is not abelian
or maybe i can go one step above
this is gibberish
ignore me ill be back
im chucking the idea of abelian, I don't know if we need to talk about those
.
well like
i was tryna think in general
me when R = {a^2, b}
๐
lots of non abelian groups are counter examples
yeah so we can't have restrictions that kill the order of a , b
yeah
yeah cause then you just take the subgroup generated by that element boom finite
and we know because of structure theorem thet any additional conditions besides commuatative puts a finite condition
yeah



