Documents about Pairwise Disjoint

  • 1 Pages

    Ma635-Lecture Notes 8. Lebesgue measure

    Stevens, MA 635

    Excerpt: ... Ma 635. Real Analysis I. Lecture Notes VIII. MEASURE 8.1 Denition. Lebesgue measure of interval (a, b) of numerical line is L (a, b) = b a. 8.2 Denition. Lebesgue outer measure of a set E is (E) = inf L n=1 L (In ) : E n=1 In where the inmum is taken over all coverings of E by countable unions of intervals. 8.3 () = 0 L (countable set) = 0 L (a, b) = L (a, b) L (E) (F ) if E F L L (monotonicity) 8.4 Denition If {(ai , bi )} is a collection of pairwise disjoint open intervals then L i=1 (ai , bi ) := i=1 (bi ai ). The sum may be innite. 1 ...

  • 1 Pages


    Charleston Law, MATH 301

    Excerpt: ... Math 301 - Spring 2008 Homework 2: due 23 April (1) Skim through Chapter 1 in the text to make sure you are familiar with the concepts from todays class. (2) From todays lecture, you should recognize and understand the following vocabulary: set (proper) subset Venn Diagram intersection (relative) complement partition N, Z, R universal set power set disjoint index set ordered pair cardinality intervals union dierence pairwise disjoint sets Cartesian product (3) Your rst hand-in homework assignment is due at the beginning of class next Tuesday, 29 April. The problems are listed below, and all come from your textbook. You may discuss your work with your classmates, but you should neatly write your solution in your own words without consultation from your classmates. The underlined problems must be completed completely on your own; the problems in parentheses must be typeset using LaTeX. (1.7) 1.40 2.17 2.34 1.23 1.52 2.21 2.39 1.25 2.6 2.29 (2.50) 1.31 2.11 2.32 2.55 (4) There is a link on the ...

  • 4 Pages


    Harvey Mudd College, MATH 171

    Excerpt: ... arose only later. With that in mind, let's apply some of our knowledge of group actions to the specific example of the symmetric group. Definition 12. Let Sn be a permutation. The cycle type of is a nonincreasing sequence of positive integers (l1 , l2 , . . . , lr ), l1 l2 lr such that may be decomposed into disjoint cycles length li , = 1 2 r Example 13. The cycle type of (123)(34) S4 is 4, as (123)(34) = (1234). The cycle type of (12)(34) is (2, 2), as this permutation is written as a product of disjoint transpositions. 3 |i | = li . Proposition 14. Every permutation is a product of pairwise disjoint cycles; moreover this decomposition is unique up to the order of the terms. Theorem 15. Two permutations in Sn are conjugate if and only if they are of the same cycle type. Lemma 16. For a permutation Sn , and = (a1 , . . . , ak ) a k-cycle in Sn , -1 = (a1 ), . . . , (ak ). Proof. Note that -1 (ai ) = (ai ) = (ai+1 ). Also, if b = a1 , . . . , ak , then -1 (b) = a1 , . . . , ak . Th ...

  • 2 Pages


    Berkeley, MATH 202a

    Excerpt: ... MATH 202A LECTURE NOTES FOR OCT 19, 2005 PROFESSOR DONALD SARASON 1. Semirings Denition 1.1 (Semiring). A semiring (Folland: an elementary family) on X is a family S P(X) such that (1) S (2) If A, B S, then A B S (3) If A, B S, then A \ B is a nite disjoint union of sets in S Example 1.2. A cell in R is [a, b) or . The cells in R form a semiring. Example 1.3. A cell in RN (N > 1) is or a product of cells RN form a semiring. N 1 [ai , bi ). Cells in Proposition 1.4. Let S be a semiring of X and let R be the family of nite disjoint unions of sets in S. Then R is the ring generated by S (i.e. in particular R is a ring). 2. Measure Denition 2.1 (Measure). Let S P(X) be a semiring. A measure on S is a function : S [0, ] (if maps to [0, ), we say is a nite measure) such that (1) () = 0 (2) If A1 , A2 , S are pairwise disjoint , then i=1 Ai = i=1 (Ai ) N Example 2.2. Let S be a semiring of cells in RN . ...

  • 1 Pages


    USC, MATH 525

    Excerpt: ... AB = . What is the set B? distributes over : A (BC) = (A B)(A C). And in fact, the ring is commutative: A B = B A. Note: rings need not have a multiplicative unit. What would it take for R to be a ring with unit? Problem 3. Is it possible for a -ring to be infinite yet countable? Give a careful proof of your statement-this problem is harder than it looks. Hint: If you could find countably many pairwise disjoint sets E1 , E2 , . . . in the -ring, you'd be home free: for each possible sequence of 0's and 1's would lead to a different countable union (a 0 in the i-th position meaning don't include Ei in the union, a 1 meaning do include it). Ah, but how to get them to be pairwise disjoint ? Problem 4. Let X be an uncountable set (say R for specificity) and let A be the -algebra of subsets of X which are either countable (finite or denumerable), or whose complements are countable. Does there exist a topology T on X such that A is the Borel field on X generated by T ? Hint: None. I don't know the answer ...

  • 4 Pages


    University of Illinois, Urbana Champaign, CS 421

    Excerpt: ... gain, you get the idea. So, along with that issue, we need a grammar that will allow us to gure out what rule we are going to use to parse with after only having had seen one token. One way that we saw for dealing with this was to extend the grammar and not make a choice until it was absolutely obvious which rule we needed to be using. But we need to test our grammar to see if it is even possible to write a parser for the grammar. 2.2 Pairwise Disjoint Test (slides 34-36 The test we are going to use is called the Pairwise disjoint edness Test. And note, that this is an approximate test, so we may not get perfect results every time. And this test simply checks to see if it can make a decision on which rule to use based on the rst token seen and not extending the grammar like we mentioned before. So this test is a little strict because it would have told us that the grammar we looked at last time would not have a parser, but in fact, we did have one. So for this test, we are going to calculate what we w ...

  • 7 Pages


    Allan Hancock College, MATH 2902

    Excerpt: ... 4 are precisely 36, 18, 12, 9, 6, and 4, we conclude that these are the only possibilities for the number of right translates of X. Furthermore, if the number of right translates is 4 then, as we proved in the previous 4 lemma, the translates are pairwise disjoint . And by the proposition we stated above, any nonempty subset whose translate are pairwise disjoint must be a coset of a subgroup of G; so the result is proved. Each equivalence class for the relation on S consists of the right translates of an 9-element subset, and so the number of elements in the equivalence class must be 36, 18, 12, 9, 6, or 4. The total number of elements in S is the sum of the numbers of elements in the various equivalence classes; so #S = 36n1 + 18n2 + 12n3 + 9n4 + 6n5 + 4n6 for some nonnegative integers n1 , n2 , n3 , n4 , n5 and n6 . But the right hand side above can be written as 3(12n1 + 6n2 + 4n3 + 3n4 + 2n5 + n6 ) + n6 , which differs from n6 by a multiple of 3. So #S n6 (mod 3). But we have seen that #S = 94143280 ...

  • 2 Pages

    probability set up

    Cornell, BTRY 4080

    Excerpt: ... n Ai . i=1 An exercise is to show that (n Ai )c = n Ac and (n Ai )c = n Ac . These are called DeMori=1 i=1 i i=1 i=1 i gan's laws. There are no restrictions on S. The collection of events, F, must be a -field, which means that it satisfies the following: (i) , S is in F; (ii) if A is in F, then Ac is in F; (iii) if A1 , A2 , . . . are in F, then Ai and Ai are in F. i=1 i=1 Typically we will take F to be all subsets of S, and so (i)-(iii) are automatically satisfied. The only times we won't have F be all subsets is for technical reasons or when we talk about conditional expectation. So now we have a space S, a -field F, and we need to talk about what a probability is. There are three axioms: (1) 0 P(E) 1 for all events E. (2) P(S) = 1. (3) If the Ei are pairwise disjoint , P( Ei ) = i=1 i=1 P(Ei ). Pairwise disjoint means that Ei Ej = unless i = j. Note that probabilities are probabilities of subsets of S, not of points of S. However it is common to write P(x) for P({x}). Intuitively, the probability ...

  • 1 Pages



    Excerpt: ... or two adjacent vertices. (Hint: Study s(u) - s(v) when u and v are adjacent.) b) Determine the maximum distance between the center and the barycenter in a tree of diameter d. (Example: In the tree below, the center is {x, y}, the barycenter is {z}, and the distance between them is 1.) x y z 3. Let G be the 3-regular graph with 4m vertices formed from m pairwise disjoint kites by adding m edges to link them in a ring, as shown on the right above for m = 6. Prove that (G) = 2m8m . 4. Count the following sets of trees with vertex set [n], giving two proofs for each: one using the Prfer correspondence and one by direct counting arguments. u a) trees that have 2 leaves. b) trees that have n - 2 leaves. 5. Prove that if the Graceful Tree Conjecture is true and T is a tree with m edges, then K2m decomposes into 2m - 1 copies of T . (Hint: If every tree T with m - 1 edges is graceful, then K2m-1 has a cyclically invariant decomposition into copie ...

  • 2 Pages


    Berkeley, MATH 105

    Excerpt: ... ficulty than I'd anticipated; I expected problem (5) to be the tricky one but on the average people had more trouble with number (4). Let's fix firmly in our minds the fact that this result is false if it is only given that 0 fj (x) A (x) for all x. Indeed consider fj = [j,j+1] and A = (with (E, A, ) = (R, B, ). Then 0 fj (x) A (x) for all x, yet fj d = 1 while |A| = 0. Another example is fj (x) = -1/j for all x R. Now all hypotheses are satisfied with A = , except that fj are not nonnegative. Again the conclusion is false. Many solutions introduced a bit of notation and then simply claimed the conclusion without offering any analysis at all. In particular, if you didn't use the monotonicity hypothesis fj fj+1 and the hypothesis that fj 0, then you can't possibly have writtenwritten a correct proof! A more sophisticated fallacy, to which several victims fell prey, is to write fj out in the form Nj fj = k=1 cj,k Bj,k where cj,k are nonnegative scalars and the sets Bj,k are pairwise disjoint for each ...

  • 4 Pages


    Oregon, MATH 232

    Excerpt: ... is a sample space and E is an event in this space, then the complement E c of E is the set E c = \ E, so E and E c are disjoint and = E E c . We are now going to restate the Theorem given on page 191 of the text, but we will omit the proof. However, we expect you to expend a little eort to follow and understand its proof it is not only fun in its own right, but it illustrates some very important properties of sets and probability functions. Theorem 3.1. Let P be a probability function on a nite sample space . Then (a) P () = 0; (b) P (E c ) = 1 P (E) for every event E in ; (c) P (E F ) = P (E) + P (F ) P (E F ) for every pair of events E and F ; (d) For every pairwise disjoint set of events E1 , E2 , . . . , En P (E1 E2 En ) = P (E1 ) + P (E2 ) + + P (En ). Here is one of the great advantages of having only a nite sample space . For then each single outcome is an event and each event E is the disjoint uni ...

  • 2 Pages


    Wesleyan, MATH 514

    Excerpt: ... Math 514 Solution to HW #3 Spring, 2008 Chapter 1.4, Exercise #1 1a. Fix a line L R2 : We are to show that (L) = 0: We write L as a union of countably many intervals. For example, if we describe L as follows: for some xed non-zero vector ~ 2 R2 and some w 2 R2 ; v ~ L = fw + t~ j t 2 Rg ~ v then we can write L= [ fw + t~ j t 2 [n; n + 1]g ~ v n2Z By countable subadditivity, it is enough to show that for each n 2 Z; (fw + t~ j t 2 [n; n + 1)g) = ~ v 0: So we x n 2 Z. We denote fw + t~ j t 2 [n; n + 1)g by An : First we note ~ v that An is Lebesgue measurable, since it is closed. Now if ~ is a vector in R2 u that is not a multiple of ~ ; then the sets v fAn + s~ gs2(0;1) u are pairwise disjoint , and are all contained in a bounded set, namely the parallelogram P = fw + t~ + s~ j s; t 2 [0; 1]g : ~ v u Since P is bounded (and closed), we know that (P ) < 1: However, since is invariant under translation in R2 , each of the sets An +s~ u has the same measure, namely (An ). So if we choose a sequence of dist ...

  • 1 Pages


    Wisconsin, CS 787

    Excerpt: ... CS787: Homework 6 Due date: Tuesday, April 21, 2009 Please note this is a short homework, due on Tuesday. 4/21 1. Give an approximation algorithm for the following problem: Given a directed graph G = (V, E), nd a subset of edges of maximum cardinalit ...