MHB Affine Algebraic Sets in A^2 - Dummit and Foote, page 660, Example 3

  • Thread starter Thread starter Math Amateur
  • Start date Start date
  • Tags Tags
    Example Sets
Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
[I apologise for repeating this post ... but I genuinely would like help ... and the post comes from September 2015 ... and so is not an impatient "bump" of an item ... I hope administrators will understand ...]

=====================================================I am trying to gain an understanding of the basics of elementary algebraic geometry and am reading Dummit and Foote Chapter 15: Commutative Rings and Algebraic Geometry ...

At present I am focused on Section 15.1 Noetherian Rings and Affine Algebraic Sets ... ...

I need someone to help me to fully understand the reasoning/analysis behind one of the statements in Example (3) on Page 660 of D&F ...

On page 660 (in Section 15.1) of D&F we find the following text and examples (I am specifically focused on Example (3)):https://www.physicsforums.com/attachments/5664
In the above text, in Example (3), we find the following:

"... ... For any polynomial $$f(x,y) \in k[x,y]$$ we can write

$$f(x,y) = f_0(x) + f_1(x)y + (x^3 - y^2) g(x,y).$$"Can someone explain ( :( slowly and carefully) exactly how/why this is true ... ...

Peter====================================================

In order for readers of the above post to understand the context of the question and the notation employed I am providing the introductory pages on affine algebraic sets in the D&F text ... ... as follows:View attachment 5665
View attachment 5666
View attachment 5667
 
Physics news on Phys.org
By definition $k[x,y] = (k[x])[y]$. So every polynomial in $k[x,y]$ is a polynomial in $y$ with coefficients in $k[x]$. The Euclidean algorithm over $k[x]$ yields $f(x,y) = (x^3 - y^2)g(x,y) + r(x,y)$ where $0 \le \operatorname{deg}_y(r(x,y)) < 2$ (note: $\operatorname{deg}_y p(x,y)$ denotes the degree of $p(x,y)$ as a polynomial in $y$). So $r(x,y) = f_0(x) + f_1(x)y$ for some $f_0(x), f_1(x)\in k[x]$.
 
Euge said:
By definition $k[x,y] = (k[x])[y]$. So every polynomial in $k[x,y]$ is a polynomial in $y$ with coefficients in $k[x]$. The Euclidean algorithm over $k[x]$ yields $f(x,y) = (x^3 - y^2)g(x,y) + r(x,y)$ where $0 \le \operatorname{deg}_y(r(x,y)) < 2$ (note: $\operatorname{deg}_y p(x,y)$ denotes the degree of $p(x,y)$ as a polynomial in $y$). So $r(x,y) = f_0(x) + f_1(x)y$ for some $f_0(x), f_1(x)\in k[x]$.

Thanks so much for the help Euge ... much appreciated ...

Sorry for the late reply ... i have been ill with the flu ... just recovering ...

Thanks again,

Peter
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top