Dual (category theory)

﻿
Dual (category theory)

In category theory, a branch of mathematics, duality is a correspondence between properties of a category C and so-called dual properties of the opposite category Cop. Given a statement regarding the category C, by interchanging the source and target of each morphism as well as interchanging the order of composing two morphisms, a corresponding dual statement is obtained regarding the opposite category Cop. Duality, as such, is the assertion that truth is invariant under this operation on statements. In other words, if a statement is true about C, then its dual statement is true about Cop. Also, if a statement is false about C, then its dual has to be false about Cop.

Given a concrete category C, it is often the case that the opposite category Cop per se is abstract. Cop need not be a category that arises from mathematical practice. In this case, another category D is also termed to be in duality with C if D and Cop are equivalent as categories.

In the case when C and its opposite Cop are equivalent, such a category is self-dual.

Formal definition

We define the elementary language of category theory as the two-sorted first order language with objects and morphisms as distinct sorts, together with the relations of an object being the source or target of a morphism and a symbol for composing two morphisms.

Let σ be any statement in this language. We form the dual σop as follows:

1. Interchange each occurrence of "source" in σ with "target".
2. Interchange the order of composing morphisms. That is, replace each occurrence of $g \circ f$ with $f \circ g$

Informally, these conditions state that the dual of a statement is formed by reversing arrows and compositions.

Duality is the observation that σ is true for some category C if and only if σop is true for Cop.

Examples

• A morphism $f\colon A \to B$ is a monomorphism if $f \circ g = f \circ h$ implies g = h. Performing the dual operation, we get the statement that $g \circ f = h \circ f$ implies g = h. for a morphism $f\colon B \to A$. This is precisely what it means for f to be an epimorphism. In short, the property of being a monomorphism is dual to the property of being an epimorphism.

Applying duality, this means that a morphism in some category C is a monomorphism if and only if the reverse morphism in the opposite category Cop is an epimorphism.

• An example comes from reversing the direction of inequalities in a partial order. So if X is a set and ≤ a partial order relation, we can define a new partial order relation ≤new by
xnew y if and only if yx.

This example on orders is a special case, since partial orders correspond to a certain kind of category in which Hom(A,B) can have at most one element. In applications to logic, this then looks like a very general description of negation (that is, proofs run in the opposite direction). For example, if we take the opposite of a lattice, we will find that meets and joins have their roles interchanged. This is an abstract form of De Morgan's laws, or of duality applied to lattices.

References

Wikimedia Foundation. 2010.

Look at other dictionaries:

• Category theory — In mathematics, category theory deals in an abstract way with mathematical structures and relationships between them: it abstracts from sets and functions to objects and morphisms . Categories now appear in most branches of mathematics and in… …   Wikipedia

• Limit (category theory) — In category theory, a branch of mathematics, the abstract notion of a limit captures the essential properties of universal constructions such as products and inverse limits. The dual notion of a colimit generalizes constructions such as disjoint… …   Wikipedia

• Monad (category theory) — For the uses of monads in computer software, see monads in functional programming. In category theory, a branch of mathematics, a monad, Kleisli triple, or triple is an (endo )functor, together with two natural transformations. Monads are used in …   Wikipedia

• Cone (category theory) — In category theory, a branch of mathematics, the cone of a functor is an abstract notion used to define the limit of that functor. Cones make other appearances in category theory as well. Contents 1 Definition 2 Equivalent formulations 3 Category …   Wikipedia

• Kernel (category theory) — In category theory and its applications to other branches of mathematics, kernels are a generalization of the kernels of group homomorphisms and the kernels of module homomorphisms and certain other kernels from algebra. Intuitively, the kernel… …   Wikipedia

• Product (category theory) — In category theory, the product of two (or more) objects in a category is a notion designed to capture the essence behind constructions in other areas of mathematics such as the cartesian product of sets, the direct product of groups, the direct… …   Wikipedia

• Element (category theory) — In category theory, the concept of an element, or a point, generalizes the more usual set theoretic concept of an element of a set to an object of any category. This idea often allows to restate definitions or properties of morphisms (such as… …   Wikipedia

• Monoid (category theory) — In category theory, a monoid (or monoid object) (M,μ,η) in a monoidal category is an object M together with two morphisms called multiplication, and called unit, such that the diagrams and …   Wikipedia

• Pushout (category theory) — In category theory, a branch of mathematics, a pushout (also called a fibered coproduct or fibered sum or cocartesian square or amalgamed sum) is the colimit of a diagram consisting of two morphisms f : Z → X and g : Z → Y with a common …   Wikipedia

• Pullback (category theory) — In category theory, a branch of mathematics, a pullback (also called a fibered product or Cartesian square) is the limit of a diagram consisting of two morphisms f : X → Z and g : Y → Z with a common codomain. The pullback is often written: P = X …   Wikipedia