Home | About | Tools
home » context search

Search within these results

abelian
abstract
additive
adjoint
adjunction
algebra
algebraic
arrows
assigns
associates
axiomatic
axioms
bifunctor
bimorphisms
categorical
category
cocomplete
colimit
comma
commutative
commutes
cone
constructions
contravariant
counit
covariant
definition
diagram
dimensional
dual
dually
eilenberg
equivalence
every
forgetful
foundations
freyd
functor
graphs
grp
hom
homomorphism
homotopy
identity
indexing
isomorphism
lane
lawvere
left
lemma
limit
logic
mac
maps
mathematical
mathematics
mod
modules
monad
monic
monoid
morphism
natural
naturally
notion
object
operads
pair
preserving
presheaves
representable
ring
saunders
sets
sheaves
spaces
tensor
theory
topological
topology
topos
transformation
unique
universal
vect
yoneda
More results:   Start [1] 2 3 4 5 6 7   Next

Matching Pages (82 found; page 1 of 7)

Category theory - Wikipedia

Functors Main article: functor Functors are structure-preserving maps between categories. They can be thought of as morphisms in the category of al...

Category theory - Wikipedia

Functors Main article: functor Functors are structure-preserving maps between categories. They can be thought of as morphisms in the category of al...

Functor - Wikipedia

Diagonal functor : The diagonal functor is defined as the functor from D to the functor category D C which sends each object in D to the constant f...

Adjoint functors - Wikipedia

Problems formulated with adjoint functors 1.3 Adjoint functors as solving optimization problems 1.4 The case of partial orders 2 Formal definitions...

Representable functor - Wikipedia

Preservation of limits Representable functors are naturally isomorphic to Hom functors and therefore share their properties. In particular, (covari...

Hom functor - Wikipedia

Yoneda's lemma asserts that every natural transformation between Hom functors is of this form. In other words, the Hom functors give rise to a full...

Functor category - Wikipedia

C ) can be made precise in several ways; the most succinct formulation uses the language of adjoint functors . Every functor F  : D ? E induces a f...

Comma category - Wikipedia

Limits and universal morphisms Colimits in comma categories may be "inherited". If and are cocomplete, is a cocontinuous functor, and another funct...

Cone (category theory) - Wikipedia

Universal cones Limits and colimits are defined as universal cones . That is, cones through which all other cones factor. A cone ? from L to F is a...

Monad (category theory) - Wikipedia

Beck's monadicity theorem gives a characterization of monadic functors. [ edit ] Uses Monads are used in functional programming to express types of...

Morphism - Wikipedia

A bimorphism is a morphism that is both an epimorphism and a monomorphism. Isomorphism : f  : X ? Y is called an isomorphism if there exists a morp...

Subcategory - Wikipedia

P. Freyd [1] ) if it contains all the objects of C . A lluf subcategory is typically not full: the only full lluf subcategory of a category is that...

Cartesian closed category - Wikipedia

G -sets are nothing but functors from this category to Set The category of all directed graphs is cartesian closed; this is a functor category as e...

More results:   Start [1] 2 3 4 5 6 7   Next
About Us | Feedback | Contact Us | ©2007 Trailfire Inc. All rights reserved.