Representable functor | EPFL Graph Search

Are you an EPFL student looking for a semester project?

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

In mathematics, particularly , a representable functor is a certain functor from an arbitrary into the . Such functors give representations of an abstract category in terms of known structures (i.e. sets and functions) allowing one to utilize, as much as possible, knowledge about the category of sets in other settings. From another point of view, representable functors for a category C are the functors given with C. Their theory is a vast generalisation of upper sets in posets, and of Cayley's theorem in group theory. Let C be a and let Set be the . For each object A of C let Hom(A,–) be the hom functor that maps object X to the set Hom(A,X). A functor F : C → Set is said to be representable if it is naturally isomorphic to Hom(A,–) for some object A of C. A representation of F is a pair (A, Φ) where Φ : Hom(A,–) → F is a natural isomorphism. A contravariant functor G from C to Set is the same thing as a functor G : Cop → Set and is commonly called a . A presheaf is representable when it is naturally isomorphic to the contravariant hom-functor Hom(–,A) for some object A of C. According to Yoneda's lemma, natural transformations from Hom(A,–) to F are in one-to-one correspondence with the elements of F(A). Given a natural transformation Φ : Hom(A,–) → F the corresponding element u ∈ F(A) is given by Conversely, given any element u ∈ F(A) we may define a natural transformation Φ : Hom(A,–) → F via where f is an element of Hom(A,X). In order to get a representation of F we want to know when the natural transformation induced by u is an isomorphism. This leads to the following definition: A universal element of a functor F : C → Set is a pair (A,u) consisting of an object A of C and an element u ∈ F(A) such that for every pair (X,v) consisting of an object X of C and an element v ∈ F(X) there exists a unique morphism f : A → X such that (Ff)(u) = v. A universal element may be viewed as a universal morphism from the one-point set {•} to the functor F or as an initial object in the of F.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (7)

Simple and projective correspondence functors

Jacques Thévenaz, Serge Bouc

A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. We determine exactly which simple correspondence

2019

Correspondence functors and finiteness conditions

Jacques Thévenaz, Serge Bouc

We investigate the representation theory of finite sets. The correspondence functors are the functors from the category of finite sets and correspondences to the category of k-modules, where k is a co

2018

Tensor product of correspondence functors

Jacques Thévenaz, Serge Bouc

As part of the study of correspondence functors, the present paper investigates their tensor product and proves some of its main properties. In particular, the correspondence functor associated to a f

2018

Related people (2)

Jacques Thévenaz, Serge Bouc

Related concepts (32)

Related courses (19)

Related lectures (145)

Representable functor

Yoneda lemma

In mathematics, the Yoneda lemma is arguably the most important result in . It is an abstract result on functors of the type morphisms into a fixed object. It is a vast generalisation of Cayley's theorem from group theory (viewing a group as a miniature category with just one object and only isomorphisms). It allows the of any into a (contravariant set-valued functors) defined on that category. It also clarifies how the embedded category, of representable functors and their natural transformations, relates to the other objects in the larger functor category.

Presheaf (category theory)

In , a branch of mathematics, a presheaf on a is a functor . If is the poset of open sets in a topological space, interpreted as a category, then one recovers the usual notion of presheaf on a topological space. A morphism of presheaves is defined to be a natural transformation of functors. This makes the collection of all presheaves on into a category, and is an example of a . It is often written as . A functor into is sometimes called a profunctor.

MATH-506: Topology IV.b - cohomology rings

Singular cohomology is defined by dualizing the singular chain complex for spaces. We will study its basic properties, see how it acquires a multiplicative structure and becomes a graded commutative a

MATH-483: Gödel and recursivity

Gödel incompleteness theorems and mathematical foundations of computer science

DH-406: Machine learning for DH

This course aims to introduce the basic principles of machine learning in the context of the digital humanities. We will cover both supervised and unsupervised learning techniques, and study and imple

Cohomology of C2: Cup Product MATH-506: Topology IV.b - cohomology rings

Covers the cup product in the cohomology of C2, showing how non-trivial elements are represented by cocycles.

Cohomology Operations: Cup Products and Bockstein MATH-506: Topology IV.b - cohomology rings

Explores cup products, Bockstein homomorphisms, and Steenrod algebra in cohomology.

Cohomology: Cup Product MATH-506: Topology IV.b - cohomology rings

Covers the cup product in cohomology, focusing on examples and computations.