Received May 27, 2009; accepted January 14, 2011
|
|
- Andrew Lane
- 5 years ago
- Views:
Transcription
1 MATHEMATICAL COMMUNICATIONS 53 Math. Coun. 6(20), I σ -Convergence Fatih Nuray,, Hafize Gök and Uǧur Ulusu Departent of Matheatics, Afyon Kocatepe University, Afyonkarahisar, Turkey Received May 27, 2009; accepted January 4, 20 Abstract. In this paper, the concepts of σ-unifor density of subsets A of the set N of positive integers and corresponding I σ -convergence were introduced. Furtherore, inclusion relations between I σ-convergence and invariant convergence also I σ-convergence and [V σ ] p -convergence were given. AMS subject classifications: 40A05, 40D25 Key words: statistical convergence, I-convergence, invariant convergence, strongly σ- convergence, σ-unifor density, I σ -convergence. Introduction and background A sequence x = (x k ) is said to be strongly Cesaro suable to the nuber L if n n n x k L = 0. k= A continuous linear functional φ on l, the space of real bounded sequences, is said to be a Banach it if (a) φ(x) 0, when the sequence x = (x n ) has x n 0 for all n, (b) φ(e) =, where e = (,,,...), and (c) φ(x n+ ) = φ(x n ) for all x l. A sequence x l is said to be alost convergent to the value L if all of its Banach its are equal to L. Lorentz [4] has given the following characterization. A bounded sequence (x n ) is said to be alost convergent to L if and only if x n+k = L uniforly in n. ĉ denotes the set of all alost convergent sequences. k= Corresponding author. Eail addresses: fnuray@aku.edu.tr (F. Nuray), hgok@aku.edu.tr (H. Gök), ulusu@aku.edu.tr (U. Ulusu) c 20 Departent of Matheatics, University of Osijek
2 532 F. Nuray, H. Gök and U. Ulusu Maddox [5] has defined a strongly alost convergent sequence as follows: A bounded sequence (x n ) is said to be strongly alost convergent to L if and only if x n+k L = 0 k= uniforly in n. [ĉ] denotes the set of all strongly alost convergent sequences. Let σ be a apping of the positive integers into theselves. A continuous linear functional φ on l is said to be an invariant ean or a σ-ean if it satisfies conditions (a) and (b) stated above and (d) φ(x σ(n) ) = φ(x n ) for all x l. The appings σ are assued to be one-to-one and such that σ (n) n for all positive integers n and, where σ (n) denotes the th iterate of the apping σ at n. Thus φ extends the it functional on c, the space of convergent sequences, in the sense that φ(x) = x for all x c. Consequently, c V σ. In the case σ is the translation apping σ(n) = n +, the σ-ean is often called a Banach it and V σ, the set of bounded sequences all of whose invariant eans are equal, is the set of alost convergent sequences ĉ. It can be shown that V σ = {x = (x n ) l : x σ k (n) = L uniforly in n}, where l denotes the set of all bounded sequences. The set of all such σ appings will be denoted by M. Raii [] proved that {Vσ : σ M} = l k= and {Vσ : σ M} = c, where c denotes the set of all convergent sequences. The following inclusion relation between ĉ and V σ can be written: {ĉ} {V σ : σ M}. Several authors including Raii [], Schaefer [4], Mursaleen [8], Savaş [2] and others have studied invariant convergent sequences. The concept of strongly σ-convergence was defined by Mursaleen in [7]: A bounded sequence x = (x k ) is said to be strongly σ convergent to L if x σ k (n) L = 0 k= uniforly in n. In this case we will write x k L[V σ ]. By [V σ ], we denote the set of all strongly σ-convergent sequences. In the case σ(n) = n+, the space [V σ ] is the set of strongly alost convergent sequences [ĉ].
3 I σ -Convergence 533 Recently, the concept of strong σ-convergence was generalized by Savaş [2] as below [V σ ] p := {x = (x k ) : x σk (n) L p = 0 uniforly in n}, k= where 0 < p <. If p =, then [V σ ] p = [V σ ]. It is known that [V σ ] p l. A sequence x = (x k ) is said to be statistically convergent to the nuber L if for every ɛ > 0, n n {k n : x k L ɛ} = 0, where the vertical bars indicate the nuber of eleents in the enclosed set. The idea of statistical convergence was introduced by Fast [3] and studied by any authors. There is a natural relationship between statistical convergence and strong Cesaro suability [2]. The concept of a σ-statistically convergent sequence was introduced by Nuray and Savaş in [0] as follows: A sequence x = (x k ) is σ-statistically convergent to L if for everyɛ > 0, {k : x σ k (n) L ɛ} = 0 uniforly in n. In this case we write S σ x = L or x k L(S σ ) and define 2. I σ -convergence Definition. Let A N and If the following its exist S σ := {x = (x k ) : S σ x = L, for soe L}. s := in n A {σ(n), σ 2 (n),..., σ (n)} S := ax n A {σ(n), σ 2 (n),..., σ (n)}. s V (A) :=, S V (A) := then they are called a lower and an upper σ-unifor density of the set A, respectively. If V (A) = V (A), then V (A) = V (A) = V (A) is called the σ-unifor density of A. In the case σ(n) = n +, this definition gives a definition of unifor density u in []. A non-epty subset of I of P (N) is called an ideal on N if (i) B I whenever B A for soe A I, (ii) A B I whenever A, B I.
4 534 F. Nuray, H. Gök and U. Ulusu An ideal I is called proper if N / I. An ideal I is called adissible if it is proper and contains all finite subsets. For any ideal I there is a filter F (I) corresponding to I, given by F (I) = {K N : N \ K I}. Let I P (N) be a proper ideal in N. The sequence x = (x k ) is said to be I-convergent to L, if for ɛ > 0 the set A ɛ := {k : x k L ɛ} belongs to I. If x = (x k ) is I-convergent to L, then we write I x = L. A sequence x = (x k ) is said to be I -convergent to the nuber L if there exists a set M = { < 2 <...} F (I) such that k x k = L. In this case we write I x k = L (see [3]). Denote by I σ the class of all A N with V (A) = 0. Definition 2. A sequence x = (x k ) is said to be I σ -convergent to the nuber L if for every ɛ > 0 A ɛ := {k : x k L ɛ} belongs to I σ ; i.e., V (A ɛ ) = 0. In this case we write I σ x k = L. The set of all I σ -convergent sequences will be denoted by I σ. In the case σ(n) = n +, I σ -convergence coincides with I u - convergence which was defined in []. We can also write {I u } {I σ : σ M}, where I u denotes the set of all I u -convergent sequences. We can easily verify that if I σ x n = L and I σ y n = L 2, then I σ (x n + y n ) = L + L 2 and if a is a constant, then I σ ax n = al. Theore. Suppose x = (x k ) is a bounded sequence. If x is I σ -convergent to L, then x is invariant convergent to L. Proof. Let, n N be arbitrary and ɛ > 0. We estiate t(n, ) = x σ(n) + x σ 2 (n) x σ (n) L. We have t(n, ) t () (n, ) + t (2) (n, ), where and t () (n, ) = t (2) (n, ) = j ; j ; x σ j (n) L x σ j (n) L ɛ x σ j (n) L. x σ j (n) L <ɛ
5 I σ -Convergence 535 We have t (2) (n, ) < ɛ, for every n =, 2,... The boundedness of x = (x k ) iplies that there exist K > 0 such that x σ j (n) L K, (j =, 2,...; n =, 2,...), then this iplies that t () (n, ) K { j : x σ j (n) L ɛ} hence x is invariant convergent to L. K ax n { j : x σj (n) L ɛ} = K S, The converse of the previous theore does not hold. For exaple, x = (x k ) is the sequence defined by x k = if k is even and x k = 0 if k is odd. When σ(n) = n +, this sequence is invariant convergent to 2 but it is not I σ-convergent. In [2], Connor gave soe inclusion relations between strong p-cesaro convergence and statistical convergence and showed that these are equivalent for bounded sequences. Now we shall give an analogous theore which states inclusion relations between [V σ ] p -convergence and I σ -convergence and show that these are equivalent for bounded sequences. Theore 2. (a) If 0 < p < and x k L([V σ ] p ), then x = (x n ) is I σ -convergent to L. (b) If x = (x n ) l and I σ -converges to L, then x k L([V σ ] p ). (c) If x = (x n ) l, then x = (x n ) is I σ -convergent to L if and only if x k L([V σ ] p ) (0 < p < ). Proof. (a) Let x k ([V σ ] p ), 0 < p <. Suppose ɛ > 0. Then for every n N, we have and x σ j (n) L p j ; x σ j (n) L ɛ x σ j (n) L p ɛ p { j : x σ j (n) L ɛ} ɛ p ax n { j : x σ j (n) L ɛ} x σ j (n) L p ɛ p ax n { j : x σ j (n) L ɛ} = ɛ p S for every n =, 2, 3,.... This iplies S = 0 and so I σ x k = L. (b) Now suppose that x l and I σ -convergent to L. Let 0 < p < and ɛ > 0. By assuption, we have V (A ɛ ) = 0. The boundedness of x = (x k ) iplies that
6 536 F. Nuray, H. Gök and U. Ulusu there exist M > 0 such that x σ j (n) L M, that for every n N we have that x σ j (n) L p = j= Hence, we obtain + j ; x σ j (n) L ɛ j ; x σ j (n) L <ɛ (j =, 2,...; n =, 2,...). Observe x σ j (n) L p x σj (n) L p M ax n { j : x σ j (n) L ɛ} M S + ɛp. x σ j (n) L p = 0 j= uniforly in n. (c) This is a corollary of (a) and (b). In the case σ(n) = n+ in the above theores, we have Theore and Theore 2 in []. Definition 3. A sequence x = (x k ) is said to be Iσ-convergent to the nuber L if there exists a set M = { < 2 <...} F (I σ ) such that k x k = L. In this case we write Iσ x k = L. I σ- convergence is better applicable in soe situations. Theore 3. Let I σ be an adissible ideal. If a sequence x = (x k ) is I σ-convergent to L, then this sequence is I σ -convergent to L. Proof. By assuption, there exists a set H I σ such that for M = N \ H = { < 2 <... < k <...} we have + ɛ p x k = L. () k Let ɛ > 0. By (), there exists k 0 N such that x k L < ɛ for each k > k 0. Then obviously {k N : x k l ɛ} H { < 2 <... < k0 }.(2) (2) The set on the right-hand side of (2) belongs to I σ (since I σ is adissible). So x = (x k ) is I σ -convergent to L. The converse of Theore 3 holds if I σ has property (AP). Definition 4 (see [3]). An adissible ideal I is said to satisfy the condition (AP) if for every countable faily of utually disjoint sets {A, A 2,...} belonging to I there exits a countable faily of sets {B, B 2,...} such that the syetric difference A j B j is a finite set for j N and B = ( j= B j) I.
7 I σ -Convergence 537 Theore 4. Let I σ be an adissible ideal and let it have property (AP). If x is I σ -convergent to L, then x is I σ-convergent to L. Proof. Suppose that I σ satisfies condition (AP). Let I σ x k = L. Then for ɛ > 0, {k : x k L ɛ} belongs to I σ. Put A = {k : x k L } and A n = {k : n x k L < n } for n 2, n N. Obviously, A i B j = for i j. By condition (AP) there exits a sequence of {B n } n N such that A j B j are finite sets for j N and B = ( j= B j) I σ. It is sufficient to prove that for M = N \ B we have Let λ > 0. Choose n N such that n+ < λ. Then x k = L. (3) k M;k {k : x k L λ} Since A j B j, j =, 2,..., n + are finite sets, there exists k 0 N such that n+ ( j= n+ B j ) {k : k > k 0 } = ( j= n+ j= A j. A j ) {k : k > k 0 } (4) If k > k 0 and k / B, then k / n+ j= B j and by (4), k / n+ j= A j. But then x k L < n + < λ so (3) holds and hence we have I σ x k = L. Now we shall state a theore that gives a relation between S σ -convergence and I σ -convergence. Theore 5. A sequence x = (x k ) is S σ -convergent to L if and only if it is I σ - convergent to L. References [] V. Baláž, T. Šalát, Unifor density u and corresponding I u-convergence, Math. Coun. (2006), 7. [2] J.S. Connor, The statistical and strong p - Cesaro convergence of sequences, Analysis 8(988), [3] H. Fast, Sur la convergence statistique, Cooloq. Math. 2(95), [4] P. Kostryko,T. Šalát, W. Wilczinski, I-convergence, Real. Anal. Exchange 26( ), [5] G. Lorentz, A contribution to the theory of divergent sequences, Acta Math. 80(948), [6] I. J. Maddox, A new type of convergence, Math. Proc. Cabridge Phil. Soc. 83(978), 6 64.
8 538 F. Nuray, H. Gök and U. Ulusu [7] M. Mursaleen, Matrix transforation between soe new sequence spaces, Houston J. Math. 9(983), [8] M. Mursaleen, On infinite atrices and invariant eans, Indian J. Pure and Appl. Math. 0(979), [9] M. Mursaleen, O.H.H. Edely, On the invariant ean and statistical convergence, Appl. Math. Lett. 22(2009), [0] F. Nuray, E. Savaş, Invariant statistical convergence and A-invariant statistical convergence, Indian J. Pure and Appl. Math. 0(994), [] R.A. Raii, Invariant eans and invariant atrix ethods of suability, Duke Math. J. 30(963), [2] E. Savaş, Soe sequence spaces involving invariant eans, Indian J. Math. 3(989), 8. [3] E. Savaş, Strongly σ-convergent sequences, Bull. Calcutta Math. 8(989), [4] P. Schaefer, Infinite atrices and invariant eans, Proc. Aer. Soc. Math. 36(972), 04 0.
Statistical Lacunary Invariant Summability
Theoetical Mathematics & Applications, vol.3, no.2, 203, 7-78 ISSN: 792-9687 (pint), 792-9709 (online) Scienpess Ltd, 203 Statistical Lacunay Invaiant Summability Nimet Pancaoglu and Fatih Nuay 2 Abstact
More informationIn Discrete Time a Local Martingale is a Martingale under an Equivalent Probability Measure
In Discrete Time a Local Martingale is a Martingale under an Equivalent Probability Measure Yuri Kabanov 1,2 1 Laboratoire de Mathématiques, Université de Franche-Comté, 16 Route de Gray, 253 Besançon,
More informationGUESSING MODELS IMPLY THE SINGULAR CARDINAL HYPOTHESIS arxiv: v1 [math.lo] 25 Mar 2019
GUESSING MODELS IMPLY THE SINGULAR CARDINAL HYPOTHESIS arxiv:1903.10476v1 [math.lo] 25 Mar 2019 Abstract. In this article we prove three main theorems: (1) guessing models are internally unbounded, (2)
More informationSome Bounds for the Singular Values of Matrices
Applied Mathematical Sciences, Vol., 007, no. 49, 443-449 Some Bounds for the Singular Values of Matrices Ramazan Turkmen and Haci Civciv Department of Mathematics, Faculty of Art and Science Selcuk University,
More informationarxiv: v2 [math.lo] 13 Feb 2014
A LOWER BOUND FOR GENERALIZED DOMINATING NUMBERS arxiv:1401.7948v2 [math.lo] 13 Feb 2014 DAN HATHAWAY Abstract. We show that when κ and λ are infinite cardinals satisfying λ κ = λ, the cofinality of the
More informationOn the smallest abundant number not divisible by the first k primes
On the smallest abundant number not divisible by the first k rimes Douglas E. Iannucci Abstract We say a ositive integer n is abundant if σ(n) > 2n, where σ(n) denotes the sum of the ositive divisors of
More informationThe ruin probabilities of a multidimensional perturbed risk model
MATHEMATICAL COMMUNICATIONS 231 Math. Commun. 18(2013, 231 239 The ruin probabilities of a multidimensional perturbed risk model Tatjana Slijepčević-Manger 1, 1 Faculty of Civil Engineering, University
More informationA Property Equivalent to n-permutability for Infinite Groups
Journal of Algebra 221, 570 578 (1999) Article ID jabr.1999.7996, available online at http://www.idealibrary.com on A Property Equivalent to n-permutability for Infinite Groups Alireza Abdollahi* and Aliakbar
More informationThe Real Numbers. Here we show one way to explicitly construct the real numbers R. First we need a definition.
The Real Numbers Here we show one way to explicitly construct the real numbers R. First we need a definition. Definitions/Notation: A sequence of rational numbers is a funtion f : N Q. Rather than write
More informationStrategies and Nash Equilibrium. A Whirlwind Tour of Game Theory
Strategies and Nash Equilibrium A Whirlwind Tour of Game Theory (Mostly from Fudenberg & Tirole) Players choose actions, receive rewards based on their own actions and those of the other players. Example,
More information3 The Model Existence Theorem
3 The Model Existence Theorem Although we don t have compactness or a useful Completeness Theorem, Henkinstyle arguments can still be used in some contexts to build models. In this section we describe
More informationOn the Lower Arbitrage Bound of American Contingent Claims
On the Lower Arbitrage Bound of American Contingent Claims Beatrice Acciaio Gregor Svindland December 2011 Abstract We prove that in a discrete-time market model the lower arbitrage bound of an American
More informationMartingales. by D. Cox December 2, 2009
Martingales by D. Cox December 2, 2009 1 Stochastic Processes. Definition 1.1 Let T be an arbitrary index set. A stochastic process indexed by T is a family of random variables (X t : t T) defined on a
More informationTEST 1 SOLUTIONS MATH 1002
October 17, 2014 1 TEST 1 SOLUTIONS MATH 1002 1. Indicate whether each it below exists or does not exist. If the it exists then write what it is. No proofs are required. For example, 1 n exists and is
More informationCONGRUENCES AND IDEALS IN A DISTRIBUTIVE LATTICE WITH RESPECT TO A DERIVATION
Bulletin of the Section of Logic Volume 42:1/2 (2013), pp. 1 10 M. Sambasiva Rao CONGRUENCES AND IDEALS IN A DISTRIBUTIVE LATTICE WITH RESPECT TO A DERIVATION Abstract Two types of congruences are introduced
More informationGame Theory: Normal Form Games
Game Theory: Normal Form Games Michael Levet June 23, 2016 1 Introduction Game Theory is a mathematical field that studies how rational agents make decisions in both competitive and cooperative situations.
More informationCOMBINATORICS OF REDUCTIONS BETWEEN EQUIVALENCE RELATIONS
COMBINATORICS OF REDUCTIONS BETWEEN EQUIVALENCE RELATIONS DAN HATHAWAY AND SCOTT SCHNEIDER Abstract. We discuss combinatorial conditions for the existence of various types of reductions between equivalence
More informationBest response cycles in perfect information games
P. Jean-Jacques Herings, Arkadi Predtetchinski Best response cycles in perfect information games RM/15/017 Best response cycles in perfect information games P. Jean Jacques Herings and Arkadi Predtetchinski
More informationOn the h-vector of a Lattice Path Matroid
On the h-vector of a Lattice Path Matroid Jay Schweig Department of Mathematics University of Kansas Lawrence, KS 66044 jschweig@math.ku.edu Submitted: Sep 16, 2009; Accepted: Dec 18, 2009; Published:
More informationMath-Stat-491-Fall2014-Notes-V
Math-Stat-491-Fall2014-Notes-V Hariharan Narayanan December 7, 2014 Martingales 1 Introduction Martingales were originally introduced into probability theory as a model for fair betting games. Essentially
More informationCollinear Triple Hypergraphs and the Finite Plane Kakeya Problem
Collinear Triple Hypergraphs and the Finite Plane Kakeya Problem Joshua Cooper August 14, 006 Abstract We show that the problem of counting collinear points in a permutation (previously considered by the
More informationNotes on the symmetric group
Notes on the symmetric group 1 Computations in the symmetric group Recall that, given a set X, the set S X of all bijections from X to itself (or, more briefly, permutations of X) is group under function
More informationEpimorphisms and Ideals of Distributive Nearlattices
Annals of Pure and Applied Mathematics Vol. 18, No. 2, 2018,175-179 ISSN: 2279-087X (P), 2279-0888(online) Published on 9 November 2018 www.researchmathsci.org DOI: http://dx.doi.org/10.22457/apam.v18n2a5
More informationInterpolation of κ-compactness and PCF
Comment.Math.Univ.Carolin. 50,2(2009) 315 320 315 Interpolation of κ-compactness and PCF István Juhász, Zoltán Szentmiklóssy Abstract. We call a topological space κ-compact if every subset of size κ has
More informationEquivalence between Semimartingales and Itô Processes
International Journal of Mathematical Analysis Vol. 9, 215, no. 16, 787-791 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/1.12988/ijma.215.411358 Equivalence between Semimartingales and Itô Processes
More informationA note on the number of (k, l)-sum-free sets
A note on the number of (k, l)-sum-free sets Tomasz Schoen Mathematisches Seminar Universität zu Kiel Ludewig-Meyn-Str. 4, 4098 Kiel, Germany tos@numerik.uni-kiel.de and Department of Discrete Mathematics
More informationBINOMIAL TRANSFORMS OF QUADRAPELL SEQUENCES AND QUADRAPELL MATRIX SEQUENCES
Journal of Science and Arts Year 17, No. 1(38), pp. 69-80, 2017 ORIGINAL PAPER BINOMIAL TRANSFORMS OF QUADRAPELL SEQUENCES AND QUADRAPELL MATRIX SEQUENCES CAN KIZILATEŞ 1, NAIM TUGLU 2, BAYRAM ÇEKİM 2
More informationmaps 1 to 5. Similarly, we compute (1 2)(4 7 8)(2 1)( ) = (1 5 8)(2 4 7).
Math 430 Dr. Songhao Li Spring 2016 HOMEWORK 3 SOLUTIONS Due 2/15/16 Part II Section 9 Exercises 4. Find the orbits of σ : Z Z defined by σ(n) = n + 1. Solution: We show that the only orbit is Z. Let i,
More informationIntroduction to Probability Theory and Stochastic Processes for Finance Lecture Notes
Introduction to Probability Theory and Stochastic Processes for Finance Lecture Notes Fabio Trojani Department of Economics, University of St. Gallen, Switzerland Correspondence address: Fabio Trojani,
More informationCONSISTENCY AMONG TRADING DESKS
CONSISTENCY AMONG TRADING DESKS David Heath 1 and Hyejin Ku 2 1 Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA, USA, email:heath@andrew.cmu.edu 2 Department of Mathematics
More informationEquilibrium payoffs in finite games
Equilibrium payoffs in finite games Ehud Lehrer, Eilon Solan, Yannick Viossat To cite this version: Ehud Lehrer, Eilon Solan, Yannick Viossat. Equilibrium payoffs in finite games. Journal of Mathematical
More informationSome Remarks on Finitely Quasi-injective Modules
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 6, No. 2, 2013, 119-125 ISSN 1307-5543 www.ejpam.com Some Remarks on Finitely Quasi-injective Modules Zhu Zhanmin Department of Mathematics, Jiaxing
More informationLECTURE 4: MIXED STRATEGIES (CONT D), BIMATRIX GAMES
LECTURE 4: MIXED STRATEGIES (CONT D), BIMATRIX GAMES Mixed Strategies in Matrix Gaes (revision) 2 ixed strategy: the player decides about the probabilities of the alternative strategies (su of the probabilities
More informationNon replication of options
Non replication of options Christos Kountzakis, Ioannis A Polyrakis and Foivos Xanthos June 30, 2008 Abstract In this paper we study the scarcity of replication of options in the two period model of financial
More informationLecture 14: Basic Fixpoint Theorems (cont.)
Lecture 14: Basic Fixpoint Theorems (cont) Predicate Transformers Monotonicity and Continuity Existence of Fixpoints Computing Fixpoints Fixpoint Characterization of CTL Operators 1 2 E M Clarke and E
More informationIII. Valuation Framework for CDS options
III. Valuation Fraework for CDS options In siulation, the underlying asset price is the ost iportant variable. The suitable dynaics is selected to describe the underlying spreads. The relevant paraeters
More information4 Martingales in Discrete-Time
4 Martingales in Discrete-Time Suppose that (Ω, F, P is a probability space. Definition 4.1. A sequence F = {F n, n = 0, 1,...} is called a filtration if each F n is a sub-σ-algebra of F, and F n F n+1
More informationCOMBINATORIAL CONVOLUTION SUMS DERIVED FROM DIVISOR FUNCTIONS AND FAULHABER SUMS
GLASNIK MATEMATIČKI Vol. 49(69(014, 351 367 COMBINATORIAL CONVOLUTION SUMS DERIVED FROM DIVISOR FUNCTIONS AND FAULHABER SUMS Bumkyu Cho, Daeyeoul Kim and Ho Park Dongguk University-Seoul, National Institute
More informationADDING A LOT OF COHEN REALS BY ADDING A FEW II. 1. Introduction
ADDING A LOT OF COHEN REALS BY ADDING A FEW II MOTI GITIK AND MOHAMMAD GOLSHANI Abstract. We study pairs (V, V 1 ), V V 1, of models of ZF C such that adding κ many Cohen reals over V 1 adds λ many Cohen
More information6.207/14.15: Networks Lecture 10: Introduction to Game Theory 2
6.207/14.15: Networks Lecture 10: Introduction to Game Theory 2 Daron Acemoglu and Asu Ozdaglar MIT October 14, 2009 1 Introduction Outline Review Examples of Pure Strategy Nash Equilibria Mixed Strategies
More informationOutline of Lecture 1. Martin-Löf tests and martingales
Outline of Lecture 1 Martin-Löf tests and martingales The Cantor space. Lebesgue measure on Cantor space. Martin-Löf tests. Basic properties of random sequences. Betting games and martingales. Equivalence
More informationOptimal Control of Batch Service Queues with Finite Service Capacity and General Holding Costs
Queueing Colloquium, CWI, Amsterdam, February 24, 1999 Optimal Control of Batch Service Queues with Finite Service Capacity and General Holding Costs Samuli Aalto EURANDOM Eindhoven 24-2-99 cwi.ppt 1 Background
More informationX i = 124 MARTINGALES
124 MARTINGALES 5.4. Optimal Sampling Theorem (OST). First I stated it a little vaguely: Theorem 5.12. Suppose that (1) T is a stopping time (2) M n is a martingale wrt the filtration F n (3) certain other
More information4: SINGLE-PERIOD MARKET MODELS
4: SINGLE-PERIOD MARKET MODELS Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2016 M. Rutkowski (USydney) Slides 4: Single-Period Market Models 1 / 87 General Single-Period
More informationTotal Reward Stochastic Games and Sensitive Average Reward Strategies
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS: Vol. 98, No. 1, pp. 175-196, JULY 1998 Total Reward Stochastic Games and Sensitive Average Reward Strategies F. THUIJSMAN1 AND O, J. VaiEZE2 Communicated
More informationFinancial Risk: Credit Risk, Lecture 1
Financial Risk: Credit Risk, Lecture 1 Alexander Herbertsson Centre For Finance/Departent of Econoics School of Econoics, Business and Law, University of Gothenburg E-ail: alexander.herbertsson@cff.gu.se
More informationBROWNIAN MOTION Antonella Basso, Martina Nardon
BROWNIAN MOTION Antonella Basso, Martina Nardon basso@unive.it, mnardon@unive.it Department of Applied Mathematics University Ca Foscari Venice Brownian motion p. 1 Brownian motion Brownian motion plays
More informationMath 167: Mathematical Game Theory Instructor: Alpár R. Mészáros
Math 167: Mathematical Game Theory Instructor: Alpár R. Mészáros Midterm #1, February 3, 2017 Name (use a pen): Student ID (use a pen): Signature (use a pen): Rules: Duration of the exam: 50 minutes. By
More informationA Translation of Intersection and Union Types
A Translation of Intersection and Union Types for the λ µ-calculus Kentaro Kikuchi RIEC, Tohoku University kentaro@nue.riec.tohoku.ac.jp Takafumi Sakurai Department of Mathematics and Informatics, Chiba
More information1 Directed sets and nets
subnets2.tex April 22, 2009 http://thales.doa.fmph.uniba.sk/sleziak/texty/rozne/topo/ This text contains notes for my talk given at our topology seminar. It compares 3 different definitions of subnets.
More informationCONSTRUCTION OF CODES BY LATTICE VALUED FUZZY SETS. 1. Introduction. Novi Sad J. Math. Vol. 35, No. 2, 2005,
Novi Sad J. Math. Vol. 35, No. 2, 2005, 155-160 CONSTRUCTION OF CODES BY LATTICE VALUED FUZZY SETS Mališa Žižović 1, Vera Lazarević 2 Abstract. To every finite lattice L, one can associate a binary blockcode,
More informationCONSISTENCY OF THE CONSTRAINED MAXIMUM LIKELIHOOD ESTIMATOR IN FINITE NORMAL MIXTURE MODELS
CONSISTENCY OF THE CONSTRAINED MAXIMUM LIKELIHOOD ESTIMATOR IN FINITE NORMAL MIXTURE MODELS Xianming Tan, Jiahua Chen, Runchu Zhang 1 Nankai University and University of Waterloo Due to non-regularity
More informationCATEGORICAL SKEW LATTICES
CATEGORICAL SKEW LATTICES MICHAEL KINYON AND JONATHAN LEECH Abstract. Categorical skew lattices are a variety of skew lattices on which the natural partial order is especially well behaved. While most
More informationA No-Arbitrage Theorem for Uncertain Stock Model
Fuzzy Optim Decis Making manuscript No (will be inserted by the editor) A No-Arbitrage Theorem for Uncertain Stock Model Kai Yao Received: date / Accepted: date Abstract Stock model is used to describe
More informationCharacterization of the Optimum
ECO 317 Economics of Uncertainty Fall Term 2009 Notes for lectures 5. Portfolio Allocation with One Riskless, One Risky Asset Characterization of the Optimum Consider a risk-averse, expected-utility-maximizing
More informationA class of coherent risk measures based on one-sided moments
A class of coherent risk measures based on one-sided moments T. Fischer Darmstadt University of Technology November 11, 2003 Abstract This brief paper explains how to obtain upper boundaries of shortfall
More informationOrthogonality to the value group is the same as generic stability in C-minimal expansions of ACVF
Orthogonality to the value group is the same as generic stability in C-minimal expansions of ACVF Will Johnson February 18, 2014 1 Introduction Let T be some C-minimal expansion of ACVF. Let U be the monster
More informationON A PROBLEM BY SCHWEIZER AND SKLAR
K Y B E R N E T I K A V O L U M E 4 8 ( 2 1 2 ), N U M B E R 2, P A G E S 2 8 7 2 9 3 ON A PROBLEM BY SCHWEIZER AND SKLAR Fabrizio Durante We give a representation of the class of all n dimensional copulas
More informationNew tools of set-theoretic homological algebra and their applications to modules
New tools of set-theoretic homological algebra and their applications to modules Jan Trlifaj Univerzita Karlova, Praha Workshop on infinite-dimensional representations of finite dimensional algebras Manchester,
More informationOnline Shopping Intermediaries: The Strategic Design of Search Environments
Online Supplemental Appendix to Online Shopping Intermediaries: The Strategic Design of Search Environments Anthony Dukes University of Southern California Lin Liu University of Central Florida February
More informationREMARKS ON K3 SURFACES WITH NON-SYMPLECTIC AUTOMORPHISMS OF ORDER 7
REMARKS ON K3 SURFACES WTH NON-SYMPLECTC AUTOMORPHSMS OF ORDER 7 SHNGO TAK Abstract. n this note, we treat a pair of a K3 surface and a non-symplectic automorphism of order 7m (m = 1, 3 and 6) on it. We
More informationCHARACTERIZATION OF CLOSED CONVEX SUBSETS OF R n
CHARACTERIZATION OF CLOSED CONVEX SUBSETS OF R n Chebyshev Sets A subset S of a metric space X is said to be a Chebyshev set if, for every x 2 X; there is a unique point in S that is closest to x: Put
More informationHigh Dimensional Edgeworth Expansion. Applications to Bootstrap and Its Variants
With Applications to Bootstrap and Its Variants Department of Statistics, UC Berkeley Stanford-Berkeley Colloquium, 2016 Francis Ysidro Edgeworth (1845-1926) Peter Gavin Hall (1951-2016) Table of Contents
More informationMAT25 LECTURE 10 NOTES. = a b. > 0, there exists N N such that if n N, then a n a < ɛ
MAT5 LECTURE 0 NOTES NATHANIEL GALLUP. Algebraic Limit Theorem Theorem : Algebraic Limit Theorem (Abbott Theorem.3.3) Let (a n ) and ( ) be sequences of real numbers such that lim n a n = a and lim n =
More informationSy D. Friedman. August 28, 2001
0 # and Inner Models Sy D. Friedman August 28, 2001 In this paper we examine the cardinal structure of inner models that satisfy GCH but do not contain 0 #. We show, assuming that 0 # exists, that such
More informationINTERVAL DISMANTLABLE LATTICES
INTERVAL DISMANTLABLE LATTICES KIRA ADARICHEVA, JENNIFER HYNDMAN, STEFFEN LEMPP, AND J. B. NATION Abstract. A finite lattice is interval dismantlable if it can be partitioned into an ideal and a filter,
More informationSeparation axioms on enlargements of generalized topologies
Revista Integración Escuela de Matemáticas Universidad Industrial de Santander Vol. 32, No. 1, 2014, pág. 19 26 Separation axioms on enlargements of generalized topologies Carlos Carpintero a,, Namegalesh
More informationEssays on Some Combinatorial Optimization Problems with Interval Data
Essays on Some Combinatorial Optimization Problems with Interval Data a thesis submitted to the department of industrial engineering and the institute of engineering and sciences of bilkent university
More informationTWO-PERIODIC TERNARY RECURRENCES AND THEIR BINET-FORMULA 1. INTRODUCTION
TWO-PERIODIC TERNARY RECURRENCES AND THEIR BINET-FORMULA M. ALP, N. IRMAK and L. SZALAY Abstract. The properties of k-periodic binary recurrences have been discussed by several authors. In this paper,
More informationMITCHELL S THEOREM REVISITED. Contents
MITCHELL S THEOREM REVISITED THOMAS GILTON AND JOHN KRUEGER Abstract. Mitchell s theorem on the approachability ideal states that it is consistent relative to a greatly Mahlo cardinal that there is no
More informationOn Existence of Equilibria. Bayesian Allocation-Mechanisms
On Existence of Equilibria in Bayesian Allocation Mechanisms Northwestern University April 23, 2014 Bayesian Allocation Mechanisms In allocation mechanisms, agents choose messages. The messages determine
More informationWada s Representations of the. Pure Braid Group of High Degree
Theoretical Mathematics & Applications, vol2, no1, 2012, 117-125 ISSN: 1792-9687 (print), 1792-9709 (online) International Scientific Press, 2012 Wada s Representations of the Pure Braid Group of High
More informationAn Application of Ramsey Theorem to Stopping Games
An Application of Ramsey Theorem to Stopping Games Eran Shmaya, Eilon Solan and Nicolas Vieille July 24, 2001 Abstract We prove that every two-player non zero-sum deterministic stopping game with uniformly
More informationOptimal Design Of English Auctions With Discrete Bid Levels*
Optial Design Of English Auctions With Discrete Bid Levels* E. David, A. Rogers and N. R. Jennings Electronics and Coputer Science, University of Southapton, Southapton, SO7 BJ, UK. {ed,acr,nrj}@ecs.soton.ac.uk.
More information17 MAKING COMPLEX DECISIONS
267 17 MAKING COMPLEX DECISIONS The agent s utility now depends on a sequence of decisions In the following 4 3grid environment the agent makes a decision to move (U, R, D, L) at each time step When the
More informationSTAT/MATH 395 PROBABILITY II
STAT/MATH 395 PROBABILITY II Distribution of Random Samples & Limit Theorems Néhémy Lim University of Washington Winter 2017 Outline Distribution of i.i.d. Samples Convergence of random variables The Laws
More informationMaximally Consistent Extensions
Chapter 4 Maximally Consistent Extensions Throughout this chapter we require that all formulae are written in Polish notation and that the variables are amongv 0,v 1,v 2,... Recall that by the PRENEX NORMAL
More informationAnalysis of the purchase option of computers
Analysis of the of coputers N. Ahituv and I. Borovits Faculty of Manageent, The Leon Recanati Graduate School of Business Adinistration, Tel-Aviv University, University Capus, Raat-Aviv, Tel-Aviv, Israel
More informationDiscrete Random Variables and Probability Distributions. Stat 4570/5570 Based on Devore s book (Ed 8)
3 Discrete Random Variables and Probability Distributions Stat 4570/5570 Based on Devore s book (Ed 8) Random Variables We can associate each single outcome of an experiment with a real number: We refer
More informationStrong normalisation and the typed lambda calculus
CHAPTER 9 Strong normalisation and the typed lambda calculus In the previous chapter we looked at some reduction rules for intuitionistic natural deduction proofs and we have seen that by applying these
More informationSteepest descent and conjugate gradient methods with variable preconditioning
Ilya Lashuk and Andrew Knyazev 1 Steepest descent and conjugate gradient methods with variable preconditioning Ilya Lashuk (the speaker) and Andrew Knyazev Department of Mathematics and Center for Computational
More informationParameterized Expectations
Parameterized Expectations A Brief Introduction Craig Burnside Duke University November 2006 Craig Burnside (Duke University) Parameterized Expectations November 2006 1 / 10 Parameterized Expectations
More informationTHE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET
THE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET MICHAEL PINSKER Abstract. We calculate the number of unary clones (submonoids of the full transformation monoid) containing the
More informationGame Theory Fall 2003
Game Theory Fall 2003 Problem Set 5 [1] Consider an infinitely repeated game with a finite number of actions for each player and a common discount factor δ. Prove that if δ is close enough to zero then
More informationViability, Arbitrage and Preferences
Viability, Arbitrage and Preferences H. Mete Soner ETH Zürich and Swiss Finance Institute Joint with Matteo Burzoni, ETH Zürich Frank Riedel, University of Bielefeld Thera Stochastics in Honor of Ioannis
More informationAn Optimal Odd Unimodular Lattice in Dimension 72
An Optimal Odd Unimodular Lattice in Dimension 72 Masaaki Harada and Tsuyoshi Miezaki September 27, 2011 Abstract It is shown that if there is an extremal even unimodular lattice in dimension 72, then
More informationKutay Cingiz, János Flesch, P. Jean-Jacques Herings, Arkadi Predtetchinski. Doing It Now, Later, or Never RM/15/022
Kutay Cingiz, János Flesch, P Jean-Jacques Herings, Arkadi Predtetchinski Doing It Now, Later, or Never RM/15/ Doing It Now, Later, or Never Kutay Cingiz János Flesch P Jean-Jacques Herings Arkadi Predtetchinski
More informationGAME THEORY. Department of Economics, MIT, Follow Muhamet s slides. We need the following result for future reference.
14.126 GAME THEORY MIHAI MANEA Department of Economics, MIT, 1. Existence and Continuity of Nash Equilibria Follow Muhamet s slides. We need the following result for future reference. Theorem 1. Suppose
More informationTranslates of (Anti) Fuzzy Submodules
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn : 2278-800X, www.ijerd.com Volume 5, Issue 2 (December 2012), PP. 27-31 P.K. Sharma Post Graduate Department of Mathematics,
More informationNovember 2006 LSE-CDAM
NUMERICAL APPROACHES TO THE PRINCESS AND MONSTER GAME ON THE INTERVAL STEVE ALPERN, ROBBERT FOKKINK, ROY LINDELAUF, AND GEERT JAN OLSDER November 2006 LSE-CDAM-2006-18 London School of Economics, Houghton
More informationComparison of proof techniques in game-theoretic probability and measure-theoretic probability
Comparison of proof techniques in game-theoretic probability and measure-theoretic probability Akimichi Takemura, Univ. of Tokyo March 31, 2008 1 Outline: A.Takemura 0. Background and our contributions
More informationMATH 5510 Mathematical Models of Financial Derivatives. Topic 1 Risk neutral pricing principles under single-period securities models
MATH 5510 Mathematical Models of Financial Derivatives Topic 1 Risk neutral pricing principles under single-period securities models 1.1 Law of one price and Arrow securities 1.2 No-arbitrage theory and
More informationRationalizable Strategies
Rationalizable Strategies Carlos Hurtado Department of Economics University of Illinois at Urbana-Champaign hrtdmrt2@illinois.edu Jun 1st, 2015 C. Hurtado (UIUC - Economics) Game Theory On the Agenda 1
More informationDeterministic Multi-Player Dynkin Games
Deterministic Multi-Player Dynkin Games Eilon Solan and Nicolas Vieille September 3, 2002 Abstract A multi-player Dynkin game is a sequential game in which at every stage one of the players is chosen,
More informationMinimal Variance Hedging in Large Financial Markets: random fields approach
Minimal Variance Hedging in Large Financial Markets: random fields approach Giulia Di Nunno Third AMaMeF Conference: Advances in Mathematical Finance Pitesti, May 5-1 28 based on a work in progress with
More informationarxiv: v1 [q-fin.pm] 13 Mar 2014
MERTON PORTFOLIO PROBLEM WITH ONE INDIVISIBLE ASSET JAKUB TRYBU LA arxiv:143.3223v1 [q-fin.pm] 13 Mar 214 Abstract. In this paper we consider a modification of the classical Merton portfolio optimization
More informationAbstract Algebra Solution of Assignment-1
Abstract Algebra Solution of Assignment-1 P. Kalika & Kri. Munesh [ M.Sc. Tech Mathematics ] 1. Illustrate Cayley s Theorem by calculating the left regular representation for the group V 4 = {e, a, b,
More informationAn alternative route to performance hypothesis testing Received (in revised form): 7th November, 2003
An alternative route to perforance hypothesis testing Received (in revised for): 7th Noveber, 3 Bernd Scherer heads Research for Deutsche Asset Manageent in Europe. Before joining Deutsche, he worked at
More informationOn the Number of Permutations Avoiding a Given Pattern
On the Number of Permutations Avoiding a Given Pattern Noga Alon Ehud Friedgut February 22, 2002 Abstract Let σ S k and τ S n be permutations. We say τ contains σ if there exist 1 x 1 < x 2
More informationBounds on coloring numbers
Ben-Gurion University, Beer Sheva, and the Institute for Advanced Study, Princeton NJ January 15, 2011 Table of contents 1 Introduction 2 3 Infinite list-chromatic number Assuming cardinal arithmetic is
More information