|
Commutative Diagram
350px, The commutative diagram used in the proof of the five lemma. In mathematics, and especially in category theory, a commutative diagram is a diagram such that all directed paths in the diagram with the same start and endpoints lead to the same result. It is said that commutative diagrams play the role in category theory that equations play in algebra. Description A commutative diagram often consists of three parts: * objects (also known as ''vertices'') * morphisms (also known as ''arrows'' or ''edges'') * paths or composites Arrow symbols In algebra texts, the type of morphism can be denoted with different arrow usages: * A monomorphism may be labeled with a \hookrightarrow or a \rightarrowtail. * An epimorphism may be labeled with a \twoheadrightarrow. * An isomorphism may be labeled with a \overset. * The dashed arrow typically represents the claim that the indicated morphism exists (whenever the rest of the diagram holds); the arrow may be optionally labeled as \exi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
5 Lemma
In mathematics, especially homological algebra and other applications of abelian category theory, the five lemma is an important and widely used lemma about commutative diagrams. The five lemma is not only valid for abelian categories but also works in the category of groups, for example. The five lemma can be thought of as a combination of two other theorems, the four lemmas, which are dual to each other. Statements Consider the following commutative diagram in any abelian category (such as the category of abelian groups or the category of vector spaces over a given field) or in the category of groups. : file:5 lemma.svg The five lemma states that, if the rows are exact, ''m'' and ''p'' are isomorphisms, ''l'' is an epimorphism, and ''q'' is a monomorphism, then ''n'' is also an isomorphism. The two four-lemmas state: Proof The method of proof we shall use is commonly referred to as diagram chasing. We shall prove the five lemma by individually proving each of the two ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
First Isomorphism Theorem (plain)
In mathematics, specifically abstract algebra, the isomorphism theorems (also known as Noether's isomorphism theorems) are theorems that describe the relationship between quotients, homomorphisms, and subobjects. Versions of the theorems exist for groups, rings, vector spaces, modules, Lie algebras, and various other algebraic structures. In universal algebra, the isomorphism theorems can be generalized to the context of algebras and congruences. History The isomorphism theorems were formulated in some generality for homomorphisms of modules by Emmy Noether in her paper ''Abstrakter Aufbau der Idealtheorie in algebraischen Zahl- und Funktionenkörpern'', which was published in 1927 in Mathematische Annalen. Less general versions of these theorems can be found in work of Richard Dedekind and previous papers by Noether. Three years later, B.L. van der Waerden published his influential ''Moderne Algebra'' the first abstract algebra textbook that took the groups-rings- fields a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ad Infinitum
''Ad infinitum'' is a Latin phrase meaning "to infinity" or "forevermore". Description In context, it usually means "continue forever, without limit" and this can be used to describe a non-terminating process, a non-terminating ''repeating'' process, or a set of instructions to be repeated "forever," among other uses. It may also be used in a manner similar to the Latin phrase '' et cetera'' to denote written words or a concept that continues for a lengthy period beyond what is shown. Examples include: * "The sequence 1, 2, 3, ... continues ''ad infinitum''." * "The perimeter of a fractal may be iteratively drawn ''ad infinitum''." The 17th-century writer Jonathan Swift incorporated the idea of self-similarity in the following lines from his satirical poem ''On Poetry: a Rhapsody'' (1733): The vermin only teaze and pinch Their foes superior by an inch. So, naturalists observe, a flea Has smaller fleas that on him prey; And these have smaller still to bite 'em, And so proceed '' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nine Lemma
right In mathematics, the nine lemma (or 3×3 lemma) is a statement about commutative diagrams and exact sequences valid in the category of groups and any abelian category. It states: if the diagram to the right is a commutative diagram and all columns as well as the two bottom rows are exact, then the top row is exact as well. Likewise, if all columns as well as the two top rows are exact, then the bottom row is exact as well. Similarly, because the diagram is symmetric about its diagonal, rows and columns may be interchanged in the above as well. The nine lemma can be proved by direct diagram chasing, or by applying the snake lemma The snake lemma is a tool used in mathematics, particularly homological algebra, to construct long exact sequences. The snake lemma is valid in every abelian category and is a crucial tool in homological algebra and its applications, for instance ... (to the two bottom rows in the first case, and to the two top rows in the second case). Linderh ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Zig-zag Lemma
In mathematics, particularly homological algebra, the zig-zag lemma asserts the existence of a particular long exact sequence in the homology groups of certain chain complexes. The result is valid in every abelian category. Statement In an abelian category (such as the category of abelian groups or the category of vector spaces over a given field), let (\mathcal,\partial_), (\mathcal,\partial_') and (\mathcal,\partial_'') be chain complexes that fit into the following short exact sequence: : 0 \longrightarrow \mathcal \mathrel \mathcal \mathrel \mathcal\longrightarrow 0 Such a sequence is shorthand for the following commutative diagram: commutative diagram representation of a short exact sequence of chain complexes where the rows are exact sequences and each column is a chain complex. The zig-zag lemma asserts that there is a collection of boundary maps : \delta_n : H_n(\mathcal) \longrightarrow H_(\mathcal), that makes the following sequence exact: long exact sequ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Snake Lemma
The snake lemma is a tool used in mathematics, particularly homological algebra, to construct long exact sequences. The snake lemma is valid in every abelian category and is a crucial tool in homological algebra and its applications, for instance in algebraic topology. Homomorphisms constructed with its help are generally called ''connecting homomorphisms''. Statement In an abelian category (such as the category of abelian groups or the category of vector spaces over a given field), consider a commutative diagram: : where the rows are exact sequences and 0 is the zero object. Then there is an exact sequence relating the kernels and cokernels of ''a'', ''b'', and ''c'': :\ker a ~~ \ker b ~~ \ker c ~\overset~ \operatornamea ~~ \operatornameb ~~ \operatornamec where ''d'' is a homomorphism, known as the ''connecting homomorphism''. Furthermore, if the morphism ''f'' is a monomorphism, then so is the morphism \ker a ~~ \ker b, and if ''g is an epimorphism, then so is \ope ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Five Lemma
In mathematics, especially homological algebra and other applications of abelian category theory, the five lemma is an important and widely used lemma about commutative diagrams. The five lemma is not only valid for abelian categories but also works in the category of groups, for example. The five lemma can be thought of as a combination of two other theorems, the four lemmas, which are dual to each other. Statements Consider the following commutative diagram in any abelian category (such as the category of abelian groups or the category of vector spaces over a given field) or in the category of groups. : file:5 lemma.svg The five lemma states that, if the rows are exact, ''m'' and ''p'' are isomorphisms, ''l'' is an epimorphism, and ''q'' is a monomorphism, then ''n'' is also an isomorphism. The two four-lemmas state: Proof The method of proof we shall use is commonly referred to as diagram chasing. We shall prove the five lemma by individually proving each of the two fo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Syllogism
A syllogism ( grc-gre, συλλογισμός, ''syllogismos'', 'conclusion, inference') is a kind of logical argument that applies deductive reasoning to arrive at a conclusion based on two propositions that are asserted or assumed to be true. In its earliest form (defined by Aristotle in his 350 BCE book '' Prior Analytics''), a syllogism arises when two true premises (propositions or statements) validly imply a conclusion, or the main point that the argument aims to get across. For example, knowing that all men are mortal (major premise) and that Socrates is a man (minor premise), we may validly conclude that Socrates is mortal. Syllogistic arguments are usually represented in a three-line form: All men are mortal. Socrates is a man. Therefore, Socrates is mortal.In antiquity, two rival syllogistic theories existed: Aristotelian syllogism and Stoic syllogism. From the Middle Ages onwards, ''categorical syllogism'' and ''syllogism'' were usually used interchangeably. Thi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Exact Sequence
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 |
Surjective
In mathematics, a surjective function (also known as surjection, or onto function) is a function that every element can be mapped from element so that . In other words, every element of the function's codomain is the image of one element of its domain. It is not required that be unique; the function may map one or more elements of to the same element of . The term ''surjective'' and the related terms '' injective'' and '' bijective'' were introduced by Nicolas Bourbaki, a group of mainly French 20th-century mathematicians who, under this pseudonym, wrote a series of books presenting an exposition of modern advanced mathematics, beginning in 1935. The French word '' sur'' means ''over'' or ''above'', and relates to the fact that the image of the domain of a surjective function completely covers the function's codomain. Any function induces a surjection by restricting its codomain to the image of its domain. Every surjective function has a right inverse assuming the ... [...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] |
Homological Algebra
Homological algebra is the branch of mathematics that studies 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 modules and 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 both their homology and cohomology. Homological algebra affords the means to extract information contained in these complexes and present it in the form of homological invariants of rings, modules, topological spaces, and other 'tangible' mathematical objects. A powerful tool for doing this is provided by spectral sequences. It has pla ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
