Ideals with subsets and divides

  • Thread starter Thread starter phyguy321
  • Start date Start date
  • Tags Tags
    Subsets
phyguy321
Messages
45
Reaction score
0

Homework Statement


Let I = <f(x)>, J =<g(x)> be ideals in F[x]. prove that I\subsetJ \leftrightarrow g(x)|f(x)

Homework Equations





The Attempt at a Solution


If I is a subset of J then does that mean that f is in J also and by definition of an ideal g*some b in J must equal something in J so g|f? because g|f means that f=bg for some b in J
 
Physics news on Phys.org
phyguy321 said:
If I is a subset of J then does that mean that f is in J
Correct.

also and by definition of an ideal g*some b in J must equal something in J so g|f? because g|f means that f=bg for some b in J
Sort of. I would just use the fact that J is generated by g(x).
 
what does it mean that J is generated by g(x)? in layman's terms
 
It means J = {a(x)g(x) : a(x) in F[x]}, in other words J is the set of all "multiples" of g(x).
 
So if f(x) is in J and J = {a(x)g(x): a(x) in F[x]} then f(x) = a(x)g(x) therefore g(x)|f(x)?
 
Correct.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top