On Strongly Equivalent Nonrandomized Transition Probabilities
|
|
- Sharyl Charles
- 5 years ago
- Views:
Transcription
1 On Strongly Equivalent Nonrandomized Transition Probabilities Eugene. Feinberg 1 and lexey B. Piunovskiy bstract Dvoretzky, Wald and Wolfowitz proved in 1951 the existence of equivalent and strongly equivalent mappings for a given transition probability when the number of nonatomic measures is finite and the decision set is finite. This paper introduces a notion of strongly equivalent transition probabilities with respect to a finite collection of functions. This notion contains the notions of equivalent and strongly equivalent transition probabilities as particular cases. This paper shows that a strongly equivalent mapping with respect to a finite collection of functions exists for a finite number of nonatomic distributions and finite decision set. It also provides a condition when this is true for a countable decision set. ccording to a recent example by Loeb and Sun, a strongly equivalent mapping may not exist under these conditions when the decision set is uncountable. This paper also provides two additional counterexamples and shows that strongly equivalent mappings exist for homogeneous transition probabilities. 1 Introduction Dvoretzky, Wald and Wolfowits [, 3] studied the following problem. Consider a standard Borel space, i.e. is a one-to-one measurable image of a Borel subset of a Polish space, and consider another standard Borel space. Sometimes is called a state space (or set) and is called a decision space (or set). Let a finite number of nonatomic probability measures µ 1,..., µ K on be given. We recall that a measure µ on a standard Borel space is called nonatomic if µ({x}) = for all x. We follow the terminology that a finite set is countable. Of course, if is countable then f(a)ν(da) = a f(a)ν(a) for any measure ν and for any function f on. Denote by π(da x) a regular transition probability from to. Since we consider only regular transition probabilities and only measurable functions, we sometimes omit the terms regular and measurable. The following two facts were proved in [3]. Proposition 1. ([3, Theorem 3.1]) If is a finite set then for any finite number K, for any measurable functions r k (x, a), k = 1,..., K, and for any transition probability π from to, there exists a measurable mapping ϕ of to such that r k (x, a)π(da x)µ k (dx) = r k (x, ϕ(x))µ k (dx), k = 1,..., K. 1 Department of pplied Mathematics and Statistics, State University of New York at Stony Brook, Stony Brook, NY , US. Department of Mathematical Sciences, University of Liverpool, Liverpool, L69 7ZL, UK. 1
2 Proposition. ([3, Theorem 3.]) If is a finite set then for any transition probability π from to there exists a measurable mapping ϕ : such that π(a x)µ k (dx) = µ k ({x : ϕ(x) = a}), a, k = 1,..., K. We remark that Dvoretzky, Wald, and Wolfowitz [, 3] considered = R n but their proofs are valid for a standard Borel space. Let the finite integer K and measurable functions r k (x, a) on be fixed, k = 1,..., K. ccording to [3], two transition probabilities π 1 and π are called equivalent if r k (x, a)π 1 (da x)µ k (dx) = r k (x, a)π (da x)µ k (dx), k = 1,..., K; (1) and π 1 and π are called strongly equivalent if for any measurable subset B of π 1 (B x)µ k (dx) = π (B x)µ k (dx), k = 1,..., K. () Thus, for any transition probability, Proposition 1 states the existence of an equivalent measurable mapping when the set is finite. Proposition claims the existence of a strongly equivalent measurable mapping when is finite. s mentioned in [3], strongly equivalent transition probabilities are equivalent for any set of measurable functions {r k } on, but they may not be equivalent for a given set of measurable functions on. The natural question is whether, for a given transition probability, equivalent and strongly equivalent measurable mappings exist for infinite. Dvoretzky, Wald, and Wolfowitz [3, Section 4] studied this question by considering a compact and approximating it by finite sets. Feinberg and Piunovskiy [4, Theorem 1] proved the existence of an equivalent measurable mapping for an arbitrary Borel space. Loeb and Sun [6, Example.7] provided a surprising example when a strongly equivalent measurable mapping does not exist when K = and = [ 1, 1]. In particular, in this example the transition probability, for which there is no equivalent mapping, is a stochastic mixture of two mappings. In this paper we introduce a definition of strongly equivalent transition probabilities with respect to (wrt) a finite collection of functions on. By selecting an appropriate collection of functions, strongly equivalent transition probabilities wrt to a collection become strongly equivalent in the sense of (). By selecting another collection, strongly equivalent transition probabilities wrt to that collection become equivalent. Theorem 1 below states that if the set is finite, then, for a transition probability and a finite collection of measurable functions on, there exists a mapping that is strongly equivalent wrt to that collection. Theorem states that, if the transition probability does not depend on x, then the corresponding generalization of Proposition holds for an arbitrary Borel space. Theorem 3 provides a sufficient condition for a countable set when strongly equivalent wrt to a given finite collection of functions mapping exists for a given transition probability. Corollary 1 states, for a countable, the existence of a strongly equivalent mapping wrt a given collection of functions for a transition probability being a finite mixture of deterministic mappings. In addition, we construct examples that illustrate, for a given transition probability, the following possibilities: (i) there is no strongly equivalent mapping wrt to a function f(x, a) on when K = 1 (if f = f(x), such a mapping exists), and (ii) equivalent and strongly equivalent mappings do not exist for a countable number of nonatomic measures.
3 Definitions and preliminary result Consider nonempty standard Borel spaces and. Let P be a probability measure on and π be a transition probability from to. transition probability π is deterministic if for each x there exists a such that π({a} x) = 1. Each deterministic transition probability π is identified by a measurable mapping ϕ : such that π({ϕ(x)} x) = 1 for all x. Definition 1. Suppose a natural K and a collection of measurable functions {f k (x, a)} k=1,,...,k on are given. Two transition probabilities π 1 and π are called strongly equivalent wrt {f k } k=1,,...,k if for each k = 1,,..., K and for any measurable function ρ(a) on ρ(a)f k (x, a)π 1 (da x)p (dx) = ρ(a)f k (x, a)π (da x)p (dx). We remark that in this paper we follow a standard agreement that a finite or infinite Lebesgue - Stieltjes integral gdp is defined for any nonnegative measurable function g. In general, gdp = g + dp g dp, and this integral is defined only if either g + dp < or g dp <, where g + (x) = max{, g(x)} and g (x) = max{, g(x)}. If two integrals are not defined, they are considered to be equal. Notice that if π is a deterministic transition probability defined by a measurable mapping ϕ then ρ(a)f k (x, a)π(da x)p (dx) = ρ(ϕ(x))f k (x, ϕ(x))p (dx). We observe that, for P = K 1 K k=1 µ k, the strong equivalence of transition probabilities wrt {f k } k=1,,...,k for the properly selected functions f k implies the described in the Introduction strong equivalence and equivalence in the sense of Dvoretzky, Wald and Wolfowitz [, 3]. Indeed, since µ k P, k = 1,..., K, by the Radon-Nykodým theorem there are nonnegative measurable functions g k, k = 1,..., K, such that µ k (dx) = g k (x)p (dx). Thus, if transition probabilities π 1 and π are strongly equivalent wrt {f k } k=1,,...,k with f k (x, a) = g k (x)r k (x, a) then, by setting ρ(a) = 1 we have that they are equivalent in the sense of Dvoretzky, Wald and Wolfowitz [3]; (see (1) ). Transition probabilities π 1 and π are strongly equivalent wrt {g k } k=1,,...,k if and only if they are strongly equivalent in the sense of Dvoretzky, Wald and Wolfowitz [3]; see (). The following theorem, whose proof is based on the method introduced in [3], states the existence of strongly equivalent mappings wrt to a given finite collection of functions. Theorem 1. Let P (dx) be a non-atomic probability measure, be finite, K be a natural number, and a collection {f k (x, a)} k=1,,...,k of measurable functions on be given. Then, for any transition probability π from to, there exists a measurable mapping ϕ such that π and ϕ are strongly equivalent wrt {f k } k=1,,...,k. Proof. For any b consider the functions r bk (x, a) = I{a = b}f k (x, a), k = 1,..., K. Then {r bk } {b,k=1,...,k} is a finite collections of functions and, therefore, Proposition 1 implies that ϕ I{ϕ(x) = b}f k (x, ϕ(x))p (dx) = f k (x, b)π(b x)p (dx), b, k = 1,..., K. By multiplying each side of this equality by ρ(b), adding them in b, and replacing the notation b with a, we have ρ(ϕ(x))f k (x, ϕ(x))p (dx) = ρ(a)f k (x, a)π(a x)p (dx), k = 1,..., K. a 3
4 Remark 1. can be considered as a state space and can be considered as an action space. Sometimes it is natural to consider the set of available actions (x) for each state x. measurable mapping ϕ : is called a selector if ϕ(x) (x) for all x. The natural assumptions are that the graph Gr () = {(x, a) : x, a (x)} of the setvalued mapping (x) is a measurable subset of and there exists a selector. transition probability π must satisfy π((x) x) = 1 for all x. Functions f k (x, a), with respect to which a strong equivalence is considered, should satisfy f k (x, a) = for a / (x). Though such a model looks more general, in fact, it is not more general for the purpose of this paper, because, given a transition probability π, the existence of a strongly equivalent measurable function ϕ wrt {f k } k=1,,...,k implies the existence of a strongly equivalent selector ϕ wrt {f k } k=1,,...,k for the new model. Let Y = {x ϕ(x) / (x)}. Since the mapping g(x) = (x, ϕ(x)) is Borel for a Borel mapping ϕ and the graph of a Borel function ϕ is a Borel set, Y is a measurable subset of. Let φ be a selector. Define the selector ϕ: ϕ(x) = ϕ(x) for x \ Y and ϕ(x) = φ(x) for x Y. Then the transition probability π and selector ϕ are strongly equivalent wrt {f k } k=1,,...,k. 3 Uncountable set Let be an uncountable standard Borel space. The following example shows that, for a given transition probability π, the strongly equivalent function may not exist. Therefore, Theorem 1 does not hold if is uncountable. Example 1. (Loeb and Sun [6, Example.7]) For K > 1, Proposition cannot be extended to an uncountable. Let = [, 1], = [ 1, 1], µ 1 (dx) = dx, µ (dx) = xdx, and π(γ x) = 1[I{x Γ} + I{( x) Γ}] for any Borel subset Γ of [ 1, 1]. In this example there is no measurable mapping ϕ : strongly equivalent to π; see Loeb and Sun [6, Example.7] for detail. Therefore, Proposition cannot be extended to a continuum. Thus, when is not countable, Proposition and Theorem 1 do not hold for K > 1. Consider the case K = 1. Let f = f 1. If f does not depend on a, i.e. f = f(x), then Theorem 1 holds for any standard Borel space. Indeed, since all Borel spaces are isomorphic to Borel subsets of [, 1], it is sufficient to consider = = [, 1]. By replacing P with µ(dx) = f(x)p (dx), the statement of Theorem 1 for K = 1 and an arbitrary standard Borel space means that any random variable on [, 1] can be presented as a measurable mapping ϕ of a random variable with the nonatomic distribution µ. This is a well-known fact broadly used in simulation. In particular, when µ is the Lebesgue measure, the existence of such mapping, that we denote by ϕ, was proved by umann [1, Lemma F]. For a general random variable defined by a nonatomic measure µ, observe that F ()) is uniformly distributed on [, 1], where F is the distribution function of. Thus, ϕ(x) = ϕ(f (x)) is the required mapping. However, the following example shows that Theorem 1 does not hold for K = 1 when f = f(x, a) and is uncountable. Example. For K = 1 there is no strongly equivalent mapping wrt to f depending on a. Consider the same,, and π as in Example 1. Let f(x, a) = x a, and P be the Lebesgue measure on [, 1]. Then, 1 ρ(a)f(x, a)π(da x) =.5(ρ(x) x + ρ( x) x) for any measurable function 1 4
5 ρ(a) and therefore ρ(a)f(x, a)π(da x)dx = 1 For any measurable function ϕ on [, 1] 1 ρ(ϕ(x))f(x, ϕ(x))dx = [ρ(x) x + ρ( x) x]dx. (3) ρ(ϕ(x))i{ϕ(x) > }[x ϕ(x)]dx ρ(ϕ(x))i{ϕ(x) }[x + ϕ(x)]dx. Let ϕ be strongly equivalent to π wrt to {f}. Consider ρ 1 (a) = a I{a > }. Since the lefthand parts of (3) and (4) are qual, 1 1 x dx = 1 Hence 1 I{ϕ(x) > }[x ϕ(x)] dx = Consider ρ (a) = a I{a }. Then 1 1 x dx = 1 ϕ(x)i{ϕ(x) > }[x ϕ(x)]dx. 1 I{ϕ(x) > }x dx 1 ϕ(x)i{ϕ(x) }[x + ϕ(x)]dx. 1 (4) x dx. (5) Hence 1 1 I{ϕ(x) }[x + ϕ(x)] dx = I{ϕ(x) }x dx 1 1 x dx. (6) Sum (5) and (6). The righthand side of this sum is. The lefthand side is the sum of two nonnegative numbers. Therefore, and 1 I{ϕ(x) > }[x ϕ(x)] dx = ϕ(x) = 1 I{ϕ(x) }[x + ϕ(x)] dx = { x, if ϕ(x) >, x, if ϕ(x), where in (7) and in all the relations for ϕ(x) in this example we mean that they hold P -a.s. Observe that P ({ϕ(x) = }) = P ({x = }) =. Consider { ρ 3 (a) = I{ϕ(a) = a, a > }/a, if a,, otherwise. Since the lefthand sides of (3) and (4) are qual, 1 1 I{ϕ(x) = x}dx = 1 = I{ϕ(ϕ(x)) = ϕ(x), ϕ(x) > } 1 I{ϕ(x) = x}dx, 5 [ ] x ϕ(x) 1 dx (7) (8)
6 where the last equality holds because, in view of (7), the following is true: (i) ϕ(x) = x, when ϕ(x), (ii) I{ϕ(x) = x} = I{ϕ(ϕ(x)) = ϕ(x), ϕ(x) }, and (iii) P ({ϕ(x) = }) =. Equality (8) implies that P ({ϕ(x) = x}) = and, in view of (7), P ({ϕ(x) = x}) = 1. This is impossible, because for ρ 4 (a) = I{a < } we have 1 1 ρ 1 4(a)f(x, a)π(da x)dx = 1 and 4 1 ρ 4(ϕ(x))f(x, ϕ(x))dx = 1, where the former follows from (3) and the latter follows from (4). Consider a particular situation when the transition probability π does not depend on x, i.e., π(da x) = π(da y) for all x, y. Though, according to Example 1, strongly equivalent policies may not exist, they exist when the transition probability does not depend on x. Theorem. If all the measures µ 1,..., µ K are nonatomic and the transition probability π does not depend on x then for π there exists a strongly equivalent mapping. Proof. Let π(b) = π(b x), where x and B is a measurable subset of. We observe that π(b x)µ k(dx) = π(b), k = 1,..., K. Therefore, we need to prove that there exists a measurable mapping ϕ of to such that for any k = 1,..., K and for any measurable subset B of µ k ({x : ϕ(x) B}) = π(b). (9) Since all uncountable Borel spaces are isomorphic, we assume without loss of generality that = (, 1]. We shall construct a strongly equivalent mapping ϕ : (, 1]. In particular, we shall construct a sequence of measurable step functions ϕ n, n = 1,,..., such that ϕ n ϕ as n. First, we shall construct the function ϕ 1. To do this, we consider a decision rule π 1 that takes only two values: 1 and 1; π1 ( 1 x) = π((, 1]) and π1 (1 x) = π(( 1, 1]). ccording to Proposition, for the decision rule π 1 there exists a strongly equivalent mapping ϕ 1. Let We observe that, for i = 1, 1,i = {x ϕ 1 (x) = i }, i = 1,. µ k ( 1,i ) = π(( i 1, i ]), k = 1,..., K. Let for some n = 1,,..., a partition n,1,..., n, n of be given such that all elements of this partition are measurable sets and for i = 1,..., n µ k ( n,i ) = π(( i 1, i ]), k = 1,..., K. (1) n n We construct a partition n+1,1,..., n+1, n+1 of such that: (i) all elements of this partition are measurable, (ii) n,i = n+1,i 1 n+1,i, and (iii) for i = 1,..., n+1 µ k ( n+1,i ) = π(( i 1, i ]), k = 1,..., K. (11) n+1 n+1 To construct such a partition, we consider an arbitrary set n,j, j = 1,..., n. If π(( j 1 n, j we set n+1,j 1 = n,j and n+1,j =. If π(( j 1, j n measures µ n,j 1,..., µ n,j K on n,j: µ n,j k (B) = µ k(b n,j )/π(( j 1 n, j n ]) 6 ]) =, n ]) >, we consider the probability n
7 for measurable subsets B of n,j. We also define the probability measure π n,j on ( j 1 n, j n ] : π n,j (D) = π(d ( j 1 n, j n ])/π((j 1 n, j n ]) for measurable subsets D of ( j 1, j ]. The arguments used to partition the set into n n 1,1 and 1, imply that the set n,j can be partitioned into two measurable subsets n+1,j 1 and n+1,j such that (11) holds for i = j 1, j. Thus, the construction of n+1,1,..., n+1, n+1 is completed. For each n = 1,,... we set ϕ n (x) = i n when x n,i, i = 1,..., n. For n = 1 this definition is consistent with the previously given definitions. Since < ϕ n+1 (x) ϕ n (x), we can define ϕ(x) = lim n ϕ n (x), x. To complete the proof of the theorem, we need to prove (9). To verify (9), it is sufficient to show that for any n = 1,,... and for any i = 1,..., n µ k {ϕ(x) < i } = π((, i )), k = 1,..., K. (1) n n We observe that for n = 1,,... and for i = 1,..., n and for j = 1,,... Therefore, for k = 1,..., K {x ϕ n (x) < i n } = j=1{x ϕ n+j (x) ij 1 n+j } {x ϕ n+j (x) ij 1 } {x ϕ n+j+1 (x) ij+1 1 n+j n+j+1 }. µ k {ϕ(x) < i n } = lim j µ k{ϕ n+j (x) ij 1 n+j } = lim j π((, ij 1 n+j ]) = π((, i 1 i )) lim n j π((ij, n+j )) = π((, i n )), n where the second equality follows from (1). Thus, (1) is proved. 4 Countable set In this section, we prove a particular case of Theorem 1 when is an infinite countable set. Since, in view of Example 1, strongly equivalent mappings may not exist when is uncountable, the natural question is whether strongly equivalent mappings exist for a countable set. We do not know the answer to this question. The following Theorem 3 states the existence of strongly equivalent mappings wrt to a finite family of functions under the additional assumption that the transition probability π( x) is concentrated on a finite set B(x) for every x. We remark that, if is uncountable, then Example 1 demonstrates that the statements of neither Theorem 3 nor Corollary 1 are correct. 7
8 Theorem 3. Let P (dx) be a non-atomic probability measure, be a countable set, K be a natural number, and {f k (x, a)} k=1,,...,k be a collection of measurable functions on. If for P -almost all x the set B(x) = {a π(a x) > } is finite then there exists a measurable mapping strongly equivalent to π wrt {f k (x, a)} k=1,,...,k. Proof. For each finite subset B of, consider the measurable set B = {x B(x) = B}. Theorem 1 implies that, for the problem with the set replaced with B, there exists a strongly equivalent mapping wrt {f k (x, a)} k=1,,...,k. Therefore, the strongly equivalent mapping ϕ wrt {f k (x, a)} k=1,,...,k is defined on the measurable set Y = B B. This set is measurable, because there is only a countable number of terms in this union. Since P ( \ Y ) =, we can set ϕ(x) b for x \ Y, where b is an arbitrary element of. We recall that a transition probability π from a measurable set to a measurable set is called a finite mixture of mappings if there exist a finite number of measurable mappings φ 1,..., φ n of to such that, for some nonnegative numbers α 1,..., α n with their sum equal to 1, the equality π(γ x) = n i=1 α ii{φ i (x) Γ} holds for all measurable subsets Γ of and for all x. Corollary 1. Let be a countable set, K be a natural number, {f k } k=1,...,k be measurable functions on, and π be a finite mixture of measurable mappings. Then there exists a measurable mapping strongly equivalent to π wrt {f k } k=1,...,k. 5 Counterexample when the number of measures µ k is countable Dvotetzky, Wald, and Wolfowitz [3, Examples 1 and ] provide examples when Propositions 1 and do not hold when the set of parameters k, on which the functions r k and measures µ k depend, is continuum; see also Ferguson [5, p. 14]. s we see from Example 1, Theorem 3, and Corollary 1, some facts on the existence of equivalent mappings may hold for countable sets and do not hold for continuum sets. The following example demonstrates that Propositions 1, and Theorem 1 do not hold when k belongs to a countable set. Example 3. Let = [, 1], = {, 1}, and π( x) = π(1 x) 1/. ccording to [7, Theorem 6.6 in Chapter II], there exists a sequence {f k (x)} k=1,,... of nonnegative bounded uniformly continuous functions on such that, if for all k = 1,... f k (x)ν 1 (dx) = f k (x)ν (dx), (13) then measures ν 1 and ν coincide. (i) Consider r k (x, a) = f k (x)i{a = 1}, k = 1,..., and suppose there exists a measurable mapping ϕ such that r k (x, a)π(da x)dx = r k (x, ϕ(x))dx, k = 1,,... i.e. in this example all µ k are Lebesgue measures. This is equivalent to f k (x) 1 dx = f k (x)i{ϕ(x) = 1}dx, k = 1,,.... (14) 8
9 Therefore, the measures ν 1 (dx) = 1dx and ν (dx) = I{ϕ(x) = 1}dx are equal. This is impossible, because their densities 1 and I{ϕ(x) = 1} are not equal for all x. Thus, Proposition 1 does not hold when K is not finite. (ii) Since (13) remains valid if f k is multiplied by any constant c k, we select f k in the way f k(x)dx = 1, k = 1,,.... Then (14) is equivalent to π(1 x)µ k (dx) = I{ϕ(x) = 1}µ k (dx), k = 1,,..., (15) where µ k (dx) = f k (x)dx. Since (14) is impossible, Proposition does not hold when K is not finite. (iii) Let P (dx) = k=1 ( 1 )k µ k (dx) and g k (x) = µ k (dx)/p (dx). Then (15) becomes ag k (x)π(da x)p (dx) = ϕ(x)g k (x)p (dx), k = 1,,.... Since (15) is impossible, Theorem 1 does not hold either when K is countable. cknowledgement. This research was partially supported by NSF grant DMI References [1] R.J. umann, Mixed and behavior strategies in infinite games. nn. Math.Studies, 53(1964), pp []. Dvoretzky,. Wald, J. Wolfowitz, Elimination of randomization in certain problems of statistics and of the theory of games, Proc. Nat. cad. Sci., 36(195), pp [3]. Dvoretzky,. Wald, J. Wolfowitz, Elimination of randomization in certain statistical decision procedures and zero-sum two-person games, nn. Math. Stat., (1951), pp [4] E.. Feinberg and.b. Piunovskiy. On Dvoretzky-Wald-Wolfowitz theorem on nonrandomized statistical decisions. SIM Theory Probability ppl., 5(6), pp [5] T.S. Ferguson. Mathematical Statistics. Decision Theoretic pproach. cademic Press, New York, [6] P. Loeb and Y. Sun. Purification of measure-valued maps. Illinois J. of Mathematics, 5(6), pp [7] K.R.Parthasarathy. Probability Measures on Metric Spaces. MS Chelsea Publishing, Providence, Rhode Island, 5. 9
EXTENSION OF LYAPUNOV S CONVEXITY THEOREM TO SUBRANGES
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 EXTENSION OF LYAPUNOV S CONVEXITY THEOREM TO SUBRANGES PENG DAI AND EUGENE A. FEINBERG (Communicated
More informationTotal Expected Discounted Reward MDPs: Existence of Optimal Policies
Total Expected Discounted Reward MDPs: Existence of Optimal Policies Eugene A. Feinberg Department of Applied Mathematics and Statistics State University of New York at Stony Brook Stony Brook, NY 11794-3600
More informationContinuity of equilibria for two-person zero-sum games with noncompact action sets and unbounded payoffs
DOI 10.1007/s10479-017-2677-y FEINBERG: PROBABILITY Continuity of equilibria for two-person zero-sum games with noncompact action sets and unbounded payoffs Eugene A. Feinberg 1 Pavlo O. Kasyanov 2 Michael
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 informationProblem set 1, Real Analysis I, Spring, 2015.
Problem set 1, Real Analysis I, Spring, 015. (1) Let f n : D R be a sequence of functions with domain D R n. Recall that f n f uniformly if and only if for all ɛ > 0, there is an N = N(ɛ) so that if n
More information7 Complete metric spaces and function spaces
7 Complete metric spaces and function spaces 7.1 Completeness Let (X, d) be a metric space. Definition 7.1. A sequence (x n ) n N in X is a Cauchy sequence if for any ɛ > 0, there is N N such that n, m
More informationWHY SATURATED PROBABILITY SPACES ARE NECESSARY
WHY SATURATED PROBABILITY SPACES ARE NECESSARY H. JEROME KEISLER AND YENENG SUN Abstract. An atomless probability space (Ω, A, P ) is said to have the saturation property for a probability measure µ on
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 informationUNBOUNDED OPERATORS ON HILBERT SPACES. Let X and Y be normed linear spaces, and suppose A : X Y is a linear map.
UNBOUNDED OPERATORS ON HILBERT SPACES EFTON PARK Let X and Y be normed linear spaces, and suppose A : X Y is a linear map. Define { } Ax A op = sup x : x 0 = { Ax : x 1} = { Ax : x = 1} If A
More information4 Countability axioms
4 COUNTABILITY AXIOMS 4 Countability axioms Definition 4.1. Let X be a topological space X is said to be first countable if for any x X, there is a countable basis for the neighborhoods of x. X is said
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 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 informationMATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:
MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is
More informationIntroduction to Topology
Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
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 informationHomework 11. Solutions
Homework 11. Solutions Problem 2.3.2. Let f n : R R be 1/n times the characteristic function of the interval (0, n). Show that f n 0 uniformly and f n µ L = 1. Why isn t it a counterexample to the Lebesgue
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 informationSupplementary Notes for W. Rudin: Principles of Mathematical Analysis
Supplementary Notes for W. Rudin: Principles of Mathematical Analysis SIGURDUR HELGASON In 8.00B it is customary to cover Chapters 7 in Rudin s book. Experience shows that this requires careful planning
More informationPOINTWISE PRODUCTS OF UNIFORMLY CONTINUOUS FUNCTIONS
SARAJEVO JOURNAL OF MATHEMATICS Vol.1 (13) (2005), 117 127 POINTWISE PRODUCTS OF UNIFORMLY CONTINUOUS FUNCTIONS SAM B. NADLER, JR. Abstract. The problem of characterizing the metric spaces on which the
More informationA NOTE ON COMPARISON BETWEEN BIRKHOFF AND MCSHANE-TYPE INTEGRALS FOR MULTIFUNCTIONS
RESERCH Real nalysis Exchange Vol. 37(2), 2011/2012, pp. 315 324 ntonio Boccuto, Department of Mathematics and Computer Science - 1, Via Vanvitelli 06123 Perugia, Italy. email: boccuto@dmi.unipg.it nna
More informationMath 5051 Measure Theory and Functional Analysis I Homework Assignment 2
Math 551 Measure Theory and Functional nalysis I Homework ssignment 2 Prof. Wickerhauser Due Friday, September 25th, 215 Please do Exercises 1, 4*, 7, 9*, 11, 12, 13, 16, 21*, 26, 28, 31, 32, 33, 36, 37.
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 informationRecall that if X is a compact metric space, C(X), the space of continuous (real-valued) functions on X, is a Banach space with the norm
Chapter 13 Radon Measures Recall that if X is a compact metric space, C(X), the space of continuous (real-valued) functions on X, is a Banach space with the norm (13.1) f = sup x X f(x). We want to identify
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 informationMeasures and Measure Spaces
Chapter 2 Measures and Measure Spaces In summarizing the flaws of the Riemann integral we can focus on two main points: 1) Many nice functions are not Riemann integrable. 2) The Riemann integral does not
More informationSection 21. The Metric Topology (Continued)
21. The Metric Topology (cont.) 1 Section 21. The Metric Topology (Continued) Note. In this section we give a number of results for metric spaces which are familar from calculus and real analysis. We also
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 informationMATH 202B - Problem Set 5
MATH 202B - Problem Set 5 Walid Krichene (23265217) March 6, 2013 (5.1) Show that there exists a continuous function F : [0, 1] R which is monotonic on no interval of positive length. proof We know there
More informationON LEFT-INVARIANT BOREL MEASURES ON THE
Georgian International Journal of Science... Volume 3, Number 3, pp. 1?? ISSN 1939-5825 c 2010 Nova Science Publishers, Inc. ON LEFT-INVARIANT BOREL MEASURES ON THE PRODUCT OF LOCALLY COMPACT HAUSDORFF
More informationAnalysis III Theorems, Propositions & Lemmas... Oh My!
Analysis III Theorems, Propositions & Lemmas... Oh My! Rob Gibson October 25, 2010 Proposition 1. If x = (x 1, x 2,...), y = (y 1, y 2,...), then is a distance. ( d(x, y) = x k y k p Proposition 2. In
More informationMATS113 ADVANCED MEASURE THEORY SPRING 2016
MATS113 ADVANCED MEASURE THEORY SPRING 2016 Foreword These are the lecture notes for the course Advanced Measure Theory given at the University of Jyväskylä in the Spring of 2016. The lecture notes can
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 informationINTRODUCTION TO MEASURE THEORY AND LEBESGUE INTEGRATION
1 INTRODUCTION TO MEASURE THEORY AND LEBESGUE INTEGRATION Eduard EMELYANOV Ankara TURKEY 2007 2 FOREWORD This book grew out of a one-semester course for graduate students that the author have taught at
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationLEBESGUE INTEGRATION. Introduction
LEBESGUE INTEGATION EYE SJAMAA Supplementary notes Math 414, Spring 25 Introduction The following heuristic argument is at the basis of the denition of the Lebesgue integral. This argument will be imprecise,
More informationMTH 404: Measure and Integration
MTH 404: Measure and Integration Semester 2, 2012-2013 Dr. Prahlad Vaidyanathan Contents I. Introduction....................................... 3 1. Motivation................................... 3 2. The
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 informationarxiv: v1 [math.fa] 14 Jul 2018
Construction of Regular Non-Atomic arxiv:180705437v1 [mathfa] 14 Jul 2018 Strictly-Positive Measures in Second-Countable Locally Compact Non-Atomic Hausdorff Spaces Abstract Jason Bentley Department of
More informationA List of Problems in Real Analysis
A List of Problems in Real Analysis W.Yessen & T.Ma December 3, 218 This document was first created by Will Yessen, who was a graduate student at UCI. Timmy Ma, who was also a graduate student at UCI,
More informationReal Analysis Problems
Real Analysis Problems Cristian E. Gutiérrez September 14, 29 1 1 CONTINUITY 1 Continuity Problem 1.1 Let r n be the sequence of rational numbers and Prove that f(x) = 1. f is continuous on the irrationals.
More informationCHAPTER 1. Metric Spaces. 1. Definition and examples
CHAPTER Metric Spaces. Definition and examples Metric spaces generalize and clarify the notion of distance in the real line. The definitions will provide us with a useful tool for more general applications
More informationCHAPTER V DUAL SPACES
CHAPTER V DUAL SPACES DEFINITION Let (X, T ) be a (real) locally convex topological vector space. By the dual space X, or (X, T ), of X we mean the set of all continuous linear functionals on X. By the
More informationMath 117: Topology of the Real Numbers
Math 117: Topology of the Real Numbers John Douglas Moore November 10, 2008 The goal of these notes is to highlight the most important topics presented in Chapter 3 of the text [1] and to provide a few
More informationTools from Lebesgue integration
Tools from Lebesgue integration E.P. van den Ban Fall 2005 Introduction In these notes we describe some of the basic tools from the theory of Lebesgue integration. Definitions and results will be given
More information1 Lecture 4: Set topology on metric spaces, 8/17/2012
Summer Jump-Start Program for Analysis, 01 Song-Ying Li 1 Lecture : Set topology on metric spaces, 8/17/01 Definition 1.1. Let (X, d) be a metric space; E is a subset of X. Then: (i) x E is an interior
More informationTHEOREMS, ETC., FOR MATH 516
THEOREMS, ETC., FOR MATH 516 Results labeled Theorem Ea.b.c (or Proposition Ea.b.c, etc.) refer to Theorem c from section a.b of Evans book (Partial Differential Equations). Proposition 1 (=Proposition
More informationNAME: Mathematics 205A, Fall 2008, Final Examination. Answer Key
NAME: Mathematics 205A, Fall 2008, Final Examination Answer Key 1 1. [25 points] Let X be a set with 2 or more elements. Show that there are topologies U and V on X such that the identity map J : (X, U)
More informationThree hours THE UNIVERSITY OF MANCHESTER. 24th January
Three hours MATH41011 THE UNIVERSITY OF MANCHESTER FOURIER ANALYSIS AND LEBESGUE INTEGRATION 24th January 2013 9.45 12.45 Answer ALL SIX questions in Section A (25 marks in total). Answer THREE of the
More informationThe Kolmogorov extension theorem
The Kolmogorov extension theorem Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto June 21, 2014 1 σ-algebras and semirings If X is a nonempty set, an algebra of sets on
More informationM17 MAT25-21 HOMEWORK 6
M17 MAT25-21 HOMEWORK 6 DUE 10:00AM WEDNESDAY SEPTEMBER 13TH 1. To Hand In Double Series. The exercises in this section will guide you to complete the proof of the following theorem: Theorem 1: Absolute
More informationLocal time of self-affine sets of Brownian motion type and the jigsaw puzzle problem
Local time of self-affine sets of Brownian motion type and the jigsaw puzzle problem (Journal of Mathematical Analysis and Applications 49 (04), pp.79-93) Yu-Mei XUE and Teturo KAMAE Abstract Let Ω [0,
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 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 informationFragmentability and σ-fragmentability
F U N D A M E N T A MATHEMATICAE 143 (1993) Fragmentability and σ-fragmentability by J. E. J a y n e (London), I. N a m i o k a (Seattle) and C. A. R o g e r s (London) Abstract. Recent work has studied
More informationFrom now on, we will represent a metric space with (X, d). Here are some examples: i=1 (x i y i ) p ) 1 p, p 1.
Chapter 1 Metric spaces 1.1 Metric and convergence We will begin with some basic concepts. Definition 1.1. (Metric space) Metric space is a set X, with a metric satisfying: 1. d(x, y) 0, d(x, y) = 0 x
More informationDifferentiation of Measures and Functions
Chapter 6 Differentiation of Measures and Functions This chapter is concerned with the differentiation theory of Radon measures. In the first two sections we introduce the Radon measures and discuss two
More informationMATH MEASURE THEORY AND FOURIER ANALYSIS. Contents
MATH 3969 - MEASURE THEORY AND FOURIER ANALYSIS ANDREW TULLOCH Contents 1. Measure Theory 2 1.1. Properties of Measures 3 1.2. Constructing σ-algebras and measures 3 1.3. Properties of the Lebesgue measure
More informationThe Equivalence of Ergodicity and Weak Mixing for Infinitely Divisible Processes1
Journal of Theoretical Probability. Vol. 10, No. 1, 1997 The Equivalence of Ergodicity and Weak Mixing for Infinitely Divisible Processes1 Jan Rosinski2 and Tomasz Zak Received June 20, 1995: revised September
More information1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3
Index Page 1 Topology 2 1.1 Definition of a topology 2 1.2 Basis (Base) of a topology 2 1.3 The subspace topology & the product topology on X Y 3 1.4 Basic topology concepts: limit points, closed sets,
More informationSpring 2014 Advanced Probability Overview. Lecture Notes Set 1: Course Overview, σ-fields, and Measures
36-752 Spring 2014 Advanced Probability Overview Lecture Notes Set 1: Course Overview, σ-fields, and Measures Instructor: Jing Lei Associated reading: Sec 1.1-1.4 of Ash and Doléans-Dade; Sec 1.1 and A.1
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 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 informationMeasure and integration
Chapter 5 Measure and integration In calculus you have learned how to calculate the size of different kinds of sets: the length of a curve, the area of a region or a surface, the volume or mass of a solid.
More informationREAL ANALYSIS LECTURE NOTES: 1.4 OUTER MEASURE
REAL ANALYSIS LECTURE NOTES: 1.4 OUTER MEASURE CHRISTOPHER HEIL 1.4.1 Introduction We will expand on Section 1.4 of Folland s text, which covers abstract outer measures also called exterior measures).
More information3 COUNTABILITY AND CONNECTEDNESS AXIOMS
3 COUNTABILITY AND CONNECTEDNESS AXIOMS Definition 3.1 Let X be a topological space. A subset D of X is dense in X iff D = X. X is separable iff it contains a countable dense subset. X satisfies the first
More informationvan Rooij, Schikhof: A Second Course on Real Functions
vanrooijschikhof.tex April 25, 2018 van Rooij, Schikhof: A Second Course on Real Functions Notes from [vrs]. Introduction A monotone function is Riemann integrable. A continuous function is Riemann integrable.
More informationMcGill University Math 354: Honors Analysis 3
Practice problems McGill University Math 354: Honors Analysis 3 not for credit Problem 1. Determine whether the family of F = {f n } functions f n (x) = x n is uniformly equicontinuous. 1st Solution: The
More informationMathematics 220 Workshop Cardinality. Some harder problems on cardinality.
Some harder problems on cardinality. These are two series of problems with specific goals: the first goal is to prove that the cardinality of the set of irrational numbers is continuum, and the second
More informationProblem Set 2: Solutions Math 201A: Fall 2016
Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that
More informationGENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY
GENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY CARL G. JOCKUSCH, JR. AND PAUL E. SCHUPP Abstract. Generic decidability has been extensively studied in group theory, and we now study it in
More informationMA651 Topology. Lecture 10. Metric Spaces.
MA65 Topology. Lecture 0. Metric Spaces. This text is based on the following books: Topology by James Dugundgji Fundamental concepts of topology by Peter O Neil Linear Algebra and Analysis by Marc Zamansky
More informationFUNDAMENTALS OF REAL ANALYSIS by. II.1. Prelude. Recall that the Riemann integral of a real-valued function f on an interval [a, b] is defined as
FUNDAMENTALS OF REAL ANALYSIS by Doğan Çömez II. MEASURES AND MEASURE SPACES II.1. Prelude Recall that the Riemann integral of a real-valued function f on an interval [a, b] is defined as b n f(xdx :=
More informationMH 7500 THEOREMS. (iii) A = A; (iv) A B = A B. Theorem 5. If {A α : α Λ} is any collection of subsets of a space X, then
MH 7500 THEOREMS Definition. A topological space is an ordered pair (X, T ), where X is a set and T is a collection of subsets of X such that (i) T and X T ; (ii) U V T whenever U, V T ; (iii) U T whenever
More informationMeasurable Choice Functions
(January 19, 2013) Measurable Choice Functions Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/fun/choice functions.pdf] This note
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 informationµ (X) := inf l(i k ) where X k=1 I k, I k an open interval Notice that is a map from subsets of R to non-negative number together with infinity
A crash course in Lebesgue measure theory, Math 317, Intro to Analysis II These lecture notes are inspired by the third edition of Royden s Real analysis. The Jordan content is an attempt to extend the
More informationSection II.1. Free Abelian Groups
II.1. Free Abelian Groups 1 Section II.1. Free Abelian Groups Note. This section and the next, are independent of the rest of this chapter. The primary use of the results of this chapter is in the proof
More informationAnalysis Comprehensive Exam Questions Fall F(x) = 1 x. f(t)dt. t 1 2. tf 2 (t)dt. and g(t, x) = 2 t. 2 t
Analysis Comprehensive Exam Questions Fall 2. Let f L 2 (, ) be given. (a) Prove that ( x 2 f(t) dt) 2 x x t f(t) 2 dt. (b) Given part (a), prove that F L 2 (, ) 2 f L 2 (, ), where F(x) = x (a) Using
More informationEconomics 574 Appendix to 13 Ways
University of Illinois Spring 2017 Department of Economics Roger Koenker Economics 574 ppendix to 13 Ways This ppendix provides an overview of some of the background that is left undeveloped in 13 Ways
More information(convex combination!). Use convexity of f and multiply by the common denominator to get. Interchanging the role of x and y, we obtain that f is ( 2M ε
1. Continuity of convex functions in normed spaces In this chapter, we consider continuity properties of real-valued convex functions defined on open convex sets in normed spaces. Recall that every infinitedimensional
More informationInvariant measures for iterated function systems
ANNALES POLONICI MATHEMATICI LXXV.1(2000) Invariant measures for iterated function systems by Tomasz Szarek (Katowice and Rzeszów) Abstract. A new criterion for the existence of an invariant distribution
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationTopology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:
Topology Xiaolong Han Department of Mathematics, California State University, Northridge, CA 91330, USA E-mail address: Xiaolong.Han@csun.edu Remark. You are entitled to a reward of 1 point toward a homework
More informationMeasure and Category. Marianna Csörnyei. ucahmcs
Measure and Category Marianna Csörnyei mari@math.ucl.ac.uk http:/www.ucl.ac.uk/ ucahmcs 1 / 96 A (very short) Introduction to Cardinals The cardinality of a set A is equal to the cardinality of a set B,
More informationMathematics for Economists
Mathematics for Economists Victor Filipe Sao Paulo School of Economics FGV Metric Spaces: Basic Definitions Victor Filipe (EESP/FGV) Mathematics for Economists Jan.-Feb. 2017 1 / 34 Definitions and Examples
More informationChapter 5. Measurable Functions
Chapter 5. Measurable Functions 1. Measurable Functions Let X be a nonempty set, and let S be a σ-algebra of subsets of X. Then (X, S) is a measurable space. A subset E of X is said to be measurable if
More informationMath212a1413 The Lebesgue integral.
Math212a1413 The Lebesgue integral. October 28, 2014 Simple functions. In what follows, (X, F, m) is a space with a σ-field of sets, and m a measure on F. The purpose of today s lecture is to develop the
More informationg 2 (x) (1/3)M 1 = (1/3)(2/3)M.
COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is
More informationMATH & MATH FUNCTIONS OF A REAL VARIABLE EXERCISES FALL 2015 & SPRING Scientia Imperii Decus et Tutamen 1
MATH 5310.001 & MATH 5320.001 FUNCTIONS OF A REAL VARIABLE EXERCISES FALL 2015 & SPRING 2016 Scientia Imperii Decus et Tutamen 1 Robert R. Kallman University of North Texas Department of Mathematics 1155
More informationContinuity of convex functions in normed spaces
Continuity of convex functions in normed spaces In this chapter, we consider continuity properties of real-valued convex functions defined on open convex sets in normed spaces. Recall that every infinitedimensional
More informationMeasure and Integration: Concepts, Examples and Exercises. INDER K. RANA Indian Institute of Technology Bombay India
Measure and Integration: Concepts, Examples and Exercises INDER K. RANA Indian Institute of Technology Bombay India Department of Mathematics, Indian Institute of Technology, Bombay, Powai, Mumbai 400076,
More informationIsomorphism of free G-subflows (preliminary draft)
Isomorphism of free G-subflows (preliminary draft) John D. Clemens August 3, 21 Abstract We show that for G a countable group which is not locally finite, the isomorphism of free G-subflows is bi-reducible
More informationQuick Tour of the Topology of R. Steven Hurder, Dave Marker, & John Wood 1
Quick Tour of the Topology of R Steven Hurder, Dave Marker, & John Wood 1 1 Department of Mathematics, University of Illinois at Chicago April 17, 2003 Preface i Chapter 1. The Topology of R 1 1. Open
More informationFolland: Real Analysis, Chapter 7 Sébastien Picard
Folland: Real Analysis, Chapter 7 Sébastien Picard Problem 7.2 Let µ be a Radon measure on X. a. Let N be the union of all open U X such that µ(u) =. Then N is open and µ(n) =. The complement of N is called
More informationChapter 3. Topology of the Real Numbers.
3.1. Topology of the Real Numbers 1 Chapter 3. Topology of the Real Numbers. 3.1. Topology of the Real Numbers. Note. In this section we topological properties of sets of real numbers such as open, closed,
More informationReal Analysis II, Winter 2018
Real Analysis II, Winter 2018 From the Finnish original Moderni reaalianalyysi 1 by Ilkka Holopainen adapted by Tuomas Hytönen January 18, 2018 1 Version dated September 14, 2011 Contents 1 General theory
More informationMath 209B Homework 2
Math 29B Homework 2 Edward Burkard Note: All vector spaces are over the field F = R or C 4.6. Two Compactness Theorems. 4. Point Set Topology Exercise 6 The product of countably many sequentally compact
More information3 (Due ). 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 ). Show that the open disk x 2 + y 2 < 1 is a countable union of planar elementary sets. Show that the closed disk x 2 + y 2 1 is a countable
More informationFINITE BOREL MEASURES ON SPACES OF CARDINALITY LESS THAN c
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 81, Number 4, April 1981 FINITE BOREL MEASURES ON SPACES OF CARDINALITY LESS THAN c R. J. GARDNER AND G. GRUENHAGE Abstract. Let k < c be uncountable.
More information