Sums of order bounded disjointness preserving linear operators (Q2002488)

From MaRDI portal
Revision as of 19:50, 30 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128052333, #quickstatements; #temporary_batch_1722364966119)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Sums of order bounded disjointness preserving linear operators
scientific article

    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 references
    0 references

    Identifiers