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.
Module (mathematics)In mathematics, a module is a generalization of the notion of vector space in which the field of scalars is replaced by a ring. The concept of module generalizes also the notion of abelian group, since the abelian groups are exactly the modules over the ring of integers. Like a vector space, a module is an additive abelian group, and scalar multiplication is distributive over the operation of addition between elements of the ring or module and is compatible with the ring multiplication.
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.
Exact functorIn mathematics, particularly homological algebra, an exact functor is a functor that preserves short exact sequences. Exact functors are convenient for algebraic calculations because they can be directly applied to presentations of objects. Much of the work in homological algebra is designed to cope with functors that fail to be exact, but in ways that can still be controlled. Let P and Q be abelian categories, and let F: P→Q be a covariant additive functor (so that, in particular, F(0) = 0).
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.
Hom functorIn mathematics, specifically in , hom-sets (i.e. sets of morphisms between ) give rise to important functors to the . These functors are called hom-functors and have numerous applications in category theory and other branches of mathematics. Let C be a (i.e. a for which hom-classes are actually sets and not proper classes). For all objects A and B in C we define two functors to the as follows: {| class=wikitable |- ! Hom(A, –) : C → Set ! Hom(–, B) : C → Set |- | This is a covariant functor given by: Hom(A, –) maps each object X in C to the set of morphisms, Hom(A, X) Hom(A, –) maps each morphism f : X → Y to the function Hom(A, f) : Hom(A, X) → Hom(A, Y) given by for each g in Hom(A, X).
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.
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 .
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.
Supply chain managementIn commerce, supply chain management (SCM) deals with a system of procurement (purchasing raw materials/components), operations management (ensuring the production of high-quality products at high speed with good flexibility and low production cost), logistics and marketing channels, so that the raw materials can be converted into a finished product and delivered to the end customer.
