#groups-rings-fields
1 messages · Page 118 of 1
okay at least I grasp that part
I still don't understand how you can stuff that into an equation
He's right @static yew, at your present stage you're not gonna learn anything from this channel because 10 different people with 10 different opinions on presentation will bombard you with disconnected pieces of information that won't make any sense to you, so it's better to invest the time in a coherent and didactic exposition.
You can have rings of functions
yesterday I saw one of the most downvoted answers I've ever seen on stack exchange, saidly I flagged it and it was deleted 😦
unless - and + and 0 are Inside the field and not regular integers
it was like a ChatGPT abstract algebra answer
do you guys have a recommendation on such a coherent and didactic exposition?
oh!
Prove that the product is unique up to isomorphism
it's not a fortune
fuck you
it's trivial
trust
Perhaps it will even be zero
prove that 1+1 = 2 up to isomorphism
Yes! It is! So please provide me with a proof
get better material
many university students manage to pay zero dollars for their math textbooks
I'm not a university student
not that we'd ever recommend such a thing ;)
indeed
Since you're interested in fields, i'd recommend Stillwell's "Elements of Algebra", that's what got me first into the subject. It's not a standard fat algebra textbook that goes through the group->rings->fields procession and covers everything under the sun, but it's not like you're a college student taking an algebra course, and it's VERY elementary in its approach (starts all the way with natural numbers and division). It introduces all the relevant players, like group, rings, polynomials and fields, and builds towards the proof of insolvability of the quintic equation.
I NEED my free copy of "Fusion Systems - An Algebraic Approach" Mr. Bobby fusions has left me and taken the kids but that HACK FRAUD DAVID won't GIVE ME HIS BOOK
what zero funding does to a mf
Damn you david.........
$51.90
the one advantage of being employed instead of being a university student: I can actually afford these books
you're probably genx like me
ermmm aktually I'm a post graduate RESEARCHER not a studnet :theflamesofbabalyon:
I know less than most undergrads albeit
but when they have a student discount, what do you say?
but that's besides the point
maybe the library which also contains the first book of the bible has a copy of this book...
the left emoji is :mock2: and the right emoji is :mock1:
This reminds me of that Futurama episode where Fry and Bender enlist to get a 10% military discount on pork chewing gum ("... that is unless war were declared" BWA "what was that?" "war were declared")
lmao
I love futurama
that sounds like exactly what I need
everything I know about the (polynomial ring?) of polynomials with coefficients in F_2 modulo an irreducible, I learned from Wikipedia and then worked out low-degree examples by hand
then I wrote scripts to do the math with higher-degree moduli and tested them against examples I'd worked by hand
it was easy cuz I could use test vectors for CRC calculations to check my work
too bad the new season is only on disney+
it's funny how you use vectors so much but don't know what a vector space is
That one's one of the all-time classic episodes
The key to victory is the element of surprise.... SURPRISE
what LINALG101 for CS does to a mf
they've got a lot of brains, and they've got a lot of... chutzpah
protestant work ethic
I unironically agree with the first three
last week in physics class (10th grade)
how tf did u know I was protestant you FED
our teacher asked us what a vector was
I answered with "an element of a vector space"
because I don't need to use them as vectors, not in the usual sense
once I have a primitive polynomial it's just (x^(e coprime to 2^k-1))^n to generate the nth element
the catholic church has a Discord division now, we're keeping tabs
teacher owned with facts and logic 😂
algechill moment
should this all be moved to #math-discussion or is this a "mods are asleep, post X" situation?
abstract algebra is my channel I rule this domain
nah it's just algechill
anyway guys and gals whom are we sully bombing next?
Like I said, the book is not one of those 700-page bibles that are used for college courses, but given that you lack some of the requisite knowledge (e.g. not knowing \varphi^2=\varphi\circ\varphi and minor stuff like that), I think it might actually be helpful to you. It's the most elementary and "chatty" introduction to the subject that is known to me.
Also it's very short, like 200 pages tops.
guys and Gal(L/K)s
short introduction
200 pages
Artin, a standard reference, is 500+ pages. Others are just as much if not more

I have severe ADHD (one of the reasons I dropped out of college) I ain't gonna be able to stick with a 500 page book no matter how much amphetamine I stuff into my system
ADHD gang
Have you tried cocaine
also the book's margins are pretty narrow as i recall, so 2-3 pages of it correspond to 1 page of a larger book
what do you think adhd medication IS
isn't that bad?
it's what led to the fermat problem being unsolved for centuries
fermat never had a prove and I can prove it
but the character limit of a Discord message restricts me
so true king
fermat didn't have a proof because he didn't know what swagggg was
can only sets with prime-power cardinality be a field?
a finite field, yes
What proof did Fermat THINK he had...
discord max message size = 2000 characters
not a prime power
therefore: discord messages cannot be used to construct a field
do they constitute a vector space
nope
vector spaces over finite fields have to have order p^k
the vector spaces themselves have to have order p^k?
yeah, like the set underneath them
hm
i mean that's the reason why finite fields are also p^k
I'm not an expert, but I think the historical consensus is he had something similar to Lame's faulty proof (who thought Z[\zeta_n] is a UFD for all n until Kummer came along).
cause they're vector spaces over F_p
would make sense
what if Fermat's proof actually disproved the axiom of choice
and Zermelo and Fraenkel went back in time to put him on ice
Fermat was missing ... a lot of thought about number fields
you can't disprove an axiom
sure you can
you need another axiom for it, though
disproved
*disprooven
you can, by working in a system where you assume the negation of it 
differetn system = I donm#t caRE
You quite literally cannot disprove AOC in ZF
The achievements of Kummer in that regard absolutely astound me to no end, more than a lot of other great proofs.
I could do it if I wasn't warm
Fermat's proof:
AXIOM OF INTEGRAL EXPONENTIATION: there are no positive integer solutions to a^n + b^n = c^n for n>2
QED
I am continually astounded by the height of knowledge in the 1800s
How he was able to prove his regularity theorem without the modern algebraic framework (they didn't even have ideals then, Dedekind introduced that later to clean up Kummer's work a little) is truly a marvel.
it was fun
Same, I feel like history of mathematics is a little underappreciated.
Fun Things are Fun! 
as someone who's doing research in an incredibly niche, pure field
people probably got high
"dude, what if--- what if we redefined plus and times?"
"duuuuuuuuuuuuuuuude!"
you don't need a reason other than "WHAT THE FUCK IS GOING ON HERE??? WHAT IS HAPPENING?!??!"
they knew they were on to something
it's weird that a bunch of the theorems about elliptic curves predate the transistor
wait for homotopy type theorists to enter
hold on, lemme just craft a quick isomorphism from N to R
Goedel be damned
I call it the "on-demand isomorphism"
you give me an element of R, one at a time
and I will give you an N that it maps to
no, you can't see the whole thing
I have a piece of paper attesting that it's there though
just like Tether's balance sheet
you give me an element of R one at a time
nice axiom of choice stinky
and people wonder why I distrust AC
@static yew I checked and Stillwell's book unfortunately doesn't have a section on finite fields, which seems to be the motivating factor for you, but everything else I've said about the book holds.
What you could do, if you're REALLY interested in the subject, is reading Lidl/Niederreiter's "Introduction to Finite Fields" after collecting the requisite knowledge.
It's a pretty elementary intro and assumes only the basics of groups, polynomials and fields (which they lay out in the introduction).
I don't think so and I don't think any algebra book does, all of them assume prior acquaintance with linear algebra.
I remember about a couple of years ago springer were giving 1000s of full book pdfs away for free. I got some of them but I didn't know then what I would have looked up in the future, then they stopped it
btw was there an answer on whether or not there was a factorization of 40 that involved sqrt(-13)?
when I tried I thought the answer was no
I'm going to try that in sage
sage: K.<a>=NumberField(x^2+13) sage: K.ideal(40).factor() (Fractional ideal (2, a + 1))^6 * (Fractional ideal (5))
I used it to help me debug my F_p(p>2) polynomial division routine last week
do itttttt
please explain what that means, I don't know what K.<a> even does
K dot less than a greater than a
what kind of binary relation R is that
ok. K is a number field. a is the "primitive element". here it stands for sqrt(-13)
Q is the field of rational numbers
Q(sqrt(-13)) = K
is K automatically a number field?
the polynomial that defines it has to be irreducible over the base field
wait
can't you have Z and add more than one irrational though?
like Z[sqrt(2), sqrt(3)] or something
not the same, because Z[sqrt(-13)] is not a field, it's not closed under multiplication
wait why isn't it closed
in fact you have had your first glance at an order in a number field
and the 'maximal order' is the ring of integers
You may have meant to say something else where
the way I write it is probably wrong
It is indeed closed under multiplication
But it is not a field due to lack of inverses.
is Z[whatever] an integral domain
Like, whatever in C?
Yes
That is not where my brain would be at at the beginning of number fields, Z is an integral domain, would have to ... think
about Z[whatever]
typos happen, dw
I can only assume the name "integral domain" came from Z
and then you have to be able to recall the definition to check it
It's more that it came from C
this sounds like more people-were-high stuff
ok
"dude what if pi was an integer"
the most important thing a the start of number fields is what is it, and what is the ring of integers
ring of integers == Z with the "usual" addition and multiplication, right?
No
gdi
It’s everything “algebraic” over that
every time I think I've got a grasp on this stuff
Z is the ring of integers in Q
Z[epsilon] as the subring of the dual numbers deffo isn’t integral but any subring of an integral domain will be integral,
really you need to say “integral” meaning it satisfies a monic polynomial with integer coefficients
Z[sqrt(-13)] is the ring of integers in Q(sqrt(-13)) .... or is it let me check
it is
sage: K.<a>=NumberField(x^2+13)
sage: K.ideal(40).factor()
(Fractional ideal (2, a + 1))^6 * (Fractional ideal (5))
sage: OK=K.ring_of_integers()
sage: OK
Maximal Order in Number Field in a with defining polynomial x^2 + 13
sage: OK.basis()
[1, a]
is Q(sqrt(-13)) different from Q[sqrt(-13)]?
One is meant to be the fraction field of the other
Z[anything] means the smallest ring containing Z and anything
so theY are different
my travels have taken me to math.stackexchange where I see Z(t) for transcendental t
whereupon I close my eyes, stick my hands in my ears, and say LALLAALA and move on
transcendental here is the same as some unknown x
because they both satisfy no algebraic relations
basically Z[pi] and Z[x] are isomorphic
yeah basically
Sqrt(-13) is algebraic, so not transcendental
not actually a proof but that's the idea
as pi is not the root of any polynomial with (real?rational?integer?) coefficients
there's no way to turn pi into an integer
so once you add a pi into an expression, there's no way to eliminate it except for (a) dividing it by pi, canceling it to 1, or (b) subtracting pi, canceling int to 0
On a completely unrelated note, it crossed my mind today that R_1\times\cdots\times R_m\cong S_1\times\cdots\times S_n with the R_i and S_j simple rings implies m=n and R_i\cong S_i. There's simply no getting away from unique factorisation in math, is there...
it crossed my mind that you said "simple rings" and the word "simple" does not appear to apply here at all
in other words, pi is not the root of any polynomial with integer/rational coefficients
yeah that
so it is transcendental over the rationals Q
In contrast, anything that is a rational exponent of a rational is algebraic, right?
wait till you find out how simple "simple groups" are
I wonder, do we have anyone in the channel of the regulars who is capable of understanding the proof of the classification?
if I can't generate the group with 1, a, a^2, a^3, ... a^(n-1) for group order n, it ain't simple enough for my needs
C is a field right?
those groups are simple iff n is prime 
the irony
it's better to leave out the "irreducible" part on first acquaintance, no?
wait what if a is a GF(2) polynomial modulo an irreducible poly? the multiplicative group, so not zero
but it's not simple?
cuz the group order is 2^n - 1, which is almost always not prime
trust me, I studied the hell out of this for some project at work
I needed pseudorandom number generators with very specific properties
and I used galois fields to build them
what is your job
I'm a software engineer
where
I work in credit card processing
It does not, sorry. Only the bank can do that
big scam
There's actually a way I could do that, buuuut it's obviously illegal and I'm not going to jail over it
Have you seen Mr. Robot? I always wondered if the bit about how by getting some kind of "scanner" device close to a key card they can copy its information.
Not exactly credit cards, but somewhat related.
hotel key cards?
not exactly, but close
like access badges?
There is. Did that once, on a lark
Depending on the system design it may be possible
Note that you can't build a universal one
do you know if I can carry an nfc tag around with me that will automatically charge $50 from nearby credit cards?
you cannot
because the money isn't on the card
the money is in the bank
the card is just an identifier.
And the chip in the card uses RSA-based signatures to prove its legitimacy, so you can't just copy the output unless the credit card terminal screws up and the challenge isn't random enough (fun fact: when the chip cards first came out, a lot of credit card terminals did screw up and always used the same challenge, so you could replay a captured signed challenge to effectively clone the card)
we don't stream anything to the various world governments
oh, internet hub
they probably stream everything
that doesn't sound like a great trade
What the fuck is this conversation
we're trying to construct a vector space over discord messages
i.e. rings of integers to groups of idiots
the group operator + is:
nonidiot + nonidiot = nonidiot
idiot + nonidiot = idiot
nonidiot + idiot = idiot
idiot + idiot = idiot
it's basically F_2
idiot * idiot = nonidiot
F_2 but with + and * swapped
why? because idiots
who is going to say it
2 is my favourite odd number
(Hint: a number n is odd iff n mod 2 is 1)
This has been the worst algechill moment of all time, I think
does that mean no numbers are odd in F_2 cuz there is no 2 and mod 0 is undefined?
I was trying (without success apparently) to joke about you writing idiot + idiot = idiot, which translates to 1+1=1, which is the same as saying 2 is odd
I guess you meant nonidiot =1 and idiot=0 with addition and mult swapped looking at it again, so that works unless I overlooked sth
Well if idiot=0 and non idiot=1, you still don't get 0 + 0 = 1
what do steps 5 and 6 do?
Idiot * idiot = idiot makes more sense anyways
who knew, idiots are not isomorphic to a field
what has this conversation devolved into lol
Cutting edge mathematics
yeah i am sure it's at the frontier of mathematics
boowean awgebwa
idiot = 1 and + = or

Not in z/2z though 
😂
a or b = a+b+ab 
How to correctly pronounce awgebwa tho
aww-geb-bwa
So it does sound like talking about course work during lunch with a full mouth
When I tell my non math friends I’m taking algebra they think it’s the same as high school alg and they’re all like “oh I took algebra” so I gave up n say group and ring theory
"Oh linear algebra? Yeah I know y = mx + b"
LOL
Basic algebra :)
i got into that argument until they showed me their transcript where their highschool course was actually called linear algebra
If this happens just say:
"man those Cohen-Macaulay rings are a real fucker to get a grip on right"
😂
How many subgroups of each order does C2 x C2 x C2 have
And then just go with the awkward flow
Imagine you are saying you are working in algebraic geometry and some high schooler says that is easy and they are doing even analytic geometry
Yeah they think it’s plane geo and elementary algebra
If I tell someone I'm doing commutative algebra and they tell me all HS algebra commutes so what is there to be done I will strangle them on the spot
They can only occur in order 1, 2, 4, and 8, try to see what groups occur there
yeah i mean analytic geometry do be hard 😂
GAGA
how exactly does that relate to y=mx+b
In other news
man Eisenbud is so good
I wonder which one
800 pages of pure joy
the same person reads matsumura 🤢
800 pages?
yea
Eisenbud is longggg
like very long
it's memed that it contains all of comm alg in a single book lmao
I thought atiyah and McDonald's cute size was average for what you usually need
I have heard that you need more than that for stuff like Hartshorne
it's enough to get you started with AG
but it doesn't have more homological stuff
Homological algebra gets grouped with comm alg often?
are there more than one chmuwu's? 
no it's more that homological algebra techniques are very useful in comm alg
no like the stuff in comm alg that requires hom alg... stuff about depth, proj/inj dim, cohen-macaulay etc
det hasn't read AM so me no know what all it has >.<
det will read matsumura tho 
cause chmuwu recc it 
Homowogy 
it's very shallow and terse
me no likey
chmuwu's wisdom
(same >.<)
I will let Number theory motivate me
me too 
my new math objective is to understand Wiles' proof of FLT at some point in my life

I am growing closer
cohomology is everything, except homology

Just turn your page upside down smh
det know supew basics >.<
no you gotta flip it turnways
I know they're connected to like alg geo in some interesting ways
ok but super basics to you (det) is probably like
cohomology of chains of functors
I mean I know what a modular form is lol
I don't know what the motivation for them is tho
analytic functions
do not care
Does that even make sense?
nu me know a lil stuff about the ramanujan tau function, that's all
I've seen notions of chains of functors I don't recall exactly how it works
they're weakly modular of weight k >-<
Cohomology... things out of nat transforms?
gimme the uhhh irreducible characters of height 0
lemme get my notes
Yay
yeah that's like the basic example but I don't think it's very interesting
Eisenstein series are where it's at
They actually somehow solve the four squares problem???
It's like in how many ways can you write a number as the sum of four sqaures
and the solution can be found through Eisenstein series
oh yee i rememebr a lil, they in fact give you a formula for number of solutions as well
I have a 600 page book on FLT from a conference after the proof was announced. I glanced at it when I knew nothing, now I know little bits more and I have practice reading lots of papers so I could probably get through more of it now. But the problem is if it starts assuming things from e.g. the Hartshorne book, then I am back to clueless (I have not read Hartshorne)
lol
I only know one 50 minute lecture worth on modular forms 
tubu kawaii 
detuwu 
there is no way it doesn't
nvm I was chatting shit
an exact sequence of functors is some A -> B -> C such that for all objects X in the appropriate abelian category, A(X) -> B(X) -> C(X) is exact
(the details are like that certain Eisenstein series generate $\mathcal{M}2(\Gamma_0(4))$, namely $G{2,2}(\tau)$ and $G_{2,4}(\tau)$ so you can get the solution from that because the modular form associated with the four square function is a modular form of weight $2$ with respect to $\Gamma_0(4)$)
ironyincarnate
Imagine you could introduce all necessary concepts and build up the theory within 600 pages and fit the actual proof in the remaining margins.
One final flex on Fermat
Man I think just knowing Ribet's theorem is already very deep
But Wiles used some wild comm alg stuff in there too
like Gorstein rings
i don't know how people get into these things
the commutative algebra that is beyond what is needed for basic algebraic geometry
I know a good exercise: understands Ribet's proof of the epsilon conjecture (you beat me to it there Irony), apparently it uses 'the full strength of Grothendieck's algebraic geometry'
i guess to prove FLT
I'm slowly learning stuff abt Langlands since my new institution is very langlands focused so I'm getting into FLT related waters
the funny schemes
Working in AG or related fields and you overtime learn the necessary material?
Read Eisenbud bro
lmao you read Eisenbud for 200c
the class the covers like 5% of the book
200c?
class at our uni
Is it even possible for a class to cover all of either of those books? 
grad algebra sequence
sorry i just doxed myself
What do the numbers mean Jason
Well our class covered a vast majority of atiyah-macdonald

but I think you need a pure comm alg class that's very long and deep to cover all of Eisenbud
professor skipped primary decomposition iirc so i did it on my own
i don't remember any other big topics i covered outside the class
the resolutions and stuff is whatever
did you do Grobner basis stuff
Ew, computations
wdym that's like ch. 15 of Eisenbud lol
(to kerr)
it's comm alg grrrr
-<
I can't think anymore need sleep
actually sorry i was lying
wikipedia:
Universally catenary rings ⊃ Cohen–Macaulay rings ⊃ Gorenstein rings ⊃ complete intersection rings ⊃ regular local rings
gorenstein is the only one i don't know here
LMAO
also about cohomology: i try to read the nlab page every few months to see how much more i understand
i'm a det 
no human being will ever understand an entire nlab page this endevour is fruitless
https://ncatlab.org/nlab/show/morphism what about this one
unpossible
Wdym, you don't instantly understand how cohomology is related to the homotopy category of hypercomplete (inf,1)-toposes???
det slow >.<
Maybe one day I'll be able to read 10 words into a nlab page without having to open 6 tabs
they're invariants of elliptic curves
sections of some bundle on the stack of elliptic curves or something like that
technically modular functions are the invariant ones
but you can make modular functions out of modular forms
i watched (half of) borcherds's lecture series on modular forms lol
that is motivation enough for me
but maybe you're talking about generalizations
hey I’m taking a class with that dude next sem
that's dope what's the course?
THE Eisenbud? lucky you
It’s called groups rings and fields, it’s a graduate course iirc
If D is a division ring, how do I see that the homomorphism D^op->End_{M_n(D)}(D^n) via a\mapsto (x\mapsto xa) is surjective?
Said otherwise, why every group homomorphism D^n->D^n compatible with left matrix multiplication is right multiplication by a scalar.
Hm, actually you're right, I could use it probably.
JD is a little different tho, it says R->End_{End_R(M)}(M) is dense.
and M_n(D) is not End_D(D^n), M_n(D^op) is
nvm, it's End_D^op(D^n), therefore M_n(D)
but...
shit, all these ops confuse me
gimme a sec
D = k = k bar 
I feel like the last part isn't convincing (the bit about how End_Dop(D^n)\cong M_n(D) => End_End_Dop(D^n)\cong \End_M_n(D)(D^n)). Is there a better way of doing this?
how is it not convincing?
Why is there no Z[i]-module with 12 elements?
wait are you the same person as yesterday
As an abelian group it would need to have a subgroup of order 3 -- that is, {0,a,-a} with 3a=0.
Now what is i·a? It can't be 0 because i^4·a = a.
It can't be a or -a, because then -1·a = i²·a would be a itself, but a doesn't have additive order 2.
But if i·a is outside the subgroup, then it and a generates a subgroup of order 9, which is impossible.
Yes, exam today
I don't think i fully understand but i will think about this, thank you
More abstractly, one can appeal to the structure theorem and the fact that the size of a quotient of Z[i] is always the sum of two squares.
I was thinking about this but i wasn't sure if is it always or just it can be sum of two squares, i think it is easier to check like this, thank you!
Z[i] is a PID, and for reasons of geometry, Z[i]/<a+bi> must have |a+bi|² = a²+b² elements.
Thank you again
(Except when a+bi=0, of course).
One last question(probably is a stupid one), if someone can answer. If i write directly a module as a sum of indecomposable modules, does it count as indecomposable?
each individual summand is by definition indecomposable
but if there are more than one summands, then the whole thing is again by definition decomposable

So do you know another Z[i] indecomposable module with no torsion other than itself?
How about Q(i)?
you'll need to go infinite-generated else structure theorem of mods over pid takes over
(notice that any two non-trivial submods will intersect here, so can't decompose)
I think that's it, thank you!
What are the finite commutative local rings with residue field F_p, such that the maximal ideal is principal? I suspect they're only Z/p^k and Fp[t]/t^k but I am unable to prove it.
@devout dirge what about the totally ramified extensions Z_p[x]/(x^n -p)?
Modulo various powers of p
Mod p^k these are (Z/p^k)[x]/(x^n - p) and have maximal ideal x with the correct residue field.
Any proof of the correct version of this statement will use some universal mapping property for regular local rings to Artinian rings with fixed residue field, cohen structure theorem, and nakayama’s lemma and be very easy to prove though
Seems there could be a few. If I'm not mistaken Z/9[sqrt(3)] and Z/9[sqrt(6)] are not isomorphic for example.
@rocky cloak there is a square root of 2 modulo 3^2 because sqrt(2)=sqrt(3 - 1) and that power series converges
By which I mean the series sqrt(x - 1) is well behaved in characteristic not 2
Is there? 0^2 = 3^2 = 6^2 = 0,
1^2 = 8^2 = 1,
2^2 = 7^2 = 4,
4^2 = 5^2 = 7
My guess would be that all such rings are of the form (Z/p^k)[x]/(xf(x) - p, x^n) where f is a polynomial. But this should be "over counting".
@rocky cloak I don’t think you need the x^n and your sqrt(6) example shows that they need not all be of that form. When p is not zero they’re certainly all O/p^k where O is obtained by adding the root of an Eisenstein polynomial to Z_p, that’s easy to prove.
My example is of that form, it's isomorphic to Z/9[x]/(2x^2 - 3).
You need the x^n, but it could probably be avoided by putting some conditions on f. For example Z/9[x]/(3x - 3) is not finite.
Yeah, right 5x^2 - 3
I was assuming we wanted to write them with f monic to avoid huge redundancy
Eg writing them with an Eisenstein polynomial is (up to the problem with units) a complete classification
Maybe having leading coefficient between 0 and p will be a good compromise
In that such f modulo p^k parameterize exactly a choice of such an R and a generator for the maximal ideal
Without adding any bizarre extra data
For fixed p^k if one desired one could then quotient the space of such f(x) by the action of the units in Z/p^k by rescaling and obtain exactly the moduli space of such R
When p is zero things are much easier.
Thanks alot! Do you have maybe a criterion in mind such that the answer would be indeed only Z/p^k and Fp[x]/x^k?
Not sure how natural it is, but your condition + p having degree being in the degree 1 part of the associated graded ring.
It's a bit silly, since p=0 in the latter example.
Actually, scratch that. Might still not be strong enough.
Bad news everyone, I'm back
Is a prime order subgroup of an elliptic curve over F_p a vector space?
It looks like it satisfies all of the axioms
what would the scalar multiplication be
"Point multiplication"
does that satisfy a(x+y) = ax+ay?
Hrm but wait
When I tested earlier, g^n was 0
I'm having trouble visualising it
Are vector spaces allowed to have ab=0 for a nonzero a,b
Or wait no
I'm mixing up 0:1:0 in the group with 0 in the field
how do you multiply vectors
And if group order is composite it's a module?
No
I mean it’s a Z-module always
But that’s literally another word for abelian group
It can still be a vector space over F_p if its order is infinite or p^n for some n
But you can’t guarantee it
oh prime order I read that as prime index
Sorry a+b
I learned on RSA and the related diffie hellman, which is based on multiplicative group mod N
So my mental model is "group operation is multiplication"
your equation is saying b = -a, so yes
Ok lemme try to rephrase
If a group is of prime power order q, I can easily turn it into a vector space with field F_q
But if the group order is not a composite, it cannot be a vector space, merely a module?
A module over what
any abelian group is a module over Z
It’s another name for abelian group
And it’s not the case that a composite order group can’t be a vector space. You can be a vector space over F_p with order p^n, or infinity
A module over a ring of order n?
It won’t work if any other prime divides it and it’s finite though
This isn’t a meaningful thing to consider
But
Yes
It’s a module over Z/nZ
This is just saying that in a group of order n that n•x = 0
Its meaningful to me cuz it lets me verify my understanding of things
The important part with being a vector space is that vector spaces are way better than modules
And the utility of saying abelian group = Z-module is that you can apply module theory which is kinda like weaker linear algebra
But insofar as moving from Z-module to Z/nZ module for n composite, I think practically speaking it affords basically nothing
Like: if all fields of same cardinality are isomorphic, then any can't any finite group of prime order be turned into a field by mapping elements to 0..p-1 and defining the "multiplication" operator in terms of Z/pZ?
prime order or prime power
Yes, but this is artificial
Yeah that
This thing you propose basically reduces to this question: “what is 1?”
well, there is only one finite group of prime order lol
we know what 0 is, its 0 in the group
I get it
I'm just trying to verify that I understand things properly
But you can actually pick anything which isn’t 0 to be your “1”
g, or maybe a
That’s just a letter
My point is that everything in G\{0} could be 1
Everything that’s nonzero in a prime order group generates the group
Which means I can choose any 1 I want 😄
Sure
But then multiplication is pointless
Like, it’s just a thing you artificially put onto the thing
Like…
If anything can be 1, then the concept of 1 is pointless
The value of having extra structure is when it came to you with that structure already
Well
They cant all be 1 at the same time
Yes but it doesn’t do anything
Whatever you do depended on your choice
Like I can turn {
,
,
} into F_3
By saying
= 0
= 1
And
=2
But this doesn’t say anything about my original set
I’m just studying F_3 now
F_1 = {
}
Ok I think this leads into the thing I'm currently trying to understand: Schoof's algorithm for counting the points in an elliptic curve subgroup in polynomial time
You can easily construct F_p by building off of Z/pZ
Slightly more formally, the set of integers 0..p-1 with addition and multiplication defined from the Peano axioms, reduced modulo p
Schoof's algorithm involves applying the Frobenius endomorphism to the curve points over Fp-bar
Bro just say F_p. You don't need to invoke peano whenever you want to talk about the integers.
F_p is actually equal to Z/pZ, fwiw.
Isomorphic
That is the typical definition, so no, I mean equal.
mfw peano

What about F_p^k though?
That is harder to construct.
That's what I'm having issues with
Since x^p = x in Fp, the algebraic closure of Fp obviously cannot use the "usual" addition and multiplication
OK, F_p^k is F_p[x]/(Phi_k(x)), where Phi_k is the kth cylcotomic polynomial. Is this the information you needed?
the algebraic closure of Fp uses the same addition and multiplication as Fp
Maybe
But then x^q = q and frobenius is an identity transform, no?
No
The Frobenius endomorphism is not invertible in the algebraic closure of F_p
Wait hold on, that's wrong
Sorry, I mean to say that it is not of finite order
Yeah that's what I read
It's an infinite union
But this is where I'm hung up
Elliptic curves over prime field Fp just means computing the x and y coordinates modulo p
But that doesnt hold got higher powers of p, does it?
I don't know what the confusion is exactly
If you're in a different field, you use the addition and multiplication defined in that field
The field, as it were, is packaged with this information.
Now as it turns out this definition above comes with the information you need, if you know how to read it
Is that what the confusion is?
Right this is where I have trouble
The algorithm description doesn't define the field
It just says it's F_q-bar
Yes, because typically we know what F_q bar is
Writing down what it is in an explicit way is a bit tricky.
I have a mathematical description of a prescriptive algorithm
It works fine for proving it's valid, cuz all fields of equal size are isomorphic, so the choice of field is arbitrary
Here's a rough explanation: every element of F_p bar lives in some F_p^n for some n>0. The addition and multiplication within these individually is the same as normal. We think of F_p being contained in F_p^2, being contained in F_p^3 etc. which is what allows us to cross-pollinate the addition and multiplication.
cuz all fields of equal size are isomorphic
All finite fields of equal size are isomorphic
We certainly cannot substitute F_p bar for Q.
(despite their being the same size)
Wait we can't?
Interesting
Not relevant though I'm working in finite fields
Mfw Q and Q^2 are isomorphic
You're not working in finite fields. You've mentioned F_p bar
He said fields
Anyway
F_p bar is an infinite field.
Not isomorphic to Q, got it
Ye sry
He STILL said fields lol
An example is Q and A, fwiw
A is the field of algebraic numbers
Isn't Q a field?
Q^2 is not.
Smh
Yeah but fields have no proper product operation
I aim to steal all your thunder. it's ALL mine
_ _
Okay let's get off the infinites, I'm an engineer
Everything is finite
F_p bar is infinite you can't get around this point
R and C are birds
Then maybe f_p bar doesn't exist but a finite version exists that's good enough for my needs
Sanity check: Groups of order n
All subgroups are of orders that are factors of n, right
not factors, divisors
R exists, C exists, F_p bar exists
yeah, combinations of factors
R does NOT exist
the other two do
oh my bad
yeah who even believes in the axiom of choice??? amiright???
Real engineering is mostly built on a horrific union of a subset of the rationals, a single element that has a+e=a for most a, two absorptive elements, and set of a few million even more absorptive elements
you need choice to show the algebraic closure is unique in general iirc
Anything that leads to Banach-Tarski is sus
I dont actually need the full closure I thini
yeah but no one says that a 32 bit int is Z mod 2^32
I think all I need is a field that can contain x^(q^2)
I do if I'm explaining wraparound
Axiom of determinacy enjoyer
to be clear you don't need choice to construct the reals
What are absoprtive elements
@ all readers
you missed the joke
Also a 32 bit signed int is Z/2^32Z minus 2^31
Isn't Banach Tarski more just a warning sign that we need to define measurability lol
I've never seen the issue with it
we have some people here who may not be able to detect the joke
I am 100% certain we had this convo yesterday
that's their problem, respectfully 👍
and the day before that
and the day before that
and the day before that
and the day before that
only if abelian
A_4 has no subgroup of order 6
Whoops internet moment
hahahah beat you to it this time
illuminator goes crazy arc
Ngl the effects of BT make me think of the proof that 1=2 that leverages division by zero
Really
Wait does that mean the contents of this channel form a cyclic group
Crazy? I was crazy once. They put me in a rubber room. A rubber room with rats. Rats make me crazy.
Crazy? I was crazy once
A_4 also has no subgroups of order 48
Crazy? I was crazy once. They put me in a rubber room. A rubber room with rats. Rats make me crazy.
Crazy? I was crazy once
What is A?
A_4 also has no subgroups of order 1024
a capital letter
no not really
alternating group
Oh okay wew thanks
kernel of sgn or some shit like that
group of even permutations on a set of size n
idk I don't believe in A_n, it doesn't exist
unique subgroup of index 2 of S_n
group theorists keep making these groups up
what's next?? tits group??? oh wait...
Imma be bullied for that typo
If I have an l torsion subgroup of a finite group of order n, then gcd(l,n)=l, right?
S_n doesn't consent to be abelianized
what's an l torsion subgroup
There is no axiom of consent
Lagrange's theorem
torsion group of order l?
That's a yes, right?
your language is a bit weird but yeah
oh I don't know elliptic curves yet 
like the l-primary part
Now is your opportunity
Yeah I have no formal education at this level it's all self taught
I skipped over vector spaces and went straight to polynomial rings
I have so much stuff to learn at the moment...
What the FUCK is going on
Moar
p adic analysis... toric geometry... algebraic number theory... diff geo...

We can learn together!

that's the subgroup annihilated by l
do you know what a fan is
check out my cool ring
those elements who go to 0 when multiplied by l
Fake
That’s not a ring, that’s some rep theory shit
it's also a ring
I know what those [] mean…..
hey @delicate orchid
Fun times
Point multiplied, right?
what is a monoid algebra??? it sounds like rep theory
I've learnt a lot and now I'm going back through it all and computing examples as I go
is it??
wtf is a monoid algebra
ok nvm lol
l is an integer, actually a prime as stated
monoidal gebra
Right so its P+P+P... l times is 0
nono
group algebra but monoid
oh right, duh
oh i was just guessing
yeah ok so it sounds like a group algebra
Right so its P+P+P... l times is 0 (point at infinity) right?
or at least some kind of algebra on the poset structure of the lattice
like if $(\omega, M)$ is your cone lattice then $$\bC[\omega \cap M] = \bigoplus_{u \in \omega \cap M} \bC\chi^u$$ is your monoid algebra
not sure what the operation would be
yeah
the multiplication is just $\chi^u \cdot \chi^{u'} = \chi^{u + u'}$
we are doing things at an incredibly fast pace in lecture and my prof has now started not even giving proofs for theorems and propositions because they would be too complex for one course
ok so it's just the free module generated by the elements of the monoid endowed with a linear extenstion to the module operation
or as I like to call it
F(M)
that's a sign he should slow down
what course is it
newton okounkov theory
Okokok theory?
I like to call it NOT
never heard of this SHIT
it's some relatively new theory
dude you're 16 why the fuck are you learning new theories
learn real analysis you pointed skill set mf
That's a really specific course
so far we've done algebraic geometry, convex geometry, and now we're doing toric geometry
You sure it isn't just the current topic in the course?
do you know schemes
I know the definition of a scheme yes, haven't dived into any properties or anything like that yet tho lol
started learning diff geo
Notation question
Is "F_q[x,y]/(y+x+b)" a polynomial ring modulo y+x+b?
you don't actually need schemes for toric geometry
just the gluing part
to understand why it's called "ramified"
like in algebraic number theory
apparently it comes from geometry...
yes
don't ping me I'm listening to text to speech reddit compilations
ramified means branched
Use a Ponzi scheme to make money off of toric geometry
@delicate orchid hey I got a question for you
@delicate orchid ok so
@delicate orchid what do you call $\bC[M]$ for $M = \Hom(N, \bZ)$
How TF do I do modulo a multivariate polynomial
@formal ermine what is the @formal ermine problem my dear friend @formal ermine please let me know
N is a free Z mod
see this is why you need to learn ring theory properly
this is just a quotient R[x_1, ..., x_n]/(f)
k[x,y] = k[x][y]
look up quotient ring
It's a set cosets of ideals which forms a ring, so yeah, do your ring theory
dunno
I cannot stress enough that you should read a book
the definition is clear to me but my prof never gave it a name 
or we could do the radical approach of learning the universal property and only using that LMAO
you don't already do that?
does it need a name
yes
Fred
I call it Robert
do I just read out "C M"
fuck you walter
is it bad that I just view algebras as vector spaces with haha funny vector product
Should be
people don't really do this in intro algebra classes
yeah
somewhat
just pick one of the generators of F_n
I just thought of matrices ngl
just pick n-tuple
Hom(Z, Z^n) is way easier...
If I have y^2-x^3-ax-b
Are the ideals x and y?
you want to quotient this I imagine
you'd quotient by (y^3-x^3-ax-b) < this is the ideal generated by that polynomial
Ofc Hom(F_n, Z) is 'the same' as Hom(Z^n, Z) in some way that I don't wish to make precise, because Abelianisation.
as what structure is $\bZ^2 \iso (\bZ^2)^\times$
?
the fuck
I am going to repeat that you should read a book. Books tell you exactly what ideals are.
(Z^2)^\times is just (\pm 1, \pm 1) is it not
Nobody here wants to teach you a whole undergrad AA course
I fixed my typo (twice) its y^2
Is it still the same if the high exponents differ?
WHO USES TIMES FOR DUAL SPACE
yeah like bruh
if it's an \ast it's dual space you muppet
he uses \vee for another dual thing
of course it is?
go consult wikipedia
no, go consult a book
consult wikipedia so you know you need to consult a book
I've read lots of books, but most books dont cover this specific topic
If you have a specific suggestion I'm all ears
learning maths from wikipedia is a REALLY bad idea if you're not already well versed in the surrounding field
I am consulting wikipedia
I can't think of any AA books that don't cover quotient rings/ideals
artin absolutely does
This is just wrong, sorry. As wew says, any intro book will cover ideals.
I am pretty sure any abstract algebra book will tell you how to understand forming the factor ring with an arbitrary ideal
unless it's a pure group theory book for whatever reason lol
If you really need a suggestion, I personally learned from Fraleigh
But people here prefer Artin and others. I haven't read Artin.
Arrows?
commutative diagrams i think
Abstract nonsense
o
category theory and universal properties
OHHHH YEAHHHH
grp cohomology
must be a pain to code these diagrams
co this homo nerd
i struggle with straight lines, imagine curves
just use quiver lo
Which is it written out
God gave us the complex category for a reason
alg topologists writing "fold" for a map and expecting me to take their field seriously
so true king
i like the nuclear explosion in the middle
https://q.uiver.app/ this actually
A modern commutative diagram editor with support for tikz-cd.
WTF
The set of polynomials with coefficients in F2 modulo an irreducible polynomial looks like a quotient ring
Did I miss something?
does your book seriously have the (n-1)th suspension of S^0
is this how algebraic topologists are
i should have figured, these need to be advertised more
we explained this yesterday lol, all field extenstions are quotient rings
quiver and tikzcd is pretty good but I've heard that some people like to draw their diagrams more precisely to get marginally better results
"modulo J" means " if J was 0"
and then we have some properties of 0: 0 + 0 = 0 and r0 = 0
so that's where ideals come from
of course you need to prove that this works
Okay so all I need to understand is how to compute y^5 mod x^3+y^2+3
You just did
if x^3+y^2+3=0, then y^2 = -(x^3 + 3)
I did?
Just because we have something we mod out by doesn't mean there's a nice representation of it
For example we can consider the group R modulo Q
Wait hrmmmm
so y^5 mod x^3+y^2+3 is just y(y^2)^2 = y(-(x^3+3))^2 mod x^3+y^2+3
Now you're confusing modulo for computing a nice representative modulo
have fun with that expression
Since I'm dealing with prime fields, neither pi nor Q exist
You are missing the point
In arithmetic modulo 5, for example we really think of 5 mod 5 being equal to 0 mod 5, which is equal to 15 mod 5.
The way we write it doesn't matter.
Now as it happens we can always find an integer 0 <= x < 5 such that n mod 5 = x mod 5
and this is the representative
There is no general way of choosing representatives when we mod out by something.
The point is: mod is not a function!
ofc there is
It's the one you choose 
Yup
Formally "congruent"
With mod x^2 + x + 1
X^0 = 1
x^1 = x
X^2 = x + 1
So when you said this... the reason I said "you just did" is that there's not anything to compute yet
If I'm in F_p, it's the value in the range 0..p-1
the word "congruent" is a special word you use so you don't have to say "mod J" over and over
You need to think carefully first about what representatives in K[x,y] you want to choose
even then people don't care that much
then you can think about computing the representative
the coefficients are in F_p, the powers can be whatever
y^5 is already written with coefficients that are canonical representatives of the classes of F_p
if you want to reduce the power a lot, that's different
From my perspective, with univariate, its trivial. Reduction modulo the polynomial is polynomial long division and take the remainder
and it's not always helpful
it depends on what you are modding out by
You're doing polynomial long division because that gives you a representative: a unique nice thing in the ring for every element in the quotient ring.
The stuff I have experience with is modulo a univariate polynimial
Yes
Is there another common way that I don't know of?
Now you should see that the property that makes it unique is its degree: when you compute the remainder, it is of minimal degree such that it represents the thing you see
Yes. That I understand
Now you should also see that you can't do the same with bivariate polynomials. Firstly the division algorithm doesn't work the same way unfortunately, but also because the degree doesn't work in the same way.
Ugh.
So if you want to have nice representatives, you're going to have to think about what they ought to be
Then we can talk about 'computing' y^2 mod that polynomial
Here's a really grody one. Chew on F_2[x,y]/(xy - 1) for a bit
There are nice representatives you can choose but you will have to ponder it for a while
I can't because I don't understand what that ring is
Well I've suggested books
grody
who'd you call grody
it's all polynomials in x, y but we set xy-1 = 0
joe
That ring is super nice 
Shut your trap you are literally a chair
don't be hyperbolic, it's just nice
So true
Ugh I gotta get back to work
call her laurent the way she invert my indeterminate

)

