#groups-rings-fields
406252 messages · Page 573 of 407
are you not talking about x^2 + 1
a bit tired
instead
yes
yeah
im considering the function (2x+3)(x^2+1) This doesn't seem to have roots in Z5 or even Z
wait,
but with what you gave me, i guess it should?
although
Z/5Z is definitely not algebraically closed
there's definitely polynomial in Z/5Z[X] with no roots in Z/5Z
take for example P = x(x-1)(x-2)(x-3)(x-4) + 1
ah yeah
P(x) = 1 for any x € Z/5Z
interesting
(note that this method generalizes, it works to show that any finite ring can't be algebraically closed
)
so, how could I go about finding what makes a root within Z5? like would 4 be the only root of x^2+1 or just one of them ?
Mmh
I remember a few months ago a friend of mine explained me something about that
give me a minute I'll try to find what he explained me exactly
like if I remember correctly it was that the usual methods for solving quadratic equations over C worked too over Z/pZ for p a prime 
except that the square roots aren't always defined, and some details like that
yeah, like the quadratic formula. But the quadratic formula on x^2+1 would give me complex roots and i don't know how from there it would indicate that 4 is a root yknow
no it wouldn't if you use it over Z/5Z (I think)
So like
let me try
x^2 + 1
Delta = -4 = 1 [5]
sqrt(1) = 1 [5]
Solutions should be pm sqrt(Delta)/2, so -sqrt(1)/2 = -1/2 and sqrt(1)/2 = 1/2, the inverse of 2 mod 5 is 3, so solutions are 3 and 3*-1 = 2 [5].
Both are solutions
not sure if that's clear
so you reach a conclusion of 3 and 2 being roots?
yes
ah hmm
it think i get it
one question
you reached 1/2, but then said that the inverse of 2 mod 5 is 3. I'm getting confused with additive inverses and multiplicative inverses there
I'm speaking about multiplicative inverse
so basically to solve the equation $ax^2 + bx + c$ over $\bZ/n\bZ$, you should try the values given by $\frac{-b \pm \sqrt{b^2 - 4ac}}{2a}$.\
You should interpret the division by $2a$ as a multiplication by the inverse of $2a$ mod $n$ (if it exists, obvsly, but if $n$ is prime and $a \neq p$ and $p \neq 2$, you're good)and the $\sqrt{b^2 - 4ac}$ as huh.. something that works squared gives you $b^2 - 4ac$.\
Tbf I'm not sure about the details (mostly about the square root, since there's not always a square root what happens in this cae), you should probably try to do a proof of this formula over $\bZ/p\bZ$ for some prime $p$ yourself and see how properly that works, and then try to see what generalizes over $\bZ/n\bZ$ for any integer $n$
when they say every nonzero element is a unit does it mean it has an inverse?
Shika-Blyat
@lunar coyote non-zero does not imply it has an inverse in general
oops unit does tho
yeah that's what unit means
so either it has an inverse or it divides zero
now when something isn't defined (like when the multiplicative inverse doesn't exist or there's no square root), I'm not sure about what happens. Maybe there's no root, maybe there can be but we can't find it like that, idk
i think i understand @final pasture
I have one more question related to groups ive been stuck on
go ahead, ask 
are there any groups such that taking the power m of all elements doesnt form a subgroup.
So for $(G, \cdot), n \in \mathbf{N}, G_n = {g^n : g \in G}$
darkninja175
maybe I don't know enough about group structures but I can't think of one
I believe it is always a subgroup and I don't think it'd be hard to show it is
So take a group (G, .)
and some integer n € N
it's always a subgroup if G is abelian, I've seen that before
oh wait you're right
i'm assuming commutativity

So yeah, if it's abelian it is a subgroup
and if it's not abelian ig it's not, mmh 
i've been trying to think of what group would hold this property of violating the subgroup axioms, but i only really have like well behaved groups in my head that dont seem to do it
So I didn't check but I think this would fail with S_3
for n = 2, 3 or 5 (one of those, not sure which one, just intuition speaking
)
I feel like I checked S_3 but i can give it another quick check
So like in D3 s doesn't commute with r. 🤔 you're saying i should focus on those
for 2 we get {e, r, r^2}
for 3 we get {e, s, ps, p^2s}
oh but for D3 and the power of 3 that doesnt seem like a nice group
I don't think {e, s, ps, p^2s} is a group it doesn't seem closed

Yes
it cant be closed because ps * s = p, am i thinking correctly or is this just gibberish
No you're right 
So not closed under the operation

what's k ? 
And >? You won't have order in an arbitrary ring

whats order?
In a ring, you can't talk about elements being greater than other elements
In Z, R etc you can, but not in general, like how would you define order on polynomials?
through degree?
That's only a partial order, and that kind of thing will again only be possible in Euclidean domains
that's not even a partial order
Even for Z/nZ, you can't talk about order because it loops back
the "order" that the degree of polynomials gives doesn't respect antisymetry
you don't have deg(P) <= deg(Q) and deg(Q) <= deg(P) implies P = Q
Right, pre order
Also you can talk about order in Z/nZ, it's just that you can't talk about an order respecting the ring structure of Z/nZ 
gotcha
(but atleast dict ordering gives a total order yeah
)
can someone confirm that this question im given makes no sense
part b
not a field bc the mult still doesnt commute
^
ty i had to make sure im not going insane lol
is it concerning that i can barely do any questions from my abstract algebra book
Are you taking a course or self studying?
Also a question I meant to ask since a few days Moldilocks:
What does 🍎 mean ? 
eat 🔫
also which book, redd ?
i'm taking a course but is taught extremely badly
contempary abstract algebra
if its online that probably doesnt help
all online
gallian?
yep
😢
Alright alright, don't shoot 🤚 😄 ✋
is that the duluth reu guy
Had this with my group thy course
it is somewhat concerning because it will affect your grades and such but in the long run it will probably turn out fine, because when you find a better course that requires group thy you'll have a lot more motivation and background to do it on your own
was recommend "peter cameron introduction to algebra" by my lecturer but it's pretty bad imo
Like I re did all group thy on my own during my gal thy course in just a few days
If you're struggling with the current one, yeah probably
idk if d&f is a good recommendation for a first course
Every single student from my college hates artin
d&f is literally one of the easiest algebra books though
So probably don't use it
and artin is well.. particular, either you love or you hate it 
i'm not actually studying abstract algebra specifically but my course has some content on ring theory
What's your course about ?
d&f requires minimal mathematical maturity
so does gallian, but gallian just doesn't cover half the important topics
and also presents some things way too late/in a bad way
is it a cryptography course or something
ok so that's an elementary number theory course redd, right ? 
looks like a rings course really
with some elementary number theory topics attached
that easily follow from intro ring theory
but taught extremely poorly
lecturer finished the course and i still don't understand whats an ideal
that's not ideal

pun actually not intended
I realized it right when I pressed enter

ye
so long story short i can barely do the questions on this book
kek
should i continue
and keep fighting or change books
idk, gallian is kinda poor
imo
d&f on the other hand is more than enough for your course
and has great exercises
but is incredibly dry
which puts many people off
The thing is your course is covering two distinct (although related) topics, so I feel like recommending you an abstract algebra book would be too much since you're only looking for basic ring theory but I also feel that recommending you an elementary book theory wouldn't help since you also need some stuff about the said basic ring theory and idk any elementary number theory book that speaks about ring early enough 
I'd say you should forget gallian, atleast 
but idk what to recommend instead 
I think d&f would be too much + may be too hard + as F[x] said, it's D R Y, which makes it hard to read imo

d&f would be too much for your course
but your course is kinda all over the place
d&f alone does cover all of that courses's content
is abstract algebra normally a 3rd year course?
i'm 2nd year lul
Yeah, I am not even sure what it means, things like "graduate level course", it seems kind of arbitrary to me
it's just a bit of a strange course
basic abstract algebra can unironically be taught to a grade 9 student who's willing to put the effort into learning it
(in France, elementary abstract algebra is often covered in the first months of the first year
)
abse
based
oh, right, sorry, i misunderstood
Is abse how they spell it in france
xD
abse based abse
the biggest barrier to intro abstract algebra isn't really the prerequisite knowledge to it (which is barely anything), it's mostly just the mathematical maturity
(friends of mine translated "based" to "soclé" in French, which is quite the funny translation when you understand it
)
I think the biggest barrier is that they teach you group theory without motivation
I mean it's just kinda standard that algebra is typically taught in 3rd year (in NA at least)
this this this 
which is why it's called a 3rd year course
doesn't mean non-3rd years can't take it
idk, I like group theory without any motivation
it's a pretty theory without anything extra
needed
I feel like it's just too abstract for a lot of people to handle
I actually like it too, that's how I started maths, but it's so much better (and helps a lot more people that struggles with it) with motivation 
before they're more familiar with more proof based math
Also, this proof-based vs non proof-based thing in NA is definitely shitty weird 
"typically"
Yeah, I suspect that at most good schools, students take it 1st or 2nd year
I mean I can't help that hs students don't know proof based math
and spent their lives grinding computations
hs ?
high school
oh right
well
the thing is
why is there still course that aren't "proof based" after high school 
because 90%+ of the uni population doesn't need proof based math?
they need to know what a derivative is, what an integral is, and basic computational lin alg
at max
I mean in a pure maths cursus 
Is mv calc proof based in france? But I would hate to eg proof stokes theorem
algebra courses have a ton of people that aren't in pure math
mv ? multivar calc ? 
me slim ?
oh hi lol 
Ah, is this english class?
We are on the same maths/physics french server
"Hi, I am doing well. And you?"
I had no clue to find him here
Yeah, although in more advanced course (like multivar calc, which is partially covered in 2nd year usually, and "finalized" 3rd year course), proofs of this kind of annoying theorems may be covered in class but are not emphasized if they're not of particular interest 
But yeah, mv calc is proof based here, so in pure maths cursus you'll usually have proofs of big theorems, with epsilons and deltas everywhere 
In engineering schools I believe it's not always the case 

Depending what kind of stuff you are doing in engineering schools
Exactly what 8da said, so "Hi, I am doing well. And you ?" 
Yeah, as h. says
.
In "prestigious" engineering schools, it's likely that most of the stuff will be covered with great details (atleast when the details are worth being covered, which may not be the case of important theorems with annoying but not particularly insightful proof
), but in "less prestigous" engineering schools, there's pretty much nothing that is "proof-based"

doing alright!^^ I'm definitely in the wrong section (abstract algrebra)
I feel like I'm repeating myself 
Quotient the space of the channels by the relation #groups-rings-fields ~ #chill, and you won't be wrong anymore
(appreciate how I'm in the right channel for my joke
)
Also I love this emoji 

I wasn't expecting too see you here either. You were going to ask something or you were just lurking ?
lurking obviously, also maybe share a video I saw about Grothendieck but it's in french anyway :))
No youtube automatic translation ?
(and share it anyway, I'm interested
)
's fanboy here 
Entretien enregistré à la Fondation Hugot du Collège de France le 27 novembre 2018 entre les mathématiciens Jean-Pierre Serre et Alain Connes à propos de la correspondance Serre / Grothendieck (Correspondance Grothendieck-Serre, Société mathématique de France, 2001 ; Grothendieck-Serre Correspondence, American Mathematical Society, 2003).
You ahve the Bourbaki following up in trends after that one
hey that guy wrote my textbook!
I was doing some research on Galois, and his acceptance at X

Yes he got rejected twice
so he did join the ENS
but after a bit of time, he also got rejected too from there
he went to prison at some point
i see
you are in france?
ive heard of ecole polytechnique too its a good school i suppose
Yeah, but I'm not in any ENS lol, I'm still in high school 

Ulm > PS h. 
Yeah, polytechnique and the ENS are considered the best schools in France (and also the hardest to join
)
(he is still in highschool but can talk with doctor in maths about things i have no clue about)
Are you thinking about the category theory thingy with SEV ? 
well im a math undergrad but next year im starting grad school in statistics
Shika in high school. I'm shook.
yes
I also didn't know what I was talking about lol, I'm a total noob in CT 
How can my nemesis be a high schooler?

(in french this time: la fleeeeeemme
)
I'm going to sleep...forever
I don't even want to join a preparatory class
does france have entrance exams for university
So I don't really care about IOM or the CG, since that only helps getting into such schools, fac is open for everyone and that's probably a better place for me 
-_-, ruining a potential
Didn't say I don't want to join an ENS though
AH
What did you think about X/ENS for MP this week ?
he is going to say "easy" I swear
I just don't feel like I'd be able to give the better of myself in preparatory class though 
Well I wasn't confident either before joining them
depends on what you call univ ig
And the fact I had no clue about actual sciences before doing them didn't help choosing
but it really helped me gain interest and not be lazy anymore
can you think of SU(2) as rotating quaternions the same way that e^itheta rotates complex numbers
(maths A was really full of classics. Except that idk, I'm too bad in analysis/proba to have an actual idea of what the subject were about or how hard they were
)
I see, well yes, I was a bit disappointed about Maths A tbh
But the computer sciences last exam was nice
Well they're both rotating stuff, so yeah ? 
(Maybe you're asking something more specific, it this is the case I'm missing it)
which one ?
there was a few computer science exam recently, centrale's exam and also info A iirc 
oh and math info yeah
oooo beautiful
xDDD
at the end of the subject:

😘
whats llg
A preparatory class famous for being the most prestigious one here
and also the one with the best results yeah

is this an entrance exam??
it's one of the many exams you take
in France
you can go to the univ
but you can also do 2 year of preparatory class
to prepare entrance exams
for some prestigious schools
like the ENS
polytechnique
and other (mostly engineering) schools
this is one of the entrance exams
(Centrale)
i see
:))
for the ENS, more specifically 
(CENTRALE)
so what is this exam for
Mmh ? 
oh and yeah, centrale exists too
it's part of the exams to enter Polytechnique / ENS
and is one of the worst engineering school you can get ^^
considered as one of the hardest ones
so you would take it after you do 2 year of preparatory school in order to enter ENS?
(I'm joking, obviously, it's one of the best engineering school here)
sean
ah i see
I'm at Centrale, that's why he is trolling me
i cant read french but it definitely doesnt look easy
that's the maths A subject we were talkign about
which is considered classic as Shika said
i only partially understand the questions but i think most senior math students at my school would not pass this exam
so good students, those who aim to enter at the most prestigious schools, like ENS, do a lot of exercises, and when I mean a lot it's really a lot 
And they often use the same (online website or books) resources for that
it makes sense
most of my professors are from europe and asia and they talk about similar things
It's a week full of 8 hours of exam everyday, you have 4 actual math tests
A, B, C and D obv
so we call "classics" exercises that appears quite often in those resources
so you are multidisciplinary in that sense
(and some people call something classic if they know it (just 'cause they want to flex, tbh
))
i see
Like you Shika 😏
so how old are people when they finish preparatory school and start university?
obviously, my sole goal is to flex on you guys 
20 usually
but it's customary if you fail the first time
to do a third year of preparatory class
i see
(that happens a lot, I'd say something close to half of the people failing do this 3rd year)
by failing
I mean just not having a school you want
you can always go to classic univ
or to a school that accepted you but that is not as good as you wanted
is university paris 7 good
hmm depends 
my professor studied at ENS cachan and then did phd at university paris 7
i just checked his cv :p
I was 16 when I entered preparatory classes, and someone was 15
so it really depends, but yeah most people are 18 when they start their two years of preparatory classes
first 3 years => the overall level of the student is hmm.. how to put: garbage, like every univ in France (
)
after that => It's a good university yeah
(Idk if h. will agree with me when I say that every univ in France is garbage in the first 3 years
)
i know what you mean
I Agree
One exception : Dauphine
Sean if you are interested : https://www.sieben.fr/2014/01/02/prepa/
(Hmm, yeah Dauphine isn't that bad, still nowhere as near of a "bad" preparatory class though
)
that's an article about what is french prenpa
it's really unique
and has its own vocabulary in a sense
"they won’t all go to the Ecole Polytechnique. The renowned engineering schools are Centrale Paris, Supélec" Facts
😭
lol
thanks, i'll read it
Also I don't like the prepa system personally, but mostly because I don't think I'd like it lol 
You can't know before you try
Well I'm not planning on trying 
although
Ok
I'm planning on trying
but only one prepa
Wait, you are in france and you are not in prepa?
Because I made a promise to a friend, that I'd try join his ex-prepa @viral jolt 
And I finished mine !
But so you do not want to go to ENS?
(fr : Laquelle ?)
I don't, but I'm planning on doing it through the univ 
(Thiers, une prépa marseillaise +/- random)
Not random at all
(enfin elle a quand même été la prépa du major de l'X y'a 2 ou 3 ans
)
Wait
Idk how to write
I meant I do @chilly ocean*
"a student is called a 3/2 if he integrates the Ecole Polytechnique between his first and second year of preparatory class since the integral of x from 1 to 2 is 3/2"
lmfao
hey sorry quick question, where do i post general relativity questions
But I don't have a link sorry
and fields winner
Connyyyyyy teach me the ways 😆
so when students finish prepa to start ENS or something, they have a good understanding of algebra, analysis,topology,etc already?
mmh
highly depends on the student lol
linear algebra, analysis, topology on real normed vector space are covered in prepa
in some details
abstract algebra is covered, a bit
but point-set topology isn't at all
multivar calculus isn't covered in great details either
metric spaces aren't either (even though it's customary to speak about them a bit atleast)
but even stuff like quotient structures isn't supposed to be covered
some "good" preparatory classes do it, but not enough so that we can say it is "properly covered" 
forget stuff like group action or repr theory
As I said preparatory classes have a great culture of the exercises
and more particularly
of hard exercises
got it
of exercises that are particularly technical
when did u guys really start to "enjoy" maths like im in 3rd year undergrad and still dont rly enjoy it
sometimes i like it and sometimes i hate it :p
when i studied measure theory is when i really liked math
cause i liked the subject a lot
algebra is more boring and nonintuitive for me
So the subjects covered aren't particularly wide and aren't covered particularly deeply, but someone who finished prepa has already seen a fair bit of what we could call "completely" elementary mathematics, yeah, even though there's holes in what should be covered to say that @drowsy quest 
was there like a breaking point like oh wow maths is acctually enjoyable
I enjoy maths when I learn something particularly beautiful 
and that happens often enough to keep me interested over the time

i dont really know lol. i like to learn math but i dont know if i find it enjoyable
maybe this is why im quitting math for statistics
but the school im going to go to is known for being very theoretical for statistics
half the faculty are almost like probabilists
are you saying this like it's a bad thing or are you glad it's the case ? 
im glad
probability is my favorite subject
tbh, half the reason im doing stats is bc i was accepted into a much better statistics department vs math department
us
it makes me think of people liking pure maths that joins some engineering school after their prepa even though there's pretty much no pure math in the said school because they would feel bad if they did 2 year of prepa to finally join a math univ (since math univ is accessible directly after hs
)
(I'm not saying it's your case)
lol
my case is like, i liked probability, i like statistics enough, and i can get into a much better statistics department than math department
and job prospects are better for statistics tbh, both in industry and academic
Fair enough 
I was not that good at maths even tho I liked it, I reached my 'limits' in that sense during the preparaotry classes
Imo prep classes are just bad at helping people developing their potential in math, anyone that needs time to develop intuition wouldn't be able to "be good" in prepa, even though they could be really good (and I mean even better than fast people) with enough time
I know someone like that 
He did prepa and he was 2nd starting from the bottom during the first year in maths
and the prepa wasn't even good
so he left
and he joined univ
that is true, we don't have enough time, a chapter per week is overwhelming
He's know doing his phd in category theory 
so are you trying to skip prepa and attempt the entrance exam?
That's what I'm planning on doing yeah 
Focus on highschool, u still have history/french to deal with 😎

last time I was in my high school
like physically
was maybe
5 months ago
and that's not because of covid
my last "bulletin" (idk what's the english word, h. please translate it for me lol
) is literally just zeroes and "wtf he's never here who's that ?"

and some of my prof
aren't even joking
Since I've literally never been present in their classes 
'would say report'
attendance?
yeah, report with grades in it 
C1 fluent 😎
does that mean youre failing high school
does it matter what your grades are in highschool or only the entrance exams matter?
Yes 
well
to enter in uni, they don't really care
at the end of hs
you get some diploma
to atleast be allowed to enter uni
this diploma
is easy
like really easy
and that's not even flexing
there's something like 95% of success

But you need it
and well
I am never attending at my classes
so I repeat classes
I'll probably repeat the same class for the 2nd time this year 
(so next year I'll take the same class for the 3rd time
)
But I had a year of advance, so that's only be the first year where I'm actually a year older that then people with me 
Why don't you try to attend the exam this year, as a free candidate, so you can go to uni faster ?
I can do it this year, but that's exactly what I'm planning on doing next year 
soo isnt it a mistake to be not going to school? lol
university admissions are different in the US lol, if you fail classes in high school you're fucked
it is a mistake, somehow, but when I try to force myself, it huh.. doesn't quite work
we are one of the worst countries to be honest
yeah, hs in France really sucks 
that's why we have Exams after two years of preparatory classes
an exam means equal chances
for anyone
and to be fair we go from being the zero in hs, to top maths uni later on
that's why preparatory classes are so intense btw 
so that's not the potential of the excellent students that is controversial but more the politics set up
what u do in one year
in maths only
so you didn’t learn any math in hs you learned it all independently ?
chem
sport for X 😂
Yes 
I mean
when I started math on my own
I wasn't even able to add two fractions properly
(not even joking
)
I already had dropped out of school for 3 years, when I started learning maths, so my level was roughly the level of someone that stopped school in 8th grade + that forgot everything he learned before 8th grade (including 8th grade) 
(going to sleep, have fun guys)
Hi there, can i get some help with a galois theory problem?
let be p a prime, define K=Fp(t), then f=x^p-x +t is irreducible in K[x]. I need to show that K[x]/(f) is a Galois extension of K
I would just like to know where to start... should i use the definition?
Yes. What is required for an extension to be Galois?
That's true. Do we have a good guess about what polynomial should split in K[x]/f?
Hmm
Im actually quite confused about this field... like, i dont have any intuition of it
Well, in general, if f(x) is irreducible over any field K, the normal closure of K[x]/f is the splitting field of f(x). So if K[x]/f is normal, it should be the splitting field of f(x)
Yup. So we want to try to understand how the roots of f(x) are related
this is a pretty funny polynomial
why? lol
you'll see when you figure it out
once you do this
if K is a field
I mean, i get its probably finite
It is finite dimensional over K
oh I meant that it's a finite extension
are you asking if the field is finite?
Nope, the extension
Just to be clear, it is finite in the sense that it is a finite dimensional vector space over K. But as K is not finite, the extension field is not a finite field.
But this is what people mean when they say that a field extension is finite
Oh, yeah. I get that perfectly, thanks
Its just he said the field was finite, meaning the extension, and i got confused
here
He meant it is a finite extension
Yep, now i know that
Is there something wrong?
I know what it means an extension to be finite
I think we are all on the same page now
So the question remains, if one root of f is in K[x]/f, why are all of the roots there?
Hmm
Thats the adjunction ring (field in this case) of any root of f
Oh sorry, it is isomorphic to the adjunction of any root
It doesnt mean it has all roots
Not in general. But it should when the extension is normal
I know the class of x is a root in there
That is true. We want to try to understand how f(x) factor.
Let's try a different problem (that I think is more intuitive). I claim that if f(x)= x^(p-1)-t instead, the claim is still true, that K[x]/f is Galois
Is it irreducible too?
It is
Excelent
Ok, so we want to prove it is normal
And the guess for a polynomial that splits would be again f
Yup. But here we can more obviously write down what the roots are
What exactly do you mean by that? Is there only one?
Let's just pretend p=3
i thought there would be just one root, repeated p-1 times
How many solutions are there to x^2-t?
What are they?
t^{1/2} and its additive inverse
how about x^3-t?
I claim that we shouldn't think of t^1/2 and -t^1/2 as additive inverses, but rather as t^1/2 and (-1)t^1/2
Here, what we really care about is that (-1)^2=1
Isnt this just the same thing?
Technically, yes. But for the cube example, what we care about are the solutions to x^3=1
Oh, ok i get what you mean
And you are right, that we don't necessary know that K has cubic roots of unity
Yeah, thats my concern
But what about the p-1 roots of unity in F_p?
Ooooooh
If a homomorphism is two-to-one, does that mean its kernel necessarily has two elements?
Its just Fp
So what are the solutions to x^(p-1)-t?
Ok yes its fermats little theorem
for sure
Humm they would be t^{1/p-1} times any element of Fp*
So if I have one root of x^(p-1)-t in an extension of K, do I have the others?
Yes, since Fp is within K
Yup!
Youre a genius :D
So do you believe that K[x]/x^(p-1)-t is normal?
Indeed
I feel it kinda weird, but i suppose it makes sense
Like, the class of x is not in the form we were just talking about
But yeah, it is like an artificial root of f
and er is this the reason why it is separable too?
Like, the roots are all different
Since you know that the units of Fp are distinct, you get p-1 different roots
So yeah, you have seperability
Nice...
You can also check the gcd of f and f'
the derivative test
Yup. But f'=(p-1)x^(p-2) whose only root is 0, so it's relatively prime to f (which does not have 0 as a root)
Nice
and to extend to the x^p-x+t case... should i solve that equation and multiply by the elements of Fp* or something?
The symmetry is different here. But the idea is similar
(hint: try addition instead of multiplication)
That's why I did it first 🙂
Here a question: if alpha is a root of f(x), what is f(alpha+1)?
🙂
Because of char = 0
yup
:D
And are alpha and alpha+1 equal?
No, that would imply 1=0
Ok, i think thats pretty much it
Exactly hahaha
Your claim is certainly right
I appreciate all your help, thanks!!!
You're welcome!
Yes
do you know a reason for this?
Yes, that means theres only two elements that map to the identity
which is the definition of the kernel of an homomorphism
oh, of course. i feel stupid hahaha
Dont worry haha
ty
Np :D
Hey all, I've been tasked to do the following, given a cube centered at the origin of R^3. We consider the midpoints of each of the 12 edges of the cube. I'm tasked with verifying that these 12 vectors form a root system.
I'm sure this is trivial, but I can't even really think of what these vectors look like numerically
Well, if we assume the vertices are (\pm 1, \pm 1, \pm 1), then midpoints would be simply computed.
Let $\gamma$ be a root of the polynomial $x^2+1$. Consider an element $a\gamma+b\in\mathbb{F}_3(\gamma)$ with $a,b\in\mathbb{F}_3$ and $a\neq0$. What is its inverse in $\mathbb{F}_3(\gamma)$?
panoramatopia
i've calculated the inverses for each of the six elements described here
but i'm curious if there's a way that's more technical and calculates some generic form for all ay+b 
(a gamma + b)*(a gamma - b) should do the trick?
yeah thats what i got for all my results
i wonder if thats sufficient
yeah cuz
a^2=1 in F3
regardless of what a is
that would be (a^2 gamma^2 - b^2) = -(a^2+b^2) = 2-b^2 which is not 0 as b^2 = 0 or 1
so you'd get g^2-b^2=1 or g^2+1=0 which follows the polynomial
(a g - b)/(2-b^2) is the required inverse
mmm yeah you're right good catch
just noticed that looking at my individual inverses bc gamma*2gamma=0
=1?
braindead
sorry
yes
i stg my brain drops packets when i'm trying to talk about math
thank you for the help 
just a quick logic check--its sufficient to say that the order of an element $a$ in a cyclic group is $p_1^np_2\cdots$ as long as $a^{p_1},a^{p_1^2}...\neq1$, correct? e.g.--if $a^9=1$ and $a^3\neq1$ then the order of $a$ is 9
panoramatopia
are you checking over all divisors?
consider the group of units mod 7 that is, {1, 2, 3, 4, 5, 6} under multiplication modulo 7
can i say order of 2 is 6 = 2*3
because 2^2 is not 1 but 2^(2 * 3) = 1?
yes, checking over all divisors. in your example it wouldn't be true that the order is 6 because 2^3=8=1 mod 7
yep, then its fine
you can reduce your work a bit
a has order n if a^(n/p) is not 1 for any prime divisor of n and a^n = 1
great!
the example i was trying to show was just that ord(a) = 8 because a^2, a^4 != 1 and a^8 = 1
just wanted to brush up on my logic there
Sorry for another question but a classmate and i are stuck on this one problem: Show that at least one element of the set ${2,3,6}$ is square in $\mathbb{F}_p$ with $p\geq7$. So far we've supposed by contradiction that none of them are squares. Because $\mathbb{F}_p^\times$ is cyclic, then it has a generator $a$. Because none are squares, then for all $1\leq x,y,z\leq p-2$, it's true that $a^{2x}\not\equiv 2$, $a^{2y}\not\equiv 3$, and $a^{2z}\not\equiv 6$, all mod $p$. By extension $a^{2(x+y+z)}\not\equiv 36$ mod $p$. If we pick $x+y+z=p$ (which we can do because as shown $x$, $y$, and $z$ are all arbitrary) then we obtain $a^{2p}\not\equiv 36$ mod $p$ or $a^p\not\equiv 6$ mod $p$. By Fermat's Little Theorem, this states that $a\not\equiv 6$. This is a pretty easy counterexample in some fields but I'm not sure how to extend this upwards to all $\mathbb{F}_p$, and I'm also not sure if we made a leap in logic somewhere with all the incongruences
panoramatopia
that sounds like a weird problem
yeah
fuck me for having a number theorist as my algebra professor
It's actually a pretty cute problem
Generally try NOT to manipulate incongruences, as you might make a "leap in logic"
yeah that's what I was worried about
mmmmm yeah that's what i was worried about 
i can give you a proof with both using and not using the fact that multiplicative group of Fp is cyclic
which one do you want?
I'm a bit more interested in the one that uses its cyclic properties, as that was the hint my professor gave
okie so try to think about this. Say a was a generator.
Show that a (non-zero) element b is perfect square if and only if b = a^(2x) mod p
a^2x is clearly a perfect square, so what you need to show is, the other direction. That is if the exponent is not even, then the element isn't a perfect square. That is, a^(2x+1) can't be b^2 for some b.
Well, clearly b=a^r mod p for some r
yep
and because b is a perfect square, then you can take the square root of both sides and you should get a number that exists in F_p, that is, a^(r/2)=a^q mod p
Square both sides and you get a^r=a^2q mod p
but are you saying r is even in this case?
how do you just take square roots?
if r was odd then a^(r/2) doesn't make sense. Also there are 2 square roots for a number, which one do you use?
more precisely i want you to show that something is not square if and only if the exponent would be odd
alright
clearly if it's not square then the exponent is odd
because an even exponent implies a square, as you've shown
yea so say a^(2x+1) = c^2 then c = a^y and hence we'll get a^(2x+1) = a^(2y) is this bad?
if we have a^r=b mod p with odd r, then we can multiply both sides by a to get a^(r+1)=ab mod p. Clearly r+1 is even so ab is a perfect square then. However, this would imply both a and b have a square root, but a has odd order because it generates a group with prime degree.
uhhhh but then that circles back to the beginning of the sentence lol
and yes that is bad
because then you're saying that an even number is equivalent to an odd number
mmmmmmm
how does ab being square imply both a and b have a square root?
there is a missing step which lets you conclude this
it doesn't, disregard my logic
well, if both 2x+1 and 2y are less than p then the problem is done, because all powers of a under a^p are distinct
yea so the problem is this would tell us that
a^(2(x-y)+1) = 1
yep that's one way to say it
but generally you'll see this argument more. order of a is (p-1) hence (p-1) divides 2(x-y)+1
but if p is an odd prime then i get 2 divides 2(x-y)+1
and 2(x-y)+1 is odd
i see
alright, so we've shown that a perfect square must be an even power of the generator
yea so what we proved is a number is perfect square if its some even power of the generator and its not a perfect square if its odd power of the generator
i guess the logical next step would be to prove that 2, 3, and 6 can't all be odd powers of the generator
ohhhhh
if either of 2 or 3 are perfect square then we're done!
and if they are not, 2 = a^r and 3 = a^s with r and s odd
this gives 6 = a^(r+s) but (r+s) is even hence in this case 6 is a perfect square
What is generally done is, with this you can define
$\left(\frac{a}{p}\right) = \begin{cases}0 & a \equiv 0 \pmod p\ 1 & a \text{ is a quadratic residue}\-1 & a \text{ is a quadratic non-residue}\end{cases}$
det
quadratic residue is just a fancy name for perfect square
with what we just prove, you can write it neatly as
$\left(\frac{ab}{p}\right)=\left(\frac{a}{p}\right)\left(\frac{b}{p}\right)$
det
(just to be clear, these are not fraction, its just a notation. its called the Legendre's symbol)
if a and b are not perfect squares then their product is.
yep
wow
one nice thing you get from the problem is this
i was wondering what the significance of 2, 3, and 6 was
det
oh lol
- at least one root that is
16 is a perfect 8th power modulo every prime, but its not a perfect 8th power in Z
you can give it a shot if you're bored
hahaha i very well might
its same as saying (x^8 - 16) has a root in any Fp but not in Z
hi, could someone recommend me a book or document to read about properties of homomorphisms between complex tori?
alternatively, isogenies between elliptic curves?
Yes, something like that, but not too advanced
how did you define ideal?
ideal is the integers
what?
i'm confused
Show the whole question please
And give your definition of an ideal of a ring
Okay, definition.
an ideal is a subring which satisfies if a,b is in R then a-b is in R and say r is in the ideal then ra=ar is in R
is that the definition you wanted?
Yes
Now if you want to show a subset, take an element of the smaller set and show it belongs in the larger set
It follows like immediately from the defn
Can you write it out properly
so would the smallest integer be just n
because when you multiply n.z the smallest positive integer would be 1*n = n
n can be any element of I
But it is the smallest one in this case
Since they say that in b
Ideals are not subrings
ideals very much are subrings
they just so happen to satisfy conditions even stronger than ones for being a subring
they're special subrings
That depends on your definition of "ring"
If you take unital rings then no
well I don't do the ring/rng fuckery
They are only subrings if you are working with rngs and that's certainly not standard
Nonunital rings seems more common in the theory of noncommutative rings. But in commutative settings, I almost always seen ring to mean unital, as well.
Even in non commutative rings I've only seen unital being assumed
I've seen some noncommutative geometry people explicitly want nonunital rings. For what it's worth, Dummit+Foote do not require ring in their basic definition, so this definition definitely does persist at large
I see
Hmmm, I'm trying to find two finite abelian groups G & H such that:
C[G] ≅ C[H] as complex group-algebras
but R[G] ≇ R[H] as real group-algebras
And ngl.. I'm kinda stuck n.n;;
I think if I pick G & H to be finite with the same order, then C[G] ≅ C[H] would follow immediately
But I don't really know how to mess with R[G] ≇ R[H]
If you know there is a convention where ideals are subrings and someone says that is their definition, idk why you would reply to them that ideals aren't subrings 
I wasn't even aware there was a convention where rings are actually rngs
Because I have only ever seen unital rings
Consider the answer to this question, and see if you find it inspiring: https://mathoverflow.net/questions/229213/a-group-algebra-isomorphism-problem
Hmmm, well all the criteria is automatically upheld except for nth roots of unity.
Which to me, suggests I should pick C4 (so roots would be 1, -1, i, -i) and C2 x C2 which does have all it's roots in R.
So I'm guessing R[C4] ≅ R x R x C
and I'm guessing R[C2 x C2] ≅ R x R x R x R
Is this what you were hinting at by posting this link?
yup
I'm not actually sure about the isomorphism type of R[C4]. But it does have an element of order 4, which R[C2xC2] does not
I am reading a proof about the simplicity of A_n. Is the red part in the image really necessary? Would the proof still be valid if we just ignored it?
In a ring, we have the distributive property a * (b + c) = a * b + a * c, where * is the multiplication in the ring and + is the addition in the ring. But * does not necessarily have to be commutative
However, we must also have (b + c) * a = b * a + c * a be satisfied.
So I am confused.
Or is it that they have to be satisfied, but it is not necessarily the case that a * (b + c) = (b + c) * a?
You don't get a*(b+c)=(b+c)*a
So it's the latter of what I wrote?
Yes
I mean, I can surely find a tau that doesn't commute with sigma and that fixes both sigma(i) and i without having to know that all the cycles in sigma have the same length, right?
yea looks good to me
lemme think again tho
it could just serve as a tool to reduce the number of cases that you need to consider to show that such a tau indeed exists?
for this question can i just prove it by just stating the def of the ideals
So we want a $\tau$ such that $\tau \sigma \tau^{-1} \neq \sigma$. Let $\sigma = (a_1 a_2 \cdots)(b_1b_2 \cdots)$. Then $\tau \sigma \tau^{-1} = (\tau(a_1)\tau(a_2) \cdots)(\tau(b_1)\tau(b_2) \cdots)$. The lenght of $\sigma$ is greater or equal to 6. Tau must fix 2 elements, which means that 4, at minimum, must be permuted. But tau is a double transposition so we could always find a tau that doesn't commute with sigma. I really don't understand why the cycles need to have the same length...
older sister
(just to confirm, by double transpositions we just mean product of 2 transpositions and not product of 2 disjoint transpositions, right)
Yes, I mean tau = (ab)(cd) where a, b, c and d are different
but then what if n = 5, sigma = (12)(34)(56)?
none of (34)(56), (35)(46) or (36)(45) would work.
But how do you know that the above sigma is in the normal group N?
yeah but your sigma is not even, right?
It seems so weird because I can't find any reason why knowing that all the cycles in the decomposition of sigma has the same length would help. It also feels weird for a proof to have unnecessary information...
if i have some u,v
but u and v aren't multiples of each other
would the gcd(u,v) be the smallest postive integer
It would be 1, I think, because u and v are relatively prime
could i say that 1 is say d or something arbitary
that belongs to an ideal in the integers?
i'll probably just assume its there to help you find such a tau? for instance I could take 2 cases sigma(sigma(i)) = i and sigma(sigma(i)) = j which is not i. In the second case we can consider tau to be (sigma(i), a)(b c) where a and j are different and in the first case that helps a bit to see how sigma would look like, it will just be a product of 2 cycles.
yeah that might be the case, I am not entirely sure
what about 4 and 6
oopsie
triyng to something likt
a is an element of an ideal where a is the smallest positive integer
Then a generates that ideal I think if a is the smallest positive integer in the ideal, assuming we are talking about ideals in Z






