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

In mathematical analysis, a strong measure zero set is a subset A of the real line with the following property: for every sequence (εn) of positive reals there exists a sequence (In) of intervals such that |In| < εn for all n and A is contained in the union of the In. (Here |In| denotes the length of the interval In.) Every countable set is a strong measure zero set, and so is every union of countably many strong measure zero sets. Every strong measure zero set has Lebesgue measure 0. The Cantor set is an example of an uncountable set of Lebesgue measure 0 which is not of strong measure zero.

Property Value
dbo:abstract
  • In mathematical analysis, a strong measure zero set is a subset A of the real line with the following property: for every sequence (εn) of positive reals there exists a sequence (In) of intervals such that |In| < εn for all n and A is contained in the union of the In. (Here |In| denotes the length of the interval In.) Every countable set is a strong measure zero set, and so is every union of countably many strong measure zero sets. Every strong measure zero set has Lebesgue measure 0. The Cantor set is an example of an uncountable set of Lebesgue measure 0 which is not of strong measure zero. Borel's conjecture states that every strong measure zero set is countable. It is now known that this statement is independent of ZFC (the Zermelo–Fraenkel axioms of set theory, which is the standard axiom system assumed in mathematics). This means that Borel's conjecture can neither be proven nor disproven in ZFC (assuming ZFC is consistent).Sierpiński proved in 1928 that the continuum hypothesis (which is now also known to be independent of ZFC) implies the existence of uncountable strong measure zero sets. In 1976 Laver used a method of forcing to construct a model of ZFC in which Borel's conjecture holds. These two results together establish the independence of Borel's conjecture. The following characterization of strong measure zero sets was proved in 1973: A set A ⊆ R has strong measure zero if and only if A + M ≠ R for every meagre set M ⊆ R. This result establishes a connection to the notion of strongly meagre set, defined as follows: A set M ⊆ R is strongly meagre if and only if A + M ≠ R for every set A ⊆ R of Lebesgue measure zero. The dual Borel conjecture states that every strongly meagre set is countable. This statement is also independent of ZFC. (en)
dbo:wikiPageID
  • 45200516 (xsd:integer)
dbo:wikiPageLength
  • 4125 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1060138102 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • In mathematical analysis, a strong measure zero set is a subset A of the real line with the following property: for every sequence (εn) of positive reals there exists a sequence (In) of intervals such that |In| < εn for all n and A is contained in the union of the In. (Here |In| denotes the length of the interval In.) Every countable set is a strong measure zero set, and so is every union of countably many strong measure zero sets. Every strong measure zero set has Lebesgue measure 0. The Cantor set is an example of an uncountable set of Lebesgue measure 0 which is not of strong measure zero. (en)
rdfs:label
  • Strong measure zero set (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
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