|
Multiplicative Group
In mathematics and group theory, the term multiplicative group refers to one of the following concepts: *the group under multiplication of the invertible elements of a field, ring, or other structure for which one of its operations is referred to as multiplication. In the case of a field ''F'', the group is , where 0 refers to the zero element of ''F'' and the binary operation • is the field multiplication, *the algebraic torus GL(1).. Examples *The multiplicative group of integers modulo ''n'' is the group under multiplication of the invertible elements of \mathbb/n\mathbb. When ''n'' is not prime, there are elements other than zero that are not invertible. * The multiplicative group of positive real numbers \mathbb^+ is an abelian group with 1 its identity element. The logarithm is a group isomorphism of this group to the additive group of real numbers, \mathbb. * The multiplicative group of a field F is the set of all nonzero elements: F^\times = F -\, under the mu ... [...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 t ... [...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 that contains a finite number of elements. As with any field, a finite field is a 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 given by the integers mod when 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 and every positive integer there are fields of order p^k, all of which are 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 which is a field; this means that multiplication, addition, subtraction and division (excluding division by zero ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Michiel Hazewinkel
Michiel Hazewinkel (born 22 June 1943) is a Dutch mathematician, and Emeritus Professor of Mathematics at the Centre for Mathematics and Computer Science and the University of Amsterdam, particularly known for his 1978 book ''Formal groups and applications'' and as editor of the '' Encyclopedia of Mathematics''. Biography Born in Amsterdam to Jan Hazewinkel and Geertrude Hendrika Werner, Hazewinkel studied at the University of Amsterdam. He received his BA in mathematics and physics in 1963, his MA in mathematics with a minor in philosophy in 1965 and his PhD in 1969 under supervision of Frans Oort and Albert Menalda for the thesis "Maximal Abelian Extensions of Local Fields".Michiel Hazewinkel, Curriculum vitae at michhaz.home.xs4all.nl. Accessed September 10, 2013 After graduation Hazewinkel started ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kummer Theory
In abstract algebra and number theory, Kummer theory provides a description of certain types of field extensions involving the adjunction of ''n''th roots of elements of the base field. The theory was originally developed by Ernst Eduard Kummer around the 1840s in his pioneering work on Fermat's Last Theorem. The main statements do not depend on the nature of the field – apart from its characteristic, which should not divide the integer ''n'' – and therefore belong to abstract algebra. The theory of cyclic extensions of the field ''K'' when the characteristic of ''K'' does divide ''n'' is called Artin–Schreier theory. Kummer theory is basic, for example, in class field theory and in general in understanding abelian extensions; it says that in the presence of enough roots of unity, cyclic extensions can be understood in terms of extracting roots. The main burden in class field theory is to dispense with extra roots of unity ('descending' back to smaller fields); which is som ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pierre Cartier (mathematician)
Pierre Émile Cartier (born 10 June 1932) is a French mathematician. An associate of the Bourbaki group and at one time a colleague of Alexander Grothendieck, his interests have ranged over algebraic geometry, representation theory, mathematical physics, and category theory. He studied at the École Normale Supérieure in Paris under Henri Cartan and André Weil. Since his 1958 thesis on algebraic geometry he has worked in a number of fields. He is known for the introduction of the Cartier operator in algebraic geometry in characteristic ''p'', and for work on duality of abelian varieties and on formal groups. He is the eponym of Cartier divisors and Cartier duality. From 1961 to 1971 he was a professor at the University of Strasbourg. In 1970 he was an Invited Speaker at the International Congress of Mathematicians in Nice. He was awarded the 1978 Prize Ampère of the French Academy of Sciences. In 2012 he became a fellow of the American Mathematical Society. Publications ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Duality Theory Of Abelian Varieties
In mathematics, a dual abelian variety can be defined from an abelian variety ''A'', defined over a field ''K''. Definition To an abelian variety ''A'' over a field ''k'', one associates a dual abelian variety ''A''v (over the same field), which is the solution to the following moduli problem. A family of degree 0 line bundles parametrized by a ''k''-variety ''T'' is defined to be a line bundle ''L'' on ''A''×''T'' such that # for all t \in T, the restriction of ''L'' to ''A''× is a degree 0 line bundle, # the restriction of ''L'' to ×''T'' is a trivial line bundle (here 0 is the identity of ''A''). Then there is a variety ''A''v and a line bundle P \to A \times A^\vee,, called the Poincaré bundle, which is a family of degree 0 line bundles parametrized by ''A''v in the sense of the above definition. Moreover, this family is universal, that is, to any family ''L'' parametrized by ''T'' is associated a unique morphism ''f'': ''T'' → ''A''v so that ''L'' is isomorphic to th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prime Number
A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, or , involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order. The property of being prime is called primality. A simple but slow method of checking the primality of a given number n, called trial division, tests whether n is a multiple of any integer between 2 and \sqrt. Faster algorithms include the Miller–Rabin primality test, which is fast but has a small chance of error, and the AKS primality test, which alway ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Structure Sheaf
In mathematics, a ringed space is a family of ( commutative) rings parametrized by open subsets of a topological space together with ring homomorphisms that play roles of restrictions. Precisely, it is a topological space equipped with a sheaf of rings called a structure sheaf. It is an abstraction of the concept of the rings of continuous (scalar-valued) functions on open subsets. Among ringed spaces, especially important and prominent is a locally ringed space: a ringed space in which the analogy between the stalk at a point and the ring of germs of functions at a point is valid. Ringed spaces appear in analysis as well as complex algebraic geometry and the scheme theory of algebraic geometry. Note: In the definition of a ringed space, most expositions tend to restrict the rings to be commutative rings, including Hartshorne and Wikipedia. " Éléments de géométrie algébrique", on the other hand, does not impose the commutativity assumption, although the book mostly co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nilpotent Element
In mathematics, an element x of a 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 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 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 congruent to 0 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\\ 0 & 0 \end. Here AB=0 and BA=B. *By definition, any element of a nilsemigroup is nilpotent. Properties No nilpotent elem ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Characteristic (field)
In mathematics, the characteristic of a ring , often denoted , is defined to be the smallest number of times one must use the ring's 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 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 requirements for a ring (see Multiplicative identity and the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
If And Only If
In logic and related fields such as mathematics and philosophy, "if and only if" (shortened as "iff") is a biconditional logical connective between statements, where either both statements are true or both are false. The connective is biconditional (a statement of material equivalence), and can be likened to the standard material conditional ("only if", equal to "if ... then") combined with its reverse ("if"); hence the name. The result is that the truth of either one of the connected statements requires the truth of the other (i.e. either both statements are true, or both are false), though it is controversial whether the connective thus defined is properly rendered by the English "if and only if"—with its pre-existing meaning. For example, ''P if and only if Q'' means that ''P'' is true whenever ''Q'' is true, and the only case in which ''P'' is true is if ''Q'' is also true, whereas in the case of ''P if Q'', there could be other scenarios where ''P'' is true and ''Q ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Reduced Scheme
This is a glossary of algebraic geometry. See also glossary of commutative algebra, glossary of classical algebraic geometry, and glossary of ring theory. For the number-theoretic applications, see glossary of arithmetic and Diophantine geometry. For simplicity, a reference to the base scheme is often omitted; i.e., a scheme will be a scheme over some fixed base scheme ''S'' and a morphism an ''S''-morphism. !$@ A B C D E F G H I J K L M N O P ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
