|
Distinct Roots
In mathematics, a polynomial ''P''(''X'') over a given field ''K'' is separable if its roots are distinct in an algebraic closure of ''K'', that is, the number of distinct roots is equal to the degree of the polynomial. This concept is closely related to square-free polynomial. If ''K'' is a perfect field then the two concepts coincide. In general, ''P''(''X'') is separable if and only if it is square-free over any field that contains ''K'', which holds if and only if ''P''(''X'') is coprime to its formal derivative ''D'' ''P''(''X''). Older definition In an older definition, ''P''(''X'') was considered separable if each of its irreducible factors in ''K'' 'X''is separable in the modern definition. In this definition, separability depended on the field ''K''; for example, any polynomial over a perfect field would have been considered separable. This definition, although it can be convenient for Galois theory, is no longer in use. Separable field extensions Separable poly ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many areas of mathematics, which include number theory (the study of numbers), algebra (the study of formulas and related structures), geometry (the study of shapes and spaces that contain them), Mathematical analysis, analysis (the study of continuous changes), and set theory (presently used as a foundation for all mathematics). Mathematics involves the description and manipulation of mathematical object, abstract objects that consist of either abstraction (mathematics), abstractions from nature orin modern mathematicspurely abstract entities that are stipulated to have certain properties, called axioms. Mathematics uses pure reason to proof (mathematics), prove properties of objects, a ''proof'' consisting of a succession of applications of in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Inseparable Extension
In field theory, a branch of algebra, an algebraic field extension E/F is called a separable extension if for every \alpha\in E, the minimal polynomial of \alpha over is a separable polynomial (i.e., its formal derivative is not the zero polynomial, or equivalently it has no repeated roots in any extension field).Isaacs, p. 281 There is also a more general definition that applies when is not necessarily algebraic over . An extension that is not separable is said to be ''inseparable''. Every algebraic extension of a field of characteristic zero is separable, and every algebraic extension of a finite field is separable.Isaacs, Theorem 18.11, p. 281 It follows that most extensions that are considered in mathematics are separable. Nevertheless, the concept of separability is important, as the existence of inseparable extensions is the main obstacle for extending many theorems proved in characteristic zero to non-zero characteristic. For example, the fundamental theorem of Galoi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nilpotent
In mathematics, an element x of a ring (mathematics), ring R is called nilpotent if there exists some positive integer n, called the index (or sometimes the degree), such that x^n=0. The term, along with its sister Idempotent (ring theory), idempotent, was introduced by Benjamin Peirce in the context of his work on the classification of algebras. Examples *This definition can be applied in particular to square matrix, square matrices. The matrix :: A = \begin 0 & 1 & 0\\ 0 & 0 & 1\\ 0 & 0 & 0 \end :is nilpotent because A^3=0. See nilpotent matrix for more. * In the factor ring \Z/9\Z, the equivalence class of 3 is nilpotent because 32 is Congruence relation, congruent to 0 Modular arithmetic, modulo 9. * Assume that two elements a and b in a ring R satisfy ab=0. Then the element c=ba is nilpotent as \beginc^2&=(ba)^2\\ &=b(ab)a\\ &=0.\\ \end An example with matrices (for ''a'', ''b''):A = \begin 0 & 1\\ 0 & 1 \end, \;\; B =\begin 0 & 1\\ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tensor Product Of Fields
In mathematics, the tensor product of two field (mathematics), fields is their tensor product of algebras, tensor product as algebra over a field, algebras over a common subfield (mathematics), subfield. If no subfield is explicitly specified, the two fields must have the same characteristic (algebra), characteristic and the common subfield is their prime field, prime subfield. The tensor product of two fields is sometimes a field, and often a product ring, direct product of fields; In some cases, it can contain non-zero nilpotent elements. The tensor product of two fields expresses in a single structure the different way to embed the two fields in a common extension field. Compositum of fields First, one defines the notion of the compositum of fields. This construction occurs frequently in field theory (mathematics), field theory. The idea behind the compositum is to make the smallest field containing two other fields. In order to formally define the compositum, one must firs ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Automorphism
In mathematics, an automorphism is an isomorphism from a mathematical object to itself. It is, in some sense, a symmetry of the object, and a way of mapping the object to itself while preserving all of its structure. The set of all automorphisms of an object forms a group, called the automorphism group. It is, loosely speaking, the symmetry group of the object. Definition In an algebraic structure such as a group, a ring, or vector space, an ''automorphism'' is simply a bijective homomorphism of an object into itself. (The definition of a homomorphism depends on the type of algebraic structure; see, for example, group homomorphism, ring homomorphism, and linear operator.) More generally, for an object in some category, an automorphism is a morphism of the object to itself that has an inverse morphism; that is, a morphism f: X\to X is an automorphism if there is a morphism g: X\to X such that g\circ f= f\circ g = \operatorname _X, where \operatorname _X is the identity ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Purely Inseparable Field Extension
In algebra, a purely inseparable extension of fields is an extension ''k'' ⊆ ''K'' of fields of characteristic ''p'' > 0 such that every element of ''K'' is a root of an equation of the form ''x''''q'' = ''a'', with ''q'' a power of ''p'' and ''a'' in ''k''. Purely inseparable extensions are sometimes called radicial extensions, which should not be confused with the similar-sounding but more general notion of radical extensions. Purely inseparable extensions An algebraic extension E\supseteq F is a ''purely inseparable extension'' if and only if for every \alpha\in E\setminus F, the minimal polynomial of \alpha over ''F'' is ''not'' a separable polynomial.Isaacs, p. 298 If ''F'' is any field, the trivial extension F\supseteq F is purely inseparable; for the field ''F'' to possess a ''non-trivial'' purely inseparable extension, it must be imperfect as outlined in the above section. Several equivalent and more concrete definitions for the notion of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Splitting Field
In abstract algebra, a splitting field of a polynomial with coefficients in a field is the smallest field extension of that field over which the polynomial ''splits'', i.e., decomposes into linear factors. Definition A splitting field of a polynomial ''p''(''X'') over a field ''K'' is a field extension ''L'' of ''K'' over which ''p'' factors into linear factors :p(X) = c \prod_^ (X - a_i) where c \in K and for each i we have X - a_i \in L /math> with ''ai'' not necessarily distinct and such that the roots ''ai'' generate ''L'' over ''K''. The extension ''L'' is then an extension of minimal degree over ''K'' in which ''p'' splits. It can be shown that such splitting fields exist and are unique up to isomorphism. The amount of freedom in that isomorphism is known as the Galois group of ''p'' (if we assume it is separable). A splitting field of a set ''P'' of polynomials is the smallest field over which each of the polynomials in ''P'' splits. Properties An extension ''L'' th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Radical Morphism
In algebraic geometry, a morphism of schemes :''f'': ''X'' → ''Y'' is called radicial or universally injective, if, for every field ''K'', the induced map ''X''(''K'') → ''Y''(''K'') is injective. (EGA I, (3.5.4)) This is a generalization of the notion of a purely inseparable extension of fields (sometimes called a radicial extension, which should not be confused with a radical extension). It suffices to check this for ''K'' algebraically closed. This is equivalent to the following condition: ''f'' is injective on the topological spaces and for every point ''x'' in ''X'', the extension of the residue fields :''k''(''f''(''x'')) ⊂ ''k''(''x'') is radicial, i.e. purely inseparable. It is also equivalent to every base change of ''f'' being injective on the underlying topological spaces. (Thus the term ''universally injective''.) Radicial morphisms are stable under composition, products and base change. If ''gf'' is radicial, so is ''f''. References * , sectio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algebraic Geometry
Algebraic geometry is a branch of mathematics which uses abstract algebraic techniques, mainly from commutative algebra, to solve geometry, geometrical problems. Classically, it studies zero of a function, zeros of multivariate polynomials; the modern approach generalizes this in a few different aspects. The fundamental objects of study in algebraic geometry are algebraic variety, algebraic varieties, which are geometric manifestations of solution set, solutions of systems of polynomial equations. Examples of the most studied classes of algebraic varieties are line (geometry), lines, circles, parabolas, ellipses, hyperbolas, cubic curves like elliptic curves, and quartic curves like lemniscate of Bernoulli, lemniscates and Cassini ovals. These are plane algebraic curves. A point of the plane lies on an algebraic curve if its coordinates satisfy a given polynomial equation. Basic questions involve the study of points of special interest like singular point of a curve, singular p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Projective Line
In projective geometry and mathematics more generally, a projective line is, roughly speaking, the extension of a usual line by a point called a '' point at infinity''. The statement and the proof of many theorems of geometry are simplified by the resultant elimination of special cases; for example, two distinct projective lines in a projective plane meet in exactly one point (there is no "parallel" case). There are many equivalent ways to formally define a projective line; one of the most common is to define a projective line over a field ''K'', commonly denoted P1(''K''), as the set of one-dimensional subspaces of a two-dimensional ''K''-vector space. This definition is a special instance of the general definition of a projective space. The projective line over the reals is a manifold; see '' Real projective line'' for details. Homogeneous coordinates An arbitrary point in the projective line P1(''K'') may be represented by an equivalence class of '' homogeneous coordi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Proof
A mathematical proof is a deductive reasoning, deductive Argument-deduction-proof distinctions, argument for a Proposition, mathematical statement, showing that the stated assumptions logically guarantee the conclusion. The argument may use other previously established statements, such as theorems; but every proof can, in principle, be constructed using only certain basic or original assumptions known as axioms, along with the accepted rules of inference. Proofs are examples of exhaustive deductive reasoning that establish logical certainty, to be distinguished from empirical evidence, empirical arguments or non-exhaustive inductive reasoning that establish "reasonable expectation". Presenting many cases in which the statement holds is not enough for a proof, which must demonstrate that the statement is true in ''all'' possible cases. A proposition that has not been proved but is believed to be true is known as a conjecture, or a hypothesis if frequently used as an assumption for ... [...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] |
