Jump to content

Primitive part and content

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Loraof (talk | contribs) at 20:09, 3 July 2016 (top: "content unity" might be misinterpreted as "unity of content", a non-quantitative concept). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In algebra, the content of a polynomial with integer coefficients is the greatest common factor of its coefficients. Thus, e.g., the content of equals 2, since this is the greatest common factor of 12, 30, and -20. The definition may be extended to polynomials with coefficients in any fixed unique factorization domain.

A polynomial is primitive if its content equals 1.

Gauss's lemma for polynomials states that the product of primitive polynomials (with coefficients in the same unique factorization domain) also is primitive. Equivalently, it may be expressed as stating that the content of the product of two polynomials is the product of their contents.

See also

References

  • B. Hartley; T.O. Hawkes (1970). Rings, modules and linear algebra. Chapman and Hall. ISBN 0-412-09810-5.
  • Page 181 of Lang, Serge (1993), Algebra (Third ed.), Reading, Mass.: Addison-Wesley, ISBN 978-0-201-55540-0, Zbl 0848.13001
  • David Sharpe (1987). Rings and factorization. Cambridge University Press. pp. 68–69. ISBN 0-521-33718-6.