Degree (mathematics)
From Wikipedia, the free encyclopedia
In mathematics, there are several meanings of degree depending on the subject.
Unit of angleA degree (in full, a degree of arc, arc degree, or arcdegree), usually denoted by ° (the degree symbol), is a measurement of plane angle, representing 1⁄360 of a full rotation. When that angle is with respect to a reference meridian, it indicates a location along a great circle of a sphere, such as Earth (see Geographic coordinate system), Mars, or the celestial sphere.[1] Degree of a polynomialThe degree of a term of a polynomial in one variable is the exponent on the variable in that term; the degree of a polynomial is the highest such degree. For example, in 2x3 + 4x2 + x + 7, the term of highest degree is 2x3; this term, and therefore the entire polynomial, are said to have degree 3. For polynomials in two or more variables, the degree of a term is the sum of the exponents of the variables in the term; the degree of the polynomial is again the highest such degree. For example, the polynomial x2y2 + 3x3 + 4y has degree 4, the same degree as the term x2y2. Degree of an algebraic numberThe degree of an algebraic number is the smallest degree of a non-trivial polynomial in one variable with rational coefficients having said algebraic number as a root. For instance, any rational number Failed to parse (Missing texvc executable; please see math/README to configure.): q is degree 1 since it is the root of the polynomial Failed to parse (Missing texvc executable; please see math/README to configure.): x\mapsto x-q . Additionally, the square root of any non-square positive integer, say Failed to parse (Missing texvc executable; please see math/README to configure.): \sqrt n , is degree 2, as it is the root of Failed to parse (Missing texvc executable; please see math/README to configure.): x\mapsto x^2-n . Degree of a field extensionGiven a field extension K/F, the field K can be considered as a vector space over the field F. The dimension of this vector space is the degree of the extension and is denoted by [K : F]. Degree of a vertex in a graphIn graph theory, the degree of a vertex in a graph is the number of edges incident to that vertex — in other words, the number of lines coming out of the point. In a directed graph, the indegree and outdegree count the number of directed edges coming into and out of a vertex respectively. Degree of a continuous mapIn topology, the term degree is applied to continuous maps between manifolds of the same dimension. From a circle to itselfThe simplest and most important case is the degree of a continuous map
. There is a projection
, Failed to parse (Missing texvc executable; please see math/README to configure.): x\mapsto [x] , where Failed to parse (Missing texvc executable; please see math/README to configure.): [x] is the equivalence class of Failed to parse (Missing texvc executable; please see math/README to configure.): x modulo1 (i.e. Failed to parse (Missing texvc executable; please see math/README to configure.): x\sim y if and only if Failed to parse (Missing texvc executable; please see math/README to configure.): x-y is an integer). If Failed to parse (Missing texvc executable; please see math/README to configure.): f : S^1 \to S^1 \, is continuous then there exists a continuous Failed to parse (Missing texvc executable; please see math/README to configure.): F : \mathbb R \to \mathbb R , called a lift of Failed to parse (Missing texvc executable; please see math/README to configure.): f to Failed to parse (Missing texvc executable; please see math/README to configure.): \mathbb R , such that Failed to parse (Missing texvc executable; please see math/README to configure.): f([z]) = [F(z)] \, . Such a lift is unique up to an additive integer constant and Failed to parse (Missing texvc executable; please see math/README to configure.): deg(f)= F(x + 1)-F(x) \, . Note that Failed to parse (Missing texvc executable; please see math/README to configure.): F(x + 1)-F(x) is an integer and it is also continuous with respect to Failed to parse (Missing texvc executable; please see math/README to configure.): x
. Between manifoldsLet Failed to parse (Missing texvc executable; please see math/README to configure.): f:X\to Y \, be a continuous map, Failed to parse (Missing texvc executable; please see math/README to configure.): X and Failed to parse (Missing texvc executable; please see math/README to configure.): Y closed oriented Failed to parse (Missing texvc executable; please see math/README to configure.): m -dimensional manifolds. Then the degree of Failed to parse (Missing texvc executable; please see math/README to configure.): f is an integer such that
is the map induced on the Failed to parse (Missing texvc executable; please see math/README to configure.): m dimensional homology group, Failed to parse (Missing texvc executable; please see math/README to configure.): [X] and Failed to parse (Missing texvc executable; please see math/README to configure.): [Y] denote the fundamental classes of Failed to parse (Missing texvc executable; please see math/README to configure.): X and Failed to parse (Missing texvc executable; please see math/README to configure.): Y . Here is the easiest way to calculate the degree: If Failed to parse (Missing texvc executable; please see math/README to configure.): f
is smooth and Failed to parse (Missing texvc executable; please see math/README to configure.): p
is a regular value of Failed to parse (Missing texvc executable; please see math/README to configure.): f
then Failed to parse (Missing texvc executable; please see math/README to configure.): f^{-1}(p)=\{x_1,x_2,..,x_n\} \,
is a finite number of points. In a neighborhood of each the map Failed to parse (Missing texvc executable; please see math/README to configure.): f
is a homeomorphism to its image, so it might be orientation preserving or orientation reversing. If Failed to parse (Missing texvc executable; please see math/README to configure.): m
is the number of orientation preserving and Failed to parse (Missing texvc executable; please see math/README to configure.): k
is the number of orientation reversing locations, then Failed to parse (Missing texvc executable; please see math/README to configure.): deg(f)=m-k \,
. The same definition works for compact manifolds with boundary but then Failed to parse (Missing texvc executable; please see math/README to configure.): f should send the boundary of Failed to parse (Missing texvc executable; please see math/README to configure.): X to the boundary of Failed to parse (Missing texvc executable; please see math/README to configure.): Y . One can also define degree modulo 2 (deg2(f)) the same way as before but taking the fundamental class in Z2 homology. In this case deg2(f) is element of Z2, the manifolds need not be orientable and if Failed to parse (Missing texvc executable; please see math/README to configure.): f^{-1}(p)=\{x_1,x_2,..,x_n\} \, as before then deg2(f) is n modulo 2. PropertiesThe degree of map is a homotopy invariant; moreover for continuous maps from the sphere to itself it is a complete homotopy invariant, i.e. two maps Failed to parse (Missing texvc executable; please see math/README to configure.): f,g:S^n\to S^n \, are homotopic if and only if deg(f) = deg(g). Degree of freedomA degree of freedom is a concept in mathematics, statistics, physics and engineering. See degrees of freedom. References
|


