|
Noncommutative Polynomials
In mathematics, a twisted polynomial is a polynomial over a field of characteristic p in the variable \tau representing the Frobenius map x\mapsto x^p. In contrast to normal polynomials, multiplication of these polynomials is not commutative, but satisfies the commutation rule : \tau x=x^p \tau for all x in the base field. Over an infinite field, the twisted polynomial ring is isomorphic to the ring of additive polynomials, but where multiplication on the latter is given by composition rather than usual multiplication. However, it is often easier to compute in the twisted polynomial ring — this can be applied especially in the theory of Drinfeld modules. Definition Let k be a field of characteristic p. The twisted polynomial ring k\ is defined as the set of polynomials in the variable \tau and coefficients in k. It is endowed with a ring structure with the usual addition, but with a non-commutative multiplication that can be summarized with the relation \tau x=x^p\tau for x\i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polynomial
In mathematics, a polynomial is an expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An example of a polynomial of a single indeterminate is . An example with three indeterminates is . Polynomials appear in many areas of mathematics and science. For example, they are used to form polynomial equations, which encode a wide range of problems, from elementary word problems to complicated scientific problems; they are used to define polynomial functions, which appear in settings ranging from basic chemistry and physics to economics and social science; they are used in calculus and numerical analysis to approximate other functions. In advanced mathematics, polynomials are used to construct polynomial rings and algebraic varieties, which are central concepts in algebra and algebraic geometry. Etymology The word ''polynomial'' join ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Field (mathematics)
In mathematics, a field is a set on which addition, subtraction, multiplication, and division are defined and behave as the corresponding operations on rational and real numbers do. A field is thus a fundamental algebraic structure which is widely used in algebra, number theory, and many other areas of mathematics. The best known fields are the field of rational numbers, the field of real numbers and the field of complex numbers. Many other fields, such as fields of rational functions, algebraic function fields, algebraic number fields, and ''p''-adic fields are commonly used and studied in mathematics, particularly in number theory and algebraic geometry. Most cryptographic protocols rely on finite fields, i.e., fields with finitely many elements. The relation of two fields is expressed by the notion of a field extension. Galois theory, initiated by Évariste Galois in the 1830s, is devoted to understanding the symmetries of field extensions. Among other results, thi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Characteristic (algebra)
In mathematics, the characteristic of a ring (mathematics), ring , often denoted , is defined to be the smallest number of times one must use the ring's identity element, multiplicative identity (1) in a sum to get the additive identity (0). If this sum never reaches the additive identity the ring is said to have characteristic zero. That is, is the smallest positive number such that: :\underbrace_ = 0 if such a number exists, and otherwise. Motivation The special definition of the characteristic zero is motivated by the equivalent definitions characterized in the next section, where the characteristic zero is not required to be considered separately. The characteristic may also be taken to be the exponent (group theory), exponent of the ring's additive group, that is, the smallest positive integer such that: :\underbrace_ = 0 for every element of the ring (again, if exists; otherwise zero). Some authors do not include the multiplicative identity element in their r ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Frobenius Map
In commutative algebra and field theory, the Frobenius endomorphism (after Ferdinand Georg Frobenius) is a special endomorphism of commutative rings with prime characteristic , an important class which includes finite fields. The endomorphism maps every element to its -th power. In certain contexts it is an automorphism, but this is not true in general. Definition Let be a commutative ring with prime characteristic (an integral domain of positive characteristic always has prime characteristic, for example). The Frobenius endomorphism ''F'' is defined by :F(r) = r^p for all ''r'' in ''R''. It respects the multiplication of ''R'': :F(rs) = (rs)^p = r^ps^p = F(r)F(s), and is 1 as well. Moreover, it also respects the addition of . The expression can be expanded using the binomial theorem. Because is prime, it divides but not any for ; it therefore will divide the numerator, but not the denominator, of the explicit formula of the binomial coefficients :\frac, if . T ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Commutative
In mathematics, a binary operation is commutative if changing the order of the operands does not change the result. It is a fundamental property of many binary operations, and many mathematical proofs depend on it. Most familiar as the name of the property that says something like or , the property can also be used in more advanced settings. The name is needed because there are operations, such as division and subtraction, that do not have it (for example, ); such operations are ''not'' commutative, and so are referred to as ''noncommutative operations''. The idea that simple operations, such as the multiplication and addition of numbers, are commutative was for many years implicitly assumed. Thus, this property was not named until the 19th century, when mathematics started to become formalized. A similar property exists for binary relations; a binary relation is said to be symmetric if the relation applies regardless of the order of its operands; for example, equality is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Additive Polynomial
In mathematics, the additive polynomials are an important topic in classical algebraic number theory. Definition Let ''k'' be a field of prime characteristic ''p''. A polynomial ''P''(''x'') with coefficients in ''k'' is called an additive polynomial, or a Frobenius polynomial, if :P(a+b)=P(a)+P(b)\, as polynomials in ''a'' and ''b''. It is equivalent to assume that this equality holds for all ''a'' and ''b'' in some infinite field containing ''k'', such as its algebraic closure. Occasionally absolutely additive is used for the condition above, and additive is used for the weaker condition that ''P''(''a'' + ''b'') = ''P''(''a'') + ''P''(''b'') for all ''a'' and ''b'' in the field. For infinite fields the conditions are equivalent, but for finite fields they are not, and the weaker condition is the "wrong" as it does not behave well. For example, over a field of order ''q'' any multiple ''P'' of ''x''''q'' − ''x'' will satisfy ''P''(''a''&nbs ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Drinfeld Module
In mathematics, a Drinfeld module (or elliptic module) is roughly a special kind of module over a ring of functions on a curve over a finite field, generalizing the Carlitz module. Loosely speaking, they provide a function field analogue of complex multiplication theory. A shtuka (also called F-sheaf or chtouca) is a sort of generalization of a Drinfeld module, consisting roughly of a vector bundle over a curve, together with some extra structure identifying a "Frobenius twist" of the bundle with a "modification" of it. Drinfeld modules were introduced by , who used them to prove the Langlands conjectures for GL2 of an algebraic function field in some special cases. He later invented shtukas and used shtukas of rank 2 to prove the remaining cases of the Langlands conjectures for GL2. Laurent Lafforgue proved the Langlands conjectures for GL''n'' of a function field by studying the moduli stack of shtukas of rank ''n''. "Shtuka" is a Russian word штука meaning "a single copy ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ring (mathematics)
In mathematics, rings are algebraic structures that generalize fields: multiplication need not be commutative and multiplicative inverses need not exist. In other words, a ''ring'' is a set equipped with two binary operations satisfying properties analogous to those of addition and multiplication of integers. Ring elements may be numbers such as integers or complex numbers, but they may also be non-numerical objects such as polynomials, square matrices, functions, and power series. Formally, a ''ring'' is an abelian group whose operation is called ''addition'', with a second binary operation called ''multiplication'' that is associative, is distributive over the addition operation, and has a multiplicative identity element. (Some authors use the term " " with a missing i to refer to the more general structure that omits this last requirement; see .) Whether a ring is commutative (that is, whether the order in which two elements are multiplied might change the result) has ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ring Homomorphism
In ring theory, a branch of abstract algebra, a ring homomorphism is a structure-preserving function between two rings. More explicitly, if ''R'' and ''S'' are rings, then a ring homomorphism is a function such that ''f'' is: :addition preserving: ::f(a+b)=f(a)+f(b) for all ''a'' and ''b'' in ''R'', :multiplication preserving: ::f(ab)=f(a)f(b) for all ''a'' and ''b'' in ''R'', :and unit (multiplicative identity) preserving: ::f(1_R)=1_S. Additive inverses and the additive identity are part of the structure too, but it is not necessary to require explicitly that they too are respected, because these conditions are consequences of the three conditions above. If in addition ''f'' is a bijection, then its inverse ''f''−1 is also a ring homomorphism. In this case, ''f'' is called a ring isomorphism, and the rings ''R'' and ''S'' are called ''isomorphic''. From the standpoint of ring theory, isomorphic rings cannot be distinguished. If ''R'' and ''S'' are rngs, then the cor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Freshman's Dream
The freshman's dream is a name sometimes given to the erroneous equation (x+y)^n=x^n+y^n, where n is a real number (usually a positive integer greater than 1) and x,y are nonzero real numbers. Beginning students commonly make this error in computing the power of a sum of real numbers, falsely assuming powers distribute over sums. When ''n'' = 2, it is easy to see why this is incorrect: (''x'' + ''y'')2 can be correctly computed as ''x''2 + 2''xy'' + ''y''2 using distributivity (commonly known by students as the FOIL method). For larger positive integer values of ''n'', the correct result is given by the binomial theorem. The name "freshman's dream" also sometimes refers to the theorem that says that for a prime number ''p'', if ''x'' and ''y'' are members of a commutative ring of characteristic ''p'', then (''x'' + ''y'')''p'' = ''x''''p'' + ''y''''p''. In this more exotic type of arithmetic, the "mistake" actually g ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euclidean Division
In arithmetic, Euclidean division – or division with remainder – is the process of dividing one integer (the dividend) by another (the divisor), in a way that produces an integer quotient and a natural number remainder strictly smaller than the absolute value of the divisor. A fundamental property is that the quotient and the remainder exist and are unique, under some conditions. Because of this uniqueness, ''Euclidean division'' is often considered without referring to any method of computation, and without explicitly computing the quotient and the remainder. The methods of computation are called integer division algorithms, the best known of which being long division. Euclidean division, and algorithms to compute it, are fundamental for many questions concerning integers, such as the Euclidean algorithm for finding the greatest common divisor of two integers, and modular arithmetic, for which only remainders are considered. The operation consisting of computing only th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
