An Indicator Function Limit Theorem in Dynamical Systems
|
|
- Ashlyn Richardson
- 5 years ago
- Views:
Transcription
1 arxiv: v2 [math.ds] 5 Nov 2009 An Indicator Function Limit Theorem in Dynamical Systems Olivier Durieu & Dalibor Volný October 27, 208 Abstract We show by a constructive proof that in all aperiodic dynamical system, for all sequences (a n ) n N R + such that a n ր and an n 0 as n, there exists a set A A having the property that the sequence of the distributions of ( a n S n (l A µ(a))) n N is dense in the space of all probability measures on R. This extends the result of [5] to the non-ergodic case. Keywords: Dynamical system; Ergodicity; Sums of random variables; Limit theorem. AMS classification: 28D05; 60F05; 60G0. Introduction and result Let (Ω,A,µ) be a probability space where Ω is a Lebesgue space and let T be an invertible measure preserving transformation from Ω to Ω. We say that (Ω,A,µ,T) is a dynamical system. Further, the dynamical system is aperiodic if µ{x Ω : n,t n x = x} = 0. It is ergodic if for any A A, T A = A implies µ(a) = 0 or. ForarandomvariableX fromωtor,wedenotebys n (X)thepartialsums n i=0 X Ti, n. The present paper concerns the question of the limit behavior of partial sums in general aperiodic dynamical systems. In 987, Burton and Denker [2] proved that in any aperiodic dynamical system, there exists a function in L 2 0 which verifies the central limit theorem. In general, for functions in L p spaces, Volný [7] proved that for any sequence a n, LaboratoiredeMathématiquesetPhysiqueThéorique,UMR6083CNRS,UniversitéFrançoisRabelais, Tours; olivier.durieu@lmpt.univ-tours.fr Laboratoire de Mathématiques Raphaël Salem, UMR 6085 CNRS, Université de Rouen; dalibor.volny@univ-rouen.fr
2 a nn 0, there exists a dense G δ part G of L p 0 such that for any f G the sequence of distributions of S nk (f) is dense in the set of all probability measures on R, see also Liardet and Volný [6]. This work is also related to the question of the rate of convergence in the ergodic theorem (see del Junco and Rosenblatt [3]). In Durieu and Volný [5], a similar result is shown for the class of centered indicator functions l A µ(a), A A and for ergodic dynamical systems. The following theorem was obtained. Theorem Let (Ω,A,µ,T) be an ergodic dynamical system on a Lebesgue probability space, (a n ) n N R + be an increasing sequence such that a n ր and an 0 as n. n There exists a dense (for the pseudo-metric of the measure of the symmetric difference) G δ class of sets A A having the property that for every probability ν on R, there exists a subsequence (n k ) k N satisfying S nk (l A µ(a)) D k ν. Here, we answer the question of the existence of a similar result in the non-ergodic case. Assume now that (Ω,A,µ,T) is not ergodic. Let (a n ) n N R + be an increasing sequence satisfying a n ր and an 0 as n. Denote by I the σ-algebra of the n invariant sets and (µ x ) x χ the ergodic components of the measure µ. If there exist a set A A, a probability measure ν on R and a sequence (n k ) k N such that then E(l A I) = µ(a) almost surely. S nk (l A µ(a)) D k ν, Indeed, if there exists x χ such that µ x (A) µ(a) = c > 0, then by Birkhoff s Ergodic Theorem, n S n(l A µ(a)) c n µ x -almost surely. Therefore and we have a contradiction. S nk (l A µ(a)) k + So, to find a set which satisfies the conclusion of Theorem, we have to consider the sets A such that E(l A I) is almost surely constant. The class of such sets is not, in general, dense in A. So, in the non-ergodic case, we cannot expect the result of genericity. Nevertheless, in the non-ergodic case, one can show the( existence of an arbitrarily ) small set A A such that the sequence of the distributions of a n S n (l A µ(a)) is dense n N in the set of probability measures on R. We prove the following result. 2
3 Theorem 2 Let (Ω,A,µ,T) be an aperiodic dynamical system on a Lebesgue probability space and (a n ) n N R + be an increasing sequence such that a n ր and an n 0 as n. For all ε > 0, there exists a set A A with µ(a) < ε such that for every probability measure ν on R, there exists a sequence (n k ) k N such that S nk (l A µ(a)) D k ν. The rest of the paper is devoted to the proof of Theorem 2. Note that the proof that we propose is constructive. 2 Proof Let (Ω,A,µ,T) be an aperiodic dynamical system and (a n ) n N R + be an increasing sequence such that a n ր and an 0 as n which are fixed for all the sequel. n 2. An equivalent statement Let M be the set of all probability measures on R and M 0 be the set of all probability measures on R which have zero-mean. We denote by d the Lévy metric on M. For all µ and ν in M with distribution functions F and G, d(µ,ν) = inf{ε > 0 : G(t ε) ε F(t) G(t+ε)+ε, t R}. The space (M, d) is a complete separable metric space and convergence with respect to d is equivalent to weak convergence of distributions (see Dudley [4], pages ). If X : Ω R is a random variable, we denote by L Ω (X) the distribution of X on R. Using the separability of the set M 0 which is dense in M, we can prove that the next theorem is equivalent to Theorem 2. Theorem 3 For every ε > 0 and for every sequence (ν k ) k N in M 0, there exist a set A A, with µ(a) < ε, and a sequence (n k ) k N such that d(l Ω ( S nk (l A µ(a))),ν k ) k 0. Proposition 2. Theorem 3 and Theorem 2 are equivalent. Let M be a countable and dense subset of M 0. We can find a sequence (ν k ) k N such that for all η M, there exists an infinite set K η N verifying that for all k K η, ν k = η. Let A be the set and (n k ) k N be the sequence associated to the sequence (ν k ) k N as in Theorem 3. 3
4 For each ν M, there exists an increasing sequence (k j ) j N such that ν kj = ν for all j N. By Theorem 3, By classical argument, Theorem 2 follows. d(l Ω ( j S nkj (l A µ(a))),ν) j 0. The fact that Theorem 2 implies Theorem 3 is clear. Now to prove Theorem 3, we will construct explicitly the set A. To do that, we will use the four following lemmas. 2.2 Auxiliary results Let ν be a probability on R. For B B(R) with ν(b) > 0, ν B denotes the probability on R defined by ν B (A) = ν(b) ν(a B). For x R, ν x denotes the probability on R defined by ν x (B) = ν({xb/b B}). Lemma 2.2 Some properties of the Lévy metric: (i) For each probability ν on R, for all Borel sets B, d(ν B,ν) ν(r\b). (ii) For all probabilities ν and η on R, for all x, d(ν x,η x ) d(ν,η). (iii) For all probability ν on R, for all measurable functions f and g from Ω to R, where δ 0 is the Dirac measure at 0. d( L Ω (f +g),ν) ( L Ω (f),ν)+d( L Ω (g),δ 0 ) (iv) For all probability ν on R, d(ν,δ 0 ) A if and only if ν((, A)) A and ν((a, )) A. The proof is left to the reader. Lemma 2.3 For all probability ν on R, for all ε > 0, there exists C 0 and n 0 N, for all C C 0 and n n 0, there exists a probability η on R with support S [ a n C,a n C] Z such that for all i S, η({i}) Q, d(η an,ν) ε and E(η) := xdη(x) = 0. This Lemma is a consequence of Lemma 3.3 in [5] (which has a constructive proof) and of the fact that for all probability measure on Z with finite support, we can find a probability on Z with same support which is arbitrarily close to the first one (with respect to d) and takes values in Q. The following lemma is classical, we do not give a proof. 4
5 Lemma 2.4 Let (Ω,A,µ) be a Lebesgue probability space and ν be a probability on R. Then, there exists a measurable random variable X : Ω R, such that L Ω (X) = ν. Recall that a set F A is the base of a Rokhlin tower of height n if the sets F,TF,...,T n F are pairwise disjoint. Lemma 2.5 For all n and for all ε > 0, there exists a set F A such that {F,...,T n F} is a Rokhlin tower of measure greater than ε and the sojourn time in the junk set J = Ω\( i=0 n Ti F) is almost surely, i.e. for a.e. x J, Tx F. This can be view as a consequence of Alpern s theorem [], by constructing a Rokhlin castle with two towers of height n and n+ and the base of the second tower of measure less than ε. 2.3 Proof of Theorem 3 Let the sequence (ν k ) k in M 0 and the constant ε (0,) be fixed. Let (ε k ) k be a decreasing sequence of positive reals such that k ε k < ε and k kε k <. Theorem 3 is a consequence of the following proposition, which is proved in the next section. Proposition 2.6 There exist a sequence of pairwise disjoint sets A k A and a sequence of integers (n k ) k such that, (i) µ(a ) ε and for all k >, µ(a k ) an k n k ε k ; (ii) for all k, d(l Ω ( S nk (l Ak µ(a k ))),ν k ) ε k ; (iii) for all k and for all j > k, d(l Ω ( a nj S nj (l Ak µ(a k ))),δ 0 ) ε j. We admit the proposition for the end of the proof. Set A = k A k. Then by (i), µ(a) = k µ(a k ) k ε k ε. 5
6 By Proposition 2.6 and by (iii) and (iv) of Lemma 2.2, for all j, d(l Ω ( a nj S nj (l A µ(a))),ν j ) j d(l Ω ( S nj (l Ai µ(a i ))),δ 0 ) a nj i= +d(l Ω ( S nj (l Aj µ(a j ))),ν j ) a nj + d(l Ω ( S nj (l Ai µ(a i ))),δ 0 ) a nj i=j+ (j )ε j +ε j + i=j+ n j a nj µ(a i ) i j iε i which goes to 0 when j goes to. Thus Theorem 3 is proved. 2.4 Proof of Proposition 2.6 We give an explicit construction of the sets A k. We begin by the construction of the set A. Step : the set A The goal is to find a set A and an integer n such that d(l Ω ( a n S n (l A µ(a ))),ν ) ε. But we also want that the set A becomes negligible for thepartial sums oflength n k, k 2 (condition (iii)). There are several steps. First, we will define a set A, which satisfies (ii) and (iii) for j = 2. Then, we will modify this set, step by step, to have (iii) for all j > 2. The set A, We consider the probability ν, the constant ε and we set α := ε 8. Applying Lemma 2.3toν andα,wegettwoconstantsc(ν,α )andn(ν,α )andwechoosec := C(ν,α ) and n n(ν,α ) such that d n α where d := a n C +. () We get a corresponding centered probability η (given by Lemma 2.3) with support in { d +,...,d } such that d(η an,ν ) α. Since for all i, η ({i}) Q, there exist q N and q (i) N, i =...,2d, such that η ({i d }) = q(i), for all i =,...,2d. q 6
7 Now, weconsidertheprobabilityν 2 andε 2. Wedefineα 2 := an 2n ε 2. ApplyingLemma2.3 to ν 2 and α 2, we get two constants C(ν 2,α 2 ) and n(ν 2,α 2 ). Set C 2 := max{c(ν 2,α 2 ),C } and let n 2 n(ν 2,α 2 ) be a multiple of q n such that q n a n2 α 2. (2) By Lemma 2.5, we can consider a set F A such that {F,TF,...,T n2 F } is a Rokhlin tower of height n 2, with the sojourn time in the junk set almost surely equal to and the measure of the junk set smaller than γ := min{ an 2 n 2 α 2,α }. Write F l := T ln F, l = 0,...,p. We thus have p := n 2 n towers {F l,...,tln F l} of height n. Notice that by definition of n 2, p is a multiple of q. By Lemma 2.4, let h be a measurable function from F to Z such that L F (h ) = η and denote by g the positive function equal to h +d. Let A F,i := g ({i}), i =,...,2d. Now, for all i =,...,2d, let {A F,i,,...,A F } be a partition of the set A,i,q (i) F,i into sets of measure q µ(f ). We thus have a partition of F into {A F,,,...,A F,,q (),A F,2,,...,A F,2,q (2),...,A F,2d,,...,A F,2d,q (2d }. ) By induction, we define partitions of F l for l =,...,p by setting T n A F l,i,j+ if j q (i),i,j := T n A F l,i+, if j = q (i) and i < 2d. T n A F l,, if j = q (2d ) and i = 2d For all l = 0,...,p and for all i =,...,2d, we set and,i := := q (i) j= 2d i i=k=0,i,j T k,i. Remark that for any l {0,...,p }, for any x F l and for any i {,...,2d }, Now, we define the set A, as follows x,i if and only if S n (l AF l )(x) = i. A, := p 7 l=0.
8 Remark that for any x F, S n q (l A, )(x) = d q and since p is a multiple of q, n S n2 (l A, )(x) = d p. Moreover, for each k {,..., 2 n q }, for any x T kn q F, we also have S n q (l A, )(x) = d q. Lemma 2.7 (i) µ(a, ) α ; (ii) A, p j=0 2d i=0 T i+jn F ; (iii) d(l Ω ( a n S n (l A, µ(a, ))),ν ) ε ; (iv) d(l Ω ( a n2 S n2 (l A, µ(a, ))),δ 0 ) α 2. For each l = 0,...,p, µ( ) = E F (g )µ(f ) = d µ(f ). Therefore, by (), µ(a, ) = p l=0 By construction, (ii) is clear. Let Ω := p l=0 µ( ) = p d µ(f ) p n 2 d = d n α. n 2d i=0 T i F l. We have and since E F (g ) = d, by centering, Now, since γ α, L Ω (S n (l A, )) = L F (g ) L Ω (S n (l A, µ(a, ))) = L F (h ). µ(ω ) = p (n 2d )µ(f ) (n 2 2p d ) ( γ ) n 2 = γ 2d n 3α. Thus, by Lemma 2.2 (i), and by Lemma 2.2 (ii), d(l Ω (S n (l A, µ(a, ))),L F (h )) 3α. d(l Ω ( a n S n (l A, µ(a, ))),L F ( h a n )) 3α. 8
9 We infer, by triangular inequality, that and (iii) is proved. d(l Ω ( a n S n (l A, µ(a, ))),ν ) ε Recall that n 2 is a multiple of n q and, by definition of A,, S n q (l A, )(x) = d q whenever x belongs to one of the T kn q n F for k = 0,..., 2 n q. Since the sojourn time in the junk set is, we infer that for any x Ω, Using µ(a, ) = p d µ(f ), we get (p q )d S n2 (l A, )(x) (p +q )d. S n2 (l A, µ(a, )) p d n 2 µ(f ) +q d p d γ +q d. Thus, since γ an 2 n 2 α 2 and by (2), we have a n2 S n2 (l A, µ(a, )) d n α 2 + d n q n a n2 2α α 2 α 2 and (iv) follows from application of Lemma 2.2 (iv). Of course, the set A, is not defined well enough to be negligible for higher partial sums. So, we need to modify a small part of A,. Thus we introduce a sequense of sets A,k, k 2. The set A, can be considered as a first version of the set A and the A,k, k 2 are the adjustments. The sets A,k, k 2 We shall give here the general algorithm to deduce the set A,k from A,k. To do that, we need first to define the entire sequence (n k ) k. By induction, we define the sequences (α k ) k 2, (C k ) k 2, (n k ) k 2, (q k ) k 2 as follows. We consider the probability ν k and ε k. We define α k := an k 2n k ε k. Applying Lemma 2.3 to ν k and α k, we get two constants C(ν k,α k ) and n(ν k,α k ). Set C k := max{c(ν k,α k ),C k } and let n k n(ν k,α k ) be a multiple of q k n k such that and d k n k α k where d k := C k +. (3) q k n k α k. (4) By Lemma 2.3, we get a corresponding centered probability η k on { d k +,...,d k } such that d(η kank,ν k ) α k. There exist q k N and q (i) k N, i =...,2d k, such that η k ({i d k }) = q(i) k q k. 9
10 For k, we also set p k := n k+ n k N and β k := α k α k+. Thus, for all k, We define the sequence (γ k ) k by γ k := min β j α k. (5) j k { βk+, a } n k+ α k+. (6) 2p k+ n k+ Further, for all k, by application of Lemma 2.5, we obtain a set F k A such that {F k,tf k,...,t n k+ F k } is a Rokhlin tower of height n k+ and the junk set J k := Ω\ n k+ i=0 T i F k is a set with sojourn time and µ(j k ) γ k. Remark that α 2, n 2 and γ 2 have been previously defined but they respect this new definition. We also introduce the sequence of sets F k defined by induction in the following way: F := F and F k := T n(x) x. x F k where for all x in F k, n(x) := inf{n 0/T n x F k } is the time of the first visit in F k. Lemma 2.8 There exists a sequence of measurable sets (A,k ) k such that (i) µ(a,k A,k ) β k ; (ii) for all x Ω, S n (l A,k )(x) 2d ; (iii) for all x F k, for all i = 0,...,p k, S nk (l A,k T in k )(x) = n k n d ; (iv) d(l Ω ( S nk+ (l A,k µ(a,k )),δ 0 ) α k+. + We prove the lemma by induction. The set A, is already defined. Now, for a fixed k, we are going to explain how to deduce the set A,k from A,k. For x F k and i = 0,...,p k, let ρ i (x) := (i+)n k j=in k l A,k T j (x) = S nk (l A,k T ink ). Byhypothesis, forallx F k, ρ n 0(x) = S nk (l A,k )(x) = p k k n d = n k n d butfori > 0 it can be different. The differences appear when the orbit of the point x meets the junk 0
11 set J k. Nevertheless, by definition of the Rokhlin tower (see Lemma 2.5), it can meet J k only one time in every n k consecutive iterates by T. So we have, (p k ) n k n d ρ i (x) (p k +) n k n d. To summarize, for x F k and i = 0,...,p k, ρ i (x) = n k n d +j with j { n k n d,..., n k n d }. We define a set B i (x) as follows. If j 0, B i (x) =. If j < 0, let B i (x) be a set composed by j points from the set {T in k x,...,t (i+)n k x}\a,k, in such a way that every n -consecutive points in {T in k x,...,t (i+)n k x} meet A,k B i (x) at most 2d times (it is possible because otherwise, ρ i (x) > n k n 2d j n k n d ). We define a set C i (x) as follows. If j 0, C i (x) =. If j > 0, let C i (x) be the set composed by the j first points of {T in k x,...} A,k. and Let B := x F k p k i=0 B i (x), C := x F k A,k := (A,k \C) B. p k i=0 C i (x) Since the orbit of a point x can only meet J k one time every n k and using (6), we have µ(a,k A,k ) 2p k µ(j k ) 2p k γ k β k. Remark that (ii) and (iii) are guaranteed by construction of A,k. Further for all x F k, we have S nk+ (l A,k )(x) = p k n k n d = n k+ n d. We deduce that µ(a,k ) n k+ n d µ(f k ) µ(j k) and (p k ) n k n d S nk+ (l A,k ) (p k +) n k n d. Then, S nk+ (l A,k µ(a,k )) n k d +(+ n k+ d )µ(j k ) n n and by (6) and (4), S nk+ (l A,k µ(a,k )) n k d +( + d )α k+ α k n n k+ n By Lemma 2.2 (iv), we get (iv).
12 The set A We can now define the set A A as A := lim k A,k which is well defined because the sequence (µ(a,k A,k+ )) k is summable. Lemma 2.9 (i) µ(a ) 2α ; (ii) S n (l A ) 2d ; (iii) d(l Ω ( a n S n (l A µ(a ))),ν ) 2ε ; (iv) For all k 2, d(l Ω ( S nk (l A µ(a ))),δ 0 ) ε k. For all k, we have µ(a A,k ) j=k+ µ(a,j A,j ) and then µ(a ) µ(a, )+µ(a A, ) 2α. Assertion (ii) comes from Lemma 2.8 (ii). Further (7) and Lemma 2.2 (iv) imply that for all n, j=k+ β j α k+ (7) d(l Ω ( a n (S n (l A,k µ(a,k )) S n (l A µ(a )))),δ 0 ) n a n α k+. Using Lemma 2.2 (iii), we can deduce (ii) from Lemma 2.7 (iii) and (iii) from Lemma 2.8 (iv). Step 2: The set A 2 The set A 2,2 We consider F 2 A and we will almost repeat what we did to find the set A,, working with n 2,q 2,p 2,d 2 instead of n,q,p,d. The difference comes to the fact that we want A A 2 =. Recall that η 2 is the probability measure with support in Z given by Lemma 2.3 applied to ν 2 and α 2 and with constants C 2 and n 2. Let h 2 be a function from F 2 to Z given by Lemma 2.4 such that L G (h 2 ) = η 2 and call g 2 the positive function equal to h 2 +d 2. Let A F2,i := g 2 ({i}), i =,...,2d 2 2
13 and for all i =,...,2d 2, let {A F2,i,,...,A F2 } be a partition of the set A,i,q (i) F2,i into sets 2 of measure q 2 µ(f 2 ). We thus have a partition of F 2 into {A F2,,,...,A F2,,q () 2,A F2,2,,...,A F2,2,q (2) 2,...,A F2,2d,,...,A F2,2d,q (2d }. ) 2 By induction, we deduce partitions of F2 l = Tln 2 F 2 for l =,...,p 2. We set T n 2 A F l 2,i,j+ if j q (i) 2 2,i,j := T n 2 A F l 2,i+, if j = q (i) 2 and i < 2d 2. T n 2 A F l 2,, if j = q (2d ) 2 and i = 2d 2 For all l = 0,...,p 2 and for all i =,...,2d 2, we set 2,i := q 2 (i) j= 2,i,j. Because we want disjointness, we cannot define 2 as 2d 2 i i= k=0 Tk 2,i. So, for each l {0,...,p 2 }, for each x F2 l, if x A F2 l,i, we denote by D l (x) the set composed by the i first elements of {x,tx,...}\a and we set D l := D l (x). Since A contains at most 2d points in each orbit of size n and since d 2 d, x F l 2 We define A 2,2 as D l A 2,2 := 4d 2 i=0 p 2 l=0 T i F l 2. D l. Lemma 2.0 (i) µ(a 2,2 ) α 2 ; (ii) S n2 (l A2,2 ) 2d 2 ; (iii) d(l Ω ( a n2 S n2 (l A2,2 µ(a 2,2 ))),ν 2 ) ε 2 ; (iv) d(l Ω ( a n3 S n3 (l A2,2 µ(a 2,2 ))),δ 0 ) α 3. The proof follows the one of Lemma 2.7 and is left to the reader. 3
14 The sets A 2,k, k 3 Nowwedefineasequence A 2,k,k 3usingthesametechniques asbeforeandpreserving the fact that for all k, A,k contains at most 2d 2 points in each orbit of length n 2. Then the A 2,k satisfy µ(a 2,k A 2,k ) β k and d(l Ω ( S nk+ (l A2,k µ(a 2,k ))),δ 0 ) α k+. + The set A 2 The set A 2 := lim A 2,k k is well defined, disjoint of A and satisfies the following lemma. Lemma 2. (i) µ(a 2 ) 2α 2 ; (ii) S n2 (l A2 ) 2d 2 ; (iii) d(l Ω ( a n2 S n2 (l A2 µ(a 2 ))),ν 2 ) 2ε 2 ; (iv) For all k 3, d(l Ω ( S nk (l A2 µ(a 2 ))),δ 0 ) ε k. The proof follows the one of Lemma 2.9. Step k: the set A k, k 3 It is now clear that, by induction, we can find sets A k disjoint of the sets A i, i < k, satisfying Proposition 2.6. References [] Steve Alpern. Generic properties of measure preserving homeomorphisms. In Ergodic theory (Proc. Conf., Math. Forschungsinst., Oberwolfach, 978), volume 729 of Lecture Notes in Math., pages Springer, Berlin, 979. [2] Robert Burton and Manfred Denker. On the central limit theorem for dynamical systems. Trans. Amer. Math. Soc., 302(2):75 726, 987. [3] Andrés del Junco and Joseph Rosenblatt. Counterexamples in ergodic theory and number theory. Math. Ann., 245(3):85 97,
15 [4] R. M. Dudley. Real analysis and probability, volume 74 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, Revised reprint of the 989 original. [5] Olivier Durieu and Dalibor Volný. On sums of indicator functions in dynamical systems. to appear in Ergodic Theory and Dynamical Systems. [6] Pierre Liardet and Dalibor Volný. Sums of continuous and differentiable functions in dynamical systems. Israel J. Math., 98:29 60, 997. [7] Dalibor Volný. On limit theorems and category for dynamical systems. Yokohama Math. J., 38():29 35,
Comparison between criteria leading to the weak invariance principle
Annales de l Institut Henri Poincaré - Probabilités et Statistiques 2008, Vol. 44, No. 2, 324 340 DOI: 10.1214/07-AIHP123 Association des Publications de l Institut Henri Poincaré, 2008 www.imstat.org/aihp
More informationProbability and Measure
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 84 Paper 4, Section II 26J Let (X, A) be a measurable space. Let T : X X be a measurable map, and µ a probability
More informationChapter 1. Measure Spaces. 1.1 Algebras and σ algebras of sets Notation and preliminaries
Chapter 1 Measure Spaces 1.1 Algebras and σ algebras of sets 1.1.1 Notation and preliminaries We shall denote by X a nonempty set, by P(X) the set of all parts (i.e., subsets) of X, and by the empty set.
More informationarxiv: v3 [math.ds] 23 May 2017
INVARIANT MEASURES FOR CARTESIAN POWERS OF CHACON INFINITE TRANSFORMATION arxiv:1505.08033v3 [math.ds] 23 May 2017 ÉLISE JANVRESSE, EMMANUEL ROY AND THIERRY DE LA RUE Abstract. We describe all boundedly
More informationIntegration on Measure Spaces
Chapter 3 Integration on Measure Spaces In this chapter we introduce the general notion of a measure on a space X, define the class of measurable functions, and define the integral, first on a class of
More informationarxiv: v1 [math.pr] 9 Apr 2015 Dalibor Volný Laboratoire de Mathématiques Raphaël Salem, UMR 6085, Université de Rouen, France
A CENTRAL LIMIT THEOREM FOR FIELDS OF MARTINGALE DIFFERENCES arxiv:1504.02439v1 [math.pr] 9 Apr 2015 Dalibor Volný Laboratoire de Mathématiques Raphaël Salem, UMR 6085, Université de Rouen, France Abstract.
More informationA BOREL SOLUTION TO THE HORN-TARSKI PROBLEM. MSC 2000: 03E05, 03E20, 06A10 Keywords: Chain Conditions, Boolean Algebras.
A BOREL SOLUTION TO THE HORN-TARSKI PROBLEM STEVO TODORCEVIC Abstract. We describe a Borel poset satisfying the σ-finite chain condition but failing to satisfy the σ-bounded chain condition. MSC 2000:
More informationAnalysis Comprehensive Exam Questions Fall 2008
Analysis Comprehensive xam Questions Fall 28. (a) Let R be measurable with finite Lebesgue measure. Suppose that {f n } n N is a bounded sequence in L 2 () and there exists a function f such that f n (x)
More informationOn Convergence of Sequences of Measurable Functions
On Convergence of Sequences of Measurable Functions Christos Papachristodoulos, Nikolaos Papanastassiou Abstract In order to study the three basic kinds of convergence (in measure, almost every where,
More informationDisintegration into conditional measures: Rokhlin s theorem
Disintegration into conditional measures: Rokhlin s theorem Let Z be a compact metric space, µ be a Borel probability measure on Z, and P be a partition of Z into measurable subsets. Let π : Z P be the
More informationMATHS 730 FC Lecture Notes March 5, Introduction
1 INTRODUCTION MATHS 730 FC Lecture Notes March 5, 2014 1 Introduction Definition. If A, B are sets and there exists a bijection A B, they have the same cardinality, which we write as A, #A. If there exists
More informationON DENSITY TOPOLOGIES WITH RESPECT
Journal of Applied Analysis Vol. 8, No. 2 (2002), pp. 201 219 ON DENSITY TOPOLOGIES WITH RESPECT TO INVARIANT σ-ideals J. HEJDUK Received June 13, 2001 and, in revised form, December 17, 2001 Abstract.
More informationBERNOULLI DYNAMICAL SYSTEMS AND LIMIT THEOREMS. Dalibor Volný Université de Rouen
BERNOULLI DYNAMICAL SYSTEMS AND LIMIT THEOREMS Dalibor Volný Université de Rouen Dynamical system (Ω,A,µ,T) : (Ω,A,µ) is a probablity space, T : Ω Ω a bijective, bimeasurable, and measure preserving mapping.
More informationChapter 4. Measure Theory. 1. Measure Spaces
Chapter 4. Measure Theory 1. Measure Spaces Let X be a nonempty set. A collection S of subsets of X is said to be an algebra on X if S has the following properties: 1. X S; 2. if A S, then A c S; 3. if
More informationTYPICAL POINTS FOR ONE-PARAMETER FAMILIES OF PIECEWISE EXPANDING MAPS OF THE INTERVAL
TYPICAL POINTS FOR ONE-PARAMETER FAMILIES OF PIECEWISE EXPANDING MAPS OF THE INTERVAL DANIEL SCHNELLMANN Abstract. Let I R be an interval and T a : [0, ] [0, ], a I, a oneparameter family of piecewise
More informationQuasi-invariant measures for continuous group actions
Contemporary Mathematics Quasi-invariant measures for continuous group actions Alexander S. Kechris Dedicated to Simon Thomas on his 60th birthday Abstract. The class of ergodic, invariant probability
More information25.1 Ergodicity and Metric Transitivity
Chapter 25 Ergodicity This lecture explains what it means for a process to be ergodic or metrically transitive, gives a few characterizes of these properties (especially for AMS processes), and deduces
More informationErgodic Theory. Constantine Caramanis. May 6, 1999
Ergodic Theory Constantine Caramanis ay 6, 1999 1 Introduction Ergodic theory involves the study of transformations on measure spaces. Interchanging the words measurable function and probability density
More informationIntroduction to Dynamical Systems
Introduction to Dynamical Systems France-Kosovo Undergraduate Research School of Mathematics March 2017 This introduction to dynamical systems was a course given at the march 2017 edition of the France
More informationSPACES ENDOWED WITH A GRAPH AND APPLICATIONS. Mina Dinarvand. 1. Introduction
MATEMATIČKI VESNIK MATEMATIQKI VESNIK 69, 1 (2017), 23 38 March 2017 research paper originalni nauqni rad FIXED POINT RESULTS FOR (ϕ, ψ)-contractions IN METRIC SPACES ENDOWED WITH A GRAPH AND APPLICATIONS
More informationTHEOREMS, ETC., FOR MATH 515
THEOREMS, ETC., FOR MATH 515 Proposition 1 (=comment on page 17). If A is an algebra, then any finite union or finite intersection of sets in A is also in A. Proposition 2 (=Proposition 1.1). For every
More informationDynamical Systems 2, MA 761
Dynamical Systems 2, MA 761 Topological Dynamics This material is based upon work supported by the National Science Foundation under Grant No. 9970363 1 Periodic Points 1 The main objects studied in the
More informationOn fuzzy entropy and topological entropy of fuzzy extensions of dynamical systems
On fuzzy entropy and topological entropy of fuzzy extensions of dynamical systems Jose Cánovas, Jiří Kupka* *) Institute for Research and Applications of Fuzzy Modeling University of Ostrava Ostrava, Czech
More informationStandard deviation of recurrence times for piecewise linear transformations
University of Wollongong Research Online Faculty of Engineering and Information Sciences - Papers: Part B Faculty of Engineering and Information Sciences 2017 Standard deviation of recurrence times for
More information3 hours UNIVERSITY OF MANCHESTER. 22nd May and. Electronic calculators may be used, provided that they cannot store text.
3 hours MATH40512 UNIVERSITY OF MANCHESTER DYNAMICAL SYSTEMS AND ERGODIC THEORY 22nd May 2007 9.45 12.45 Answer ALL four questions in SECTION A (40 marks in total) and THREE of the four questions in SECTION
More informationIRRATIONAL ROTATION OF THE CIRCLE AND THE BINARY ODOMETER ARE FINITARILY ORBIT EQUIVALENT
IRRATIONAL ROTATION OF THE CIRCLE AND THE BINARY ODOMETER ARE FINITARILY ORBIT EQUIVALENT MRINAL KANTI ROYCHOWDHURY Abstract. Two invertible dynamical systems (X, A, µ, T ) and (Y, B, ν, S) where X, Y
More information5 Measure theory II. (or. lim. Prove the proposition. 5. For fixed F A and φ M define the restriction of φ on F by writing.
5 Measure theory II 1. Charges (signed measures). Let (Ω, A) be a σ -algebra. A map φ: A R is called a charge, (or signed measure or σ -additive set function) if φ = φ(a j ) (5.1) A j for any disjoint
More information5 Birkhoff s Ergodic Theorem
5 Birkhoff s Ergodic Theorem Birkhoff s Ergodic Theorem extends the validity of Kolmogorov s strong law to the class of stationary sequences of random variables. Stationary sequences occur naturally even
More informationMeasures. 1 Introduction. These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland.
Measures These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland. 1 Introduction Our motivation for studying measure theory is to lay a foundation
More information1 Measurable Functions
36-752 Advanced Probability Overview Spring 2018 2. Measurable Functions, Random Variables, and Integration Instructor: Alessandro Rinaldo Associated reading: Sec 1.5 of Ash and Doléans-Dade; Sec 1.3 and
More informationERGODIC DYNAMICAL SYSTEMS CONJUGATE TO THEIR COMPOSITION SQUARES. 0. Introduction
Acta Math. Univ. Comenianae Vol. LXXI, 2(2002), pp. 201 210 201 ERGODIC DYNAMICAL SYSTEMS CONJUGATE TO THEIR COMPOSITION SQUARES G. R. GOODSON Abstract. We investigate the question of when an ergodic automorphism
More informationErgodic Theory and Topological Groups
Ergodic Theory and Topological Groups Christopher White November 15, 2012 Throughout this talk (G, B, µ) will denote a measure space. We call the space a probability space if µ(g) = 1. We will also assume
More informationLebesgue-Radon-Nikodym Theorem
Lebesgue-Radon-Nikodym Theorem Matt Rosenzweig 1 Lebesgue-Radon-Nikodym Theorem In what follows, (, A) will denote a measurable space. We begin with a review of signed measures. 1.1 Signed Measures Definition
More informationLecture 10. Theorem 1.1 [Ergodicity and extremality] A probability measure µ on (Ω, F) is ergodic for T if and only if it is an extremal point in M.
Lecture 10 1 Ergodic decomposition of invariant measures Let T : (Ω, F) (Ω, F) be measurable, and let M denote the space of T -invariant probability measures on (Ω, F). Then M is a convex set, although
More information4th Preparation Sheet - Solutions
Prof. Dr. Rainer Dahlhaus Probability Theory Summer term 017 4th Preparation Sheet - Solutions Remark: Throughout the exercise sheet we use the two equivalent definitions of separability of a metric space
More informationTHE SET OF RECURRENT POINTS OF A CONTINUOUS SELF-MAP ON AN INTERVAL AND STRONG CHAOS
J. Appl. Math. & Computing Vol. 4(2004), No. - 2, pp. 277-288 THE SET OF RECURRENT POINTS OF A CONTINUOUS SELF-MAP ON AN INTERVAL AND STRONG CHAOS LIDONG WANG, GONGFU LIAO, ZHENYAN CHU AND XIAODONG DUAN
More informationThe Hopf argument. Yves Coudene. IRMAR, Université Rennes 1, campus beaulieu, bat Rennes cedex, France
The Hopf argument Yves Coudene IRMAR, Université Rennes, campus beaulieu, bat.23 35042 Rennes cedex, France yves.coudene@univ-rennes.fr slightly updated from the published version in Journal of Modern
More informationErgodic Theorems with Respect to Lebesgue
Ergodic Theorems with Respect to Lebesgue ELEONORA CATSIGERAS Instituto de Matemática, Facultad de Ingeniería Universidad de la República Av. Herrera y Reissig 565, CP 200 Montevideo URUGUAY eleonora@fing.edu.uy
More information2 (Bonus). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due 9/5). Prove that every countable set A is measurable and µ(a) = 0. 2 (Bonus). Let A consist of points (x, y) such that either x or y is
More information4. Ergodicity and mixing
4. Ergodicity and mixing 4. Introduction In the previous lecture we defined what is meant by an invariant measure. In this lecture, we define what is meant by an ergodic measure. The primary motivation
More informationn [ F (b j ) F (a j ) ], n j=1(a j, b j ] E (4.1)
1.4. CONSTRUCTION OF LEBESGUE-STIELTJES MEASURES In this section we shall put to use the Carathéodory-Hahn theory, in order to construct measures with certain desirable properties first on the real line
More informationLecture 9. d N(0, 1). Now we fix n and think of a SRW on [0,1]. We take the k th step at time k n. and our increments are ± 1
Random Walks and Brownian Motion Tel Aviv University Spring 011 Lecture date: May 0, 011 Lecture 9 Instructor: Ron Peled Scribe: Jonathan Hermon In today s lecture we present the Brownian motion (BM).
More informationSigned Measures. Chapter Basic Properties of Signed Measures. 4.2 Jordan and Hahn Decompositions
Chapter 4 Signed Measures Up until now our measures have always assumed values that were greater than or equal to 0. In this chapter we will extend our definition to allow for both positive negative values.
More informationVARIATIONAL PRINCIPLE FOR THE ENTROPY
VARIATIONAL PRINCIPLE FOR THE ENTROPY LUCIAN RADU. Metric entropy Let (X, B, µ a measure space and I a countable family of indices. Definition. We say that ξ = {C i : i I} B is a measurable partition if:
More informationLecture Notes Introduction to Ergodic Theory
Lecture Notes Introduction to Ergodic Theory Tiago Pereira Department of Mathematics Imperial College London Our course consists of five introductory lectures on probabilistic aspects of dynamical systems,
More informationJónsson posets and unary Jónsson algebras
Jónsson posets and unary Jónsson algebras Keith A. Kearnes and Greg Oman Abstract. We show that if P is an infinite poset whose proper order ideals have cardinality strictly less than P, and κ is a cardinal
More informationChacon maps revisited
Chacon maps revisited E. H. El Abdalaoui joint work with: M. Lemańczyk (Poland) and T. De la Rue (France) Laboratoire de Mathématiques Raphaël Salem CNRS - University of Rouen (France) Moscou Stats University
More information13. Examples of measure-preserving tranformations: rotations of a torus, the doubling map
3. Examples of measure-preserving tranformations: rotations of a torus, the doubling map 3. Rotations of a torus, the doubling map In this lecture we give two methods by which one can show that a given
More informationMA359 Measure Theory
A359 easure Theory Thomas Reddington Usman Qureshi April 8, 204 Contents Real Line 3. Cantor set.................................................. 5 2 General easures 2 2. Product spaces...............................................
More informationMATH41112/ Ergodic Theory. Charles Walkden
MATH42/62 Ergodic Theory Charles Walkden 4 th January, 208 MATH4/62 Contents Contents 0 Preliminaries 2 An introduction to ergodic theory. Uniform distribution of real sequences 4 2 More on uniform distribution
More informationFUNDAMENTALS OF REAL ANALYSIS by. IV.1. Differentiation of Monotonic Functions
FUNDAMNTALS OF RAL ANALYSIS by Doğan Çömez IV. DIFFRNTIATION AND SIGND MASURS IV.1. Differentiation of Monotonic Functions Question: Can we calculate f easily? More eplicitly, can we hope for a result
More informationSubsequences of frames
Subsequences of frames R. Vershynin February 13, 1999 Abstract Every frame in Hilbert space contains a subsequence equivalent to an orthogonal basis. If a frame is n-dimensional then this subsequence has
More informationL Enseignement Mathématique, t. 40 (1994), p AN ERGODIC ADDING MACHINE ON THE CANTOR SET. by Peter COLLAS and David KLEIN
L Enseignement Mathématique, t. 40 (994), p. 249-266 AN ERGODIC ADDING MACHINE ON THE CANTOR SET by Peter COLLAS and David KLEIN ABSTRACT. We calculate all ergodic measures for a specific function F on
More informationSigned Measures and Complex Measures
Chapter 8 Signed Measures Complex Measures As opposed to the measures we have considered so far, a signed measure is allowed to take on both positive negative values. To be precise, if M is a σ-algebra
More informationThe small ball property in Banach spaces (quantitative results)
The small ball property in Banach spaces (quantitative results) Ehrhard Behrends Abstract A metric space (M, d) is said to have the small ball property (sbp) if for every ε 0 > 0 there exists a sequence
More informationA n (T )f = 1 n 1. T i f. i=0
REVISTA DE LA UNIÓN MATEMÁTICA ARGENTINA Volumen 46, Número 1, 2005, Páginas 47 51 A NOTE ON THE L 1 -MEAN ERGODIC THEOREM Abstract. Let T be a positive contraction on L 1 of a σ-finite measure space.
More informationARTICLE IN PRESS. J. Math. Anal. Appl. ( ) Note. On pairwise sensitivity. Benoît Cadre, Pierre Jacob
S0022-27X0500087-9/SCO AID:9973 Vol. [DTD5] P.1 1-8 YJMAA:m1 v 1.35 Prn:15/02/2005; 16:33 yjmaa9973 by:jk p. 1 J. Math. Anal. Appl. www.elsevier.com/locate/jmaa Note On pairwise sensitivity Benoît Cadre,
More informationLecture 3: Probability Measures - 2
Lecture 3: Probability Measures - 2 1. Continuation of measures 1.1 Problem of continuation of a probability measure 1.2 Outer measure 1.3 Lebesgue outer measure 1.4 Lebesgue continuation of an elementary
More informationFREQUENTLY HYPERCYCLIC OPERATORS WITH IRREGULARLY VISITING ORBITS. S. Grivaux
FREQUENTLY HYPERCYCLIC OPERATORS WITH IRREGULARLY VISITING ORBITS by S. Grivaux Abstract. We prove that a bounded operator T on a separable Banach space X satisfying a strong form of the Frequent Hypercyclicity
More information2 Lebesgue integration
2 Lebesgue integration 1. Let (, A, µ) be a measure space. We will always assume that µ is complete, otherwise we first take its completion. The example to have in mind is the Lebesgue measure on R n,
More informationDefining the Integral
Defining the Integral In these notes we provide a careful definition of the Lebesgue integral and we prove each of the three main convergence theorems. For the duration of these notes, let (, M, µ) be
More informationNotes on Measure, Probability and Stochastic Processes. João Lopes Dias
Notes on Measure, Probability and Stochastic Processes João Lopes Dias Departamento de Matemática, ISEG, Universidade de Lisboa, Rua do Quelhas 6, 1200-781 Lisboa, Portugal E-mail address: jldias@iseg.ulisboa.pt
More information(U) =, if 0 U, 1 U, (U) = X, if 0 U, and 1 U. (U) = E, if 0 U, but 1 U. (U) = X \ E if 0 U, but 1 U. n=1 A n, then A M.
1. Abstract Integration The main reference for this section is Rudin s Real and Complex Analysis. The purpose of developing an abstract theory of integration is to emphasize the difference between the
More informationErgodic Theorems. Samy Tindel. Purdue University. Probability Theory 2 - MA 539. Taken from Probability: Theory and examples by R.
Ergodic Theorems Samy Tindel Purdue University Probability Theory 2 - MA 539 Taken from Probability: Theory and examples by R. Durrett Samy T. Ergodic theorems Probability Theory 1 / 92 Outline 1 Definitions
More informationEntropy for zero-temperature limits of Gibbs-equilibrium states for countable-alphabet subshifts of finite type
Entropy for zero-temperature limits of Gibbs-equilibrium states for countable-alphabet subshifts of finite type I. D. Morris August 22, 2006 Abstract Let Σ A be a finitely primitive subshift of finite
More informationRATIO ERGODIC THEOREMS: FROM HOPF TO BIRKHOFF AND KINGMAN
RTIO ERGODIC THEOREMS: FROM HOPF TO BIRKHOFF ND KINGMN HNS HENRIK RUGH ND DMIEN THOMINE bstract. Hopf s ratio ergodic theorem has an inherent symmetry which we exploit to provide a simplification of standard
More informationREAL AND COMPLEX ANALYSIS
REAL AND COMPLE ANALYSIS Third Edition Walter Rudin Professor of Mathematics University of Wisconsin, Madison Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any
More informationThe Caratheodory Construction of Measures
Chapter 5 The Caratheodory Construction of Measures Recall how our construction of Lebesgue measure in Chapter 2 proceeded from an initial notion of the size of a very restricted class of subsets of R,
More informationReal Analysis Chapter 1 Solutions Jonathan Conder
3. (a) Let M be an infinite σ-algebra of subsets of some set X. There exists a countably infinite subcollection C M, and we may choose C to be closed under taking complements (adding in missing complements
More informationII - REAL ANALYSIS. This property gives us a way to extend the notion of content to finite unions of rectangles: we define
1 Measures 1.1 Jordan content in R N II - REAL ANALYSIS Let I be an interval in R. Then its 1-content is defined as c 1 (I) := b a if I is bounded with endpoints a, b. If I is unbounded, we define c 1
More information1.4 Outer measures 10 CHAPTER 1. MEASURE
10 CHAPTER 1. MEASURE 1.3.6. ( Almost everywhere and null sets If (X, A, µ is a measure space, then a set in A is called a null set (or µ-null if its measure is 0. Clearly a countable union of null sets
More informationA UNIVERSAL HYPERCYCLIC REPRESENTATION
A UNIVERSAL HYPERCYCLIC REPRESENTATION ELI GLASNER AND BENJAMIN WEISS Abstract. For any countable group, and also for any locally compact second countable, compactly generated topological group, G, we
More informationA CLT FOR MULTI-DIMENSIONAL MARTINGALE DIFFERENCES IN A LEXICOGRAPHIC ORDER GUY COHEN. Dedicated to the memory of Mikhail Gordin
A CLT FOR MULTI-DIMENSIONAL MARTINGALE DIFFERENCES IN A LEXICOGRAPHIC ORDER GUY COHEN Dedicated to the memory of Mikhail Gordin Abstract. We prove a central limit theorem for a square-integrable ergodic
More informationReal Analysis, 2nd Edition, G.B.Folland Elements of Functional Analysis
Real Analysis, 2nd Edition, G.B.Folland Chapter 5 Elements of Functional Analysis Yung-Hsiang Huang 5.1 Normed Vector Spaces 1. Note for any x, y X and a, b K, x+y x + y and by ax b y x + b a x. 2. It
More informationALMOST EVERY NUMBER HAS A CONTINUUM. INTRODUCTION. Let β belong to (1, 2) and write Σ =
ALMOST EVERY NUMBER HAS A CONTINUUM OF β-expansions NIKITA SIDOROV 1. INTRODUCTION. Let β belong to (1, 2) and write Σ = 1 {0, 1}. For each x 0 we will call any representation of x of the form (1) x =
More informationEstimates for probabilities of independent events and infinite series
Estimates for probabilities of independent events and infinite series Jürgen Grahl and Shahar evo September 9, 06 arxiv:609.0894v [math.pr] 8 Sep 06 Abstract This paper deals with finite or infinite sequences
More informationWHICH MEASURES ARE PROJECTIONS OF PURELY UNRECTIFIABLE ONE-DIMENSIONAL HAUSDORFF MEASURES
WHICH MEASURES ARE PROJECTIONS OF PURELY UNRECTIFIABLE ONE-DIMENSIONAL HAUSDORFF MEASURES MARIANNA CSÖRNYEI AND VILLE SUOMALA Abstract. We give a necessary and sufficient condition for a measure µ on the
More informationIntroduction and Preliminaries
Chapter 1 Introduction and Preliminaries This chapter serves two purposes. The first purpose is to prepare the readers for the more systematic development in later chapters of methods of real analysis
More informationCantor sets, Bernoulli shifts and linear dynamics
Cantor sets, Bernoulli shifts and linear dynamics S. Bartoll, F. Martínez-Giménez, M. Murillo-Arcila and A. Peris Abstract Our purpose is to review some recent results on the interplay between the symbolic
More informationPart V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory
Part V 7 Introduction: What are measures and why measurable sets Lebesgue Integration Theory Definition 7. (Preliminary). A measure on a set is a function :2 [ ] such that. () = 2. If { } = is a finite
More information3 Integration and Expectation
3 Integration and Expectation 3.1 Construction of the Lebesgue Integral Let (, F, µ) be a measure space (not necessarily a probability space). Our objective will be to define the Lebesgue integral R fdµ
More informationDual Space of L 1. C = {E P(I) : one of E or I \ E is countable}.
Dual Space of L 1 Note. The main theorem of this note is on page 5. The secondary theorem, describing the dual of L (µ) is on page 8. Let (X, M, µ) be a measure space. We consider the subsets of X which
More informationSeminar In Topological Dynamics
Bar Ilan University Department of Mathematics Seminar In Topological Dynamics EXAMPLES AND BASIC PROPERTIES Harari Ronen May, 2005 1 2 1. Basic functions 1.1. Examples. To set the stage, we begin with
More informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
More informationMath 4121 Spring 2012 Weaver. Measure Theory. 1. σ-algebras
Math 4121 Spring 2012 Weaver Measure Theory 1. σ-algebras A measure is a function which gauges the size of subsets of a given set. In general we do not ask that a measure evaluate the size of every subset,
More informationRandom Process Lecture 1. Fundamentals of Probability
Random Process Lecture 1. Fundamentals of Probability Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/43 Outline 2/43 1 Syllabus
More informationarxiv: v1 [math.ds] 31 Jul 2018
arxiv:1807.11801v1 [math.ds] 31 Jul 2018 On the interior of projections of planar self-similar sets YUKI TAKAHASHI Abstract. We consider projections of planar self-similar sets, and show that one can create
More informationASYMPTOTICALLY NONEXPANSIVE MAPPINGS IN MODULAR FUNCTION SPACES ABSTRACT
ASYMPTOTICALLY NONEXPANSIVE MAPPINGS IN MODULAR FUNCTION SPACES T. DOMINGUEZ-BENAVIDES, M.A. KHAMSI AND S. SAMADI ABSTRACT In this paper, we prove that if ρ is a convex, σ-finite modular function satisfying
More informationHILBERT SPACES AND THE RADON-NIKODYM THEOREM. where the bar in the first equation denotes complex conjugation. In either case, for any x V define
HILBERT SPACES AND THE RADON-NIKODYM THEOREM STEVEN P. LALLEY 1. DEFINITIONS Definition 1. A real inner product space is a real vector space V together with a symmetric, bilinear, positive-definite mapping,
More informationA note on some approximation theorems in measure theory
A note on some approximation theorems in measure theory S. Kesavan and M. T. Nair Department of Mathematics, Indian Institute of Technology, Madras, Chennai - 600 06 email: kesh@iitm.ac.in and mtnair@iitm.ac.in
More informationarxiv: v1 [math.co] 3 Nov 2014
SPARSE MATRICES DESCRIBING ITERATIONS OF INTEGER-VALUED FUNCTIONS BERND C. KELLNER arxiv:1411.0590v1 [math.co] 3 Nov 014 Abstract. We consider iterations of integer-valued functions φ, which have no fixed
More informationarxiv: v2 [math.ca] 4 Jun 2017
EXCURSIONS ON CANTOR-LIKE SETS ROBERT DIMARTINO AND WILFREDO O. URBINA arxiv:4.70v [math.ca] 4 Jun 07 ABSTRACT. The ternary Cantor set C, constructed by George Cantor in 883, is probably the best known
More informationJOININGS, FACTORS, AND BAIRE CATEGORY
JOININGS, FACTORS, AND BAIRE CATEGORY Abstract. We discuss the Burton-Rothstein approach to Ornstein theory. 1. Weak convergence Let (X, B) be a metric space and B be the Borel sigma-algebra generated
More informationThe Kadec-Pe lczynski theorem in L p, 1 p < 2
The Kadec-Pe lczynski theorem in L p, 1 p < 2 I. Berkes and R. Tichy Abstract By a classical result of Kadec and Pe lczynski (1962), every normalized weakly null sequence in L p, p > 2 contains a subsequence
More informationDynamical Systems and Ergodic Theory PhD Exam Spring Topics: Topological Dynamics Definitions and basic results about the following for maps and
Dynamical Systems and Ergodic Theory PhD Exam Spring 2012 Introduction: This is the first year for the Dynamical Systems and Ergodic Theory PhD exam. As such the material on the exam will conform fairly
More information1.1. MEASURES AND INTEGRALS
CHAPTER 1: MEASURE THEORY In this chapter we define the notion of measure µ on a space, construct integrals on this space, and establish their basic properties under limits. The measure µ(e) will be defined
More information(1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define
Homework, Real Analysis I, Fall, 2010. (1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define ρ(f, g) = 1 0 f(x) g(x) dx. Show that
More informationON THE UNIQUENESS PROPERTY FOR PRODUCTS OF SYMMETRIC INVARIANT PROBABILITY MEASURES
Georgian Mathematical Journal Volume 9 (2002), Number 1, 75 82 ON THE UNIQUENESS PROPERTY FOR PRODUCTS OF SYMMETRIC INVARIANT PROBABILITY MEASURES A. KHARAZISHVILI Abstract. Two symmetric invariant probability
More informationLebesgue Measure. Dung Le 1
Lebesgue Measure Dung Le 1 1 Introduction How do we measure the size of a set in IR? Let s start with the simplest ones: intervals. Obviously, the natural candidate for a measure of an interval is its
More informationarxiv: v1 [math.ds] 1 Oct 2014
A NOTE ON THE POINTS WITH DENSE ORBIT UNDER AND MAPS arxiv:1410.019v1 [math.ds] 1 Oct 014 AUTHOR ONE, AUTHOR TWO, AND AUTHOR THREE Abstract. It was conjectured by Furstenberg that for any x [0,1]\Q, dim
More information