# 14 Abian and Kemp Theorem 1. For every cardinal k if the union of k many sets of measure zero is of measure zero, then the union of k many measurable

Save this PDF as:

Size: px
Start display at page:

Download "14 Abian and Kemp Theorem 1. For every cardinal k if the union of k many sets of measure zero is of measure zero, then the union of k many measurable"

## Transcription

1 PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE Nouvelle série tome 52 (66), 1992, ON MEASURABILITY OF UNCOUNTABLE UNIONS OF MEASURABLE SETS Alexander Abian and Paula Kemp Abstract. This paper deals exclusively with the question of Lebesgue measurability of subsets of the set R of all real numbers that are the unions of measurable subsets of R. Thus, in what follows every set is a set of real numbers and all references to measure are in the sense of Lebesgue. It is well known that a countable union of measurable sets is measurable. However, there also exist uncountable unions of measurable sets which are measurable. For instance, the closed unit interval [0; 1] which is measurable is the union of uncountably, many of its singletons each of which is measurable. On the other hand, in the setting of ZFC (Zermelo-Fraenkel Set Theory with the Axiom of Choice), there exist also nonmeasurable sets which are also unions of uncountably many measurable sets. For instance, the well known classical examples of nonmeasurable sets [3, p. 135] are unions of many of their singletons. However, it is also well known that there exist set-theoretical models [5] of ZF (with the negation of the Axiom of Choice) in which every set is measurable. Thus in these models any union of measurable sets is measurable. From the above it follows that the question of measurability of unions of measurable sets depends on the underlying Set Theory and consequently on the Set-theoretical models to which these sets belong. Since the presence of the Axiom of Choice is desirable, in view of the existence of nonmeasurable sets which are unions of many measurable sets, the question referred to in the above acquires the following form: (1) In which Set-theoretical models for ZFC is the following a valid statement: S For every cardinal the union M u<k u of k many measurable sets M u is measurable. First however, we observe that by virtue of the following theorem (which is valid in ZF), it suffices to answer the above question exclusively for the case of sets of measure zero. AMS Subject Classification (1980): Primary 28 A 12

2 14 Abian and Kemp Theorem 1. For every cardinal k if the union of k many sets of measure zero is of measure zero, then the union of k many measurable sets is measurable. Proof. Assume that the union S of k many sets of measure zero is of measure zero. We show that the set M = M u<k u where each M u is a measurable set is measurable. It is well known [1]thatM has a measurable kernel L,i.e.,L M such that every measurable subset of M L is of measure zero. Clearly, M u L (since it is the difference of two measurable sets) is a measurable subset of M L. Thus for every u<k, S it is the case that M u L is of measure zero. Consequently, byour assumption (M u<k u L) is of measure zero. But then M = L [ Su<k (M u L) and thus M is the union of two measurable sets. Hence, the set M is measurable, as desired. Now returning to statement (1), let us observe thatitisvalid in every model for ZFC + CH (where CH is the Continuum Hypothesis). Clearly in every model for ZFC + CH if k < then k is a countable cardinal. However, since every countable union of measurable sets is measurable, statement (1) is trivially valid in these models. In view of the above, we are led to consider models for ZFC +:CH (i.e., ZFC with the negation of the Continuum Hypothesis). Indeed in Theorem 2 below, we prove that statement (1) is valid in every model for ZFC +:CH + MA, where MA is the Martin's Axiom. The latter states: (2) Let (P;») be a partially ordered set with the c.i.c. property and let (D u ) u<k with k < be a family of k many dense subsets D u of P. Then there exists a filter F of P such that F has a nonempty intersection with every D u. For the sake of completeness of the paper we recall the definitions of c.i.c.", dense", and filter" mentioned in (2). Let (P;») be a partially ordered set. Two elements X and Y od P are called incompatible iff X and Y have no nonzero lower bound, where by zero (0) we mean the minimum element ofp (if P has a minimum element atall). The partially ordered set (P;») has the c.i.c. property iff every subset of P of pairwise incompatible elements is countable. A subset D of the partially ordered set (P;») is called a dense subset of P iff for every p 2 P there existsad 2 D such that d» p. A subset F of the partially ordered set (P;») is called a filter of P iff (3) (i) 0 2 F and every finite subset of F has a lower bound in F (ii) if x 2 F and y x then y 2 F. Property (ii) is not used in this paper. Before proving Theorem 2, we give some examples to show that the restrictions on the partially ordered set (P;») to have the c.i.c. property and for the cardinal k to be < are essential in (2).

3 On measurability of uncountable unions of measurable sets 15 First, we show that the c.i.c. property in (2) cannot be dropped. To this end, we consider the following example. Let (P;») be the set of all finite functions from! into! 1 (i.e., f 2 P iff Domain of f is a finite subset of!) and let f» g in P iff f is an extension of g i.e., f g. Φ We observeψthat (P;») does not have the c.i.c. property. This is because f(0;u)g : u 2! 1 is an uncountable set of pairwise incompatible elements of P. Now, we show that in this example, statement (2) does not hold even though k =! 1 < Indeed, for every Φ u 2! 1 it can be readily seen Ψ that (4) D u = p : p 2 P and u 2 Range of p is a dense subset of P. Now consider the family (D u ) u<!1 of dense subsets of P, where! 1 < since (2) refers to ZFC +:CH + MA. We show that there cannot be a filter F in P which has a nonempty S intersection with every dense subset D u of P. This is because otherwise, F by (4)would be a function from! onto! 1 which is a contradiction. Therefore, we have shown that the c.i.c. property isessential in (2). In the next example, we showalsothatk < in (2) cannot be dropped, even though the partial order involved has the c.i.c. property. To this end, let (P;») be the set of all finite dyadic sequences (i.e., finite sequences whose terms consist only of 0's or 1's) and let s» q in P iff s is an extension of q". Clearly, (P;») has the c.i.c. property since P itself is countable. Moreover, (P;») dense subsets since (P;») has an infinite descending chain [2]. But then (P;») cannot have a filter F which intersects every dense subset of P. This is because, as is easily verified, the complement P F of F is a dense subset of P. Therefore, the condition in (2) cannot be dropped. Next, we prove the main preliminary Theorem. Theorem 2. In every set-theoretical model for ZFC + MA, for every cardinal the union S u<k Z u of k many sets Z u of measure zeroisofmeasure zero. Proof. Let Z = S u<k Z u be a union of k many sets of measure zero. To show that Z is of measure zero, it suffices to show thatforevery ">0 there exists an open set V such that Z V and m(v )» " (where m is the Lebesgue measure). We show this based on Martin's Axiom in connection with the partially ordered set (P;») described below: Let P be the set of all open sets X of R each of measure <"i.e., (5) P = Φ X : X R and m(x) <" Ψ : We partially order P by reverse inclusion, i.e. (6) X» Y if X Y for every X; Y 2 P: Thus for every two elements X and Y of P (7) X is incompatible with Y iff m(x [ Y ) ".

4 16 Abian and Kemp We first observe that (P; ) has the c.i.c. property. Let I be a set of pairwise incompatible elements of P and let Φ (8) I n = X : X 2 I and m(x) < 1 "Ψ 1 n Clearly, (9) I = 1 S n=2 I n : with n 2: To prove that(p; ) has the c.i.c. property, in view of (9) it suffices to show that I n as given in (8) is a countable set for every n 2. To this end, let us observe thattoevery X 2 I n there corresponds a subset X of X such thatx is a finite union of open intervals with rational endpoints and (10) m(x X) <"=n: This is because X 2 I n is an open set of finite measure say, q, and hence X is a countable union of pairwise disjoint openintervals H i each of finite measure. Consequently, q is the sum of a convergent series of real numbers and therefore has a partial sum p such that (q p) <"=(2n) and where p corresponds to the measure of the union of some finitely many, say, H 1 ;... ;H k open sets H i. But then each H i with i =1;... ;k can be replaced by a subinterval W i of H i with rational endpoints in such away that their union X satisfies (10). Y of I n Next, based on (8) and (10), we observe that for every two elements X and (11) X 6= Y implies X 6= Y: To prove (11), let us assume to the contrary that X = Y. But then since X = Y and Y Y,wehave X Y and therefore Y [X = Y [(X X), wherefrom it readily follows that m(x [ Y )» m(y )+m(x X) and since Y 2 I n from (8) and (10) we obtain m(y [ X) < 1 1 n " + 1 n " = " which contradicts (7). From (11) it follows, that for every element X in I n the correspondence X to X is one to one. Since every X is a finite union of open intervals with rational endpoints, we see that I n as given in (8) is a countable set. Therefore, I as given in (9) is also a countable set. Thus (P; ) as given by (5) and (6) has the c.i.c. property, as desired. Next, for every set Z u of measure zero, we define the set D u given by (12) D u = Φ X : X 2 P and X Z u Ψ with 0 : We show that for every u<kit is the case that D u is a dense subset of P. To this end, we show that if Y 2 P, then there exists an X 2 D u such that (13) X Y:

5 On measurability of uncountable unions of measurable sets 17 Since Y is an open set in P, it follows from (5) that m(y ) < " and since m(z u ) = 0, we see that Z u can be covered with an open set H suchthatm(h [Y ) < ". But then we let X = H [ Y. Clearly, this X satisfies (13). Thus D u as given in (12) is a dense subset of P for every Now weinvoke Martin's Axiom and assert the existence of a filter F of (P; ) which has a nonempty intersection with every D u for u < k < where for convenience we letx u stand for an element S X of D u mentioned S in (12). S From (12) it follows that X u Z u and therefore X u<k u Z = Z u<k u. Thus X u<k u is an open S cover of Z and hence by the Lindelöf property ithasacountable subcover, say X u<! u Z. But the X u 's are elements of the filter F and therefore, by (3) for every natural number n, we see that (X u ) u<n has a nonempty lower bound, say, B in F. Thus, S B X u for every u<nand m(b) <"since B 2 P as given in (5). But then m X u<n n <"from which itfollows that S 1 (14) m u=1 X u = lim n!1 m [ u<n X u» ": Clearly, (14) shows that the open set V = S 1 u=1 X u covers Z and from (14) it follows that m(v )» ". Hence, Z is of measure zero, as desired. Thus Theorem 2 is proved. Combining Theorem 2 with Theorem 1, we have the following theorem which answers our question (1). Theorem 3. In every Set-theoretical model for ZFC + MA, any union of many measurable sets is measurable. The proofs given above are adaptations from Schoenfield [4]. REFERENCES [1] A. Abian, Measurable outer kernels of sets, Publ. Inst. Math. Beograd 31 (1982), 5 8. [2] A. Abian, Non-existence of ordered sets with denumerable many dense subsets, Bull. Math. Soc. Roumaine 20 (1976), 1 2. [3] E. Hewitt and K. Stromberg, Real and Abstract Analysis, Springer-Verlag, Berlin-Heidelberg- New York, [4] J. R. Schoenfield, Martin's axiom, Amer. Math Monthly 92 (1975), [5] R. M. Solovay, Amodel of set theory in which every set of reals is Lebesgue measurable, Ann. of Math. 92 (1970), Department of Mathematics (Received ) Iowa State University Ames, Iowa , USA Department of Mathematics Southwest Missouri State University Springfield, Missouri 65804, USA

### Math212a1010 Lebesgue measure.

Math212a1010 Lebesgue measure. October 19, 2010 Today s lecture will be devoted to Lebesgue measure, a creation of Henri Lebesgue, in his thesis, one of the most famous theses in the history of mathematics.

### SOLUTIONS TO ASSIGNMENT 1 MATH 576

SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts

### SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties

SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces

### Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely

### Ri and. i=1. S i N. and. R R i

The subset R of R n is a closed rectangle if there are n non-empty closed intervals {[a 1, b 1 ], [a 2, b 2 ],..., [a n, b n ]} so that R = [a 1, b 1 ] [a 2, b 2 ] [a n, b n ]. The subset R of R n is an

### 1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

### DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS

DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS ASHER M. KACH, KAREN LANGE, AND REED SOLOMON Abstract. We construct two computable presentations of computable torsion-free abelian groups, one of isomorphism

### Extension of measure

1 Extension of measure Sayan Mukherjee Dynkin s π λ theorem We will soon need to define probability measures on infinite and possible uncountable sets, like the power set of the naturals. This is hard.

### SOME USES OF SET THEORY IN ALGEBRA. Stanford Logic Seminar February 10, 2009

SOME USES OF SET THEORY IN ALGEBRA Stanford Logic Seminar February 10, 2009 Plan I. The Whitehead Problem early history II. Compactness and Incompactness III. Deconstruction P. Eklof and A. Mekler, Almost

### REAL 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).

### SET-THEORETIC CONSTRUCTIONS OF TWO-POINT SETS

SET-THEORETIC CONSTRUCTIONS OF TWO-POINT SETS BEN CHAD AND ROBIN KNIGHT AND ROLF SUABEDISSEN Abstract. A two-point set is a subset of the plane which meets every line in exactly two points. By working

### No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results

### POWER SETS AND RELATIONS

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

### An example of a computable

An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept

### GENTLY KILLING S SPACES TODD EISWORTH, PETER NYIKOS, AND SAHARON SHELAH

GENTLY KILLING S SPACES TODD EISWORTH, PETER NYIKOS, AND SAHARON SHELAH Abstract. We produce a model of ZFC in which there are no locally compact first countable S spaces, and in which 2 ℵ 0 < 2 ℵ 1. A

### MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

### 1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

### HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

### The fundamental group of the Hawaiian earring is not free (International Journal of Algebra and Computation Vol. 2, No. 1 (1992), 33 37) Bart de Smit

The fundamental group of the Hawaiian earring is not free Bart de Smit The fundamental group of the Hawaiian earring is not free (International Journal of Algebra and Computation Vol. 2, No. 1 (1992),

### Duality of linear conic problems

Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least

### Our goal first will be to define a product measure on A 1 A 2.

1. Tensor product of measures and Fubini theorem. Let (A j, Ω j, µ j ), j = 1, 2, be two measure spaces. Recall that the new σ -algebra A 1 A 2 with the unit element is the σ -algebra generated by the

### F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)

Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p

### P (A) = lim P (A) = N(A)/N,

1.1 Probability, Relative Frequency and Classical Definition. Probability is the study of random or non-deterministic experiments. Suppose an experiment can be repeated any number of times, so that we

### Problem Set I: Preferences, W.A.R.P., consumer choice

Problem Set I: Preferences, W.A.R.P., consumer choice Paolo Crosetto paolo.crosetto@unimi.it Exercises solved in class on 18th January 2009 Recap:,, Definition 1. The strict preference relation is x y

### Evaluation and Outlook

129 Chapter 6 Evaluation and Outlook A good question is never answered. It is not a bolt to be tightened into place. But a seed to be planted and to bear more seed. Toward the hope of greening the landscape

### x < y iff x < y, or x and y are incomparable and x χ(x,y) < y χ(x,y).

12. Large cardinals The study, or use, of large cardinals is one of the most active areas of research in set theory currently. There are many provably different kinds of large cardinals whose descriptions

### INTRODUCTORY SET THEORY

M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,

### Mathematics for Econometrics, Fourth Edition

Mathematics for Econometrics, Fourth Edition Phoebus J. Dhrymes 1 July 2012 1 c Phoebus J. Dhrymes, 2012. Preliminary material; not to be cited or disseminated without the author s permission. 2 Contents

### MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete

### On fractional parts of powers of real numbers close to 1

On fractional parts of powers of real numbers close to 1 Yann BUGEAUD and Niolay MOSHCHEVITIN Abstract We prove that there exist arbitrarily small positive real numbers ε such that every integral power

### The Lebesgue Measure and Integral

The Lebesgue Measure and Integral Mike Klaas April 12, 2003 Introduction The Riemann integral, defined as the limit of upper and lower sums, is the first example of an integral, and still holds the honour

### FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied

### Chapter 1. Metric Spaces. Metric Spaces. Examples. Normed linear spaces

Chapter 1. Metric Spaces Metric Spaces MA222 David Preiss d.preiss@warwick.ac.uk Warwick University, Spring 2008/2009 Definitions. A metric on a set M is a function d : M M R such that for all x, y, z

### This chapter is all about cardinality of sets. At first this looks like a

CHAPTER Cardinality of Sets This chapter is all about cardinality of sets At first this looks like a very simple concept To find the cardinality of a set, just count its elements If A = { a, b, c, d },

### CHAPTER 5. Product Measures

54 CHAPTER 5 Product Measures Given two measure spaces, we may construct a natural measure on their Cartesian product; the prototype is the construction of Lebesgue measure on R 2 as the product of Lebesgue

### Minimal R 1, minimal regular and minimal presober topologies

Revista Notas de Matemática Vol.5(1), No. 275, 2009, pp.73-84 http://www.saber.ula.ve/notasdematematica/ Comisión de Publicaciones Departamento de Matemáticas Facultad de Ciencias Universidad de Los Andes

### k, then n = p2α 1 1 pα k

Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

### God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)

Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work

### INDISTINGUISHABILITY 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

### Recursion Theory in Set Theory

Contemporary Mathematics Recursion Theory in Set Theory Theodore A. Slaman 1. Introduction Our goal is to convince the reader that recursion theoretic knowledge and experience can be successfully applied

### CmSc 175 Discrete Mathematics Lesson 10: SETS A B, A B

CmSc 175 Discrete Mathematics Lesson 10: SETS Sets: finite, infinite, : empty set, U : universal set Describing a set: Enumeration = {a, b, c} Predicates = {x P(x)} Recursive definition, e.g. sequences

### THE BANACH CONTRACTION PRINCIPLE. Contents

THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,

### This asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.

3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### 3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

### Introduction to Modern Set Theory

Introduction to Modern Set Theory Judith Roitman December 6, 2011 1 for my father, who loved mathematics 1 Revised Edition Copyright 2011 by Judith Roitman, This book is licensed for use under a Creative

### The Language of Mathematics

CHPTER 2 The Language of Mathematics 2.1. Set Theory 2.1.1. Sets. set is a collection of objects, called elements of the set. set can be represented by listing its elements between braces: = {1, 2, 3,

### There is no degree invariant half-jump

There is no degree invariant half-jump Rod Downey Mathematics Department Victoria University of Wellington P O Box 600 Wellington New Zealand Richard A. Shore Mathematics Department Cornell University

### So let us begin our quest to find the holy grail of real analysis.

1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers

### Linear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold:

Linear Algebra A vector space (over R) is an ordered quadruple (V, 0, α, µ) such that V is a set; 0 V ; and the following eight axioms hold: α : V V V and µ : R V V ; (i) α(α(u, v), w) = α(u, α(v, w)),

### 4.1. Definitions. A set may be viewed as any well defined collection of objects, called elements or members of the set.

Section 4. Set Theory 4.1. Definitions A set may be viewed as any well defined collection of objects, called elements or members of the set. Sets are usually denoted with upper case letters, A, B, X, Y,

### Continuous tree-like scales

Carnegie Mellon University Research Showcase @ CMU Department of Mathematical Sciences Mellon College of Science 4-2010 Continuous tree-like scales James Cummings Carnegie Mellon University, jcumming@andrew.cmu.edu

### CHAPTER 1 BASIC TOPOLOGY

CHAPTER 1 BASIC TOPOLOGY Topology, sometimes referred to as the mathematics of continuity, or rubber sheet geometry, or the theory of abstract topological spaces, is all of these, but, above all, it is

### MA4001 Engineering Mathematics 1 Lecture 10 Limits and Continuity

MA4001 Engineering Mathematics 1 Lecture 10 Limits and Dr. Sarah Mitchell Autumn 2014 Infinite limits If f(x) grows arbitrarily large as x a we say that f(x) has an infinite limit. Example: f(x) = 1 x

### Point Set Topology. A. Topological Spaces and Continuous Maps

Point Set Topology A. Topological Spaces and Continuous Maps Definition 1.1 A topology on a set X is a collection T of subsets of X satisfying the following axioms: T 1.,X T. T2. {O α α I} T = α IO α T.

### GENERIC 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

### Finite dimensional topological vector spaces

Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the

### Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 11

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note Conditional Probability A pharmaceutical company is marketing a new test for a certain medical condition. According

### Lebesgue Measure on R n

8 CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets

### Lecture Notes on Measure Theory and Functional Analysis

Lecture Notes on Measure Theory and Functional Analysis P. Cannarsa & T. D Aprile Dipartimento di Matematica Università di Roma Tor Vergata cannarsa@mat.uniroma2.it daprile@mat.uniroma2.it aa 2006/07 Contents

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

### Metric Spaces Joseph Muscat 2003 (Last revised May 2009)

1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of

### THE UNIQUENESS OF HAAR MEASURE AND SET THEORY

C O L L O Q U I U M M A T H E M A T I C U M VOL. 74 1997 NO. 1 THE UNIQUENESS OF HAAR MEASURE AND SET THEORY BY PIOTR Z A K R Z E W S K I (WARSZAWA) Let G be a group of homeomorphisms of a nondiscrete,

### 13 Infinite Sets. 13.1 Injections, Surjections, and Bijections. mcs-ftl 2010/9/8 0:40 page 379 #385

mcs-ftl 2010/9/8 0:40 page 379 #385 13 Infinite Sets So you might be wondering how much is there to say about an infinite set other than, well, it has an infinite number of elements. Of course, an infinite

### arxiv:math/0510680v3 [math.gn] 31 Oct 2010

arxiv:math/0510680v3 [math.gn] 31 Oct 2010 MENGER S COVERING PROPERTY AND GROUPWISE DENSITY BOAZ TSABAN AND LYUBOMYR ZDOMSKYY Abstract. We establish a surprising connection between Menger s classical covering

### Georg Cantor (1845-1918):

Georg Cantor (845-98): The man who tamed infinity lecture by Eric Schechter Associate Professor of Mathematics Vanderbilt University http://www.math.vanderbilt.edu/ schectex/ In papers of 873 and 874,

### Handout #1: Mathematical Reasoning

Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

### COFINAL MAXIMAL CHAINS IN THE TURING DEGREES

COFINA MAXIMA CHAINS IN THE TURING DEGREES WEI WANG, IUZHEN WU, AND IANG YU Abstract. Assuming ZF C, we prove that CH holds if and only if there exists a cofinal maximal chain of order type ω 1 in the

### Notes on metric spaces

Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.

### ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction

ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING Abstract. In [1] there was proved a theorem concerning the continuity of the composition mapping, and there was announced a theorem on sequential continuity

### Vector Spaces II: Finite Dimensional Linear Algebra 1

John Nachbar September 2, 2014 Vector Spaces II: Finite Dimensional Linear Algebra 1 1 Definitions and Basic Theorems. For basic properties and notation for R N, see the notes Vector Spaces I. Definition

### Sets and set operations

CS 441 Discrete Mathematics for CS Lecture 7 Sets and set operations Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square asic discrete structures Discrete math = study of the discrete structures used

### ADDITIVE GROUPS OF RINGS WITH IDENTITY

ADDITIVE GROUPS OF RINGS WITH IDENTITY SIMION BREAZ AND GRIGORE CĂLUGĂREANU Abstract. A ring with identity exists on a torsion Abelian group exactly when the group is bounded. The additive groups of torsion-free

### Sections 2.1, 2.2 and 2.4

SETS Sections 2.1, 2.2 and 2.4 Chapter Summary Sets The Language of Sets Set Operations Set Identities Introduction Sets are one of the basic building blocks for the types of objects considered in discrete

### The Dirichlet Unit Theorem

Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if

### AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC

AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC W. T. TUTTE. Introduction. In a recent series of papers [l-4] on graphs and matroids I used definitions equivalent to the following.

### CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

### Stationary random graphs on Z with prescribed iid degrees and finite mean connections

Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative

### SMALL SKEW FIELDS CÉDRIC MILLIET

SMALL SKEW FIELDS CÉDRIC MILLIET Abstract A division ring of positive characteristic with countably many pure types is a field Wedderburn showed in 1905 that finite fields are commutative As for infinite

### CONTRIBUTIONS TO ZERO SUM PROBLEMS

CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg

### Cardinality. The set of all finite strings over the alphabet of lowercase letters is countable. The set of real numbers R is an uncountable set.

Section 2.5 Cardinality (another) Definition: The cardinality of a set A is equal to the cardinality of a set B, denoted A = B, if and only if there is a bijection from A to B. If there is an injection

### Elements of probability theory

2 Elements of probability theory Probability theory provides mathematical models for random phenomena, that is, phenomena which under repeated observations yield di erent outcomes that cannot be predicted

### BANACH AND HILBERT SPACE REVIEW

BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but

### Mathematical Methods of Engineering Analysis

Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### E3: PROBABILITY AND STATISTICS lecture notes

E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................

### Degrees that are not degrees of categoricity

Degrees that are not degrees of categoricity Bernard A. Anderson Department of Mathematics and Physical Sciences Gordon State College banderson@gordonstate.edu www.gordonstate.edu/faculty/banderson Barbara

### Prime Numbers and Irreducible Polynomials

Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.

### We give a basic overview of the mathematical background required for this course.

1 Background We give a basic overview of the mathematical background required for this course. 1.1 Set Theory We introduce some concepts from naive set theory (as opposed to axiomatic set theory). The

### CHAPTER 7 GENERAL PROOF SYSTEMS

CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes

### Analytic cohomology groups in top degrees of Zariski open sets in P n

Analytic cohomology groups in top degrees of Zariski open sets in P n Gabriel Chiriacescu, Mihnea Colţoiu, Cezar Joiţa Dedicated to Professor Cabiria Andreian Cazacu on her 80 th birthday 1 Introduction

### MEASURE AND INTEGRATION. Dietmar A. Salamon ETH Zürich

MEASURE AND INTEGRATION Dietmar A. Salamon ETH Zürich 12 May 2016 ii Preface This book is based on notes for the lecture course Measure and Integration held at ETH Zürich in the spring semester 2014. Prerequisites

### (a) Write each of p and q as a polynomial in x with coefficients in Z[y, z]. deg(p) = 7 deg(q) = 9

Homework #01, due 1/20/10 = 9.1.2, 9.1.4, 9.1.6, 9.1.8, 9.2.3 Additional problems for study: 9.1.1, 9.1.3, 9.1.5, 9.1.13, 9.2.1, 9.2.2, 9.2.4, 9.2.5, 9.2.6, 9.3.2, 9.3.3 9.1.1 (This problem was not assigned

### A Stronger Form of the Van den Berg-Kesten Inequality

A Stronger Form of the Van den Berg-Kesten Inequality Peter Winkler March 4, 2010 Abstract Let Q n := {0,1} n be the discrete hypercube with uniform probability distribution, and let A and B be two up-events

### Today s Topics. Primes & Greatest Common Divisors

Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime

### MODELS OF SET THEORY

MODELS OF SET THEORY STEFAN GESCHKE Contents 1. First order logic and the axioms of set theory 2 1.1. Syntax 2 1.2. Semantics 2 1.3. Completeness, compactness and consistency 3 1.4. Foundations of mathematics