Lattice disjoint explained

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

inf\left\{|x|,|y|\right\}=0

, in which case we write

x\perpy

, where the absolute value of x is defined to be

|x|:=\sup\left\{x,-x\right\}

. 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

A\perpB

. If A is the singleton set

\{a\}

then we will write

a\perpB

in place of

\{a\}\perpB

. For any set A, we define the disjoint complement to be the set

A\perp:=\left\{x\inX:x\perpA\right\}

.

Characterizations

Two elements x and y are disjoint if and only if

\sup\{|x|,|y|\}=|x|+|y|

. If x and y are disjoint then

|x+y|=|x|+|y|

and

\left(x+y\right)+=x++y+

, where for any element z,

z+:=\sup\left\{z,0\right\}

and

z-:=\sup\left\{-z,0\right\}

.

Properties

Disjoint complements are always bands, but the converse is not true in general. If A is a subset of X such that

x=\supA

exists, and if B is a subset lattice in X that is disjoint from A, then B is a lattice disjoint from

\{x\}

.

Representation as a disjoint sum of positive elements

For any x in X, let

x+:=\sup\left\{x,0\right\}

and

x-:=\sup\left\{-x,0\right\}

, where note that both of these elements are

\geq0

and

x=x+-x-

with

|x|=x++x-

. Then

x+

and

x-

are disjoint, and

x=x+-x-

is the unique representation of x as the difference of disjoint elements that are

\geq0

. For all x and y in X,

\left|x+-y+\right|\leq|x-y|

and

x+y=\sup\{x,y\}+inf\{x,y\}

. If y ≥ 0 and xy then x+y. Moreover,

x\leqy

if and only if

x+\leqy+

and

x-\leqx-1

.

See also

Sources

. Schaefer . Helmut H. . Helmut H. Schaefer . Wolff . Manfred P. . Topological Vector Spaces . Springer New York Imprint Springer . . 3 . New York, NY . 1999 . 978-1-4612-7155-0 . 840278135 .