Commutative diagramIn mathematics, and especially in , a commutative diagram is a 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. A commutative diagram often consists of three parts: (also known as vertices) morphisms (also known as arrows or edges) paths or composites In algebra texts, the type of morphism can be denoted with different arrow usages: A monomorphism may be labeled with a or a .
Homological algebraHomological 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 .
Algebra homomorphismIn mathematics, an algebra homomorphism is a homomorphism between two algebras. More precisely, if A and B are algebras over a field (or a ring) K, it is a function such that, for all k in K and x, y in A, one has The first two conditions say that F is a K-linear map, and the last condition says that F preserves the algebra multiplication. So, if the algebras are associative, F is a rng homomorphism, and, if the algebras are rings and F preserves the identity, it is a ring homomorphism.
Commutative algebraCommutative algebra, first known as ideal theory, is the branch of algebra that studies commutative rings, their ideals, and modules over such rings. Both algebraic geometry and algebraic number theory build on commutative algebra. Prominent examples of commutative rings include polynomial rings; rings of algebraic integers, including the ordinary integers ; and p-adic integers. Commutative algebra is the main technical tool in the local study of schemes.
Exact sequenceAn exact sequence is a sequence of morphisms between objects (for example, groups, rings, modules, and, more generally, objects of an ) such that the of one morphism equals the kernel of the next. In the context of group theory, a sequence of groups and group homomorphisms is said to be exact at if . The sequence is called exact if it is exact at each for all , i.e., if the image of each homomorphism is equal to the kernel of the next. The sequence of groups and homomorphisms may be either finite or infinite.
Homotopy category of chain complexesIn homological algebra in mathematics, the homotopy category K(A) of chain complexes in an A is a framework for working with chain homotopies and homotopy equivalences. It lies intermediate between the category of chain complexes Kom(A) of A and the D(A) of A when A is ; unlike the former it is a , and unlike the latter its formation does not require that A is abelian. Philosophically, while D(A) turns into isomorphisms any maps of complexes that are quasi-isomorphisms in Kom(A), K(A) does so only for those that are quasi-isomorphisms for a "good reason", namely actually having an inverse up to homotopy equivalence.
Resolution (algebra)In mathematics, and more specifically in homological algebra, a resolution (or left resolution; dually a coresolution or right resolution) is an exact sequence of modules (or, more generally, of s of an ), which is used to define invariants characterizing the structure of a specific module or object of this category. When, as usually, arrows are oriented to the right, the sequence is supposed to be infinite to the left for (left) resolutions, and to the right for right resolutions.
Chain (algebraic topology)In algebraic topology, a -chain is a formal linear combination of the -cells in a cell complex. In simplicial complexes (respectively, cubical complexes), -chains are combinations of -simplices (respectively, -cubes), but not necessarily connected. Chains are used in homology; the elements of a homology group are equivalence classes of chains. For a simplicial complex , the group of -chains of is given by: where are singular -simplices of . Note that any element in not necessary to be a connected simplicial complex.
Universal coefficient theoremIn algebraic topology, universal coefficient theorems establish relationships between homology groups (or cohomology groups) with different coefficients. For instance, for every topological space X, its integral homology groups: Hi(X; Z) completely determine its homology groups with coefficients in A, for any abelian group A: Hi(X; A) Here Hi might be the simplicial homology, or more generally the singular homology. The usual proof of this result is a pure piece of homological algebra about chain complexes of free abelian groups.
Value chainA value chain is a progression of activities that a firm operating in a specific industry performs in order to deliver a valuable product (i.e., good and/or service) to the end customer. The concept comes through business management and was first described by Michael Porter in his 1985 best-seller, Competitive Advantage: Creating and Sustaining Superior Performance. The idea of the value chain is based on the process view of organizations, the idea of seeing a manufacturing (or service) organization as a system, made up of subsystems each with inputs, transformation processes and outputs.
Supply chainA supply chain, sometimes expressed as a "supply-chain", is a complex logistics system that consists of facilities that convert raw materials into finished products and distribute them to end consumers or end customers. Meanwhile, supply chain management deals with the flow of goods within the supply chain in the most efficient manner. In sophisticated supply chain systems, used products may re-enter the supply chain at any point where residual value is recyclable. Supply chains link value chains.
Tensor-hom adjunctionIn mathematics, the tensor-hom adjunction is that the tensor product and hom-functor form an adjoint pair: This is made more precise below. The order of terms in the phrase "tensor-hom adjunction" reflects their relationship: tensor is the left adjoint, while hom is the right adjoint. Say R and S are (possibly noncommutative) rings, and consider the right module categories (an analogous statement holds for left modules): Fix an -bimodule and define functors and as follows: Then is left adjoint to .
