Some regularity properties of algorithms and additive functions with respect to them (Q756026): Difference between revisions

A strictly decreasing sequence \(\lambda =(\lambda_ n)\) of positive real numbers with finite \(L(\lambda):=\sum^{\infty}_{n=1}\lambda_ n\) is called interval filling iff for any \(x\in [0,L(\lambda)]\) there exists a sequence \(\delta\) : \({\mathbb{N}}\to \{0,1\}\) such that \(x=\sum^{\infty}_{n=1}\delta_ n\lambda_ n\). A sequence \(\alpha\) of functions mapping [0,L(\(\lambda\))] into \(\{\) 0,1\(\}\) is called an algorithm for an interval filling sequence \(\lambda\) iff \(x=\sum^{\infty}_{n=1}\alpha_ n(x)\lambda_ n\) for all \(x\in [0,L(\lambda)]\). All algorithms are stated and continuity points of all terms of all algorithms for a given interval filling sequence are established. An algorithm \(\alpha\) for \(\lambda\) is called monotonic iff for any x,y\(\in [0,L(\lambda)]\) with \(x<y\), there exists a \(k\in {\mathbb{N}}\) such that \(\alpha_ i(x)=\alpha_ i(y)\) for \(i\in \{1,...,k-1\}\) and \(\alpha_ k(x)=0\), \(\alpha_ k(y)=1\). A family of monotonic algorithms is constructed and regularity properties of monotonic algorithms are discussed. Let X be a Banach space and consider a sequence \(a_ n\) of its points such that \(\sum^{\infty}_{n=1}\| a_ n\| <+\infty\), an interval filling sequence \(\lambda\), an algorithm \(\alpha\) for \(\lambda\), and the function F: [0,L(\(\lambda\))]\(\to X\) defined by the formula \(F(x)=\sum^{\infty}_{n=1}\alpha_ n(x)a_ n.\) Some continuity points of F are indicated. In the case where the algorithm \(\alpha\) is monotonic: \(F(x+)\) and F(x-) exist at each \(x\in (0,L(\lambda))\), there exists a countable set \(D\subset [0,L(\lambda)]\) such that F is continuous at each point \(x\in [0,L(\lambda)]\setminus D\) and the continuity of F is characterized.