FACTOID # 76: The fourteen unhappiest countries are all in Eastern Europe.
 
 Home   Encyclopedia   Statistics   Countries A-Z   Flags   Maps   Education   Forum   FAQ   About 
 
WHAT'S NEW
RECENT ARTICLES
More Recent Articles »
 

SEARCH ALL

FACTS & STATISTICS    Advanced view

Search encyclopedia, statistics and forums:

 

 

(* = Graphable)

 

 


Encyclopedia > Categorial duality

In category theory, an abstract branch of mathematics, the dual of a category C is the category formed by reversing all the morphisms of C. That is, we take Cop to be the category with objects that are those of C, but with the morphisms from X to Y in Cop being the morphisms from Y to X in C. Hence, the dual of a dual of a category is itself. The dual category is also called the opposite category.


Examples come 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 ≤new by the definition

xnew y if and only if yx.

For example, there are opposite pairs child/parent, or descendant/ancestor.


This is a special case, since partial orders correspond to a certain kind of category in which Mor(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.


Generalising that observation, limits and colimits are interchanged when one passes to the opposite category. This is immediately useful, when one can identify the opposite category in concrete terms. For example the category of affine schemes is equivalent to the opposite of the category of commutative rings. The Pontryagin duality restricts to an equivalence between the category of compact Hausdorff abelian topological groups and the opposite of the category of (discrete) abelian groups. The category of Stone spaces and continuous functions is equivalent to the opposite of the category of Boolean algebras and homomorphisms.


A duality between categories C and D is defined as an equivalence between C and the opposite of D. The above are all examples of dualities.


One other way in which the concept is used is to remove the distinction between covariant and contravariant functors: a contravariant functor to D is equally a functor to the opposite of D.


See also: Duality (mathematics)




  Results from FactBites:
 
Duality for Simple $\omega$-Categories and Disks (212 words)
The category $\cal S$ of simple $\omega$-categories is a full subcategory of the category, with strict $\omega$-functors as morphisms, of all $\omega$-categories.
The category $\cal S$ is a key ingredient in another concept of weak $\omega$-category, called protocategory.
We prove that $\cal D$ and $\cal S$ are contravariantly equivalent, by a duality induced by a suitable schizophrenic object living in both categories.
Equivalence of categories - Wikipedia, the free encyclopedia (1435 words)
An equivalence of categories consists of a functor between the involved categories, which is required to have an "inverse" functor.
One of the central themes of algebraic geometry is the duality of the category of affine schemes and the category of commutative rings.
In pointless topology the category of spatial locales is known to be equivalent to the dual of the category of sober spaces.
  More results at FactBites »


 

COMMENTARY     


Share your thoughts, questions and commentary here
Your name
Your comments
Please enter the 5-letter protection code

Want to know more?
Search encyclopedia, statistics and forums:

 


Lesson Plans | Student Area | Student FAQ | Reviews | Press Releases |  Feeds | Contact
The Wikipedia article included on this page is licensed under the GFDL.
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms.