A Measure Theoretical Subsequence Characterization of Statistical Convergence

نویسندگان

  • HARRY I. MILLER
  • R. C. Buck
  • Andrew Bruckner
  • H. I. MILLER
چکیده

The concept of statistical convergence of a sequence was first introduced by H. Fast. Statistical convergence was generalized by R. C. Buck, and studied by other authors, using a regular nonnegative summability matrix A in place of C\ . The main result in this paper is a theorem that gives meaning to the statement: S= {sn} converges to L statistically (T) if and only if "most" of the subsequences of 5 converge, in the ordinary sense, to L . Here T is a regular, nonnegative and triangular matrix. Corresponding results for lacunary statistical convergence, recently defined and studied by J. A. Fridy and C. Orhan, are also presented. Introduction The concept of the statistical convergence of a sequence of reals S = {s„} was first introduced by H. Fast [9]. The sequence S = {s„} is said to converge statistically to L and we write lim sn = L (stat) if for every e > 0, n—»oo lim n~x\{k < n : \sk L\ > e}\ = 0, n—>oo where \A\ denotes the cardinality of the set A. Properties of statistically convergent sequences were studied in [5, 6, 12, and 16]. In [13] Fridy and Miller gave a characterization of statistical convergence for bounded sequences using a family of matrix summability methods. Statistical convergence can be generalized by using a regular nonnegative summability matrix A in place of C\. This idea was first mentioned by R. C. Buck [3] in 1953 and has been further studied by Sember and Freedman ([10 and 11]) and Connor ([5 and 7]). Regular nonnegative summability matrices turn out to be too general for our purposes here, instead we use the concept of a mean. A matrix T = (amn ) will be called a mean if amn > 0 when n m, Y^=\ amn = 1 for all m and limm_0O amn = 0 for each n . If T = (amn) is a mean, following Buck, a sequence S = {sn} is said to be statistically T-summable to L and we write sn -> L (stat T) if for every e > 0 Received by the editors August 18, 1993 and, in revised form, February 14, 1994; originally communicated to the Proceedings oftheAMS by Andrew Bruckner. 1991 Mathematics Subject Classification. Primary 40D25; Secondary 40G99, 28A12. ©1995 American Mathematical Society 0002-9947/95 $1.00+ $.25 per page

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Statistical Convergence of Subsequences of a given Sequence

This paper is closely related to the paper of Harry I.Miller: Measure theoretical subsequence characterization of statistical convergence, Trans.Amer.Math. Soc. 347 (1995), 1811–1819 and contains a general investigation of statistical convergence of subsequences of an arbitrary sequence from the point of view of Lebesgue measure, Hausdorff dimensions and Baire’s categories.

متن کامل

Logarithmic density and logarithmic statistical convergence

In this paper we use the idea of logarithmic density to define the concept of logarithmic statistical convergence. We find the relations of logarithmic statistical convergence with statistical convergence, statistical summability (H, 1) introduced by Móricz (Analysis 24:127-145, 2004) and [H, 1]q-summability. We also give subsequence characterization of statistical summability (H, 1). MSC: 40A0...

متن کامل

A Theoretical Framework of the Graph Shift Algorithm

Since no theoretical foundations for proving the convergence of Graph Shift Algorithm have been reported, we provide a generic framework consisting of three key GS components to fit the Zangwill’s convergence theorem. We show that the sequence set generated by the GS procedures always terminates at a local maximum, or at worst, contains a subsequence which converges to a local maximum of the si...

متن کامل

A Convergence Theorem for the Graph Shift-type Algorithms

Graph Shift (GS) algorithms are recently focused as a promising approach for discovering dense subgraphs in noisy data. However, there are no theoretical foundations for proving the convergence of the GS Algorithm. In this paper, we propose a generic theoretical framework consisting of three key GS components: simplex of generated sequence set, monotonic and continuous objective function and cl...

متن کامل

New fundamentals of Young measure convergence∗

This paper presents a new, penetrating approach to Young measure convergence in an abstract, measure theoretical setting. It was started in [12, 13, 14] and given its definitive shape in [18, 22]. This approach is based on K-convergence, a device by which narrow convergence on P(R) can be systematically transferred to Young measure convergence. Here P(R) stands for the set of all probability me...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010