PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Very low Entry average rating: No information on entry rating
disjunction property of Wallman (Definition)

A partially ordered set $ \mathfrak{A}$ with a least element 0 has the disjunction property of Wallman if for every pair $ (a,b)$ of elements of the poset, either $ b\leq a$ or there exists an element $ c\leq b$ such that $ c\ne 0$ and $ c$ has no nontrivial common predecessor with $ a$. That is, in the latter case, the only $ x$ with $ x\leq a$ and $ x\leq c$ is $ x=0$.

For the case if the poset $ \mathfrak{A}$ is a $ \cap$-semilattice disjunction property of Wallman is equivalent to every of the following three formulas:

  1. $ \forall a,b\in\mathfrak{A}:(\{c\in\mathfrak{A}\vert c\cap a\ne 0\} = \{c\in\mathfrak{A}\vert c\cap b\ne 0\} \Rightarrow a = b)$;
  2. $ \forall a,b\in\mathfrak{A}:(\{c\in\mathfrak{A}\vert c\cap a\ne 0\} \subseteq \{c\in\mathfrak{A}\vert c\cap b\ne 0\} \Rightarrow a \subseteq b)$;
  3. $ \forall a,b\in\mathfrak{A}:(a\subset b \Rightarrow \{c\in\mathfrak{A}\vert c\cap a\ne 0\} \subset \{c\in\mathfrak{A}\vert c\cap b\ne 0\})$.

The proof of this equivalence can be found in this online article.



"disjunction property of Wallman" is owned by porton.
(view preamble)

View style:

See Also: poset

Other names:  Wallman's disjunction property
Keywords:  partial order
Log in to rate this entry.
(view current ratings)

Cross-references: equivalence, equivalent, least element, partially ordered set

This is version 4 of disjunction property of Wallman, born on 2008-03-11, modified 2008-03-21.
Object id is 10385, canonical name is DisjunctionPropertyOfWallman.
Accessed 165 times total.

Classification:
AMS MSC06A06 (Order, lattices, ordered algebraic structures :: Ordered sets :: Partial order, general)

Pending Errata and Addenda
None.
[ View all 2 ]
Discussion
Style: Expand: Order:
forum policy
Alternative characterizations of Wallman's disjunction property by porton on 2008-03-18 14:52:07
In my draft article "Filters on Posets" (http://www.mathematics21.org/binaries/filters.pdf) I found three alternative characterizations of so called "separable lattices" which are equivalent to Wallman's disjunction property for the case of meet-semilattices. This should be somehow addressed in the encyclopedia article. I deem that these results in the mentioned article are to trivial to be called research and can be added to PlanetMath. What is the opinion of the community?
--
Victor Porton - http://www.mathematics21.org
* Algebraic General Topology and Math Synthesis
* Category Theory - new concepts
[ reply | up ]

Interact
post | correct | update request | add derivation | add example | add (any)