#groups-rings-fields
406252 messages · Page 471 of 407
I mean, what does fv mean?
(a_1,a_2.....,a_n)
What?
you have two operations on V
- and *
where * : F×V -> V
And a*(v+w) = a*v + a*w and (a+b)*v = a*v + b*v
F is the set that contains your scalars
over a field F
Yes
okay
An important family of examples:
I highly, highly recommend these videos when you learn linear algebra: https://www.youtube.com/playlist?list=PLZHQObOWTQDPD3MizzM2xVFitgF8hE_ab
If S is a set, let F(S) be the set of all formal sums a1 s1 + … + an sn where a1,...,an in F and s1,...,sn in S
So the weird thing is that those symbols don't mean anything
- is not an actual operation yet
I'm just defining what the elements of the set look like
What?
Why the = 1 though?
Anyways, we can define an actual + operation by adding coefficient by coefficient
So if we have formal sums v = as + bt and w = cs + dr, v + w = (a+c)s + bt + dr
and our scalar multiplication works by multiplying coefficient by coefficient. So a*(a1 s1 + … + an sn) = (a a1)s1 + … + (a an)sn
cool
Now if V is a vector space, a basis for V is a subset B of V such that every v in V has a unique representation of the form v = a1 e1 + … + an en for a1,...,an in F and e1,...,en in B
If V has basis B, then we get an isomorphism F(B) -> V by sending a formal sum to its actual sum
The amazing thing about vector spaces is that any two bases for the same vector space are actually in bijection, so they have the same cardianltiy
We define the dimension of V, dim V, to be this cardinality
Finally, two vector spaces V and W turn out to be isomorphic if and only if dim V = dim W
Oh, a homomorphism of F-vector spaces is a map L : V -> W satisfying L(v+w) = L(v) + L(w) (so it's a group homomorphsim) and L(av) = a L(v) for any scalar a in F and v in V. An isomorphism is an invertible homomorphism
Now if V is a vector space, a basis for V is a subset B of V such that every v in V has a unique representation of the form v = a1 e1 + … + an en for a1,...,an in F and e1,...,en in B
@latent anvil don't they need to be linearly independent? Otherwise this would just be a generator
Oh I guess I'm actually lying a little
You should have the ai be nonzero
Otherwise it's easy to get non-unique representations
By just adding in more terms
An isomorphism 👀
So if R and R^2 as isomorphic as vector spaces over some field, they're isomorphic as groups
They're definitely not isomorphic over R, since they have dimension 1 and 2 respectively
But over the field of rational numbers, they actually do have the same dimension
how
fam I am aware
Uncountable basis 
So prove that R is not a finite dimensional vector space
Show that if V is an F-vector space, there's a natural vector space structure on the abelian group V×V
Show that if V is infinite dimensional over V, then V ≈ V×V
i will try that
By using a basis for V to get a basis of the same cardinality for V×V
yes
Lol
and same with scalar multiplaction
Yes
cool
lol
stupid questions?
i gave a very fast introduction to linear algebra
stupid questions?
no
a basis B is a subset of V such that every vector in V can be written as combinations of vectors in B
am i right?
Yes
Lol
A basis B is a linearly independent subset of V such that every vector in V can be written as linear combinations of vectors in B
A minimal generator
A subset B of V is said to be a basis if:
- It is linearly independent
- span(B) = V
A basis is an isomorphism to R^k for some cardinal k
imo
oh my god im so stupid
a basis is a spanning set
if you need linear independence you're trying to be too fancy
Lol
Oof
lmao
?
R is not linearly independent
Okay, linear algebra time is over
what is linear independance
Let A be the infinite direct sum of Z with itself
Or the infinite direct product if you swing that way
Show that A ≈ A × A
okay
Here is your example, you're welcome
yea
This is secretly the linear algebra example
phi((a_1,a_2,a_3,....a_n) = ((a_1,a_3...,a_(2k+1)),(a_2,a_4....,a_(2k))?
phi is isomoprhism?
That doesn't look injective
Just make a bijection between N and N disjoint union N
if u go form
from
Z/2Z
njo
product(Z/2Z) to product(Z/2Z) x product(Z/2Z)
ayy
am i right boys?
Actually what you were doing is kinda fine
i fucked it up didnt i
but whats wrong
@chilly ocean that guy shamrock had enough with me being brain damaged what does linear independant mean
u gotta help me
Lol
,w linearly independent
oh okay
wtf is a matrix
is 1+1+1 unique?
like
if i have an element in R v
basis of R is 1?
{1} ?
With respect to the basis {1} the representation 1*3 for 3 is unique.
it is/
cool
so the vectors are linearly indepednant if u can write them as a unique linear ocmbinations with vectors from the basis
Mb
Yeah
i just wanted to learn linear algebra enough as like a
lemma or someshit for the problem i had
i never liked this linear algebra shit from high schol
Why are you learning algebra if you don't know linear algebra
You're not gonna learn shit by just derping around on a discord server
part 3 ( linear algebra )
well im going through the text books im just asking for help with problems
Why are you doing math if you don't like linear algebra
and its just a conincidence that i asked shamrock to teach me some new definitions
Dark secret: when I first learned group theory I couldn't do the matrix groups problems because I couldn't multiply matrices
Algebra before linear algebra kinda sounds like first semester category hell
And turns out shamrock probably was disserviced by this lol
@woven delta idk i probably dont know linear algebra enough to hate it i jusut iddnt like playing around with matrices using gauss stuff
i know matrice operations forom high schoool
Don't learn that type you can learn actually interesting stuff
If you wanna learn algebra along with linear algebra
and i think it helped me to understand group examples of matrices
yea rtin
artin
we talked about this
Pick up a book called Algebra by Artin
b4
and i just hated matrices for whatever reason
why u thought i was derping around on discord tho?
Turns out math isn't kind to people's desires, it's a very git gud or git fuckt subject
My point here is like, this isn't the way to learn stuff
'Turns out math isn't kind to people's desires, it's a very git gud or git fuckt subject'
oh
If you don't wanna learn linear algebra you're just screwed
well i read the textbook , do some problems and post problems here that i have difficulty wiht
Like this is a barrier of entry to the subject
There is a reason why they don't start with algebra in uni
if you byw hat you mean by this is just
You clearly didn't read much of Artin or even like, Hoffman and Kunze
that this way im not learning linear algebra then i totally agree
If you're asking for definitions on discord
yea i agree with you obv
This isn't the place to learn the foundations of the subject, that's a book or a class
i think the book has its fair share of algebra
yeah so I am still bad at linear algebra
and the book even sometimes imply that some readers would not be fmailiar with lienar algebraa
Because I didn't pay attention to it in high school
Because I thought it was boring
And if you got quasi-ghosted it means you've probably used up his patience
so i think i will learn lin aglebr when i get to it in like chapter 15
Which isn't something you wanna do
For real
whats quasi-ghosted
Stopped responding for a bit
yeah so I am still bad at linear algebra
@latent anvil same lmao...
i mean
Like those basis change problems
I am much better at later stuff than earlier stuff in LA
Since I never really had like, much practice with Gaussian elimination
Yeah change of base still throws me off
Oh yeah... gaussian elimination the LU stuff
But I think of everything in terms of minimal polynomials
I get the process but I can't always carry it out
But I think of everything in terms of minimal polynomials
@bleak abyss wdym by that?
u change basis if u conjugate ig?
Same, I understand what happens but like if somebody brings me a question, I am like now waaitt a min
dk nvm
Like idk char and min polys of matrices are how I solve a lot of problems
That's pretty much right mo
I guess that .. works

lol does anyone remember inverting matrices or calculating determinants even
linear rep theory i fink
Rep theory would say that a conjugation by an element is iso to a conjugation by a matrix
Or like idk Hoffman-Kunze
lol does anyone remember inverting matrices or calculating determinants even
@upper pivot i do
Even Axler
i will do that after i finish this chapter on group theory
No not Axler
that last one
Apparently there is a big formula for determinants using cofactors and shiz
Fuck Axler
Axler is alright
Not really
axler has nice colours
He thinks about determinants like an actual dumbass
I wish more books had nice colors
lol N/mathfrak(u) i never remember those of the top of my head, always have to look up the algos
same imagine rudin colourised
the parity of a permutation is the determinant of the peermutation written in array form
boom
Which is fine if you're doing functional analysis because determinants aren't nearly much of a thing
But if you're doing anything else and your definition of the characteristic polynomial is
Mathfrak A!
Like, easiest way to make a book more readable, put definitions and theorems in colored boxes
Close enough
"Complexify the matrix, upper triangularize that, and then take the product of t-diagonals
@stone fulcrum topology without tears right?!
I feel like I still don't really understand determinants
Axler did that with his FA book as well
Like if that's how you define a characteristic polynomial you need help
That's a really good book
And you also probably need to lose tenure
Yes. Call me inspired. I honestly want to write a similar book for abstract
You think?
Yeah that's bad
Like, at least define it as like product of (x-λ)
@stone fulcrum first buyer
Determinant something something volume
is the characteristic polynomial
Err I guess how do you talk about multiplicity?
the triangle thiny?
Why do you believe that?
thingy?
But I've tried and it comes out sucky
Char poly of a matrix A is det(tI-A)
i think i saw this when defining partiy of permutatioln
-_-
Char poly of a matrix A is det(tI-A)
@bleak abyss ad-bc ftw
You can fix that by actually learning linear algebra
I feel like this devolved into everybody saying they're bad at linear algebra
Nah I'm good
I'm okay at linear algebra
You can fix that by actually learning linear algebra
@bleak abyss o.O or.....
I'm not bad at linear algebra
x < y doesn't imply x is small
I'm not bad at linear algebra
@chilly ocean oh yeah? give me the formula for the determinant of a 7x7 matrix
Yeah duh it implies y is small
Hmm?
Bruh wolfram alpha
Oh sorry lol
o smort
So it seems
i wish there was a field of math i was good at ):
And reading
I mean you can compute it using gauss
Wait hold up it actually worked
I actually got it wrong the first time and edited the message
Master gaslighter
I've been hoodwinked!!!!
Nice
Anyway the point is that if people try to do more advanced stuff and ask dumb questions because they don't know essential stuff they may get btfo'd
idk why
When no one is getting paid to answer questions there are in fact dumb questions
yeah who knows
but the textbook assumes some1 is not fmailiar with lienar algebraa
and i was not supposed to know linear algebra in solving the problem
Anyways why is a^2 - b^2 = (a-b)(a+b)?
well i tried with different values of a,b and it seemed to work so it must be true
Btfo shamrock
Owned
lol idiot just look at the zero sets and apply the nullstellensatz
Z(a^2 - b^2) = Z((a-b)(a+b)) and they're both clearly radical
Who hurt you
LA
@latent anvil , there's actually a really nice geometric proof
oh?
Oh sorry I thought you meant about R and R^2 being isomorphic as groups
Yeah no I was meming
R and R^2 are isomorphic as groups
oh, sorry, I misunderstood then
Someone had a problem to find a group G iso to G×G
They said they tried R and it didn't work
And I was like "well it does"
But then they didn't know linear algebra
there are easier solutions anyway
let me see if I have this right: A set S with a law of composition is a group if there exists a surjective homomorphism from a group G to S?
yep, think that's true
Okay cool.
Another question: when we talk about the quotient group $G=\bC^{\times}/U$ with U being the set of complex numbers on the unit circle, we're talking about all of cosets of U? So the elements of G are sets of the form $xe^{i\theta}$ for all theta and some $x\in \bC^{\times}$?
nix:
With this group G being isomorphic to the positive real numbers under multiplication?
So the map from the quotient group to R^\times is the absolute value map, and would the map from R^\times bring a real number r to the circle of radius r in C^\times?
Great thank you
👍
do ring homomorphisms preserve multiplicative identity?
wikipedia says yes, but my textbook says only if the homomorphism is onto
also which convention is more prevalent: rings with identity or rings without identity
with
the more common convention is that homs preserve 1
yep haha
just be careful if you're taking a class and your prof expects you to use your textbook's definition
I saw that :P
it's good to keep in midn that there are other conventions out ther
but the most common one is definitely the one with 1
being preserved
I forgot what I posted lmao ok coolio
How would you use the division algorithm, I don't see it immediately
True!
Any other way of proving that anyone can see in the context of an intro analysis class tho? I'm trying to think of a really simple way to show at least that it is at most countable
without development of anything outside the context of set theory or reasonable prerequesite ideas
at that point in the chapter rudin just develops stuff regarding showing countability and the like
but does give a hefty amount of properties of complex numbers from the last chapter
Mega, what have you tried?
let $p(x)$ be the minimal polynomial then $p(\alpha) = 0$. Now as F remains unchanged under $\sigma$ so we have $\sigma(p(\alpha)) = \sigma(0) = 0$, but $\sigma(p(\alpha)) = p(\sigma(\alpha))$ as coefficients of $p(x) \in F$.
I wanted to verify my proof
That's correct so far
Isn't that enough ? Have I missed something ?
No
You showed that if α is a root of some polynomial p, then σ(α) is too
That doesn't say anything about the roots of the minimal polynomial, or bijectivity
oh okay, so I also need to show that for all alpha, sigma(alpha) is unique ?
So that it is a complete cycle ?
mega:
Ah okay, it was my mistake not mentioning the minimal polynomial, and as sigma is automorphism, it's already unique
Yep, you’re done after that
I see, thanks!
Hi, can someone help with this question?
I'm trying to prove the hint part first
So I need to prove that it is a subgroup and it is cyclic
Yes
just to be sure, you know that ${\pm 1}$ means ${-1;1}$, right ?
Zef Klop 🍃 🌿 🌻:
The set which has -1 and 1 right?
yes
Yup
then I don't see what is stopping you from showing it is a subgroup
I don't understand how we can show that is a subgroup
use the definition of subgroup
So it has to satisfy that G contains the identity and inverse of each element of GL_2(Q) right?
Okay wait so what is the question really asking
the hint is asking you to show that the set H = {(1 b // 0 1) with b in Z} is a subgroup of G, and is cyclic (generated by one element)
the question is really asking you to show that G can be generated by 3 elements
When they say "determine the elements x,y,z such that G=<x,y,z>", I need to find 3 matrices (x,y,z) that have elements cycles back to each other?
they don't say "determine the elements x,y,z such that ..."
they say "determine some elements x,y,z such that ..."
you need to find 3 elements of G (matrices) such that those three generate G
So i tried to compute (1b 01)^n and found that in general, it becomes (1nb 01)
And if i do the inverse, (1b 01)^-n, in general we get (1-nb 01)
yes
a cyclic group is a group that is generated by one element
you are thinking of torsion groups
not the same thing
i just started group theory at school so im still learning but cant u say that the one in the hint is a cyclic subgroup bc from the form uve found, its isormorphic to a subgroup of integers, and subgroups of cyclic groups are always cyclic?
I need a bit of help with one of the problems I'm working on
PolyBeanDip:
This the problem and part of my solution. I'm not really sure how to proceed from here
Also, I only included problem 1 so that problem 2 makes sense
use rational root test to note -3 and 1/2 are roots
then you have a quadratic
by the rational root test, you can show it's irreducible
(x+3)(2x+1)(x^2 + 1)
should be the factorization
<@&286206848099549185> could I have help with the question I have above?
why is that a contradiction tho?
just say "therefore the galois group can't have an odd permutation"
the discriminant is nonzero because you've assumed the poly is separable.
alright, one sec
so this theorem is just false if the characteristic is 2
because of the issue you noticed
sure, take x^2 + x + 1 over F_2. The discriminant is 1 but the galois group is Z/2Z = S_2
whereas A_2 would just be the trivial subgroup of S_2
you can kind of see this directly. let's think of quadratic polynomials. if the discriminant is a square, then the quadratic formula tells you the roots are in the base field
but the quadratic formula fails in charactersitic 2 because it requires dividing by 2
ooh, cool
as for the nonseparability issue, take the polynomial f(x) = x^2(x^2 + 1) over Q. it's not separable and therefore its discriminant is 0 (so, a square in Q). Label the roots in order 0,0,i,-i. As as subgroup of S_4, the galois group is {e, (34)}
which isn't a subgroup of A_4 as it contains an odd permutation
it's not a difficult example to construct but it did take me a sec -- this is why I had assumed that your assumption of separability was for the whole problem, but you're right that the problem doesn't really add that as an assumption
ok thanks
for this example, you can basically take any poly that has a nonsquare discriminant (and therefore a galois group not contained in A_n)
and then force it to have discriminant 0 by multiplying by x^2
and then the galois group will now be a subgroup of S_(n+2) since we've added 2 roots
but it won't be contained in A_(n+2)
sorry for not reading your question closely enough at first
u done here boys?
i just wanna make a concept check not a problem
okay so this says that if G is a finitely generated abelian group then G is isomorphic to Z^r * Z_n_1 X Z_n_2 X .... X Z_n_k such that n_i >= 2 for all i , n_(i+1) divides n_i and r>=0
now the problem we are doing now is trying to find the abelian groups of a certain order
doing this with using what i just said up would be 'ad hoc' and would be hard to find such ns which are now called the invariant factors
so there is an identical theorem
for finite abelian groups
let G be of order n = (p_1)^a(p_2)^a_1..... G is isomorphic to some groups A_1 X A_2 X... X A_k such that :
|A_i| = p^(a_i) and
is isomoprhic to Z_p^b_1 X Z_p^b_2 .... such that b_1 + b_2 +....b_j = a_i
am i doing everything right here?>
i know i butchered the notation cuz idk latex but is there somethging wrong
you haven't done much yet
but you haven't said anything false
okay cool
so now we call the p^b_is the elementary divisors of G ( dk why )
now this is what i know
plus i proved that Z_n X Z_m is isomorphic to Z_nm iff (n,m) = 1
now i still dont know how i would find abelian groups of certain orders
yes, so that fact is how you go between the two different theorems
basically just factor the order
if you get a p then that factor must be Z/pZ
if you get a p^2 then it's either Z/p^2 Z or Z/p x Z/p
etc
I have to go now but hopefully that will help you start
so factorization 180 would be 2^2(3^2)(5)
okay
G ~= A_1 x A_2 x A_3
|A_1| = 2^2 , |A_2| = 3^2 , |A_3| =5
A_1 ~= Z_2^b1 x Z_2^b2 .....
such that b1 + b2 + ... bn = 2
and bi >= b_i+1
now this is a partition of 2
now bs would all have to be one here
2 bs
so A_1 ~= Z_2 x Z_2
am i doing this all right ?
same shit with A_2 and A_3 ?
and i think i find other nonisomoprhic abelian groups
when i play around with the partitions
if i change the b_s ( not for this case cuz 2 has only this partition ig ) i get new As hence news Gs
hope im right
ig the rest of the section is trying to explain how to go from the invariant factors to the elementary divisors and the othe way around
Since multiplication must be commutative, is the general linear group not a field? It seems to satisfy the necessary properties of every element having an inverse for both addition of multiplication, so if it's not a field, what is it?
lmao
@toxic zephyr it's not closed under addition
I + (-I) = 0 is not in GL, but I and -I are
or even just it doesn't have a 0 lol
oh shit youre right haha my b
np
@solemn rain did you forget about Z/4Z
is Z/nZ the cyclic group of order n for you?
anyways
no? idk
im still finding out first group
so now i have G = Z_2 x Z_2 x A_2 x A_3
jyes
cool
so im doing all right now?
i have this weird feeling that i dont understand it it sjust
no I was responding to what you said about Z/nZ
Z_n is nonstandard notation
yes
as a sum of positive integers?
2
?!
is that one
okay so i have Z_4
and also Z_2 x Z_2
which are non isomorphic
thats just for A_1
oh boy
why is that an "oh boy"?
it'sliterally the same for A_2
and it's trivial for A_3
okay i m going to work that out jusut to check
my understanding
dk how u got that that fast xd
because you already factored 180
|A_2| = 3^2
the exponent is the same
and it literally only depends on the exponent
what are the options for A_2
no no no no no
what
check the theorem again
the b_i don't sum to 3
they sum to the exponent on the 3
fuck
that's why this is so easy
yes
wrong channel
okay so i think i can get the handle of this
chill boys
oh fuck
put that on me hyper
my bad
so anyways
is that it for this section?
yep
okay but
look at this
how can i find
the b's
if i have the ns from the first theorem
the general one
and vice versa?
oh sorry
how can i find elementary divisors
from invariant factors
uhh which is which
the invariant factors are the (n_1,n_2,n_3...)
ssuch that G = Z^r x Z_n_1 x Z_n_2 ...
Z^r = Z x Z x Z ( r times )
basically you have to factor each of the n_i
into primes
then split each Z_{n_i} into its prime pieces
and then combine all the pieces prime by prime
so for example if you had Z_6 x Z_2
Z_2 is already its own prime piece
and Z_6 = Z_3 x Z_2
so once you regroup
you get Z_3 x (Z_2 x Z_2)
the two theorems are just two ways or organizing the same data
the first way is nice because you can write any group as aproduct of cyclic groups, which is nice
(and the n_i divisible by n_(i+1) is just a little "bonus")
yes
and the other way is nice because sometimes its useful to decompose a group prime-by-prime
you mean write any abelian group?
yes
okaay one more thing
no np thank you for even having patience with me
why is the number of abelian groups up to isomorphism
is the number of partitions of beta ( which somehow is not rleated to the prime its being raised by )
( beta is the elementary divisor )
is it because you have ddifferent As
what do you mean the elementary divisor
let G be of order n = (p_1)^a(p_2)^a_1..... G is isomorphic to some groups A_1 X A_2 X... X A_k such that :
|A_i| = p^(a_i) and
is isomoprhic to Z_p^b_1 X Z_p^b_2 .... such that b_1 + b_2 +....b_j = a_i
the elementary divisors are b_1 , b_2 ...
so it's the number of partitions of the a_i
you can just see that from the statement
and also we talked earlier about why the prime doens't actually matter
you get new A_s hence new Gs?
corresponding to Z_p x Z_p
and Z_(p^2)
now you take the product of hte number of partitions of all of the a_i
and that's your answer
yea i got that
okay cool
thats it for the section?
i thank god that id ont have to prove this shit
its too big boy for me apparentrly
erm... I'm a bit confused about : "What if the condition 1 != 0 is omitted?" part
Ah yes the legendary Definition (2.3)
F^{x] doesn't even contain 0
lol
imma share it
just thought I'd post what I'm confused about first then follow with it :"3
What do you think would happen if 1 = 0?
but in the scope of the axiom (ii) 0 isn't in F^{x}
that's what I find confusing ...
0 is in F
it's defined by how it acts on F+
but you can still talk about multiplying by it
for example, the real numbers form a field
I think his confusion is that F^{\times} = F - {0} is now empty
so?
So how can it be an abelian group if 1\ne 0?
well yeah
(I apologize beforehand for my stupidity)
He has but he's not sure how to parse it
can F* be a group if 1 = 0?
Basically the point is this, if 1 = 0, then x = x1 = x0 = 0
So F^{\times} is empty if 1 = 0
so it was that simple ?
Empty sets can't be a grourp
essentially, yes
:[
this is why we're forced to define 1 =/= 0
wth
I was thinking that there was some important thing that has to do with the identity of (F,+) and (F,x) and distributivity
idk
since 0 isnt in F* by definition, it cant be the multiplicative identity
basically
so you MUST have 1 \neq 0
i.e. the condition can be omitted just fine
as long as you define F* = F \ {0}
yeah I understand ...
anyway, there is a temptation to say "okay, but what if we pretended we could do this"
"and we had 1 = 0"
in that case, you'd have the field of 1 element
so basically
I've thought of F less abstractly
erm
with 1 he means the additive id and 0 the multiplicative
other way around
but for some reason I associated them with numbers
0 is the additive identity, 1 the multiplicative
so it didn't make sense to even pose such a question here
yeah sure, thats understandable
but once you think of them abstractly as different identities
the question makes sense
yes
this is why in a lot of group theory settings, they use a symbol like "e" or "id" instead of a number like 0 or 1
I see why such a situation is possible
EXACTLY !
(he's been using e for a while so I got used to the notation and 1 being associated with numbers because he worked in C alot)
it turns out that for fields specifically
no matter what sort of field we make
it behaves "a lot" like regular ol' arithmetic
so calling things 0, 1, etc isnt usually too problematic
Yep yep
but there is some nuance, as established
just notation
for example, in the field of 2 elements, 1 + 1 = 0
it's not defined that way, but you can prove it
oh you mean
in the field of 2 elements
yeah, 1 is its own inverse there by definition
-_-
lol
my bad my bad
it's alright :3
we usually say "negative" when talking about additive inverses
and yes, 1 is its own negative
yep I know
in the field of 2 elements
anyway, the field of 2 elements is just what you get when you take the additive group $\bZ/2\bZ$ and define multiplication on it the ``obvious" way
Namington:
ie 1*1 = 1, 0*x = 0
Ah
I'm currently finishing up with chapter 3 (real vector spaces)
I've left some 3 sections out of 10 in the group theory part (chapter 2)
but I've just had a lot of trouble understanding them I just decided to go to the next chapter and go back
but now I don't feel like going back
:"3
anyways
Thanks A Waxwing Slain :3 !!!!!!!!!
what text are u using if i maay ask
Algebra by Artin
ty\
np :3
what's an intuitive explanation of characters?
I guess what I'm asking is - what are characters used for? What information do they encode?
considering characters from a group to the multiplicative group of a field gives us an abelian group of morphisms
in other words, we can study the properties of the multiplicative group of a field by looking at a regular old group and considering relations by characters
squint hard enough and you get statements about, say, galois theory, although usually the other direction (as in using galois theory to discuss characters) is more fruitful
the abelian groups of order 100 are Z_2 x Z_2 x Z_2 x Z_2 or Z_2xZ_2 x Z_4 or Z_4 x Z_4 ( up to isomoprhism )
is that right boys?
and is there something like an online thing that would classify groups ?
so i could check?
Um those groups have order 16 and there are P(4)=5 such groups (you missed Z_16 and Z_8 x Z_2)
oh fuck
well
Z_16 has order 16
why isnt it 100 then"?
stupid question
they are non isomoprhic?
I'm also not sure where 16 is coming from here. 100 = 2^2 * 5^2
so you should be looknig for groups of order 2^2 and groups of order 5^2
so yes what
There are P(2)^2=4 such groups
arent there 2 partitions of 2
so there are (2)(2) abelian groups of order 100 ?
im sorry im bad
Yep
You’re decomposing into groups of prime power order
Like writing 100 as the product of prime powers
lmao
i thought i was finding the abelian groups
themselves
damn how can i be doing somethign withotu even understandingf what im doing lmaao
Well you find the orders of the cyclic groups and then take direct products
can you tel lme how do you get Z_16
what i did was this
G is isomorphic to A_1 x A_2 where |A_1| = 2^2 , |A_2|=5^2 and A_1 is isomorphic to Z_2^a_1 x Z_2^a_2 x ..... x Z_2^a_n where a_1+a_2+....a_n = 2
so there are two possibilities for the a
a's
a=2
or 1+1
so i get Z_2 x Z_2 or Z_4
the same for A_2
thats what i did
Yes
hwo do you get Z_16
you were the one who got Z_16
plot twist?
no?
he abelian groups of order 100 are Z_2 x Z_2 x Z_2 x Z_2 or Z_2xZ_2 x Z_4 or Z_4 x Z_4 ( up to isomoprhism )
where
You would have the product of cardinalities equal to 16
ok, you were the one who got 16
This corresponds to partitions of 4
16 is irrelevant here
Z_16 is the {4} partition
write out the abelian groups of order 100 and we'll tell you
the abelian groups of order 100 are Z_2 x Z_2 x Z_2 x Z_2 or Z_2xZ_2 x Z_4 or Z_4 x Z_4
For 100, the groups are Z_25 x Z_4, Z_5 x Z_5 x Z_4, Z_25 x Z_2 x Z_2, and Z_5 x Z_5 x Z_2 x Z_2 up to isomorphism
how did you get these
wait first I want to know how you got the ones that you listed
so that we can correct the mistake
G is isomorphic to A_1 x A_2 where |A_1| = 2^2 , |A_2|=5^2 and A_1 is isomorphic to Z_2^a_1 x Z_2^a_2 x ..... x Z_2^a_n where a_1+a_2+....a_n = 2
so there are two possibilities for the a
a's
a=2
or 1+1
so i get Z_2 x Z_2 or Z_4
yes great
my bad boys
i was too happy saying the yare same cuz they had same power
but no its Z_5^a_1
Just notice that these {1,1} and {2} options are allowed for each prime.
boys boys im sorry
tysm
so im finding abelian groups
by decomposing them into cyclic groups
by using fundamental theorem
We know
I'd say first you are decomposing them into their "prime" pieces
A_2 is ismoprhic to Z_5^a_1 x Z_5^a_2 x... Z_5^a_n
we have either A_2 IS ISMORHPC to Z_5 x Z_5 or Z_25
Prime pieces are allowed by Chinese Remainder Theorem
yeah we went over that earlier
cool
i got it now
okay here is the ifnal part
going from invariant factors to elementary divisors
suppose G is isomorphic to Z_2 x Z_2 x Z_25
what type of G is it?
(2,2,25)?
oh
ok yes
let me show u this
to get the elementary divisors, basically just pick the largest part of each prime piece
and work your way down
we already have the elementary divisors
yea
thats what i usued
the second 'theorem'
now the elementary divisors are 2 4 5 25
right?
NO WAIT
I mean not all of them at once
suppose G is isomorphic to Z_2 x Z_2 x Z_25
each group of order 100 has different elementary divisors
ok yep let's take that one
divisors here are 2,2 ,and 25
ye
5*
fuck it im using definitions
yea ur right
yea ayea
divisors are the a_is here
so idfc about intuition
okay so now
how can i find the invaraint factors
cuz thats like half the section
the primes that show up are 2 and 5
the largest divisor for 2 is, well, 2
and the largest for 5 is 25
so let's take 2*25
=50
we started with 2,2,25 and we took out 2 and 5
so we're just left with 2
and that's it
2 and 50
ohh
Or Z_2 x Z_50
😓
are you seriously asking that?
okay 1 sec
gcd(2,25)?
fucking internet
