About: Disjunction property of Wallman

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

In mathematics, especially in order theory, a partially ordered set with a unique minimal element 0 has the disjunction property of Wallman when for every pair (a, b) of elements of the poset, either b ≤ a or there exists an element c ≤ b such that c ≠ 0 and c has no nontrivial common predecessor with a. That is, in the latter case, the only x with x ≤ a and x ≤ c is x = 0.

Property Value
dbo:abstract
  • In mathematics, especially in order theory, a partially ordered set with a unique minimal element 0 has the disjunction property of Wallman when for every pair (a, b) of elements of the poset, either b ≤ a or there exists an element c ≤ b such that c ≠ 0 and c has no nontrivial common predecessor with a. That is, in the latter case, the only x with x ≤ a and x ≤ c is x = 0. A version of this property for lattices was introduced by , in a paper showing that the homology theory of a topological space could be defined in terms of its distributive lattice of closed sets. He observed that the inclusion order on the closed sets of a T1 space has the disjunction property. The generalization to partial orders was introduced by . (en)
dbo:wikiPageID
  • 16206083 (xsd:integer)
dbo:wikiPageLength
  • 1533 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 950187615 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In mathematics, especially in order theory, a partially ordered set with a unique minimal element 0 has the disjunction property of Wallman when for every pair (a, b) of elements of the poset, either b ≤ a or there exists an element c ≤ b such that c ≠ 0 and c has no nontrivial common predecessor with a. That is, in the latter case, the only x with x ≤ a and x ≤ c is x = 0. (en)
rdfs:label
  • Disjunction property of Wallman (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