Sums of order bounded disjointness preserving linear operators (Q2002488)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sums of order bounded disjointness preserving linear operators |
scientific article; zbMATH DE number 7079966
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sums of order bounded disjointness preserving linear operators |
scientific article; zbMATH DE number 7079966 |
Statements
Sums of order bounded disjointness preserving linear operators (English)
0 references
12 July 2019
0 references
The authors study the possibility of decomposing an order bounded $n$-disjoint operator into a sum of disjointness preserving operators. It turns out that such a decomposition is unique up to some ``Boolea- valued permutation''. Namely, the authors define a purely $n$-disjoint linear operator $T : E \to F$ between real vector lattices $E$ and $F$ if $n$ is the least natural for which $T$ is $n$-disjoint for all nonzero band projections in the second annihilator of $T(E)$. This concept proves fruitful for formulating the Boolean-valued analogue of permutations that yield the desired decompositions.
0 references
vector lattice
0 references
purely \(n\)-disjoint operator
0 references
Boolean permutation
0 references
factorization
0 references
disjointness preserving operator
0 references
0.94543904
0 references
0.9314311
0 references
0.90690196
0 references
0.9022314
0 references
0.8943591
0 references
0 references
0.88861644
0 references