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

  • MHB
  • Thread starter Math Amateur
  • Start date
In summary: They have provided a solution that shows that every element in an ideal generated by $x+y$ and $x-y$ can be expressed in the form $h_3x + h_4y$. However, they omitted to point out that this works because the fraction $\frac12$ is in $\mathbb{Q}.$
  • #1
Math Amateur
Gold Member
MHB
3,998
48
I am reading Chapter 1, Section 4, Cox et al "Ideals, Varieties and Algorithms"

Exercise 3(a) reads as follows:

In \(\displaystyle \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

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

Ideal generated by x, y is the ideal

\(\displaystyle h_3 x + h_4 y \) where \(\displaystyle h_3, h_4 \in \mathbb{Q}[x,y] \)

So

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

\(\displaystyle = (h_1 + h_2)x + (h_1 - h_2)y \)

\(\displaystyle = h_3x + h_4y \)

\(\displaystyle <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
  • #2
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}.$
 
  • #3
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
 

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

What is the purpose of solving ideals in Q[x,y]?

The purpose of solving ideals in Q[x,y] is to find a set of generators for the ideal, which represents all possible combinations of polynomials in Q[x,y] that equal zero. This allows for a more efficient way to manipulate and analyze polynomial equations.

What is the difference between solving ideals in Q[x,y] and solving equations in Q[x,y]?

Solving ideals in Q[x,y] involves finding a set of generators for the ideal, while solving equations in Q[x,y] involves finding specific solutions for a given equation. Solving ideals is a more general approach compared to solving equations.

What are the main techniques for solving ideals in Q[x,y]?

The main techniques for solving ideals in Q[x,y] include using the division algorithm, substitution, and elimination. These techniques allow for the reduction of polynomials to simpler forms, making it easier to find generators for the ideal.

What is the significance of Cox et al Chapter 1 Section 4 in understanding ideals in Q[x,y]?

Cox et al Chapter 1 Section 4 provides a comprehensive overview of solving ideals in Q[x,y] and introduces important concepts such as Gröbner bases and the Buchberger algorithm. It also includes examples and exercises to help readers understand and apply the techniques.

How can solving ideals in Q[x,y] be applied in real-world situations?

Solving ideals in Q[x,y] has applications in various fields such as coding theory, cryptography, and computer-aided design. It can also be used to study the geometry and topology of algebraic curves and surfaces.

Back
Top