MHB Solving Ideals in Q[x,y]: Cox et al Chapter 1 Section 4

  • Thread starter Thread starter Math Amateur
  • Start date Start date
Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
I am reading Chapter 1, Section 4, Cox et al "Ideals, Varieties and Algorithms"

Exercise 3(a) reads as follows:

In $$ \mathbb{Q}[x,y] $$ show the following equality of ideals:

<x + y, x - y > = <x, y>

I would appreciate help with this problem.

====================================================

My 'solution' (of which I am most unsure!) is as follows:

Idea generated by x + y, x - y is the ideal

$$ h_1 ( x + y) + h_2 (x - y)$$ where $$ h_1, h_2 \in \mathbb{Q}[x,y] $$

Ideal generated by x, y is the ideal

$$ h_3 x + h_4 y $$ where $$ h_3, h_4 \in \mathbb{Q}[x,y] $$

So

$$ h_1(x + y) + h_2 (x - y) = h_1x + h_1y + h_2x - h_2y $$

$$ = (h_1 + h_2)x + (h_1 - h_2)y $$

$$ = h_3x + h_4y $$

$$ <x,y> $$

Can someone please either correct this reasoning or confirm that is is correct/adequate.

Peter

[This is also posted on MHF]
 
Physics news on Phys.org
Your equation $$\begin{aligned} h_1(x + y) + h_2 (x - y) &= h_1x + h_1y + h_2x - h_2y \\ &= (h_1 + h_2)x + (h_1 - h_2)y \\ &= h_3x + h_4y \end{aligned}$$ shows that every element $h_1(x + y) + h_2 (x - y)$ in the ideal $\langle x+y,x-y\rangle$ generated by $x+y$ and $x-y$ can be expressed in the form $h_3x + h_4y$, where $h_3 = h_1+h_2$ and $h_4 = h_1-h_2$. This shows that $\langle x+y,x-y\rangle \subseteq \langle x,y\rangle.$

So far, so good. To show the reverse inclusion, you must start with an element $h_3x + h_4y \in \langle x,y\rangle$ and express it in the form $h_1(x + y) + h_2 (x - y)$. Your equation shows that this can be done by taking $h_1 = \frac12(h_3+h_4)$ and $h_2 = \frac12(h_3-h_4)$. What you omitted from your solution was to point out that this works, because the fraction $\frac12$ is in $\mathbb{Q}$.

Notice that if the question had asked you to show the same result in $\mathbb{Z}[x,y]$ then it would no longer have been correct, because the fraction $\frac12$ is not available in $\mathbb{Z}.$
 
Opalg said:
Your equation $$\begin{aligned} h_1(x + y) + h_2 (x - y) &= h_1x + h_1y + h_2x - h_2y \\ &= (h_1 + h_2)x + (h_1 - h_2)y \\ &= h_3x + h_4y \end{aligned}$$ shows that every element $h_1(x + y) + h_2 (x - y)$ in the ideal $\langle x+y,x-y\rangle$ generated by $x+y$ and $x-y$ can be expressed in the form $h_3x + h_4y$, where $h_3 = h_1+h_2$ and $h_4 = h_1-h_2$. This shows that $\langle x+y,x-y\rangle \subseteq \langle x,y\rangle.$

So far, so good. To show the reverse inclusion, you must start with an element $h_3x + h_4y \in \langle x,y\rangle$ and express it in the form $h_1(x + y) + h_2 (x - y)$. Your equation shows that this can be done by taking $h_1 = \frac12(h_3+h_4)$ and $h_2 = \frac12(h_3-h_4)$. What you omitted from your solution was to point out that this works, because the fraction $\frac12$ is in $\mathbb{Q}$.

Notice that if the question had asked you to show the same result in $\mathbb{Z}[x,y]$ then it would no longer have been correct, because the fraction $\frac12$ is not available in$\mathbb{Z}.$
Thanks OpalgReally appreciate your help
Peter
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
Back
Top