About: Brown's representability theorem

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In mathematics, Brown's representability theorem in homotopy theory gives necessary and sufficient conditions for a contravariant functor F on the homotopy category Hotc of pointed connected CW complexes, to the category of sets Set, to be a representable functor. More specifically, we are given F: Hotcop → Set,

Property Value
dbo:abstract
  • In mathematics, Brown's representability theorem in homotopy theory gives necessary and sufficient conditions for a contravariant functor F on the homotopy category Hotc of pointed connected CW complexes, to the category of sets Set, to be a representable functor. More specifically, we are given F: Hotcop → Set, and there are certain obviously necessary conditions for F to be of type Hom(—, C), with C a pointed connected CW-complex that can be deduced from category theory alone. The statement of the substantive part of the theorem is that these necessary conditions are then sufficient. For technical reasons, the theorem is often stated for functors to the category of pointed sets; in other words the sets are also given a base point. (en)
  • 호모토피 이론에서 브라운 표현 정리(Brown表現定理, 영어: Brown representability theorem)는 위상 공간의 호모토피 범주 위의 함자가 표현 가능 함자인지 여부에 대한 필요충분조건을 제시하는 정리이다. (ko)
dbo:wikiPageID
  • 1073746 (xsd:integer)
dbo:wikiPageLength
  • 6942 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1032124365 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • 호모토피 이론에서 브라운 표현 정리(Brown表現定理, 영어: Brown representability theorem)는 위상 공간의 호모토피 범주 위의 함자가 표현 가능 함자인지 여부에 대한 필요충분조건을 제시하는 정리이다. (ko)
  • In mathematics, Brown's representability theorem in homotopy theory gives necessary and sufficient conditions for a contravariant functor F on the homotopy category Hotc of pointed connected CW complexes, to the category of sets Set, to be a representable functor. More specifically, we are given F: Hotcop → Set, (en)
rdfs:label
  • Brown's representability theorem (en)
  • 브라운 표현 정리 (ko)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:knownFor of
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is dbp:knownFor of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy