In mathematics, the cohomology operation concept became central to algebraic topology, particularly homotopy theory, from the 1950s onwards, in the shape of the simple definition that if F is a functor defining a cohomology theory, then a cohomology operation should be a natural transformation from F to itself. Throughout there have been two basic points: the operations can be studied by combinatorial means; and the effect of the operations is to yield an interesting bicommutant theory. The origin of these studies was the work of Pontryagin, Postnikov, and Norman Steenrod, who first defined the Pontryagin square, Postnikov square, and Steenrod square operations for singular cohomology, in the case of mod 2 coefficients. The combinatorial aspect there arises as a formulation of the failure of a natural diagonal map, at cochain level. The general theory of the Steenrod algebra of operations has been brought into close relation with that of the symmetric group. In the Adams spectral sequence the bicommutant aspect is implicit in the use of Ext functors, the derived functors of Hom-functors; if there is a bicommutant aspect, taken over the Steenrod algebra acting, it is only at a derived level. The convergence is to groups in stable homotopy theory, about which information is hard to come by. This connection established the deep interest of the cohomology operations for homotopy theory, and has been a research topic ever since. An extraordinary cohomology theory has its own cohomology operations, and these may exhibit a richer set on constraints. A cohomology operation of type is a natural transformation of functors defined on CW complexes. Cohomology of CW complexes is representable by an Eilenberg–MacLane space, so by the Yoneda lemma a cohomology operation of type is given by a homotopy class of maps . Using representability once again, the cohomology operation is given by an element of .

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.