A note on the sequence of weakening buffer operator

Based on the present theories of operators, this paper give a new result on the weakening buffer operator. f is a monotonously increasing function, g is its inverse function. If d is a weakening buffer operator, and x(k)d is made of x(k),..., x(n), k = 1, 2, ... n. If we substitute x(k) by f(x(k)), k=1, ..., n. The new result is m = [f(x(k))]d. If g(m) = e, then e is also a weakening buffer operator.