#groups-rings-fields
1 messages ¡ Page 117 of 1
ah too bad that's on the next page đ
fun fact a ufd is characterized by that theorem
wait you mean <a> = <dr> right
so since <rd> is an ideal you can multiply it by the inverse of r
yes sorry
and get that <rd> = <d>
so they're the same
yeah I meant trivially to see it you have that every element of <rd> is of the form rdx for x in R
But since r^-1 <rd> = <rd> we can see that r^-1<rd> = <d> hence <d> = <rd>
ah ok got it thx!!
this might be a stupid idea, but could we possibly consider G/H U G/K where H is the normal subgroup in G of order 5 and K is the normal subgroup in G of order 3? if we can show that they're intersection is trivial then we can perhaps consider a canonical homomorphism of some sort, don't know if this goes anywhere though (will work on it in the meantime)(
Not really sure what that union would mean when you're quotienting out by different things
yeah and i suppose the union is not always a subgroup as well
i guess i can just consider HK lmfao and just show that their intersection is trivial
don't know why the hint is asking me to quotient shit out
In fact union of subgroups is a subgroup iff one contains the other
This would work, but note that it only works because H,K are normal, therefore HK is a subgroup (it's a sufficient condition that one of the subgroups be normal)
Hm what happens if we allow bigger unions
I mean tbf it is possible then I think
yes but any subgroup of order 30 contains a normal subgroup of order 5 and a normal subgroup of order 3
Lol
But uh
Just union over all proper subgroups of a finite group
You're not guaranteed oth a subgroup of order 3 and order 5
Or
Not and
Reread
wait thatâs so messed up
This is for 2 subgroups ofc
It makes sense, unions are set theoretic, they don't preserve any structure
If you allow for 3 subgroups there's nontrivial examples where the union is again a subgroup
Which imo is more fucked up
Ah interesting
Oh that puts me at peace then
There's actually a classification for it
Yeah first thing that came to mind was Z/2 z Z/2Z and the three subgroups of order 2
But that is trivial enough lol
you're joking
what is it then?
A group is the union of 3 proper subgroups iff it has klein group as a quotient
Oh lmao
Nice
that's actually amazing
Which makes it the prototypical example in a sense
hahaha good observation potato
Hm
There's further results for 4,5,6 subgroups
Where the klein 4 group is replaced by some finite set of subgroups
This is so funny
Oh wait
seems like something appropriate for the american math monthly
I think I know how to do
No group is the union of 7 proper subgroups
how much do you wanna bet
Do you have a paper that worked this out, Shin?
that I donât find one
I'd love to see it
It's all in the mse thread
nvm this is not true in general but we certainly do know that G either has a normal subgroup of order 5 or a normal subgroup of order 3
Boop @coral spindle
so still works
They provided references and an overview that was published in american math monthly
But you're not guaranteed both a subgroup of order 3 and a subgroup of order 5
So you can't always generate one of order 15 by multiplying them
nah you are by the first sylow theorem, if p is a prime and p divides 30 then there's a subgroup of order p
unless im reading smt wrong
Sorry, I forgot the word normal silly me, but you're right, as long as one of them is normal it still works
I made an oppsie
No problem
Ftr I think they wanted you to use correspondence theorem
But that's just a roundabout way of saying the same thing
correspondence theorem?
well i looked in the answers and my intuition was somewhat right, they just used some canonical homomorphisms i believe
The correspondence between subgroups of the quotient group and subgroups and subgroups containing the normal subgroups
weird how they teach that for rings so often but not groups
Huh, I learned that in my first classes on groups and rings
We did it in rings and used it in groups without properly acknowledging it lol
I think it must be taught in some form for Jordan-HĂślder right?
Or composition series more generally
we did neither
In my gt course (very same one I am TAing rn) we teach it explicitly
We don't do jordan hoelder tho, but we do mention it
Good to hear
Because your prof skipped a bunch of stuff to squeeze in Galois theory
Wait, Galois theory, without Jordan Holder?
Why do you need Jordan Holder to do Galois theory?
I guess it'd be helpful to understand solvability of groups a bit better
Yeah I guess that'd be it
Well solvability is the existence of one series anyway
Ah true
Hm
Still not necessary tho
Cause we know subgroup of solvable group is solvable etc
So as soon as you reach an obstruction cresting a tower or smth we know it ain't solvable
True
Any help here?
think of examples of finite cardinality Z_2[X]-modules and see what they have in common
if i give more of a hint it pretty much gives it away
I know it is something like the number of elements of a Z_2[x]-module needs to have 2^n elements because of the characteristic but I don't know how to explain why
Or is it what i wrote correct?
you can formalize this by saying Z_2[x]-modules are automatically Z_2-modules, which are vector spaces and therefore easy
this is an example of "restriction of scalars"
Ok, thank you !
no problem. you can actually think of k[x]-modules as vector spaces over k with a linear operator given by the action of x
Hi. Any idea how to show that factor-ring of a finite ring with unity is finite?
R -> R/N is surjective
Because you have a canonical morphism R -> R/N which is surjective
Thanks!
This morphism is probably the most important tool to study factor rings
how is that possible
Why is that discussionâs greatest moment
Hey, won't any subring containing F be the whole ring?
Oh wait... the subring doesn't have to be an ideal right...
đ§ âď¸
I'm having a brain fart, how does $U_1\oplus\cdots\oplus U_n=V_1\oplus\cdots\oplus V_n$ and $U_i\subset V_i$ imply $U_i=V_i$?
leave_no_norm
See the discussion below. The klein 4-group is an example
just think of the natural map
Does this work or am I wildly overcomplicating things:
Take $U'i=\bigoplus{j\neq i}U_i$, likewise with $V'_i$, let $M$ be the full module, then $U'_i\subset V'_i$ and the surjective map $M\to M/V'_i\cong V_i$ factors through to the surjective $U_i\cong M/U'_i\to V_i$, so there is a submodule $W_i\subset U_i$ such that $U_i/W_i\cong V_i$ and $V_i/U_i\cong\frac{V_i/W_i}{U_i/W_i}\cong0$, so $V_i=U_i$.
what does full module mean
the full direct sum, U_i and V_i are submodules of some fixed module.
leave_no_norm
Sorry misread lol
This is an internal direct sum
Oh lol
You have a direct sum and you make any of its terms strictly larger, what happens?
I think any submodules
just some submodules of a fixed module M
I inferred that it's internal because of the inclusion U_i â V_i
yeah, i guess i am wildly overcomplicating things
Otherwise idk what that would mean
you are correct, yes
Write it as a unique R-linear combination of elements of the U_i

And then you'll see
Well actually better than that lol like just straight up intersect both sides with V_i right
You're basically proving this 
Ok no
I initially was worried about like
Answering this
Hug

what are those
Lorenz's Algebra II
he has a chapter on those
Oh that was a serious question as well lol
but i haven't read it
Inch resting
Bourbaki Algebra chapter 8
Only in French

The Bourbaki ref is mainly a meme
Yea
Only up to chapter 7 is in English
Or was it in comm alg
I think itâs in comm alg
Chapter IX?
I forgot lmfao
But either way, it isnât in one thatâs been translated
Iâm a genius
Iâm a genius
Oh lmao
This page also links it, hot
Actually how advanced are the prereqs yikes I might need to backtrack more lol but I will see how stuff goes
Thank you CHMONKEY
Glomed
borger đ
lmfaao
what's that about, i'm unfamiliar with server lore
Eisenbud ch. 7 and Serre - Local fields
question because I'm dumb: how would I prove that function composition associates? I know it intuitively, it's because the embedding of one function into another can basically act as a placeholder to be expanded on at any time, but idk what the formalization would look like
OH I can just do a function map diagram, right?
Just show theyâre equal
((fâ˘g)â˘h)(x) = (fâ˘g)(h(x)) = f(g(h(x)))
All equalities by definition
Do the same for fâ˘(gâ˘h) and you end up with f(g(h(x)))
So (fâ˘g)â˘h = fâ˘(gâ˘h) by definition of equality for functions
two functions are equal if they take on the same value everywhere on their domain
I think I figured it out, both have the same domains and codomains, and I can demonstrate a mapping from x to f(g(h(x))) using a mapping diagram showing how both end in the same place.
I remember helping you translate this i think 
A little haha
Hi guys! The set of nilpotent elements of a commutative ring is an ideal, is this real for non-commutative rings?
I donât think so
Think of 2x2 matrices over Z
i was trying to see if a could find a necessary condition and then prove that not every non-commutative ring satisfies it.
sorry for my english
uwu
With x being 0,1
0,0 y being 0,0
1,0 these are nilpotent but their sum isnât
Thank you!
Youâre very welcome!
Let $K = \mathbb F_p(t)$. Any hints on how to show the Artin-Schreier polynomial $f:= X^p - X - t\in K[x]$ isn't solvable by radicals? I know that the splitting field of $K$ is generated just by any root $\alpha$, since the roots are $\alpha,\alpha+1,\dots,\alpha+ (p-1)$, and that $\mathrm{Gal}(K(\alpha)/K) \simeq \mathbb Z/p$ correspondingly, but I can't find any obvious obstructions to $\alpha$ somehow lying in some bigger radical extension
potato
isnt going through the dual rep unnecessary here to show representations are completely reducible? We only have to show this for $r=1$ since it's easy to split $V$ into representations of each matrix algebra, and in this case, we have an intertwiner $\phi:A\oplus ... \oplus A \to V$ given by $\phi(a_1,...,a_n)=a_1v_1+...+a_nv_n$ for ${v_1,...,v_n}$ a basis of $V$, and so its kernel is a subrepresentation, giving us $V\cong A^{\oplus n}/ \ker{\phi}$ as an $A$-representation, and this is $W^{\oplus mn}/W^{\oplus r} \cong W^{\oplus mn-r}$ where $W$ is the unique irreducible representation of $A$
seems like it's about the same idea as what they do but without having to worry about the dual representation
đittle âarwhal â
this is basically just repeating the argument of "free modules over semisimple rings are semisimple, and thus all modules being quotients of free modules they are also semisimple"
oh i guess you can even make things easier by explicitly decomposing representations of A as direct sums of the actions of elementary matrices
Funny, I was about to post a question on a related topic.
what is the splitting field of the polynomial x^7 + 1 over F_2 ?
x^7+1 = (x+1)(x^6+x^5+x^4+x^3+x^2+x+1) where (x^6+x^5+x^4+x^3+x^2+x+1) has no roots but it can be written as (x^3+x+1)(x^3+x^2+1), when i calculate the splitting field, do i need to take in consideration the (x+1) as well? Would it be F_8 or F_64?
x^7 + 1 doesn't factor like that
it's x^7+1 = (x+1)(1-x+x^2-x^3+x^4-x^5+x^6)
What's the difference lol, it's over F_2
oh lmao
Yep, its F_2
ok I didn't catch that 
(you don't consider x+1 since it has a root in F_2)
I think those two polynomials generated the same splitting field so it's F_8 but lemme think abt it
I remember seeing it in D&F but I'll look into it
Actually nvm, what am I talking about.
You're right.
Adjoining a root of either produces a primitive 7th root of unity and so x^7-1 splits
ye that's the idea iirc
If you know what a primitive root of unity is, the right answer is F_8.
If you adjoin a root of either cubic, you get an element \zeta\neq1 that satisfies x^7-1, therefore its order in the multiplicative group is 7, so you get 7 distinct roots 1,\zeta,\zeta^2,\dots,\zeta^6 of x^7+1 and x^7+1 splits.
In case you need the argumentation.
why must field theory be so fucked sometimes 
Au contraire, I think it's very neat and logical.
hey this is beautiful to my eyes
category looks fucked to me
yeah because the category of fields is fucked
đ¤
I don't need the argumentation thank you, i'm allowed to use something that says F_p^n * F_n^m is F_n^s where s = lcm[m,n]
but i wasn't sure about the (x+1)
Thank you again
leave_no_norm
If I want to reduce the proof of $M_{n_1}(D_1)\times\cdots\times M_{n_k}(D_k)\cong M_{m_1}(E_1)\times\cdots\times M_{m_l}(E_l)\implies n_i=m_i,D_i\cong E_i$ to the case of 1 factor, can I argue like this: the factors are the unique (non-zero two-sided) ideals of either ring, so the isomorphism induces a bijective additive and multiplicative map between them (perhaps after a permutation), which is unital, since the identity of either ring is the sum of identities of the factors, so we get $M_{n_i}(D_i)\cong M_{m_i}(E_i)$.
leave_no_norm
How do I delete this, the react isn't doing anything
I am in pain
disclaimer: everything I know of abstract algebra is 100% self-taught (mostly from Wikipedia), limited primarily to finite groups and sets (primarily GF(2^n)) , stemming from their relationships to my work as a software engineer in error detection/correction, random number generation, and public/private key cryptography
(snipped: my end goal. let me know if you want to hear that)
My current journey of discovery has me trying to understand what the algebraic closure of a (prime) finite field looks like.
The only concrete thing I can find is a line on Wikipedia that says "For a finite field of prime power order q, the algebraic closure is a countably infinite field that contains a copy of the field of order q^n for each positive integer n (and is in fact the union of these copies)."
What's the effective difference betweeen the algebraic closure of, say, F_2, versus the positive integers? Where can I find something that will help me understand the finer details here?
Well so the positive integers donât form a group (or even a monoid) under addition
whereas the algebraic closure of F_2 is a field
sorry, nonnegative integers
Equipped with an abelian group under addition and its multiplicative structure gives it a field structure
Well even the non/negative integers
They form a monoid under addition
Another example is the characteristics here
okay, not a group b/c no additive inverse
For any element in the algebraic closure of F_2
If you add the same element to itself, it is 0
do you know what an algebraic field extension is?
I do not understand what an algebraic field extension is. That's one of the things I'm having lots of trouble with
As sets there is nothing to distinguish them, since they're both of "same size", but it's not just about that, is it.
we write that as L/K
K is contained in L
and both of them are fields
an algebraic field extension is a field extension L/K such that every element in L is the root of some polynomial with coefficients in K
example: C/R where C are the complex numbers and R are the real numbers is an algebraic field extension
so that means that all non-constant polynomials with coefficients in R [and integer exponents?] have roots in C, right?
not quite
oh
every element in C is a root of some polynomial in R
OH but not all polynomials necessarily have all of their roots in C?
they do in this case
yes, not necessarily, but it turns out that's also true
we can now define what an algebraic closure of a field is
but no in general
and if they do then C is an algebraic closure?
Yes
yes!
okay, that part I can grasp
What I'm having trouble with is "extending" that concept, if you will, to finite fields
an algebraic closure of a finite field is a field that contains every possible root to every possible polynomial with coefficients in that finite field
we call a field L algebraically closed if it fulfills one of the following, equivalent properties:
a) every non constant polynomial in L has a root in L
b) there are no algebraic extensions of L
replace "finite field" with "R" if you want:
"an algebraic closure of R is a field that contains every possible root to every possible polynomial with coefficients in R"
the algebraic closure (n.b. simplifying here) of a field K is the smallest field above K, let's call it L, such that the extension (L/K) is algebraic and the L is algebraically closed
I'm almost there. If a polynomial p of degree k is irreducible in GF(2^k), then it doesn't have roots, which (if k>1) means that GF(2^k) is not algebraically closed, right?
if the degree is > 1 then yes I think so
yes, finite fields are never algebraically closed
I'm really good at GF(2^k) b/c of LFSRs and CRCs
replace GF(2^k) with whatever finite field you wish
but the union of all fields of prime powers of 2: F_2, F_2^2, F_2^3, ... is an algebraic closure?
as you can see, this polynomial has no root in GF(2^k)
=> GF(2^k) is not algebraically closed
the union of two fields is almost never a field
I can't even think of a way to meaningfully define the union of two fields without a bigger field containing both
yeah but this is the union of an infinite number of fields
okay, sounds like you're just as confused by this definition I found as I am
You take the âunionâ
You can make sense of the Union inside the algebraic closure
But when you donât a priori have it, you can define it as a colimit
told you the category of fields was fucked
Or you can do some annoying trick with adjoining variables for each irr poly and mod out
Do this over all n, take a colimit
you guys are going a little too fast for me here
This is an algebraically closed field containing your thing
chmonkey my friend we're talking to a software engineer
no offense, stevie
Iâm describing how you form algebraic closures in general
oop I forgor
You can define the algebraic closure of finite fields âeasilyâ
like I said: I'm self-taught, and my focus has been on stuff I needed to understand to do my job, so I'm missing a lot of seemingly-irrelevant (to me) supporting knowledge
this all got messy when I got into non-binary prime fields
Then assume the field exists
I don't even have a mental model of what F_4 looks like
prime fields are easy cuz I can just do regular arithmetic and take the modulus
Just assume it exists for some abstract reason
Once you do this you can think of it as the Union of all finite fields
ah, but I'm an engineer and I'm trying to do engineering, so I need stuff that not only exists, but is constructible
ok here's a fun fact, F_4 is GF(4)
I donât know why you need F_p-bar at all then, and I have no idea then
since you probably don't care too much about proofs (like me) I'll just let you know that all finite fields of the same size are isomorphic
I think of finite fields as just formally adjoining a root of a funny polynomial to F_p
right, but what is GF(4)?
GF(2) is {0,1}
GF(3) is {0,1,2}
GF(2) doesn't seem like {0,1,2,3} cuz 2*2=0
And it satisfies some relation like a^p^n = a
you're right, it's not Z/4Z
it's a different structure
I'd prefer to think of it as {0, 1, x, 1+x} where 2 times anything is 1
I'm trying to understand Schoof's algorithm, which seems to involve finding the roots of x^3 - y^2 + ax + b for some constants a,b and x,y in F_p
which involves the Frobenius transform of the algebraic closure of F_p
I have nothing helpful to say because this isnât the sort of thing I ever deal with so Iâll just have to tap out, sorry
Iâve got no idea how to constructively describe these things ÂŻ_(ă)_/ÂŻ
if that was supposed to say "2 times anything is 0" then I 100% get it, cuz I thought GF(2^k) has characteristic 2
characteristic 2 means that 1+1=0 right?
if anything non-zero multiples to get zero you definitely do not have a field
fuck nm you're right 
Wew yeah, what the ruck
or are you
I don't know if I'm right that GF(p^k) has characteristic p
you are
I got confused swapping between the two definitions give me a break
hah! the score is now Stevie-O 1, people who know what they are talking about |Z|
I do NOT know what I'm talking about that is a grave error to make
anyway if you tell me that GF(2^k) is the polynomials of degree k-1 or less
or at least is isomorphic the set of those polynomials
then I think I get it
they're isomorphic as sets sure, even as F_2 vector spaces
do you know what a quotient is
I don't understand vector spaces (they've never been relevant to my work)
and I only know "quotient" as the value q such that a = qb + r
pls learn about vector spaces before doing fields stuffs if u wanna make more prorgess
Yeah
If youâre doing anything remotely needing math, especially if itâs applied, linear algebra will be very helpful
Pls someone help me with this solvaility by radicals q bleak
Itâs by far the most useful branch of math
Idk if it's like actually easy or smth
linear algebra is the only math with applications
what lol
This might be a based opinion
All math which has applications ultimately reduce to linear algebra
Thatâs certainly provocative
calculus is trying to turn analysis into linear algebra

i'm mostly joking
can you express dynamic programming problems in linear algebra
Doesn't that make your polynomial solvable by radicals?
(in this definition)
"assuming the necessary assumptions ..."
Idk man, maybe that's the appropriate definition in char p, wouldn't know it.
It is defined like that to get rid of situations like this extension I think aha
I am sullying you for the first sentence, not the content of the second sentence
likewise
yeah it's senseful but I don't think it helps
I'm sullying because other people did it and I want to feel involved
can someone give me two examples of Z[i]-modules with 20 elements?
Have you tried looking for one on your own?
I don't actually know how to find one
OK, do you know any finite Z[i]-modules?
what's the easiest example of a Z[i]-module
Hint: maybe take quotients by ideals
This theorem is mostly for characteristic 0
That's the point of this exercise
To show how it breaks in char p
yes field of rational functions
wait non char 0 fields exist? Lmao
very unbased
based on my current reading,
- modules are like vector spaces
- vector spaces are basically groups that have an operator that is associative+commutative , an identity, an inverse for all elements, and the concept of (from my perspective) basically exponentiation
am I reading this right?
You can always show that the quotiehnt of Z[i] for any non-zero ideal is finite
not exponentiation at all
You can get a good estimate on the cardinality as well
yes modules are like vector spaces but over a ring, meaning that you can't define by scalars
X is like Y except with lots of other things lol
I wouldn't agree with 2., but 1. is fine.
so Q(x) is the field of rational rational functions
if I had one penny for every time I used this in alg nt I would be rich
note that when I envision groups I envision multiplicative group of integers modulo n
that's not what other people seem to envision, but it's how I see it
Oh well that's not a good way of envisioning groups
if you gave all the elements sapience it would become the field of rational rational rational functions
those are the most basic groups possible so that's really not a good mental model
Not even a good way of envisioning Abelian groups
It's a very useful way of envisioning if most of your math is done modulo 2^(8k)
that's not even necessarily a group
Riiiiiiiiiiiiight
it's a useful way to visualise... the multiplicative group of Z/nZ... lol
zero divisors..... shudder
Anyway, the most helpful way I know of thinking about vector spaces is frankly just imagining R^3 as a space and then saying the dimension/field 50 times over.
Eventually you don't have to think about problems re: dimension or field change because you know the formalism well.
It's not generally a great idea to get hung up on how to conceptualise a structure; rather start working with them and you will build intuition after reflection.
i visualise groups as these funny collections of people with social connections
also the Galois group of polynomials with coefficients in F_2 modulo an irreducible polynomial of some degree k
oh wait wrong group
that's a graph
computing the the transitive closure of those groups is a pain
kevin bacon
gevin pacon đ
it was a joke you missed the joke
some might say a perfect graph
Kevin Bacon \in S
not as perfect as the epic people reading this 
We did it reddit
when the voicing moves đłđłđłđł
thank you kind stranger
You won the internet today
i had a cupcake today does this mean it's my cake day
I don't know where you are
wait
so if a module is a generalization of a vector space where the scalars come from a ring rather than a field
and all fields are rings
then all vector spaces are modules, right?
Yes
if you send your current place of residence, mother's maiden name, and the name of your first pet, I'll share next time
would u also like my credit card numbers
you also need the name of the street they grew up on
My credit card number is 5 (mod 10)
expiration month and year
hey @coral spindle we are friends right? c-can you gwive me ywour s-social sewurity number uwu~?
OK so if you're a troll please don't look. Thanks everyone. My current address is 10 Downing Street, London SW1A 2AA.
I am sending you a postcard with further instructions
no it's not a flat it's a house
I hope I get mail back
wew and i are literally English
my deepest condolences
well wew pretends to be english
Oh nice I always assume other people here are yanks
But I am indeed british
Anyway, I guess I can say something about modules
okay, kids!, we're gonna have some fun today!
- take your credit card number and treat it as an integer
- multiply it by 100 and add the expiration month
- multiply by 100 and add the expiration year mod 100
- multiply by 1000 and add the three digits on the back
- take it to the 65537th power
- divide by 1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139 and take the remainder
- DM me the answer
comically loud gulp
hey if you wanna say something about modules then you should definitely answer my question #advanced-number-theory message
D:
You can broadly think of modules as abelian groups that have some structure imposed upon them by the ring
This is very broad though
i know wew is a fed in disguise
THe ring can have very diverse structure
p-adic modules or as I like to call them, graded modules
this is incorrect
but I like to call them that
Bruh idk
WIsh I knew more about the p-adics that would be helpful
in the case of the integers that's no restrictions
Yar
har har
I, personally, think of modules as a highly complex abstract concept that I won't need to know or care about unless and until someone invents an error-detection/correction algorithm, random number generator, or public-private key algorithm based on them
I'd unironically just think about modules over the p-adics like, categorically
there's no point in actually thinking about them
so just throw diagrams at it
You will literally never believe what I'm gonna say next
Linear codes.
They're vector spaces. I.e., modules.
I know of this one result that like uh
ur entire PC operates on a finite ring nerd
every abelian group has a unique Z_p structure
I'm pretty sure I said something earlier about everything being 2^(8k)
I mean to study Elliptic curves, you need to be good at modules
Not sure about that.
yes, that was the RSA-100 challenge. it was factored in 1991
hmmmmm
so it must be true
In the first place it needs things like 3-divisibility in Z_2 for example
the user has 17.1k rep
And you probably want continuity conditions
ok what's the structure of C_2 over Z_3
But I can believe after you've added that that there is at most one Z_p-structure
consider (2,0,0,...)
what does "structure over" even mean here
are we taking p-adic reps or what
C_2 as a Z_3 module
I refuse to think about this
protip it ISN'T, BICHES. SUCK IT
C2 as in the cyclice group of order 2?
it's too hot to think about it
how does that follow
U forgor đ to say
I forgor 
.... LOL?
I mean any finite dimensional Z_3 vector space
has to have cardinality divisible by 3 right
Well let C_2 = <g>. What should 1/2 . g be? It cannot be g^0 or g, since g^2 = g^0
(except for 0)
Z_3 is not a field
thanks for doing my thinking for me boytjie it's much appreciated
Sowwy wew
the 3-adics
if you want me to shut my whore mouth I can do so
no, I was being sincere
the notation was confusing lol
finitely generated moderatorule
Oh right, sorry, yeah the notation sucks
it was basically exactly what I thought it would happen
yeah we should just write $\mathcal O_{\bQ_p}$ for less confusion
oh my golly gosh what happens if you consider le whoilesome divisible group as a p-adic module oh my goodness gracious
$\bQ_3$
Lol
ScarletScorch
maybe $\hat \bZ_p$
Boytjie (never-to-be-glomed)
I think that's decent notation
then profinite completion of the integers would be $\hat \bZ_\infty$?
wait if Z_3 isn't Z/3Z what is it
Ye
to find out more, watch the video from veritussy, YouTube's most trusted mathematics commentator
The 3-adic integers
p-adic integers
ok tbh seeing that the p-adics are a lattice in Q_p isn't really thinking
that sounds like some pohlig-hellman stuff
what constructions of R do you know?
every abelian group is a zoinkers module
uh no?
every non aphromic group can be realized as an l adic prĂźfer rep
I am agnostic to the axiom choice and Zorn's lemma and thus don't trust that there is a valid construction of R


That's nice do I care tho
constructing R doesn't require the axiom of choice
dedekind then
you chose the wrong one
take the algebraic closure of Q and then examine the largest proper subfield
I think
look any axiom that results in banach-tarski is amongus-levels of sus in my books
I am not very knowledgeable on this stuff
đŤ
that's what I feel like all the time
But Stevie, I think you are maybe not concerned with constructive math, but with computable math
this is true
I'm a software engineer. the only fields we get to work with are finite ones
actually I mostly work with using polynomials with coefficients in F_2, modulo an irreducible
oh so you do know what a quotient ring is
if I'm doing anything outside basic arithmetic mod 2^32 or 2^64
I might know what a quotient ring is, but not by that name
you're quotienting F_2[x] here
"modulo" <-> "quotient"
which is how you formally define a field extenstion
F_2 modulo an irreducible is a finite field extension, e.g. if poly has deg d, extension of F_2 of deg d
yeah I do that a lot
I use the irreducible polys as seeds for PRNGs to produce long sequences of unique values
I do not like wireless technology
maybe? I just wanted sequences with linearity less than the absolute trivial of 1,2,3,4,5
a common one is degree 33
I use x^37 as a generator, and while I'm sure the NSA could reverse it, a casual observer would not be able to infer much from nearby outputs
wahh whah whahwahhwah WAHHHH
hold on, I'm processing that, eggman
yeah, it's even true for an arbitrary field
multiplication of vectors
So wait, what's the difference (beyond homomorphism or isomorphism or remorphism or whatever) between the vectors in this d-dimensional vector space over F_2, and the polynomials in the (polymial ring? what's the name for that set of polynomials?)
none
but you can multiply polynomials
in fact I do. that's how I do all my stuff with them.
if we include that operation it's an algebra, which is a vector space where you can multiply stuff in a nice way
but we don't have to
I still don't know the answer, i think i will say something very stupid but is Z[i]/(4+2i) good?
to generate the k'th poly, I take the polynomial x and multiply it by itself 37k times
I think you really have to understand what a vector space is to understand what they said
is it that, if you're defining it as a vector space, you don't get to do poly multiplication?
like, it's possible to define a second operator * with uv = vu and (uv)w = u(vw) and an identity for that operator
but you're just not using that?
Well that's certainly a finite Z[i]-module. I can't tell at a glance if it has 20 elements or not, but if you can write all 20 down then sure
if you want me to be specific: the SET F[x] together with scalar multiplication from F and addition is a F-vector space
the same SET but with just polynomial addition is a group
Precisely
okay, so it is what I was understanding
you're taking the (ring? is it a ring? I don't think it's a field) of polynomials of degree less than d and coefficients of F_2
and you can define + as the "usual" polynomial addition, except everything is mod 2
and you can define * as the "usual" polynomial multiplication, except everything is mod (some irreducible poly)
but you don't define * and you just leave it with + and say "ok this is my vector space"
well, yeah but we've only talked about modulo irreducibles so far
Can you give me another example or another hint? Is there a way to count them without writing them?
we're taking the set, but yes
and you still need multiplication by elements in F
Well perhaps you have seen this if you are doing this question as part of algebraic number theory: the cardinality of Z[i]/(4+2i) is |N(4+2i)| = |(4+2i)(4-2i)| = 20.
Someone can correct me here if I'm getting this wrong
Oh wait I calculated wrong
here lemme do something fancy for you stevie
There, fixed
Yes, i was thinking about that when i came up with the example
Well that's an excellent approach.
But i don't know how to find another one
okay here's a question, purely for my own edification:
you can take the set of polynomials of degree d and coefficients in F_2
and add the mod-2 '+' operator
and you get a vector space
what if you take the set
and add the mod-a-polynomial '*' operator instead
is that a vector space?
- associative: a(bc) = (ab)c
- commutative: ab = ba
- identity: "0" is the constant polynomial 1
- I don't know if everything has a multiplicative inverse though
- scalar multiplication = exponentiation
- wait is it a module
No
damn
It's not even a group
No, 0 is in there.
Groups can't have an absorptive element unless they are trivial
How might you get something with the same norm as 4+2i, maybe that's not just 4-2i or an associate
There's a really easy one to find
Still no
no inverses
Has almost no inverses
If i change 4+2i with 2+4i, are they isomorphic?
groups don't have to have inverses do they?
I don't actually know. You might have to check
those are fields
Ok i will, thank you
less sure about rings
Let $\mathbb{F}[x]$ be the set of polynomials with coefficients in $\mathbb{F}$. And let $+$ be polynomial addition, $\times_{\mathbb{F}}$ be scalar multiplication by elements in $\mathbb{F}$ and $\times$ be polynomial multiplication
then:
\begin{enumerate}
\item{$(\mathbb{F}[x], +)$ is a \emph{group}}
\item{$(\mathbb{F}[x], +, \times)$ is a \emph{ring}}
\item{$(\mathbb{F}[x], +, \times_{\mathbb{F}})$ is a vector space}
\end{enumerate}
and with all 3 it's an algebra
Yes, they do. They must have inverses. That is part of the definition of a group
wew lads or something
this shows a fundemental gap in your knowledge
Bro idk just read the wikipedia article on groups, it's not hard to find this out
don't they literally call it the multiplicative group of integers modulo n
They literally do
yes... because it only has one operation... multiplication
but it's not a group?
It is a group.
but it is
the multiplicative group of integesr mod n is NOT on the set {1, ..., n}
it is on the set of integers coprime to n
(Z/6Z)^{\times} = ({1,5}, *)
(Z/8Z)^{\times} = ({1,3,5,7}, *)
and so on
If you have any ring R, you can look for the elements that have multiplicative inverses, which form the set R^\times. This is then called the group of units of R.
yes they do...
that's part of the definition of a group
right
and if you have the set of nonzero polynomials of degree less than d with coefficients in F_p
and you have an operator * which is "usual" polynomial multiplication, modulo an irreducible polynomial
isn't that a group?
The multiplicative group of integers mod n is (Z/nZ)^\times.
Yes, modulo an irreducible polynomial, excluding 0.
That is in fact the group of units of a field.
okay so that's where we diverged
OK
wait is that where we diverged? I have forgotten lol
Find a book in peace and quiet and get the definition of group, ring, field, then algebra, then possibly module if you don't mind a bit of nuance
I don't mind the nuance, but I do have trouble keeping all the nuances straight
module before algebra, imo
still don't know what a module really is
it's just like a dude
I like algebra because you can say "an algebra is a ring which is simultaneously a vector space"
"this guy" points to letter M
oh btw I should have added vector space in the list
clearly just an algebra over a monad of the form $R\otimes -$ in CRing
ally ⤠(semaluhtounuyulohowwah)
you need therapy
there can be multiple reasons
how will a therapist help me
no more category theory
with the perceived problem beforehand
i will teach my therapist category theory
Guys how can I find second factorisation of 40
ok I think I've gotten all the funny squares in my head to actually believe this now
btw @static yew ignore this it's a joke
I still don't really see it
40 = 4 * 10 
Or maybe you'd prefer 8 * 5
40 = 2*2*2*5
The point is, don't forget about integers
someone ain't reading the paper
if I'm testing out a pohlig attack I care that the prime factors are 2 and 5
sorry not in CRing it's in R-Mod
You know what I can't deny that
uhh it's 3 mod 4 that are irreducible in Z[i]
because they literally wrote the prime factorisation at the top mr smarty pants
Yeah I assumed they'd already found a nasty ass one
okay what the heck is Z[sqrt(-13)]
read a book
Oh sry
,w (a+sqrt(-13)bi)(a-sqrt(-13)bi)
so, the set of all integers, plus the root of the polynomial x^2 = -13 ?
where did you get the extra i from
how and why would that ever be useful to anyone
forgot
I thought you did cryptography lol
you mfs care about weird and wacky rings
even I have limits, man
colimits perhaps
Yet here you are, complaining about it
you will be joining me in therapy
it's bad enough that I have a subset of 2-D vectors in Z/(large prime)Z plus an element named "the point at infinity" that is mathematically "zero"
oh I've got it
wait what's 13 mod 4
wait lemme double check
anyway, so you want a prime factorization of 40 that is not 2*2*2*5 ?
lemme see if I can do this
One of the things listed in đ˘
I can't see one immediately
fuck I was doing Z[sqrt(13)] nooo the wholesome chungus noo
It's probably not going to be a nice difference of squares
At least, I can't see any that are the difference of two squares
yeah sqrt(13) is BIG
It's is but I have to prove that they are not unique factorisation domain so I want do two different factorisation of same elements into irreducible elements
Well I mean that alone isn't hard, right? You can do (1+sqrt(-13))(1 - sqrt(-13)) = 14 = 7 * 2 and 2 is definitely irreducible in Z[sqrt(-13)]
It's not sqr13 its sqr -13
I know
yeah there are way easier ones lol
jsut do this
But the question asks for 40 specifically
@coral spindle it's not 14 it's 40
honestly, I don't see how.
grrrrrrrrrrrrrr
but that doesn't matter in finding if it's a UFD or not
stupid question I'm going to go sulk
Guys can someone explain me what is the order of root of 3 in R ?
Let's say x = sqrt(3). Can you tell me 2x, 3x, 4x â just the first few?
R not R*

Oh right. I did indeed jump the gun.
Fortunately fixable.
Saw (c) not (b).
Could still be a typo, who knows... I love it when people ask questions and then jump off the earth for a few minutes.
Z[sqrt(-13)] is the set of all numbers a + b sqrt(-13) where a,b are integers. it is understood to have a ring structure, i.e. addition/multiplication and units for those (0 and 1), additive inverses, distributivity, associativity, commutative addition. (in the case the multiplication is also commutative, so it's called a commutative ring)
so yeah what stevie said
well not if you don't understand what a generating set is
we want our thing to be closed under the above operations
we're talking to a software engineer
yes, so i'm saying exactly what the elements are
it's not $\mathbb{Z} \cup {\sqrt{-13}}$
196883
it's $\set{f(\sqrt{-13}) | f(x) \in \bZ[x]}$
this does not have 2sqrt(-13) in it
this does
perhaps I should stop assuming things 
nahhhhh
technically $\mathbb{Z} \cup {\sqrt{-13}}$ doesn't have, say, 2 sqrt(-13), or 3 sqrt(-13), or 3187503 sqrt(-13) in it, but Z[sqrt(-13)] does
Stevie-O
Um actually it's the image of the unique map $\phi \colon \bZ[x] \to \bC$ with the property that $\phi(x) = \sqrt{-13}$ nerd underscore face
Boytjie (never-to-be-glomed)
yeah exactly
Um actually it's a Frobenius anthropomorphism with an Ableian Group Project using a modular finite ring polynomial vector space to math at things until you convince someone to give you a grant
Nobody gave me a grant
obviously you didn't use enough buzzwords
I am in crippling student loan debt
Yes sir
yes, a commutative ring in fact
It is a subring of C
yeah
so if it has Z and sqrt(-13) in it
it has to have all integer multiples of sqrt(-13) or it wouldn't be closed under addition
Yes ofc
Exactly!
should've mentioned its connection to (p, q)-adic analysis and thus to the solution of the collatz conjecture...
It's also a dedekind domain!
look this stuff may be obvious to you but it's not obvious to me
And indeed it does contain all such multiples
Here come the NERDS
wait what was 13 mod 4 again
1 you muppet
dedekind domains aren't real
they're like birds
same thing for multiplication, but sqrt(-13)^2 = -13 which is already an integer so you don't have to worry about it. if it was the cube root of -13, then this would be important
Are you doing the indicator thing
Because if youâre doing the indicator thing -13 is 3 mod 4
Which is what you need
what's this about 3 mod 4?
Dw about it itâs nerd shit
NT shit
I'm into nerd shit!
Stevie, you need to get a good book on AA
my proof of the mod 4 thing was like a page lmao
Z[sqrt(-13)] is the ring of integers of the number field Q[sqrt(-13)]
is there a name for the 3 mod 4 thing
I donât think Iâve ever seen the proof nor do I want to
well it is kind of weird a priori so you should see it at least once
Yeah, the indicator tells you if itâs like this or if you need to do something weird
wait i think you have it backwards
oh no i have it backwards
13 isn't -13
idiot
Itâs ok I thought the same too 
you have literally done nothing wrong ever and you're perfec,t rho :thum bsup
I have done nothing ever
Generally if your number field is Q[sqrt{D}] where D is is a squarefree integer, then the ring of integers of this ring is Z[1/2 + sqrt{D}/2] if D = 1 mod 4 and Z[sqrt{D}] if D = 2,3 mod 4
buii 
Yeah thatâs the one
Hate it
Stupid
NOOOO
It's cool
Generalise it to nth roots then I might care
That's actually a good question lol
NT is coooool
There's really no justice on this bitch of a number theory......
I know what you are talking about regarding first impression of "the point and infinity", it can be rigorously formulated but you have to move into projective space. That is not as bad as it sounds. You take y^2 = x^3 + Ax + B, and you homogenize it, now we have Y^2Z = X^3 + AXZ^2 + BZ^3. You allow any points (X:Y:Z) except (0:0:0). In this setup, the point at infinity is the much more tangible (0:1:0)
Oh wait I missed this message
This is just the group on an elliptic curve lol
Perfectly normal
every non-annoying planar cubic with a point is an elliptic curve right
Yeah something like that
you can just move back to F_p x F_p by taking (X:Y:Z) to (X/Z, Y/Z)
In the book I'm using the Wedderburn theorem for simple rings is stated for left-Artinian rings, i.e. a left-Artinian ring is simple if and only if R\cong M_n(D). I assume this holds more generally (two-sided) Artinian rings?
the homogeneous coordinates (X:Y:Z) should be looked at as ratios, so (X:Y:Z) is the same point as (aX:aY:aZ) for nonzero a
Yes
yeah I've read about it but ngl that sounds like a band-aid
"you want to add a point "at infinity"? On a plane? did you fail geometry? In a CAVE? WITH A BOX OF SCRAPS?"
"uhh noo you see it's actually a 2-d simplification of a 3-d projection..., if you look at this"
yes and there's an equivalence relation
projective geometry is actually magic and you should be grateful
Why not state it like that then, lol. It's not like the book shies away in other aspects.
Iâm adding a point at infinity because I CAN and if you want to CRY then leave
Iâve got no clue, do they prove left artinian + simple <=> right artinian?
ngl "point at infinity" doesn't seem any more or less nonsense than Z[i] or Z(t)
actually Z(t) makes my head hurt
imagine saying this: "every distinct pair of lines in the plane intersects at exactly one point, except when they are 'parallel'"
why would you do that
Z(t) is quite natural
look at infinite train tracks! they meet at infinity on the horizon
You should see some of the shit I deal with
I see you one parallel postulate and raise you the surface of a sphere
Hm... I haven't seen that yet, but I suppose they might, seeing how that follows trivially from the theorem.
a few minutes has become 23, btw
well a sphere isn't really a plane
it has curvature: any non-degenerate triangle has angles adding up to more than 180 degrees
best advice Stevie-O is put a few weeks of evenings into a book on abstract algebra, and force yourself to not move completely past too many exercises
there's also a nice axiomatic basis for projective geometry, and you get something cool called projective duality
Yeah itâs not aerodynamic enough
Exam question: "A PE teacher lines the boys up at one end of the gym and and the girls at the other end
every minute, he blows the whistle, and the boys walk half the distance remaining across the room. When do they meet?"
- the physicist says "they never do"
- the mathematician says "in an infinite amount of time"
- the engineer says "technically they never do, but pretty soon they'll be close enough for all practical purposes"
so if you take your plane and add these "limit points" where the train tracks meet on the horizon
you get a line at infinity
boom, projective plane
The physicist spouts some gibberish about SU4(C)
The mathematician says âtrivialâ
And the engineer wonders why theyâre walking so inefficiently
Is this meant to be some kind of invariant ring of D_8?
ur a king, wew
Kind of, itâs the ring of S_4-stable representations of D_8

my point is that the projective plane isn't so contrived, so neither is the point at infinity on an elliptic curve
Thereâs an even worse one in 4 variables later on but I cba to get the paper
grothendieck ring?
get all yer reps
there's addition like (+) and multiplication like (x)
add some inverses
you've got a ring
False
that's the grothendieck ring SHUT
that clears things up đ
Iâm going to give the exact sequence definition in an abelian category because I hate illuminator so much
It just so happens to be what you claimed because every C[G] module is projective
hey that's fine I know some cat theory now
do u know Abelian categories
maybe
Tbh abelian categories are just exact categories in my head
MAYBE AIN'T GREAT
I simply donât care for them in any other context
who up braiding they monoidal categories
YES UNLESS YOU ASK ME TO PROVE SOME WEIRD SHIT
hey I heard monoidal subalgebra recently
yeah I came in here in the first place cuz I'm trying to understand Schoof's algorithm for counting the number of points in an elliptic curve over a prime field
and I'm getting hit with algebraic closures and Frobenius endomorphisms and mathematical notation that makes no sense to me
like:
"the frobenius endomorphism given by $\phi$ satisfies the characteristic equation $\phi^2 - t\phi + q = 0$ except if phi is a mapping how do you square a freaking mapping
Stevie-O
Compile Error! Click the
reaction for more information.
(You may edit your message to recompile.)
$\phi^2$ is defined as $\phi \circ \phi$
Boytjie (never-to-be-glomed)
I'm sorry it's just group theory, and I went to take a bath since I've been reading and exercising all day, I don't think I know anything about what they are talking about, I know they ask me the order of each element, so I wouldn't understand well with advanced topics.
wait so if it's (x, y) -> (x^q, y^q) then the "square" is ( (x^q)^q, (y^q)^q) ?




