|
Monic Polynomial
In algebra, a monic polynomial is a non-zero univariate polynomial (that is, a polynomial in a single variable) in which the leading coefficient (the nonzero coefficient of highest degree) is equal to 1. That is to say, a monic polynomial is one that can be written as :x^n+c_x^+\cdots+c_2x^2+c_1x+c_0, with n \geq 0. Uses Monic polynomials are widely used in algebra and number theory, since they produce many simplifications and they avoid divisions and denominators. Here are some examples. Every polynomial is associated to a unique monic polynomial. In particular, the unique factorization property of polynomials can be stated as: ''Every polynomial can be uniquely factorized as the product of its leading coefficient and a product of monic irreducible polynomials.'' Vieta's formulas are simpler in the case of monic polynomials: ''The th elementary symmetric function of the roots of a monic polynomial of degree equals (-1)^ic_, where c_ is the coefficient of the th po ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algebra
Algebra is a branch of mathematics that deals with abstract systems, known as algebraic structures, and the manipulation of expressions within those systems. It is a generalization of arithmetic that introduces variables and algebraic operations other than the standard arithmetic operations, such as addition and multiplication. Elementary algebra is the main form of algebra taught in schools. It examines mathematical statements using variables for unspecified values and seeks to determine for which values the statements are true. To do so, it uses different methods of transforming equations to isolate variables. Linear algebra is a closely related field that investigates linear equations and combinations of them called '' systems of linear equations''. It provides methods to find the values that solve all equations in the system at the same time, and to study the set of these solutions. Abstract algebra studies algebraic structures, which consist of a set of mathemati ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polynomial Ring
In mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring formed from the set of polynomials in one or more indeterminates (traditionally also called variables) with coefficients in another ring, often a field. Often, the term "polynomial ring" refers implicitly to the special case of a polynomial ring in one indeterminate over a field. The importance of such polynomial rings relies on the high number of properties that they have in common with the ring of the integers. Polynomial rings occur and are often fundamental in many parts of mathematics such as number theory, commutative algebra, and algebraic geometry. In ring theory, many classes of rings, such as unique factorization domains, regular rings, group rings, rings of formal power series, Ore polynomials, graded rings, have been introduced for generalizing some properties of polynomial rings. A closely related notion is that of the ring of polynomial functions on a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rational Root Theorem
In algebra, the rational root theorem (or rational root test, rational zero theorem, rational zero test or theorem) states a constraint on rational solutions of a polynomial equation a_nx^n+a_x^+\cdots+a_0 = 0 with integer coefficients a_i\in\mathbb and a_0,a_n \neq 0. Solutions of the equation are also called roots or zeros of the polynomial on the left side. The theorem states that each rational solution written in lowest terms (that is, and are relatively prime), satisfies: * is an integer factor of the constant term , and * is an integer factor of the leading coefficient . The rational root theorem is a special case (for a single linear factor) of Gauss's lemma on the factorization of polynomials. The integral root theorem is the special case of the rational root theorem when the leading coefficient is . Application The theorem is used to find all rational roots of a polynomial, if any. It gives a finite number of possible fractions which can be checked to see ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rational Number
In mathematics, a rational number is a number that can be expressed as the quotient or fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (for example, The set of all rational numbers is often referred to as "the rationals", and is closed under addition, subtraction, multiplication, and division by a nonzero rational number. It is a field under these operations and therefore also called the field of rationals or the field of rational numbers. It is usually denoted by boldface , or blackboard bold A rational number is a real number. The real numbers that are rational are those whose decimal expansion either terminates after a finite number of digits (example: ), or eventually begins to repeat the same finite sequence of digits over and over (example: ). This statement is true not only in base 10, but also in every other integer base, such as the binary and hexadecimal ones (see ). A real n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complex Number
In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted , called the imaginary unit and satisfying the equation i^= -1; every complex number can be expressed in the form a + bi, where and are real numbers. Because no real number satisfies the above equation, was called an imaginary number by René Descartes. For the complex number is called the , and is called the . The set of complex numbers is denoted by either of the symbols \mathbb C or . Despite the historical nomenclature, "imaginary" complex numbers have a mathematical existence as firm as that of the real numbers, and they are fundamental tools in the scientific description of the natural world. Complex numbers allow solutions to all polynomial equations, even those that have no solutions in real numbers. More precisely, the fundamental theorem of algebra asserts that every non-constant polynomial equation with real or complex coefficie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Integral Domain
In mathematics, an integral domain is a nonzero commutative ring in which the product of any two nonzero elements is nonzero. Integral domains are generalizations of the ring of integers and provide a natural setting for studying divisibility. In an integral domain, every nonzero element ''a'' has the cancellation property, that is, if , an equality implies . "Integral domain" is defined almost universally as above, but there is some variation. This article follows the convention that rings have a multiplicative identity, generally denoted 1, but some authors do not follow this, by not requiring integral domains to have a multiplicative identity. Noncommutative integral domains are sometimes admitted. This article, however, follows the much more usual convention of reserving the term "integral domain" for the commutative case and using " domain" for the general case including noncommutative rings. Some sources, notably Lang, use the term entire ring for integral domain ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Integral Element
In commutative algebra, an element ''b'' of a commutative ring ''B'' is said to be integral over a subring ''A'' of ''B'' if ''b'' is a root of a polynomial, root of some monic polynomial over ''A''. If ''A'', ''B'' are field (mathematics), fields, then the notions of "integral over" and of an "integral extension" are precisely "algebraic element, algebraic over" and "algebraic extensions" in field theory (mathematics), field theory (since the root of any polynomial is the root of a monic polynomial). The case of greatest interest in number theory is that of complex numbers integral over Z (e.g., \sqrt or 1+i); in this context, the integral elements are usually called algebraic integers. The algebraic integers in a finite field extension, extension field ''k'' of the rational number, rationals Q form a subring of ''k'', called the ring of integers of ''k'', a central object of study in algebraic number theory. In this article, the term ''ring (mathematics), ring'' will be underst ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algebraic Integer
In algebraic number theory, an algebraic integer is a complex number that is integral over the integers. That is, an algebraic integer is a complex root of some monic polynomial (a polynomial whose leading coefficient is 1) whose coefficients are integers. The set of all algebraic integers is closed under addition, subtraction and multiplication and therefore is a commutative subring of the complex numbers. The ring of integers of a number field , denoted by , is the intersection of and : it can also be characterized as the maximal order of the field . Each algebraic integer belongs to the ring of integers of some number field. A number is an algebraic integer if and only if the ring \mathbbalpha/math> is finitely generated as an abelian group, which is to say, as a \mathbb- module. Definitions The following are equivalent definitions of an algebraic integer. Let be a number field (i.e., a finite extension of \mathbb, the field of rational numbers), in other words ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Primitive Polynomial (ring Theory)
In algebra, the content of a nonzero polynomial with integer coefficients (or, more generally, with coefficients in a unique factorization domain) is the greatest common divisor of its coefficients. The primitive part of such a polynomial is the quotient of the polynomial by its content. Thus a polynomial is the product of its primitive part and its content, and this factorization is unique up to the multiplication of the content by a unit of the ring of the coefficients (and the multiplication of the primitive part by the inverse of the unit). A polynomial is primitive if its content equals 1. Thus the primitive part of a polynomial is a primitive polynomial. Gauss's lemma for polynomials states that the product of primitive polynomials (with coefficients in the same unique factorization domain) also is primitive. This implies that the content and the primitive part of the product of two polynomials are, respectively, the product of the contents and the product of the primiti ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite Field
In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field (mathematics), field that contains a finite number of Element (mathematics), elements. As with any field, a finite field is a Set (mathematics), set on which the operations of multiplication, addition, subtraction and division are defined and satisfy certain basic rules. The most common examples of finite fields are the integers mod n, integers mod p when p is a prime number. The ''order'' of a finite field is its number of elements, which is either a prime number or a prime power. For every prime number p and every positive integer k there are fields of order p^k. All finite fields of a given order are isomorphism, isomorphic. Finite fields are fundamental in a number of areas of mathematics and computer science, including number theory, algebraic geometry, Galois theory, finite geometry, cryptography and coding theory. Properties A finite field is a finite set that is a fiel ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polynomial Equation
In mathematics, an algebraic equation or polynomial equation is an equation of the form P = 0, where ''P'' is a polynomial with coefficients in some field (mathematics), field, often the field of the rational numbers. For example, x^5-3x+1=0 is an algebraic equation with integer coefficients and :y^4 + \frac - \frac + xy^2 + y^2 + \frac = 0 is a multivariate polynomial equation over the rationals. For many authors, the term ''algebraic equation'' refers only to the univariate case, that is polynomial equations that involve only one variable (mathematics), variable. On the other hand, a polynomial equation may involve several variables (the ''multivariate'' case), in which case the term ''polynomial equation'' is usually preferred. Some but not all polynomial equations with Rational number, rational coefficients have a solution that is an algebraic expression that can be found using a finite number of operations that involve only those same types of coefficients (that is, can be Al ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Partial Order
In mathematics, especially order theory, a partial order on a set is an arrangement such that, for certain pairs of elements, one precedes the other. The word ''partial'' is used to indicate that not every pair of elements needs to be comparable; that is, there may be pairs for which neither element precedes the other. Partial orders thus generalize total orders, in which every pair is comparable. Formally, a partial order is a homogeneous binary relation that is reflexive, antisymmetric, and transitive. A partially ordered set (poset for short) is an ordered pair P=(X,\leq) consisting of a set X (called the ''ground set'' of P) and a partial order \leq on X. When the meaning is clear from context and there is no ambiguity about the partial order, the set X itself is sometimes called a poset. Partial order relations The term ''partial order'' usually refers to the reflexive partial order relations, referred to in this article as ''non-strict'' partial orders. However som ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
