Concept

Rational homotopy theory

In mathematics and specifically in topology, rational homotopy theory is a simplified version of homotopy theory for topological spaces, in which all torsion in the homotopy groups is ignored. It was founded by and . This simplification of homotopy theory makes certain calculations much easier. Rational homotopy types of simply connected spaces can be identified with (isomorphism classes of) certain algebraic objects called Sullivan minimal models, which are commutative differential graded algebras over the rational numbers satisfying certain conditions. A geometric application was the theorem of Sullivan and Micheline Vigué-Poirrier (1976): every simply connected closed Riemannian manifold X whose rational cohomology ring is not generated by one element has infinitely many geometrically distinct closed geodesics. The proof used rational homotopy theory to show that the Betti numbers of the free loop space of X are unbounded. The theorem then follows from a 1969 result of Detlef Gromoll and Wolfgang Meyer. A continuous map of simply connected topological spaces is called a rational homotopy equivalence if it induces an isomorphism on homotopy groups tensored with the rational numbers . Equivalently: f is a rational homotopy equivalence if and only if it induces an isomorphism on singular homology groups with rational coefficients. The rational homotopy category (of simply connected spaces) is defined to be the of the of simply connected spaces with respect to rational homotopy equivalences. The goal of rational homotopy theory is to understand this category (i.e. to determine the information that can be recovered from rational homotopy equivalences). One basic result is that the rational homotopy category is equivalent to a of the of topological spaces, the subcategory of rational spaces. By definition, a rational space is a simply connected CW complex all of whose homotopy groups are vector spaces over the rational numbers.

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.

Graph Chatbot

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.