DOCSLIB.ORG

Download This PDF File

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

西 南 交 通 大 学 学 报 第 55 卷 第 1 期 Vol. 55 No. 1 JOURNAL OF SOUTHWEST JIAOTONG UNIVERSITY 2020 年 2 月 Feb. 2020 ISSN: 0258-2724 DOI：10.35741/issn.0258-2724.55.1.15 Research article Mathematics NEW DEFINITIONS OF SIGMA FIELD 适马场的新定义 Hind Fadhil Abbas Directorate of Education, Salah Eddin, Khaled Ibn Al Walid School Tikrit City, Iraq, [email protected] Abstract The sigma field is a branch of mathematics that refers to the gathering of subsets includes sample space. It is useful in establishing a formal mathematical probability definition. The sets that occur in the sigma field are responsible for constituting various events in the presence of available sample space. In this paper, we focus on sigma fields. The main aim of this paper is to define the sigma field. Different types of sigma fields, along with the basic mathematics and examples, are also elaborated upon. Keywords: Set Theory, Measure, Sigma Additivity, Sigma Ring, Borel σ Field 摘要 西格玛字段是数学的一个分支，它指的是包括样本空间在内的子集的聚集。在建立正式的数 学概率定义中很有用。出现在西格玛字段中的集合负责在存在可用样本空间的情况下构成各种事 件。在本文中，我们专注于西格玛字段。本文的主要目的是定义西格玛域。还阐述了不同类型的 西格玛字段，以及基本的数学和示例。 关键词: 集合论，度量，西格玛可加性，西格玛戒指，博雷尔 σ 场 I. INTRODUCTION Basically, there are three key points for Sigma fields is a branch of mathematics that is motivations for σ algebras, namely limits of set useful in many sectors, such as physics, biotech, manipulation, defining measures, and electronics, and communication. Basically, sigma management of fractional information that is fields are defined with the help of a sample space categorized by sets. There are various types of point. A Sigma field or Sigma is defined by the sigma algebras, such as sub σ algebras, separable Greek letter σ. σ algebra represents a set of types σ algebras, Borel and Lebesgue σ algebras, of algebras. combining σ algebras, and product σ algebras. In mathematics and the theory of probability, Algebra is generated from class, and then we σ-field or σ algebra on X set is a gathering Σ of look towards algebra that is generated from semi- all subsets of set X. It is included and closed algebra. Semi-algebra is a set of finitely under complement and countable unions. polynomial equalities and inequalities. The 2 Abbas / Journal of Southwest Jiaotong University / Vol. 55 No. 1 Feb. 2020 abstract measure theory, containing a brief B. Sample Space discussion of sigma algebra with the basics, is Sample space is nothing but the outcome of an well defined by various authors [1], [2]. Product experiment. Basically, there are three algebra is discussed with examples in reference components of the probability space. Probability numbers in [1]. The Borel and Lebesgue σ space is built with a specific situation or algebras are explained by Jagannathan [3]. In the experiments. Out of those three, sample space, present study, basic concepts of sigma, random variable values range, is one component. mathematical models, various types of sigma Remaining is a probability function (probability algebra, and examples are presented. spreading of a discrete random variable) and event space, includes all possible events. II. WRITING A PLAN Here we discuss the basic scenarios related to C. Motivation the sigma field. In short, we tried to focus on set Generally, there are three different key theory, sample space, motivation, measures, sub motivators available for sigma (σ) algebra, which σ-algebras, definitions and properties, types of are listed below: sigma algebra, sigma additivity, and sigma ring. Measures definition; Limits of sets manipulation; A. Set Theory Managing fractional information Set theory is the foundation of mathematics. categorized by sets. Set theory generally refers to the collection of objects. We can just collect any type of object as D. Measurement part of a set that is relevant to mathematics. The function of the measure is to assign the Basically, set theory language is used to define non-negative value to a subset of x, which makes objects [4], [5]. Set theory is used for abstract precise sets. These sets are closed when algebra, discrete mathematics, and mathematical operations are carried out, except for the analysis. Simple set theory is shown in Figure 1. measurable sets. Here, we say that M is a measurable set. However, the complement of it is also a measurable set. These non-empty set collections with this property are termed sigma (σ) algebras [6]. A limit is an important aspect for set sequence. This limits closure for countable unions; intersections are most important. Here, set limits are defined followed by sigma (σ) algebras. 1. Consider a sequence s1, s2, s3 …which is a subset of X. (1) 2. This is the limit supremum. 3. The infimum limit for this sequence is (2) Figure 1. Set theory III. SIGMA (Σ OR Σ) FIELD The term sample space is uncountable. Due to A subset indicates all the possible this uncountability, it is difficult to find a observations. This partial information is problem in case of assignment of probabilities to characterized by smaller σ-algebra, and this is a all possible subsets. Hence, it is necessary to subset of principal sigma (σ) algebra. implement with small algebra. Some examples Consider that X is any set, and P(X) is a are listed below. The sigma (σ) algebra estimated power set. The subset is known by collecting subsets of given sample space, as σ algebra. This satisfies the following which is termed the smallest sigma (σ) algebra, properties: contains the collection [3]. ● X is a part of sigma and it is considered a universal set. 3 ● Sigma (σ) is closed for complementation, s ∈ S meaning S is in the Sigma field, and it is also a If P ∈ S then Pc ∈ S complement. If P ∈ S and Q ∈ S then P ∪ Q ∈ S ● Sigma (σ) is closed for unions, meaning Now here we discuss the natural sigma field s1,s2 ,s3,… is in the Sigma field, and S = s1 U s2 or algebra. This is useful in many special types of U s3….. cases of sets. Every sigma (σ) algebra is semi-ring, a set two binary operators together. Hence, if a set of E. Dynkin’s π-λ Theorem semi-ring is needed, then it is adequate to show The sigma field covers the Dynkin system as that it is sigma (σ) algebra. well as the π system. The Dynkin system is also Sigma algebras could also be made by known as the λ system. Here we focus on the available arbitrary sets. It helps to develop Dynkin system. probability space [7]. Theorem: Dynkin’s π-λ theorem is very useful in supporting the property of specific sigma (σ) A. Theorem algebras. In π system, it is the gathering of Consider set X as an intersection of all the subsets of set x having many close and finite sigma (σ) algebras, Si, containing X means, x ∈ X intersections. The λ-system set is the gathering of = > x ∈ Si, for all i is itself sigma (σ) algebra. It is subsets that contain x and it is locked underneath denoted by σ (X). This is known as the generation countable unions of all disjoint subsets and of sigma (σ) algebra by set X. complements, whereas the Dynkin system is straightforward in nature. Dynkin's π-λ Theorem B. Sigma Additivity is applicable for all σ (P) sets where it reduces Additivity or specifically finite additivity and the checking of σ (P) arbitrary sets, which countable additivity or sigma additivity are going shrinks the computational time. to be explained with a subset of available sets, Definition 1: Sigma (σ) field or generation of which are abstracted by properties like volume, algebra by sets family: Consider F to be a family length, and area when many objects are available. of sets, then the sigma field generated by F is Simple additivity is weak compared to sigma denoted as σ (F). It is the intersection of complete additivity because in sigma additivity minor sigma algebras of F. This is the smallest sigma specification, decimals are also considered. field or algebra having all sets in Set F. Example: Consider A = [0, 1] and F = {[0, .3], C. Sigma Ring [.5, 1]} = {b1, b2}. When a set is made by a nonempty collection Then of sets, if this set is closed for a countable union σ (F) = {ϕ, b1, b2, b3, b1 ∪ b2, b1 ∪ b3, b2 ∪ and its relative complementation, then it is b3, A} where b3 = (.3, .5). known as a sigma (σ) ring. It is also known as a Here 8 sets are present in σ (F). pronounced sigma (σ) ring. F. Borel and Lebesgue Sigma Field D. Sigma Field Definitions Consider S to be countable. Σ (σ) algebra or σ Sigma fields are generated by set families. field is used as the power set P(s). Hence, all sets Sigma fields are divided into many types, such as become defensible meaning allowable. ℝ is the generation of sigma field based on arbitrary set of real numbers. Here we generate the sigma family, cylinder set, random variable, stochastic field by all interval collection. Sometimes it is process and function, Borel and Lebesgue sigma known as Borel σ algebra or Borel σ field field, and product sigma field. Generally, σ field because it is named after Emil Borel [3]. or σ-algebras are important concepts and play Definition 2: Borel σ-algebra: The Borel fundamental scenarios for given probability in sigma field or Borel sigma (σ) algebra is case of random experiments. Consider S is the indicated by B. A topological (X; τ) space is the universal set. Many times, it is difficult to sigma (σ) algebra created by τ which belongs to summarize all the subsets of the set S if set S is the family of open sets.
Recommended publications
  • Measure Theory and Probability Theory

    Measure Theory and Probability Theory

    Measure Theory and Probability Theory Stéphane Dupraz In this chapter, we aim at building a theory of probabilities that extends to any set the theory of probability we have for finite sets (with which you are assumed to be familiar). For a finite set with N elements Ω = {ω1, ..., ωN }, a probability P takes any n positive numbers p1, ..., pN that sum to one, and attributes to any subset S of Ω the number (S) = P p . Extending this definition to infinitely countable sets such as P i/ωi∈S i N poses no difficulty: we can in the same way assign a positive number to each integer n ∈ N and require that P∞ 1 P n=1 pn = 1. We can then define the probability of a subset S ⊆ N as P(S) = n∈S pn. Things get more complicated when we move to uncountable sets such as the real line R. To be sure, it is possible to assign a positive number to each real number. But how to get from these positive numbers to the probability of any subset of R?2 To get a definition of a probability that applies without a hitch to uncountable sets, we give in the strategy we used for finite and countable sets and start from scratch. The definition of a probability we are going to use was borrowed from measure theory by Kolmogorov in 1933, which explains the title of this chapter. What do probabilities have to do with measurement? Simple: assigning a probability to an event is measuring the likeliness of this event.
  • Results Real Analysis I and II, MATH 5453-5463, 2006-2007

    Results Real Analysis I and II, MATH 5453-5463, 2006-2007

    Main results Real Analysis I and II, MATH 5453-5463, 2006-2007 Section Homework Introduction. 1.3 Operations with sets. DeMorgan Laws. 1.4 Proposition 1. Existence of the smallest algebra containing C. 2.5 Open and closed sets. 2.6 Continuous functions. Proposition 18. Hw #1. p.16 #9, 11, 17, 18; p.19 #19. 2.7 Borel sets. p.49 #40, 42, 43; p.53 #53*. 3.2 Outer measure. Proposition 1. Outer measure of an interval. Proposition 2. Subadditivity of the outer measure. Proposition 5. Approximation by open sets. 3.3 Measurable sets. Lemma 6. Measurability of sets of outer measure zero. Lemma 7. Measurability of the union. Hw #2. p.55 #1-4; p.58 # 7, 8. Theorem 10. Measurable sets form a sigma-algebra. Lemma 11. Interval is measurable. Theorem 12. Borel sets are measurable. Proposition 13. Sigma additivity of the measure. Proposition 14. Continuity of the measure. Proposition 15. Approximation by open and closed sets. Hw #3. p.64 #9-11, 13, 14. 3.4 A nonmeasurable set. 3.5 Measurable functions. Proposition 18. Equivalent definitions of measurability. Proposition 19. Sums and products of measurable functions. Theorem 20. Infima and suprema of measurable functions. Hw #4. p.70 #18-22. 3.6 Littlewood's three principles. Egoroff's theorem. Lusin's theorem. 4.2 Prop.2. Lebesgue's integral of a simple function and its props. Lebesgue's integral of a bounded measurable function. Proposition 3. Criterion of integrability. Proposition 5. Properties of integrals of bounded functions. Proposition 6. Bounded convergence theorem. 4.3 Lebesgue integral of a nonnegative function and its properties.
  • Ergodicity and Metric Transitivity

    Ergodicity and Metric Transitivity

    Chapter 25 Ergodicity and Metric Transitivity Section 25.1 explains the ideas of ergodicity (roughly, there is only one invariant set of positive measure) and metric transivity (roughly, the system has a positive probability of going from any- where to anywhere), and why they are (almost) the same. Section 25.2 gives some examples of ergodic systems. Section 25.3 deduces some consequences of ergodicity, most im- portantly that time averages have deterministic limits ( 25.3.1), and an asymptotic approach to independence between even§ts at widely separated times ( 25.3.2), admittedly in a very weak sense. § 25.1 Metric Transitivity Definition 341 (Ergodic Systems, Processes, Measures and Transfor- mations) A dynamical system Ξ, , µ, T is ergodic, or an ergodic system or an ergodic process when µ(C) = 0 orXµ(C) = 1 for every T -invariant set C. µ is called a T -ergodic measure, and T is called a µ-ergodic transformation, or just an ergodic measure and ergodic transformation, respectively. Remark: Most authorities require a µ-ergodic transformation to also be measure-preserving for µ. But (Corollary 54) measure-preserving transforma- tions are necessarily stationary, and we want to minimize our stationarity as- sumptions. So what most books call “ergodic”, we have to qualify as “stationary and ergodic”. (Conversely, when other people talk about processes being “sta- tionary and ergodic”, they mean “stationary with only one ergodic component”; but of that, more later. Definition 342 (Metric Transitivity) A dynamical system is metrically tran- sitive, metrically indecomposable, or irreducible when, for any two sets A, B n ∈ , if µ(A), µ(B) > 0, there exists an n such that µ(T − A B) > 0.
  • Defining Physics at Imaginary Time: Reflection Positivity for Certain

    Defining Physics at Imaginary Time: Reflection Positivity for Certain

    Defining physics at imaginary time: reflection positivity for certain Riemannian manifolds A thesis presented by Christian Coolidge Anderson [email protected] (978) 204-7656 to the Department of Mathematics in partial fulfillment of the requirements for an honors degree. Advised by Professor Arthur Jaffe. Harvard University Cambridge, Massachusetts March 2013 Contents 1 Introduction 1 2 Axiomatic quantum field theory 2 3 Definition of reflection positivity 4 4 Reflection positivity on a Riemannian manifold M 7 4.1 Function space E over M ..................... 7 4.2 Reflection on M .......................... 10 4.3 Reflection positive inner product on E+ ⊂ E . 11 5 The Osterwalder-Schrader construction 12 5.1 Quantization of operators . 13 5.2 Examples of quantizable operators . 14 5.3 Quantization domains . 16 5.4 The Hamiltonian . 17 6 Reflection positivity on the level of group representations 17 6.1 Weakened quantization condition . 18 6.2 Symmetric local semigroups . 19 6.3 A unitary representation for Glor . 20 7 Construction of reflection positive measures 22 7.1 Nuclear spaces . 23 7.2 Construction of nuclear space over M . 24 7.3 Gaussian measures . 27 7.4 Construction of Gaussian measure . 28 7.5 OS axioms for the Gaussian measure . 30 8 Reflection positivity for the Laplacian covariance 31 9 Reflection positivity for the Dirac covariance 34 9.1 Introduction to the Dirac operator . 35 9.2 Proof of reflection positivity . 38 10 Conclusion 40 11 Appendix A: Cited theorems 40 12 Acknowledgments 41 1 Introduction Two concepts dominate contemporary physics: relativity and quantum me- chanics. They unite to describe the physics of interacting particles, which live in relativistic spacetime while exhibiting quantum behavior.
  • Dynkin (Λ-) and Π-Systems; Monotone Classes of Sets, and of Functions – with Some Examples of Application (Mainly of a Probabilistic flavor)

    Dynkin (Λ-) and Π-Systems; Monotone Classes of Sets, and of Functions – with Some Examples of Application (Mainly of a Probabilistic flavor)

    Dynkin (λ-) and π-systems; monotone classes of sets, and of functions { with some examples of application (mainly of a probabilistic flavor) Matija Vidmar February 7, 2018 1 Dynkin and π-systems Some basic notation: Throughout, for measurable spaces (A; A) and (B; B), (i) A=B will denote the class of A=B-measurable maps, and (ii) when A = B, A_B := σA(A[B) will be the smallest σ-field on A containing both A and B (this notation has obvious extensions to arbitrary families of σ-fields on a given space). Furthermore, for a measure µ on F, µf := µ(f) := R fdµ will signify + − the integral of an f 2 F=B[−∞;1] against µ (assuming µf ^ µf < 1). Finally, for a probability space (Ω; F; P) and a sub-σ-field G of F, PGf := PG(f) := EP[fjG] will denote the conditional + − expectation of an f 2 F=B[−∞;1] under P w.r.t. G (assuming Pf ^ Pf < 1; in particular, for F 2 F, PG(F ) := P(F jG) = EP[1F jG] will be the conditional probability of F under P given G). We consider first Dynkin and π-systems. Definition 1. Let Ω be a set, D ⊂ 2Ω a collection of its subsets. Then D is called a Dynkin system, or a λ-system, on Ω, if (i) Ω 2 D, (ii) fA; Bg ⊂ D and A ⊂ B, implies BnA 2 D, and (iii) whenever (Ai)i2N is a sequence in D, and Ai ⊂ Ai+1 for all i 2 N, then [i2NAi 2 D.
  • Problem Set 1 This Problem Set Is Due on Friday, September 25

    Problem Set 1 This Problem Set Is Due on Friday, September 25

    MA 2210 Fall 2015 - Problem set 1 This problem set is due on Friday, September 25. All parts (#) count 10 points. Solve the problems in order and please turn in for full marks (140 points) • Problems 1, 2, 6, 8, 9 in full • Problem 3, either #1 or #2 (not both) • Either Problem 4 or Problem 5 (not both) • Problem 7, either #1 or #2 (not both) 1. Let D be the dyadic grid on R and m denote the Lebesgue outer measure on R, namely for A ⊂ R ( ¥ ¥ ) [ m(A) = inf ∑ `(Ij) : A ⊂ Ij; Ij 2 D 8 j : j=1 j=1 −n #1 Let n 2 Z. Prove that m does not change if we restrict to intervals with `(Ij) ≤ 2 , namely ( ¥ ¥ ) (n) (n) [ −n m(A) = m (A); m (A) := inf ∑ `(Ij) : A ⊂ Ij; Ij 2 D 8 j;`(Ij) ≤ 2 : j=1 j=1 N −n #2 Let t 2 R be of the form t = ∑n=−N kn2 for suitable integers N;k−N;:::;kN. Prove that m is invariant under translations by t, namely m(A) = m(A +t) 8A ⊂ R: −n −m Hints. For #2, reduce to the case t = 2 for some n. Then use #1 and that Dm = fI 2 D : `(I) = 2 g is invariant under translation by 2−n whenever m ≥ n. d d 2. Let O be the collection of all open cubes I ⊂ R and define the outer measure on R given by ( ¥ ¥ ) [ n(A) = inf ∑ jRnj : A ⊂ R j; R j 2 O 8 j n=0 n=0 where jRj is the Euclidean volume of the cube R.
  • ERGODIC THEORY and ENTROPY Contents 1. Introduction 1 2

    ERGODIC THEORY and ENTROPY Contents 1. Introduction 1 2

    ERGODIC THEORY AND ENTROPY JACOB FIEDLER Abstract. In this paper, we introduce the basic notions of ergodic theory, starting with measure-preserving transformations and culminating in as a statement of Birkhoff's ergodic theorem and a proof of some related results. Then, consideration of whether Bernoulli shifts are measure-theoretically iso- morphic motivates the notion of measure-theoretic entropy. The Kolmogorov- Sinai theorem is stated to aid in calculation of entropy, and with this tool, Bernoulli shifts are reexamined. Contents 1. Introduction 1 2. Measure-Preserving Transformations 2 3. Ergodic Theory and Basic Examples 4 4. Birkhoff's Ergodic Theorem and Applications 9 5. Measure-Theoretic Isomorphisms 14 6. Measure-Theoretic Entropy 17 Acknowledgements 22 References 22 1. Introduction In 1890, Henri Poincar´easked under what conditions points in a given set within a dynamical system would return to that set infinitely many times. As it turns out, under certain conditions almost every point within the original set will return repeatedly. We must stipulate that the dynamical system be modeled by a measure space equipped with a certain type of transformation T :(X; B; m) ! (X; B; m). We denote the set we are interested in as B 2 B, and let B0 be the set of all points in B that return to B infinitely often (meaning that for a point b 2 B, T m(b) 2 B for infinitely many m). Then we can be assured that m(B n B0) = 0. This result will be proven at the end of Section 2 of this paper. In other words, only a null set of points strays from a given set permanently.
  • Dynkin Systems and Regularity of Finite Borel Measures Homework 10

    Dynkin Systems and Regularity of Finite Borel Measures Homework 10

    Math 105, Spring 2012 Professor Mariusz Wodzicki Dynkin systems and regularity of finite Borel measures Homework 10 due April 13, 2012 1. Let p 2 X be a point of a topological space. Show that the set fpg ⊆ X is closed if and only if for any point q 6= p, there exists a neighborhood N 3 q such that p 2/ N . Derive from this that X is a T1 -space if and only if every singleton subset is closed. Let C , D ⊆ P(X) be arbitrary families of subsets of a set X. We define the family D:C as D:C ˜ fE ⊆ X j C \ E 2 D for every C 2 C g. 2. The Exchange Property Show that, for any families B, C , D ⊆ P(X), one has B ⊆ D:C if and only if C ⊆ D:B. Dynkin systems1 We say that a family of subsets D ⊆ P(X) of a set X is a Dynkin system (or a Dynkin class), if it satisfies the following three conditions: c (D1) if D 2 D , then D 2 D ; S (D2) if fDigi2I is a countable family of disjoint members of D , then i2I Di 2 D ; (D3) X 2 D . 3. Show that any Dynkin system satisfies also: 0 0 0 (D4) if D, D 2 D and D ⊆ D, then D n D 2 D . T 4. Show that the intersection, i2I Di , of any family of Dynkin systems fDigi2I on a set X is a Dynkin system on X. It follows that, for any family F ⊆ P(X), there exists a smallest Dynkin system containing F , namely the intersection of all Dynkin systems containing F .
  • THE DYNKIN SYSTEM GENERATED by BALLS in Rd CONTAINS ALL BOREL SETS Let X Be a Nonempty Set and S ⊂ 2 X. Following [B, P. 8] We

    THE DYNKIN SYSTEM GENERATED by BALLS in Rd CONTAINS ALL BOREL SETS Let X Be a Nonempty Set and S ⊂ 2 X. Following [B, P. 8] We

    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 128, Number 2, Pages 433{437 S 0002-9939(99)05507-0 Article electronically published on September 23, 1999 THE DYNKIN SYSTEM GENERATED BY BALLS IN Rd CONTAINS ALL BOREL SETS MIROSLAV ZELENY´ (Communicated by Frederick W. Gehring) Abstract. We show that for every d N each Borel subset of the space Rd with the Euclidean metric can be generated2 from closed balls by complements and countable disjoint unions. Let X be a nonempty set and 2X. Following [B, p. 8] we say that is a Dynkin system if S⊂ S (D1) X ; (D2) A ∈S X A ; ∈S⇒ \ ∈S (D3) if A are pairwise disjoint, then ∞ A . n ∈S n=1 n ∈S Some authors use the name -class instead of Dynkin system. The smallest Dynkin σ S system containing a system 2Xis denoted by ( ). Let P be a metric space. The system of all closed ballsT⊂ in P (of all Borel subsetsD T of P , respectively) will be denoted by Balls(P ) (Borel(P ), respectively). We will deal with the problem of whether (?) (Balls(P )) = Borel(P ): D One motivation for such a problem comes from measure theory. Let µ and ν be finite Radon measures on a metric space P having the same values on each ball. Is it true that µ = ν?If (Balls(P )) = Borel(P ), then obviously µ = ν.IfPis a Banach space, then µ =Dν again (Preiss, Tiˇser [PT]). But Preiss and Keleti ([PK]) showed recently that (?) is false in infinite-dimensional Hilbert spaces. We prove the following result.
  • Measure and Integration

    Measure and Integration

    ¦ Measure and Integration Man is the measure of all things. — Pythagoras Lebesgue is the measure of almost all things. — Anonymous ¦.G Motivation We shall give a few reasons why it is worth bothering with measure the- ory and the Lebesgue integral. To this end, we stress the importance of measure theory in three different areas. ¦.G.G We want a powerful integral At the end of the previous chapter we encountered a neat application of Banach’s fixed point theorem to solve ordinary differential equations. An essential ingredient in the argument was the observation in Lemma 2.77 that the operation of differentiation could be replaced by integration. Note that differentiation is an operation that destroys regularity, while in- tegration yields further regularity. It is a consequence of the fundamental theorem of calculus that the indefinite integral of a continuous function is a continuously differentiable function. So far we used the elementary notion of the Riemann integral. Let us quickly recall the definition of the Riemann integral on a bounded interval. Definition 3.1. Let [a, b] with −¥ < a < b < ¥ be a compact in- terval. A partition of [a, b] is a finite sequence p := (t0,..., tN) such that a = t0 < t1 < ··· < tN = b. The mesh size of p is jpj := max1≤k≤Njtk − tk−1j. Given a partition p of [a, b], an associated vector of sample points (frequently also called tags) is a vector x = (x1,..., xN) such that xk 2 [tk−1, tk]. Given a function f : [a, b] ! R and a tagged 51 3 Measure and Integration partition (p, x) of [a, b], the Riemann sum S( f , p, x) is defined by N S( f , p, x) := ∑ f (xk)(tk − tk−1).
  • Abelian Group, 521, 526 Absolute Value, 190 Accumulation, Point Of

    Abelian Group, 521, 526 Absolute Value, 190 Accumulation, Point Of

    Index Abelian group, 521, 526 A-set. SeeAnalytic set Absolutevalue, 190 Asymptoticallyequal. 479 Accumulation, point of, 196 Atlas , 231; of holomorphically related Adjoint differentialform, 157, 167 charts, 245 Adjoint operator, 403 Atomic theory, 415 Adjoint space, 397 Automorphism group, 510, 511 Algebra, 524; Boolean, 91, 92; Axiomatic method, in geometry, 507-508 fundamentaltheorem of, 195-196; homo logical, 519-520; normed, 516 BAIREclasses, 460; first, 460, 462, 463; Almost all, 479 of functions, 448 Almost continuous, 460 BAIREcondition, 464 Almost equal, 479 BAIREfunction, 464, 473; non-, 474 Almost everywhere, 70 BAIREspace, 464 Almost linear equation, 321, 323 BAIREsystem, of functions, 459, 460 Alternating differentialform, 185; BAIREtheorem, 448, 460, 462 differentialoperations for, 159-165; BANACH, S., 516 theory of, vi, 143 BANACHfixed point theorem, 423 Alternative theorem, 296, 413 BANACHspace, 338, 340, 393, 399, 432, Analysis, v, 1; axiomaticmethod in, 435,437, 516; adjoint, 400; 512-518; complex, vi ; functional, conjugate, 400; dual, 400; theory of, vi 391; harmonic, 518; and number BANACHtheorem, 446, 447 theory, 500-501 Band spectra, 418 Analytic function, definedby function BAYES theorem, 109 element, 242 BELTRAMIdifferential equation, 325 Analytic numbertheory, 480 BERNOULLI, DANIEL, 23 Analytic operation, 468 BERNOULLI, JACOB, 89, 360 Analytic set, 448, 458, 465, 468, 469; BERNOULLI, JOHANN, 23 linear, 466 BERNOULLIdistribution, 96 Angle-preservingtransformation, 194 BERNOULLIlaw, of large numbers, 116 a-points,
  • 2.1.3 Outer Measures and Construction of Measures Recall the Construction of Lebesgue Measure on the Real Line

    2.1.3 Outer Measures and Construction of Measures Recall the Construction of Lebesgue Measure on the Real Line

    CHAPTER 2. THE LEBESGUE INTEGRAL I 11 2.1.3 Outer measures and construction of measures Recall the construction of Lebesgue measure on the real line. There are various approaches to construct the Lebesgue measure on the real line. For example, consider the collection of finite union of sets of the form ]a; b]; ] − 1; b]; ]a; 1[ R: This collection is an algebra A but not a sigma-algebra (this has been discussed on p.7). A natural measure on A is given by the length of an interval. One attempts to measure the size of any subset S of R covering it by countably many intervals (recall also that R can be covered by countably many intervals) and we define this quantity by 1 1 X [ m∗(S) = inff jAkj : Ak 2 A;S ⊂ Akg (2.7) k=1 k=1 where jAkj denotes the length of the interval Ak. However, m∗(S) is not a measure since it is not additive, which we do not prove here. It is only sigma- subadditive, that is k k [ X m∗ Sn ≤ m∗(Sn) n=1 n=1 for any countable collection (Sn) of subsets of R. Alternatively one could choose coverings by open intervals (see the exercises, see also B.Dacorogna, Analyse avanc´eepour math´ematiciens)Note that the quantity m∗ coincides with the length for any set in A, that is the measure on A (this is surprisingly the more difficult part!). Also note that the sigma-subadditivity implies that m∗(A) = 0 for any countable set since m∗(fpg) = 0 for any p 2 R.