Disjunction property of Wallman: Difference between revisions

Source: Wikipedia, the free encyclopedia.
Content deleted Content added
OAbot (talk | contribs)
m Open access bot: doi added to citation with #oabot.
Extended confirmed users
40,633 edits
tag as format footnotes
Line 1: Line 1:
{{format footnotes |date=May 2024}}
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.
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.



Revision as of 02:21, 13 May 2024

In

minimal element
0 has the disjunction property of Wallman when for every pair (a, b) of elements of the poset, either ba or there exists an element cb such that c ≠ 0 and c has no nontrivial common predecessor with a. That is, in the latter case, the only x with xa and xc is x = 0.

A version of this property for

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 Wolk (1956)
.

References