lattice disjoint
In mathematics, specifically in order theory and functional analysis, two elements x and y of a vector lattice X are lattice disjoint or simply disjoint if , in which case we write , where the absolute value of x is defined to be .{{sfn | Schaefer | Wolff | 1999 | pp=204–214}}
We say that two sets A and B are lattice disjoint or disjoint if a and b are disjoint for all a in A and all b in B, in which case we write .{{sfn | Schaefer | Wolff | 1999 | pp=74–78}}
If A is the singleton set then we will write in place of .
For any set A, we define the disjoint complement to be the set .{{sfn | Schaefer | Wolff | 1999 | pp=74–78}}
Characterizations
Two elements x and y are disjoint if and only if .
If x and y are disjoint then and , where for any element z, and .
Properties
Disjoint complements are always bands, but the converse is not true in general.
If A is a subset of X such that exists, and if B is a subset lattice in X that is disjoint from A, then B is a lattice disjoint from .{{sfn | Schaefer | Wolff | 1999 | pp=74–78}}
= Representation as a disjoint sum of positive elements =
For any x in X, let and , where note that both of these elements are and with .
Then and are disjoint, and is the unique representation of x as the difference of disjoint elements that are .{{sfn | Schaefer | Wolff | 1999 | pp=74–78}}
For all x and y in X, and .{{sfn | Schaefer | Wolff | 1999 | pp=74-78}}
If y ≥ 0 and x ≤ y then x+ ≤ y.
Moreover, if and only if and .{{sfn | Schaefer | Wolff | 1999 | pp=74–78}}
See also
References
{{Reflist}}
Sources
- {{cite book | last1=Schaefer | first1=Helmut H. | authorlink=Helmut H. Schaefer | last2=Wolff | first2=Manfred P. | title=Topological Vector Spaces | publisher=Springer New York Imprint Springer | series=GTM | volume=3 | publication-place=New York, NY | year=1999 | isbn=978-1-4612-7155-0 | oclc=840278135 }}
{{Ordered topological vector spaces}}