#Field
22 messages · Page 1 of 1 (latest)
Addict
- Do not ping the Moderators, unless someone is breaking the rules.
- Do not ping the Helper Moderators, unless there is a conflict between helpers.
- Do not ping other members randomly for help.
- Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
- Wait patiently for a helper to come along.
- If the Helper has answered your question, remember to thank them with the Mathematics Ranks bot and close the thread with:
+close
Feel free to nominate the person for helper of the week in #helper-nominations
If you're happy with the help you got here, and the server overall, you can contribute financially as well:
The quotient is in bijection with K^(deg(f))
Like for concreteness, R[x]/(x^2+1) is {[ax+b]|a,b in R, x^2=-1}, so each equivalence class maps to a point in the plane
So... there's not finitely many equivalence classes (unless K itself is finite)
Yeah I think simplest example would be K[x]/(x), which is just K again
You take polynomials over K, you remove all multiples of x (so elements of the ideal of x), what you're left over with is just the constant term in K, so if K is infinite K[x]/(x) will be infinite too.
Am I saying weird or incorrect stuff @sullen bison? 😰
Better to have let them respond to the already given response.
Just trying to clarify but alright 🤷♂️
Thought K[x]/(x) was simplest way to see what happens. Although the construction of C is a neat example indeed, one which you might actually see in the wild.
Could you explain in detail how all these cosets are reduced to linear polynomials? From my understanding $(x^2 + 1)$ is the set of all multiples of $x^2 + 1$?
Addict
The quotient contains remainders when you divide by the ideal generator
Dividing by x^2+1 gives remainders of degree at most 1
It's clear that, for any polynomial f, g is equivalent mod (f) to a polynomial of degree at most deg(f)-1.
g=fq+r implies g-r is in (f) and deg(r)<deg(f)
So the equivalence classes mod (f) can be represented by remainders when dividing by f
Oh, ok thanks
That's what I thought originally, but for some reason I thought there would be only one equivalence class of linear polynomials but there is not
@vagrant apex
Hello normality_is_a_lie, this is a friendly reminder that your help request has been inactive for more than 24 hours. If you no longer need assistance, please consider closing the thread using the +close command. This thread will be automatically closed in 3 days if it remains inactive.