Purchase Solution

Set Theory : Pairwise Disjoint Finite Sets and Addition Principle

Not what you're looking for?

Ask Custom Question

Proposition 10.2.1: (the addition principle)

Suppose that X and Y are disjoint finite sets. Then X U Y is finite and |X UY| = |X| + |Y|.

Corollary 10.2.2:
For a positive integer n, suppose that X1, X2....,Xn is a collection of n pairwise disjoint finite sets (i.e. i does not = j => Xi Xj = empty set)

Then X1 U X2 U....U Xn = U ( lim from n to i=1) Xi is a finite set and
|X1 U X2 U......U Xn| = |X1| + |X2|+....|Xn|.

Please see the attached file for the fully formatted problems.

Attachments
Purchase this Solution
Solution Summary

Pairwise Disjoint Finite Sets and the Addition Principle are investigated. The solution is detailed and well presented.

Purchase this Solution
Free BrainMass Quizzes
Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

View More Free Quizzes
Related BrainMass Solutions

  • Induction and Set theory : Union and Pairwise Disjoint Finite Sets

    54868 Induction & Set Theory: Union & Pairwise Disjoint Finite Sets Proposition 10.2.1: (the addition principle) Suppose that X and Y are disjoint finite sets. Then X U Y is finite and |X U Y| = |X| + |Y|.

  • Proof about union and cardinalities

    It helps prove that finite sets are pairwise-dispoint and that an intersection is a finite set. Step by step calculations are given.

  • Set Theory Proofs : Addition Principle

    54869 Set Theory Proofs: Addition Principle Let X and Y be finite sets. a) Suppose the X C Y and |X| = |Y|. Use 10.2.1 to prove X =Y. b)... Theorem 10.2.1 (The adddition principle): Suppose that X and Y are disjoint finite sets.

  • pairwise disjoint sets

    b) By definition of pairwise disjoint sets, (A1)U(A2)U(A3) = (empty set)U(A3) = empty set which has 0 elements. This solution contextualizes pairwise disjoint sets.

  • Show that the product of two step functions is a step function

    This is clearly a finite sum (with n^2 terms), and it remains to show that for each pair (k, l) , 1< k, l < n, sets of the form A_k x B_l are disjoint.

  • Probabilities and Set Theory

    We use the fact since , and are pairwise disjoint, we can get this equality by mathematical induction easily. Proofs are provided for proabilities expressed with set theory. The solution is detailed and well presented.

  • Set Sizes

    b) the sets are pairwise disjoint. c) there are two elements common to each pair of sets and one element in all three sets. Please see the attachment for solution.

  • Examining Proof about Cardinality

    Then X U Y is finite and # (X U Y) is less than or equal to #(X) + #(Y). If in addition X and Y are disjoint (i.e., X intersection Y = the empty set), then #(X U Y)= #(X) + #(Y) c) Let X be a finite set, and let Y be a subset of X.

  • Finite or countable collection of disjoint open intervals and Cantor sets.

    Finite or countable collection of disjoint open intervals and Cantor sets are investigated. The solution is detailed and well presented.

View More Related Solutions