|
Syzygy Theorem
In mathematics, Hilbert's syzygy theorem is one of the three fundamental theorems about polynomial rings over fields, first proved by David Hilbert in 1890, that were introduced for solving important open questions in invariant theory, and are at the basis of modern algebraic geometry. The two other theorems are Hilbert's basis theorem, which asserts that all ideals of polynomial rings over a field are finitely generated, and Hilbert's Nullstellensatz, which establishes a bijective correspondence between affine algebraic varieties and prime ideals of polynomial rings. Hilbert's syzygy theorem concerns the ''relations'', or syzygies in Hilbert's terminology, between the generators of an ideal, or, more generally, a module. As the relations form a module, one may consider the relations between the relations; the theorem asserts that, if one continues in this way, starting with a module over a polynomial ring in indeterminates over a field, one eventually finds a zero module of ... [...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] |
Homological Algebra
Homological algebra is the branch of mathematics that studies homology (mathematics), homology in a general algebraic setting. It is a relatively young discipline, whose origins can be traced to investigations in combinatorial topology (a precursor to algebraic topology) and abstract algebra (theory of module (mathematics), modules and Syzygy (mathematics), syzygies) at the end of the 19th century, chiefly by Henri Poincaré and David Hilbert. Homological algebra is the study of homological functors and the intricate algebraic structures that they entail; its development was closely intertwined with the emergence of category theory. A central concept is that of chain complexes, which can be studied through their homology and cohomology. Homological algebra affords the means to extract information contained in these complexes and present it in the form of homological invariant (mathematics), invariants of ring (mathematics), rings, modules, topological spaces, and other "tangible ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Direct Sum Of Modules
In abstract algebra, the direct sum is a construction which combines several modules into a new, larger module. The direct sum of modules is the smallest module which contains the given modules as submodules with no "unnecessary" constraints, making it an example of a coproduct. Contrast with the direct product, which is the dual notion. The most familiar examples of this construction occur when considering vector spaces (modules over a field) and abelian groups (modules over the ring Z of integers). The construction may also be extended to cover Banach spaces and Hilbert spaces. See the article decomposition of a module for a way to write a module as a direct sum of submodules. Construction for vector spaces and abelian groups We give the construction first in these two cases, under the assumption that we have only two objects. Then we generalize to an arbitrary family of arbitrary modules. The key elements of the general construction are more clearly identified ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Exact Sequence
In mathematics, an exact sequence is a sequence of morphisms between objects (for example, groups, rings, modules, and, more generally, objects of an abelian category) such that the image of one morphism equals the kernel of the next. Definition In the context of group theory, a sequence :G_0\;\xrightarrow\; G_1 \;\xrightarrow\; G_2 \;\xrightarrow\; \cdots \;\xrightarrow\; G_n of groups and group homomorphisms is said to be exact at G_i if \operatorname(f_i)=\ker(f_). The sequence is called exact if it is exact at each G_i for all 1\leq i |
Linear Map
In mathematics, and more specifically in linear algebra, a linear map (also called a linear mapping, linear transformation, vector space homomorphism, or in some contexts linear function) is a mapping V \to W between two vector spaces that preserves the operations of vector addition and scalar multiplication. The same names and the same definition are also used for the more general case of modules over a ring; see Module homomorphism. If a linear map is a bijection then it is called a . In the case where V = W, a linear map is called a linear endomorphism. Sometimes the term refers to this case, but the term "linear operator" can have different meanings for different conventions: for example, it can be used to emphasize that V and W are real vector spaces (not necessarily with V = W), or it can be used to emphasize that V is a function space, which is a common convention in functional analysis. Sometimes the term ''linear function'' has the same meaning as ''linear m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kernel (linear Algebra)
In mathematics, the kernel of a linear map, also known as the null space or nullspace, is the part of the domain which is mapped to the zero vector of the co-domain; the kernel is always a linear subspace of the domain. That is, given a linear map between two vector spaces and , the kernel of is the vector space of all elements of such that , where denotes the zero vector in , or more symbolically: \ker(L) = \left\ = L^(\mathbf). Properties The kernel of is a linear subspace of the domain .Linear algebra, as discussed in this article, is a very well established mathematical discipline for which there are many sources. Almost all of the material in this article can be found in , , and Strang's lectures. In the linear map L : V \to W, two elements of have the same image in if and only if their difference lies in the kernel of , that is, L\left(\mathbf_1\right) = L\left(\mathbf_2\right) \quad \text \quad L\left(\mathbf_1-\mathbf_2\right) = \mathbf. From this, it follows ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tuple
In mathematics, a tuple is a finite sequence or ''ordered list'' of numbers or, more generally, mathematical objects, which are called the ''elements'' of the tuple. An -tuple is a tuple of elements, where is a non-negative integer. There is only one 0-tuple, called the ''empty tuple''. A 1-tuple and a 2-tuple are commonly called a singleton and an ordered pair, respectively. The term ''"infinite tuple"'' is occasionally used for ''"infinite sequences"''. Tuples are usually written by listing the elements within parentheses "" and separated by commas; for example, denotes a 5-tuple. Other types of brackets are sometimes used, although they may have a different meaning. An -tuple can be formally defined as the image of a function that has the set of the first natural numbers as its domain. Tuples may be also defined from ordered pairs by a recurrence starting from an ordered pair; indeed, an -tuple can be identified with the ordered pair of its first elements and its t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Free Module
In mathematics, a free module is a module that has a ''basis'', that is, a generating set that is linearly independent. Every vector space is a free module, but, if the ring of the coefficients is not a division ring (not a field in the commutative case), then there exist non-free modules. Given any set and ring , there is a free -module with basis , which is called the ''free module on'' or ''module of formal'' -''linear combinations'' of the elements of . A free abelian group is precisely a free module over the ring \Z of integers. Definition For a ring R and an R- module M, the set E\subseteq M is a basis for M if: * E is a generating set for M; that is to say, every element of M is a finite sum of elements of E multiplied by coefficients in R; and * E is linearly independent: for every set \\subset E of distinct elements, r_1 e_1 + r_2 e_2 + \cdots + r_n e_n = 0_M implies that r_1 = r_2 = \cdots = r_n = 0_R (where 0_M is the zero element of M and 0_R is the zer ... [...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] |
Ring (mathematics)
In mathematics, a ring is an algebraic structure consisting of a set with two binary operations called ''addition'' and ''multiplication'', which obey the same basic laws as addition and multiplication of integers, except that multiplication in a ring does not need to be commutative. 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. A ''ring'' may be defined as a set that is endowed with two binary operations called ''addition'' and ''multiplication'' such that the ring is an abelian group with respect to the addition operator, and the multiplication operator is associative, is distributive over the addition operation, and has a multiplicative identity element. (Some authors apply the term ''ring'' to a further generalization, often called a '' rng'', that omits the requirement for a multiplicative identity, and instead call the structure defi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hilbert–Burch Theorem
In mathematics, the Hilbert–Burch theorem describes the structure of some free resolutions of a quotient of a local or graded ring in the case that the quotient has projective dimension 2. proved a version of this theorem for polynomial rings, and proved a more general version. Several other authors later rediscovered and published variations of this theorem. gives a statement and proof. Statement If ''R'' is a local ring with an ideal ''I'' and : 0 \rightarrow R^m\stackrel R^n \rightarrow R \rightarrow R/I\rightarrow 0 is a free resolution of the ''R''- module ''R''/''I'', then ''m'' = ''n'' – 1 and the ideal ''I'' is ''aJ'' where ''a'' is a regular element of ''R'' and ''J'', a depth-2 ideal, is the first Fitting ideal \operatorname_1 I of ''I'', i.e., the ideal generated by the determinant In mathematics, the determinant is a Scalar (mathematics), scalar-valued function (mathematics), function of the entries of a square matrix. The determ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Invariant Theory
Invariant theory is a branch of abstract algebra dealing with actions of groups on algebraic varieties, such as vector spaces, from the point of view of their effect on functions. Classically, the theory dealt with the question of explicit description of polynomial functions that do not change, or are ''invariant'', under the transformations from a given linear group. For example, if we consider the action of the special linear group ''SLn'' on the space of ''n'' by ''n'' matrices by left multiplication, then the determinant is an invariant of this action because the determinant of ''A X'' equals the determinant of ''X'', when ''A'' is in ''SLn''. Introduction Let G be a group, and V a finite-dimensional vector space over a field k (which in classical invariant theory was usually assumed to be the complex numbers). A representation of G in V is a group homomorphism \pi:G \to GL(V), which induces a group action of G on V. If k /math> is the space of polynomial functions on ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
