Weakly tight functions and their decomposition (Q2368416): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093318312 / rank
 
Normal rank

Latest revision as of 10:14, 30 July 2024

scientific article
Language Label Description Also known as
English
Weakly tight functions and their decomposition
scientific article

    Statements

    Weakly tight functions and their decomposition (English)
    0 references
    0 references
    0 references
    19 April 2006
    0 references
    \(X\) is a nonempty set and \(I\equiv [0,1]\) is the unit interval of the real line \(\mathbb{R}\). \(I^X\) denotes all functions from \(X\) to \(I\). \(K\) is a sublattice of \(I^X\) containing the least element \(0\) and the greatest element \(1\), where \(0\) and \(1\) are constant functions sending each \(x\in X\) to \(0\) and \(1\), respectively. Let \(\beta: K\to\mathbb{R}\) be a function with \(\beta(0)= 0\). Then \(\beta\) is called weakly tight if and only if for every pair \(f_1,f_2\in K\) with \(f_1\leq f_2\) and for any \(\varepsilon> 0\), there exists \(f\in K\) such that \(f\leq f_2- f_1\) and \(|\beta(f_2)- \beta(f_1)- \beta(f)|<\varepsilon\) [refer to \textit{M. K. Nayak} and \textit{T. P. Srinivasan}, Proc. Am. Math. Soc. 48, 391--396 (1975; Zbl 0299.28009)]. The main result proven is as follows: Theorem (Jordan-decomposition-type theorem). Let \(K\) be a sublattice of \(I^X\) containing \(0\) and \(1\). If \(\beta: K\to\mathbb{R}\) is locally bounded and weakly tight, then \(\beta\) can be written as \(\beta= \beta^+- \beta^-\) where both \(\beta^+\) and \(\beta^-\) are nonnegative and monotone (and hence, locally bounded) functions defined on \(K\). Furthermore, if \(\beta\) is modular (\(\beta\) is additive and \(K\) is closed under additions), then the decomposed parts \(\beta^+\) and \(\beta^-\) are supermodular (superadditive).
    0 references
    0 references

    Identifiers