|
Smith Normal Form
In mathematics, the Smith normal form (sometimes abbreviated SNF) is a normal form that can be defined for any matrix (not necessarily square) with entries in a principal ideal domain (PID). The Smith normal form of a matrix is diagonal, and can be obtained from the original matrix by multiplying on the left and right by invertible square matrices. In particular, the integers are a PID, so one can always calculate the Smith normal form of an integer matrix. The Smith normal form is very useful for working with finitely generated modules over a PID, and in particular for deducing the structure of a quotient of a free module. It is named after the Irish mathematician Henry John Stephen Smith. Definition Let A be a nonzero m \times n matrix over a principal ideal domain R. There exist invertible m \times m and n \times n-matrices S,T (with entries in R) such that the product SAT is \begin \alpha_1 & 0 & 0 & \cdots & 0 & \cdots & 0 \\ 0 & \alpha_2 & 0 & & & & \\ 0 & 0 & \ddots ... [...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] |
Greatest Common Divisor
In mathematics, the greatest common divisor (GCD), also known as greatest common factor (GCF), of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers. For two integers , , the greatest common divisor of and is denoted \gcd (x,y). For example, the GCD of 8 and 12 is 4, that is, . In the name "greatest common divisor", the adjective "greatest" may be replaced by "highest", and the word "divisor" may be replaced by "factor", so that other names include highest common factor, etc. Historically, other names for the same concept have included greatest common measure. This notion can be extended to polynomials (see ''Polynomial greatest common divisor'') and other commutative rings (see ' below). Overview Definition The ''greatest common divisor'' (GCD) of integers and , at least one of which is nonzero, is the greatest positive integer such that is a divisor of both and ; that is, there are integers and such that ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Topology
Topology (from the Greek language, Greek words , and ) is the branch of mathematics concerned with the properties of a Mathematical object, geometric object that are preserved under Continuous function, continuous Deformation theory, deformations, such as Stretch factor, stretching, Torsion (mechanics), twisting, crumpling, and bending; that is, without closing holes, opening holes, tearing, gluing, or passing through itself. A topological space is a Set (mathematics), set endowed with a structure, called a ''Topology (structure), topology'', which allows defining continuous deformation of subspaces, and, more generally, all kinds of List of continuity-related mathematical topics, continuity. Euclidean spaces, and, more generally, metric spaces are examples of topological spaces, as any distance or metric defines a topology. The deformations that are considered in topology are homeomorphisms and Homotopy, homotopies. A property that is invariant under such deformations is a to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finitely Generated Module
In mathematics, a finitely generated module is a module that has a finite generating set. A finitely generated module over a ring ''R'' may also be called a finite ''R''-module, finite over ''R'', or a module of finite type. Related concepts include finitely cogenerated modules, finitely presented modules, finitely related modules and coherent modules all of which are defined below. Over a Noetherian ring the concepts of finitely generated, finitely presented and coherent modules coincide. A finitely generated module over a field is simply a finite-dimensional vector space, and a finitely generated module over the integers is simply a finitely generated abelian group. Definition The left ''R''-module ''M'' is finitely generated if there exist ''a''1, ''a''2, ..., ''a''''n'' in ''M'' such that for any ''x'' in ''M'', there exist ''r''1, ''r''2, ..., ''r''''n'' in ''R'' with ''x'' = ''r''1''a''1 + ''r''2''a''2 + ... + ''r''''n''''a''''n''. The set is referred to as a gene ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Chain Complex
In mathematics, a chain complex is an algebraic structure that consists of a sequence of abelian groups (or modules) and a sequence of homomorphisms between consecutive groups such that the image of each homomorphism is contained in the kernel of the next. Associated to a chain complex is its homology, which is (loosely speaking) a measure of the failure of a chain complex to be exact. A cochain complex is similar to a chain complex, except that its homomorphisms are in the opposite direction. The homology of a cochain complex is called its cohomology. In algebraic topology, the singular chain complex of a topological space X is constructed using continuous maps from a simplex to X, and the homomorphisms of the chain complex capture how these maps restrict to the boundary of the simplex. The homology of this chain complex is called the singular homology of X, and is a commonly used invariant of a topological space. Chain complexes are studied in homological algebra, but a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Homology (mathematics)
In mathematics, the term homology, originally introduced in algebraic topology, has three primary, closely-related usages. The most direct usage of the term is to take the ''homology of a chain complex'', resulting in a sequence of Abelian group, abelian groups called ''homology groups.'' This operation, in turn, allows one to associate various named ''homologies'' or ''homology theories'' to various other types of mathematical objects. Lastly, since there are many homology theories for Topological space, topological spaces that produce the same answer, one also often speaks of the ''homology of a topological space''. (This latter notion of homology admits more intuitive descriptions for 1- or 2-dimensional topological spaces, and is sometimes referenced in popular mathematics.) There is also a related notion of the cohomology of a Cochain complexes, cochain complex, giving rise to various cohomology theories, in addition to the notion of the cohomology of a topological space. Ho ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Transpose
In linear algebra, the transpose of a Matrix (mathematics), matrix is an operator which flips a matrix over its diagonal; that is, it switches the row and column indices of the matrix by producing another matrix, often denoted by (among other notations). The transpose of a matrix was introduced in 1858 by the British mathematician Arthur Cayley. Transpose of a matrix Definition The transpose of a matrix , denoted by , , , A^, , , or , may be constructed by any one of the following methods: #Reflection (mathematics), Reflect over its main diagonal (which runs from top-left to bottom-right) to obtain #Write the rows of as the columns of #Write the columns of as the rows of Formally, the -th row, -th column element of is the -th row, -th column element of : :\left[\mathbf^\operatorname\right]_ = \left[\mathbf\right]_. If is an matrix, then is an matrix. In the case of square matrices, may also denote the th power of the matrix . For avoiding a possibl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Identity Matrix
In linear algebra, the identity matrix of size n is the n\times n square matrix with ones on the main diagonal and zeros elsewhere. It has unique properties, for example when the identity matrix represents a geometric transformation, the object remains unchanged by the transformation. In other contexts, it is analogous to multiplying by the number 1. Terminology and notation The identity matrix is often denoted by I_n, or simply by I if the size is immaterial or can be trivially determined by the context. I_1 = \begin 1 \end ,\ I_2 = \begin 1 & 0 \\ 0 & 1 \end ,\ I_3 = \begin 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end ,\ \dots ,\ I_n = \begin 1 & 0 & 0 & \cdots & 0 \\ 0 & 1 & 0 & \cdots & 0 \\ 0 & 0 & 1 & \cdots & 0 \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & 0 & \cdots & 1 \end. The term unit matrix has also been widely used, but the term ''identity matrix'' is now standard. The term ''unit matrix'' is ambiguous, because it is also used for a matrix of on ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Combination
In mathematics, a linear combination or superposition is an Expression (mathematics), expression constructed from a Set (mathematics), set of terms by multiplying each term by a constant and adding the results (e.g. a linear combination of ''x'' and ''y'' would be any expression of the form ''ax'' + ''by'', where ''a'' and ''b'' are constants). The concept of linear combinations is central to linear algebra and related fields of mathematics. Most of this article deals with linear combinations in the context of a vector space over a field (mathematics), field, with some generalizations given at the end of the article. Definition Let ''V'' be a vector space over the field ''K''. As usual, we call elements of ''V'' ''vector space, vectors'' and call elements of ''K'' ''scalar (mathematics), scalars''. If v1,...,v''n'' are vectors and ''a''1,...,''a''''n'' are scalars, then the ''linear combination of those vectors with those scalars as coefficients'' is :a_1 \mathbf v_1 + a_2 \mathbf ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bézout's Identity
In mathematics, Bézout's identity (also called Bézout's lemma), named after Étienne Bézout who proved it for polynomials, is the following theorem: Here the greatest common divisor of and is taken to be . The integers and are called Bézout coefficients for ; they are not unique. A pair of Bézout coefficients can be computed by the extended Euclidean algorithm, and this pair is, in the case of integers one of the two pairs such that and ; equality occurs only if one of and is a multiple of the other. As an example, the greatest common divisor of 15 and 69 is 3, and 3 can be written as a combination of 15 and 69 as , with Bézout coefficients −9 and 2. Many other theorems in elementary number theory, such as Euclid's lemma or the Chinese remainder theorem, result from Bézout's identity. A Bézout domain is an integral domain in which Bézout's identity holds. In particular, Bézout's identity holds in principal ideal domains. Every theorem that results from ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gcd Domain
In mathematics, a GCD domain (sometimes called just domain) is an integral domain ''R'' with the property that any two elements have a greatest common divisor (GCD); i.e., there is a unique minimal principal ideal containing the ideal generated by two given elements. Equivalently, any two elements of ''R'' have a least common multiple (LCM). A GCD domain generalizes a unique factorization domain (UFD) to a non-Noetherian setting in the following sense: an integral domain is a UFD if and only if it is a GCD domain satisfying the ascending chain condition on principal ideals (and in particular if it is Noetherian). GCD domains appear in the following chain of class inclusions: Properties Every irreducible element of a GCD domain is prime. A GCD domain is integrally closed, and every nonzero element is primal. In other words, every GCD domain is a Schreier domain. For every pair of elements ''x'', ''y'' of a GCD domain ''R'', a GCD ''d'' of ''x'' and ''y'' and an LCM ' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bézout Domain
In mathematics, a Bézout domain is an integral domain in which the sum of two principal ideals is also a principal ideal. This means that Bézout's identity holds for every pair of elements, and that every finitely generated ideal is principal. Bézout domains are a form of Prüfer domain. Any principal ideal domain (PID) is a Bézout domain, but a Bézout domain need not be a Noetherian ring, so it could have non-finitely generated ideals; if so, it is not a unique factorization domain (UFD), but is still a GCD domain. The theory of Bézout domains retains many of the properties of PIDs, without requiring the Noetherian property. Bézout domains are named after the French mathematician Étienne Bézout. Examples * All PIDs are Bézout domains. * Examples of Bézout domains that are not PIDs include the ring of entire functions (functions holomorphic on the whole complex plane) and the ring of all algebraic integers. In case of entire functions, the only irreducible eleme ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
