Categorification

In mathematics, categorification is the process of replacing set-theoretic theorems with analogues. Categorification, when done successfully, replaces sets with , functions with functors, and equations with natural isomorphisms of functors satisfying additional properties. The term was coined by Louis Crane. The reverse of categorification is the process of decategorification. Decategorification is a systematic process by which isomorphic objects in a category are identified as equal. Whereas decategorification is a straightforward process, categorification is usually much less straightforward. In the representation theory of Lie algebras, modules over specific algebras are the principal objects of study, and there are several frameworks for what a categorification of such a module should be, e.g., so called (weak) abelian categorifications. Categorification and decategorification are not precise mathematical procedures, but rather a class of possible analogues. They are used in a similar way to the words like 'generalization', and not like 'sheafification'. One form of categorification takes a structure described in terms of sets, and interprets the sets as isomorphism classes of objects in a category. For example, the set of natural numbers can be seen as the set of cardinalities of finite sets (and any two sets with the same cardinality are isomorphic). In this case, operations on the set of natural numbers, such as addition and multiplication, can be seen as carrying information about coproducts and of the . Less abstractly, the idea here is that manipulating sets of actual objects, and taking coproducts (combining two sets in a union) or products (building arrays of things to keep track of large numbers of them) came first. Later, the concrete structure of sets was abstracted away – taken "only up to isomorphism", to produce the abstract theory of arithmetic. This is a "decategorification" – categorification reverses this step. Other examples include homology theories in topology.

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 (1)

Related concepts (2)

Related courses (1)

Higher-dimensional algebra

In mathematics, especially () , higher-dimensional algebra is the study of categorified structures. It has applications in nonabelian algebraic topology, and generalizes abstract algebra. Category theory#Higher-dimensional categories A first step towards defining higher dimensional algebras is the concept of of , followed by the more 'geometric' concept of double category. A higher level concept is thus defined as a of categories, or super-category, which generalises to higher dimensions the notion of – regarded as any structure which is an interpretation of Lawvere's axioms of the elementary theory of abstract categories (ETAC).

Floer homology

In mathematics, Floer homology is a tool for studying symplectic geometry and low-dimensional topology. Floer homology is a novel invariant that arises as an infinite-dimensional analogue of finite-dimensional Morse homology. Andreas Floer introduced the first version of Floer homology, now called Lagrangian Floer homology, in his proof of the Arnold conjecture in symplectic geometry. Floer also developed a closely related theory for Lagrangian submanifolds of a symplectic manifold.

MATH-658: Vanishing cycles and perverse sheaves

This course will explain the theory of vanishing cycles and perverse sheaves. We will see how the Hard Lefschetz theorem can be proved using perverse sheaves. If we have more time we will try to see t

Short homology bases for hyperelliptic hyperbolic surfaces

Given a hyperelliptic hyperbolic surface S of genus g >= 2, we find bounds on the lengths of homologically independent loops on S. As a consequence, we show that for any lambda is an element of (0, 1) there exists a constant N(lambda) such that every such ...

Jerusalem2023