|
Relative Discriminant
In mathematics, the discriminant of an algebraic number field is a numerical invariant that, loosely speaking, measures the size of the ( ring of integers of the) algebraic number field. More specifically, it is proportional to the squared volume of the fundamental domain of the ring of integers, and it regulates which primes are ramified. The discriminant is one of the most basic invariants of a number field, and occurs in several important analytic formulas such as the functional equation of the Dedekind zeta function of ''K'', and the analytic class number formula for ''K''. A theorem of Hermite states that there are only finitely many number fields of bounded discriminant, however determining this quantity is still an open problem, and the subject of current research. The discriminant of ''K'' can be referred to as the absolute discriminant of ''K'' to distinguish it from the relative discriminant of an extension ''K''/''L'' of number fields. The latter is an idea ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Principal Ideal
In mathematics, specifically ring theory, a principal ideal is an ideal I in a ring R that is generated by a single element a of R through multiplication by every element of R. The term also has another, similar meaning in order theory, where it refers to an (order) ideal in a poset P generated by a single element x \in P, which is to say the set of all elements less than or equal to x in P. The remainder of this article addresses the ring-theoretic concept. Definitions * a ''left principal ideal'' of R is a subset of R given by Ra = \ for some element a, * a ''right principal ideal'' of R is a subset of R given by aR = \ for some element a, * a ''two-sided principal ideal'' of R is a subset of R given by RaR = \ for some element a, namely, the set of all finite sums of elements of the form ras. While this definition for two-sided principal ideal may seem more complicated than the others, it is necessary to ensure that the ideal remains closed under addition. If R is a co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Square-free Integer
In mathematics, a square-free integer (or squarefree integer) is an integer which is divisible by no square number other than 1. That is, its prime factorization has exactly one factor for each prime that appears in it. For example, is square-free, but is not, because 18 is divisible by . The smallest positive square-free numbers are Square-free factorization Every positive integer n can be factored in a unique way as n=\prod_^k q_i^i, where the q_i different from one are square-free integers that are pairwise coprime. This is called the ''square-free factorization'' of . To construct the square-free factorization, let n=\prod_^h p_j^ be the prime factorization of n, where the p_j are distinct prime numbers. Then the factors of the square-free factorization are defined as q_i=\prod_p_j. An integer is square-free if and only if q_i=1 for all i > 1. An integer greater than one is the kth power of another integer if and only if k is a divisor of all i such that q_i\neq 1. T ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quadratic Fields
In algebraic number theory, a quadratic field is an algebraic number field of degree two over \mathbf, the rational numbers. Every such quadratic field is some \mathbf(\sqrt) where d is a (uniquely defined) square-free integer different from 0 and 1. If d>0, the corresponding quadratic field is called a real quadratic field, and, if d<0, it is called an imaginary quadratic field or a complex quadratic field, corresponding to whether or not it is a subfield of the field of the s. Quadratic fields have been studied in great depth, initially as part of the theory of s. There remain some unsolved p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Order (ring Theory)
In mathematics, an order in the sense of ring theory is a subring \mathcal of a ring A, such that #''A'' is a finite-dimensional algebra over the field \mathbb of rational numbers #\mathcal spans ''A'' over \mathbb, and #\mathcal is a \mathbb-lattice in ''A''. The last two conditions can be stated in less formal terms: Additively, \mathcal is a free abelian group generated by a basis for ''A'' over \mathbb. More generally for ''R'' an integral domain contained in a field ''K'', we define \mathcal to be an ''R''-order in a ''K''-algebra ''A'' if it is a subring of ''A'' which is a full ''R''-lattice. When ''A'' is not a commutative ring, the idea of order is still important, but the phenomena are different. For example, the Hurwitz quaternions form a maximal order in the quaternions with rational co-ordinates; they are not the quaternions with integer coordinates in the most obvious sense. Maximal orders exist in general, but need not be unique: there is in general no lar ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Trace Form
In mathematics, the field trace is a particular function defined with respect to a finite field extension ''L''/''K'', which is a ''K''-linear map from ''L'' onto ''K''. Definition Let ''K'' be a field and ''L'' a finite extension (and hence an algebraic extension) of ''K''. ''L'' can be viewed as a vector space over ''K''. Multiplication by ''α'', an element of ''L'', :m_\alpha:L\to L \text m_\alpha (x) = \alpha x, is a ''K''-linear transformation of this vector space into itself. The ''trace'', Tr''L''/''K''(''α''), is defined as the trace (in the linear algebra sense) of this linear transformation. For ''α'' in ''L'', let ''σ''(''α''), ..., ''σ''(''α'') be the roots (counted with multiplicity) of the minimal polynomial of ''α'' over ''K'' (in some extension field of ''K''). Then :\operatorname_(\alpha) = :K(\alpha)sum_^n\sigma_j(\alpha). If ''L''/''K'' is separable then each root appears only once (however this does not mean the coefficient above is one; for examp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Field Trace
In mathematics, the field trace is a particular function defined with respect to a finite field extension ''L''/''K'', which is a ''K''-linear map from ''L'' onto ''K''. Definition Let ''K'' be a field and ''L'' a finite extension (and hence an algebraic extension) of ''K''. ''L'' can be viewed as a vector space over ''K''. Multiplication by ''α'', an element of ''L'', :m_\alpha:L\to L \text m_\alpha (x) = \alpha x, is a ''K''- linear transformation of this vector space into itself. The ''trace'', Tr''L''/''K''(''α''), is defined as the trace (in the linear algebra sense) of this linear transformation. For ''α'' in ''L'', let ''σ''(''α''), ..., ''σ''(''α'') be the roots (counted with multiplicity) of the minimal polynomial of ''α'' over ''K'' (in some extension field of ''K''). Then :\operatorname_(\alpha) = :K(\alpha)sum_^n\sigma_j(\alpha). If ''L''/''K'' is separable then each root appears only once (however this does not mean the coefficient above is one; for e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Matrix (mathematics)
In mathematics, a matrix (plural matrices) is a rectangular array or table of numbers, symbols, or expressions, arranged in rows and columns, which is used to represent a mathematical object or a property of such an object. For example, \begin1 & 9 & -13 \\20 & 5 & -6 \end is a matrix with two rows and three columns. This is often referred to as a "two by three matrix", a "-matrix", or a matrix of dimension . Without further specifications, matrices represent linear maps, and allow explicit computations in linear algebra. Therefore, the study of matrices is a large part of linear algebra, and most properties and operations of abstract linear algebra can be expressed in terms of matrices. For example, matrix multiplication represents composition of linear maps. Not all matrices are related to linear algebra. This is, in particular, the case in graph theory, of incidence matrices, and adjacency matrices. ''This article focuses on matrices related to linear algebra, and, un ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Determinant
In mathematics, the determinant is a scalar value that is a function of the entries of a square matrix. It characterizes some properties of the matrix and the linear map represented by the matrix. In particular, the determinant is nonzero if and only if the matrix is invertible and the linear map represented by the matrix is an isomorphism. The determinant of a product of matrices is the product of their determinants (the preceding property is a corollary of this one). The determinant of a matrix is denoted , , or . The determinant of a matrix is :\begin a & b\\c & d \end=ad-bc, and the determinant of a matrix is : \begin a & b & c \\ d & e & f \\ g & h & i \end= aei + bfg + cdh - ceg - bdi - afh. The determinant of a matrix can be defined in several equivalent ways. Leibniz formula expresses the determinant as a sum of signed products of matrix entries such that each summand is the product of different entries, and the number of these summands is n!, the factorial of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Square (algebra)
In mathematics, a square is the result of multiplication, multiplying a number by itself. The verb "to square" is used to denote this operation. Squaring is the same as exponentiation, raising to the power 2 (number), 2, and is denoted by a superscript 2; for instance, the square of 3 may be written as 32, which is the number 9. In some cases when superscripts are not available, as for instance in programming languages or plain text files, the notations ''x''^2 (caret) or ''x''**2 may be used in place of ''x''2. The adjective which corresponds to squaring is ''wikt:quadratic, quadratic''. The square of an integer may also be called a square number or a perfect square. In algebra, the operation of squaring is often generalized to polynomials, other expression (mathematics), expressions, or values in systems of mathematical values other than the numbers. For instance, the square of the linear function (calculus), linear polynomial is the quadratic polynomial . One of the imp ... [...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] |
Injective
In mathematics, an injective function (also known as injection, or one-to-one function) is a function that maps distinct elements of its domain to distinct elements; that is, implies . (Equivalently, implies in the equivalent contrapositive statement.) In other words, every element of the function's codomain is the image of one element of its domain. The term must not be confused with that refers to bijective functions, which are functions such that each element in the codomain is an image of exactly one element in the domain. A homomorphism between algebraic structures is a function that is compatible with the operations of the structures. For all common algebraic structures, and, in particular for vector spaces, an is also called a . However, in the more general context of category theory, the definition of a monomorphism differs from that of an injective homomorphism. This is thus a theorem that they are equivalent for algebraic structures; see for more details. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
