About: Kuratowski's free set theorem     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FKuratowski%27s_free_set_theorem

Kuratowski's free set theorem, named after Kazimierz Kuratowski, is a result of set theory, an area of mathematics. It is a result which has been largely forgotten for almost 50 years, but has been applied recently in solving several lattice theory problems, such as the congruence lattice problem. The theorem states the following. Let be a positive integer and let be a set. Then the cardinality of is greater than or equal to if and only if for every mapping from to ,there exists an -element free subset of with respect to . For , Kuratowski's free set theorem is superseded by .

AttributesValues
rdfs:label
  • Kuratowski's free set theorem (en)
rdfs:comment
  • Kuratowski's free set theorem, named after Kazimierz Kuratowski, is a result of set theory, an area of mathematics. It is a result which has been largely forgotten for almost 50 years, but has been applied recently in solving several lattice theory problems, such as the congruence lattice problem. The theorem states the following. Let be a positive integer and let be a set. Then the cardinality of is greater than or equal to if and only if for every mapping from to ,there exists an -element free subset of with respect to . For , Kuratowski's free set theorem is superseded by . (en)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • Kuratowski's free set theorem, named after Kazimierz Kuratowski, is a result of set theory, an area of mathematics. It is a result which has been largely forgotten for almost 50 years, but has been applied recently in solving several lattice theory problems, such as the congruence lattice problem. Denote by the set of all finite subsets of a set . Likewise, for a positive integer , denote by the set of all -elements subsets of . For a mapping , we say that a subset of is free (with respect to ), if for any -element subset of and any , . Kuratowski published in 1951 the following result, which characterizes the infinite cardinals of the form . The theorem states the following. Let be a positive integer and let be a set. Then the cardinality of is greater than or equal to if and only if for every mapping from to ,there exists an -element free subset of with respect to . For , Kuratowski's free set theorem is superseded by . (en)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 60 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software