Lecture

Active Learning in Category Theory

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

MATH-211: Algebra II - groups

This course deals with group theory, with particular emphasis on group actions and notions of category theory. ...

Description

This lecture delves into various examples of categories and some examples of functors, discussing the minimal number of morphisms in a category, the concept of groupoids, defining a composition law on a directed graph to form a category, and the preservation of composition and identities by functors.

Instructor

Kathryn Hess Bellwald

Kathryn Hess Bellwald received her PhD from MIT in 1989 and held positions at the universities of Stockholm, Nice, and Toronto before moving to the EPFL.Her research focuses on algebraic topology and its applications, primarily in the life sciences, but also in materials science. She has published extensively on topics in pure algebraic topology including homotopy theory, operad theory, and algebraic K-theory. On the applied side, she has elaborated methods based on topological data analysis for high-throughput screening of nanoporous crystalline materials, classification and synthesis of neuron morphologies, and classification of neuronal network dynamics. She has also developed and applied innovative topological approaches to network theory, leading to a powerful, parameter-free mathematical framework relating the activity of a neural network to its underlying structure, both locally and globally.In 2016 she was elected to Swiss Academy of Engineering Sciences and was named a fellow of the American Mathematical Society and a distinguished speaker of the European Mathematical Society in 2017. In 2021 she gave an invited Public Lecture at the European Congress of Mathematicians. She has won several teaching prizes at EPFL, including the Crédit Suisse teaching prize and the Polysphère d’Or.

Official source

Ontological neighbourhood

Mathematics

Algebra: Abstract algebra

Discrete mathematics: Graph theory

Related concepts (32)

Directed graph

In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed edges, often called arcs. In formal terms, a directed graph is an ordered pair where V is a set whose elements are called vertices, nodes, or points; A is a set of ordered pairs of vertices, called arcs, directed edges (sometimes simply edges with the corresponding set named E instead of A), arrows, or directed lines.

Functor

In mathematics, specifically , a functor is a mapping between . Functors were first considered in algebraic topology, where algebraic objects (such as the fundamental group) are associated to topological spaces, and maps between these algebraic objects are associated to continuous maps between spaces. Nowadays, functors are used throughout modern mathematics to relate various categories. Thus, functors are important in all areas within mathematics to which is applied.

Category theory

Category theory is a general theory of mathematical structures and their relations that was introduced by Samuel Eilenberg and Saunders Mac Lane in the middle of the 20th century in their foundational work on algebraic topology. Category theory is used in almost all areas of mathematics. In particular, numerous constructions of new mathematical objects from previous ones that appear similarly in several contexts are conveniently expressed and unified in terms of categories.

Adjoint functors

In mathematics, specifically , adjunction is a relationship that two functors may exhibit, intuitively corresponding to a weak form of equivalence between two related categories. Two functors that stand in this relationship are known as adjoint functors, one being the left adjoint and the other the right adjoint. Pairs of adjoint functors are ubiquitous in mathematics and often arise from constructions of "optimal solutions" to certain problems (i.e.

Directed acyclic graph

In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it consists of vertices and edges (also called arcs), with each edge directed from one vertex to another, such that following those directions will never form a closed loop. A directed graph is a DAG if and only if it can be topologically ordered, by arranging the vertices as a linear ordering that is consistent with all edge directions.

Related lectures (64)

Categories and Functors

Explores building categories from graphs and the encoding of information by functors.

Adjunctions and Limits: Exploring Functors and Co-limits

Covers adjunctions and limits, focusing on functors, co-limits, and their applications in category theory.

Category Theory: Introduction

Explores the concept of category theory, providing examples and discussing the opposite category concept.

Limits and Colimits in Functor Categories

Explores limits and colimits in functor categories, focusing on equalizers, pullbacks, and their significance in category theory.