Find polynomials in S, then find basis for ideal (S)

That works.In summary, the conversation is about two questions related to the set S, which consists of polynomials in Q[X,Y] that are symmetric and have a degree greater than or equal to 0. The first question asks for two polynomials that belong to S, and the second question asks for a finite basis of the ideal generated by S. The second question is also given in the context of a new set S, where the polynomials must satisfy the condition that f(X,Y)=-f(Y,X). The conversation also includes some clarification on Q[X,Y] and examples of polynomials that belong to S.
  • #1
rapid1
13
0
Hi There,

I posted this question over at MHF to no avail, I'm not really sure what the ruling is on this kind of thing, I know this site was setup when MHF was down for a long time but you seem to still be active and a lot of clever people are still here so hopefully you don't mind taking a look at this for me :)

I have a couple of example questions that I'm trying to get my head around, a bit of guidance would be fabulous.\(S:=\{f\in\mathcal{Q}[X,Y]\mid f(X,Y)=f(Y,X) \mbox{ and } \deg(f)\geq 0\}\)1a: Give two polynomials that belong to \(S\).
1b: Find a finite basis of the ideal \((S)\) of \(\mathcal{Q}[X,Y]\) and justify your answer.I then have the question where the questions are the same but based on this
\(S:=\{f\in\mathcal{Q}[X,Y]\mid f(X,Y)=-f(Y,X)\}.\)
 
Physics news on Phys.org
  • #2
rapid said:
Hi There,

I posted this question over at MHF to no avail, I'm not really sure what the ruling is on this kind of thing, I know this site was setup when MHF was down for a long time but you seem to still be active and a lot of clever people are still here so hopefully you don't mind taking a look at this for me :)

I have a couple of example questions that I'm trying to get my head around, a bit of guidance would be fabulous.\(S:=\{f\in\mathcal{Q}[X,Y]\mid f(X,Y)=f(Y,X) \mbox{ and } \deg(f)\geq 0\}\)1a: Give two polynomials that belong to \(S\).
Do you understand what Q[X,Y] is? It is the set of all polynomials in variables X and Y with rational coefficients. Examples are X+ Y, [tex]3X^2+ 2Y[/tex], and [tex]X^2+ XY+ Y^2[tex]
To be in S requires that it be symmetric- that is that swapping X and Y does not change the polynomial. X+ Y and [tex]X^2+ XY+ Y^2[/tex] are in S but [tex]3X^2+ 2Y[/tex] is not.

1b: Find a finite basis of the ideal \((S)\) of \(\mathcal{Q}[X,Y]\) and justify your answer.I then have the question where the questions are the same but based on this
\(S:=\{f\in\mathcal{Q}[X,Y]\mid f(X,Y)=-f(Y,X)\}.\)
 
  • #3
Yeh, I thought that would be the case, thanks for confirming. What about part b however, a finite basis?

Also with the second question where \(f(X,Y)=-f(Y,X)\) I'm honestly struggling to think of any polynomials, other than \(0\), that fit because the minus makes it more tricky.
 
  • #4
rapid said:
Also with the second question where \(f(X,Y)=-f(Y,X)\) I'm honestly struggling to think of any polynomials, other than \(0\), that fit because the minus makes it more tricky.
How about $X-Y$ ?
 
  • #5


1a: Two polynomials that belong to S are \(f(X,Y)=X^2+Y^2\) and \(g(X,Y)=X^3+Y^3\).

1b: A finite basis for the ideal \((S)\) can be given by the set \(\{X^2+Y^2, X^3+Y^3\}\). This set spans the ideal because any polynomial \(f\in S\) can be written as a linear combination of these two polynomials (since any polynomial in \(S\) must have terms of even degree and terms of odd degree). This set is also linearly independent, as there is no non-zero linear combination of these two polynomials that will give the zero polynomial. Therefore, this set forms a basis for the ideal \((S)\).

For the second question, a similar approach can be taken. A finite basis for the ideal \((S)\) can be given by the set \(\{X^2, XY, Y^2\}\). This set also spans the ideal because any polynomial \(f\in S\) can be written as a linear combination of these three polynomials. This set is also linearly independent, as there is no non-zero linear combination of these three polynomials that will give the zero polynomial. Therefore, this set forms a basis for the ideal \((S)\).
 

FAQ: Find polynomials in S, then find basis for ideal (S)

1. What is a polynomial?

A polynomial is a mathematical expression consisting of variables (usually represented by letters), coefficients (numbers multiplied by the variables), and exponents (powers to which the variables are raised). It follows the form of ax^n + bx^(n-1) + ... + zx + c, where a, b, ..., z are the coefficients and n is a positive integer.

2. What is an ideal?

An ideal is a mathematical concept in abstract algebra that represents a subset of a given mathematical structure (such as a ring or field) that is closed under addition, subtraction, and multiplication by any element of the structure. In simpler terms, it is a set of elements that, when multiplied or added together, always result in another element within the set.

3. How do you find polynomials in S?

To find polynomials in S, you need to first determine the set S and its elements. Then, you can look for expressions that follow the form of a polynomial (ax^n + bx^(n-1) + ... + zx + c) where a, b, ..., z are elements of S and n is a positive integer. These expressions will be the polynomials in S.

4. How do you find the basis for an ideal in S?

To find the basis for an ideal in S, you need to first determine the set S and its elements. Then, you can look for a subset of S that satisfies the properties of an ideal (closure under addition, subtraction, and multiplication by any element in S). This subset will be the basis for the ideal in S.

5. Are there any specific methods for finding polynomials and basis for ideals in S?

Yes, there are specific methods such as the Gröbner basis method and the Hilbert basis theorem that can be used to find polynomials and basis for ideals in S. However, the best approach may vary depending on the specific characteristics and properties of S. It is recommended to consult a mathematics textbook or seek guidance from a mathematician for a more in-depth understanding of these methods.

Similar threads

Replies
34
Views
2K
Replies
52
Views
3K
Replies
2
Views
1K
Replies
24
Views
4K
Replies
1
Views
1K
Replies
1
Views
1K
Replies
1
Views
1K
Back
Top