About: Pro-simplicial set

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

In mathematics, a pro-simplicial set is an inverse system of simplicial sets. A pro-simplicial set is called pro-finite if each term of the inverse system of simplicial sets has finite homotopy groups. Pro-simplicial sets show up in shape theory, in the study of localization and completion in homotopy theory, and in the study of homotopy properties of schemes (e.g. étale homotopy theory).

Property Value
dbo:abstract
  • In mathematics, a pro-simplicial set is an inverse system of simplicial sets. A pro-simplicial set is called pro-finite if each term of the inverse system of simplicial sets has finite homotopy groups. Pro-simplicial sets show up in shape theory, in the study of localization and completion in homotopy theory, and in the study of homotopy properties of schemes (e.g. étale homotopy theory). (en)
dbo:wikiPageID
  • 6007184 (xsd:integer)
dbo:wikiPageLength
  • 1190 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 950536925 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • In mathematics, a pro-simplicial set is an inverse system of simplicial sets. A pro-simplicial set is called pro-finite if each term of the inverse system of simplicial sets has finite homotopy groups. Pro-simplicial sets show up in shape theory, in the study of localization and completion in homotopy theory, and in the study of homotopy properties of schemes (e.g. étale homotopy theory). (en)
rdfs:label
  • Pro-simplicial set (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink 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