Definition:Degree of Polynomial/Field
Jump to navigation
Jump to search
![]() | This article is complete as far as it goes, but it could do with expansion. In particular: Include the specific examples of where the field is Real and Complex numbers. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding this information. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Expand}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |
Definition
Let $\struct {F, +, \times}$ be a field whose zero is $0_F$.
Let $\struct {K, +, \times}$ be a subfield of $F$.
Let $x \in F$.
Let $\ds f = \sum_{j \mathop = 0}^n \paren {a_j x^j} = a_0 + a_1 x + \cdots + a_n x^n$ be a polynomial over $K$ in $x$ such that $a_n \ne 0$.
Then the degree of $f$ is $n$.
The degree of $f$ can be denoted $\map \deg f$ or $\partial f$.
Also known as
The degree of a polynomial $f$ is also sometimes called the order of $f$.
Some sources denote $\map \deg f$ by $\partial f$ or $\map \partial f$.
Sources
![]() | This page has been identified as a candidate for refactoring of medium complexity. In particular: this source talks about polynomial equations Until this has been finished, please leave {{Refactor}} in the code.
New contributors: Refactoring is a task which is expected to be undertaken by experienced editors only. Because of the underlying complexity of the work needed, it is recommended that you do not embark on a refactoring task until you have become familiar with the structural nature of pages of $\mathsf{Pr} \infty \mathsf{fWiki}$.To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Refactor}} from the code. |
- 1981: Murray R. Spiegel: Theory and Problems of Complex Variables (SI ed.) ... (previous) ... (next): $1$: Complex Numbers: Polynomial Equations