SETS

A set is a well-defined collection of distinct objects (elements).

  1. Notation

    • Sets are denoted by capital letters (e.g., AA), elements by lowercase (e.g., aa).

    • Curly braces {} enclose elements.

    • \in means "is an element of," <br>otin<br>otin means "is not an element of."

    • Example: If A=1,2,3A = {1, 2, 3}, then 1A1 \in A and 4A4 \notin A.

  2. Ways to Describe Sets

    • Roster Method: Listing all elements (e.g., E=2,4,6,8E = {2, 4, 6, 8}).

      • Example Problem: Express the set of vowels in the English alphabet using the Roster Method.

        • Solution: V=a,e,i,o,uV = {a, e, i, o, u}.

    • Set-Builder Notation: Describing element properties (e.g., A=xx is an integer and 1x5\text{A} = {x \mid x \text{ is an integer and } 1 \le x \le 5}).

      • Example Problem: Express the set of all positive even integers using Set-Builder Notation.

        • Solution: \text{P} = {x \mid x \text{ is an even integer and } x > 0}. or P = {2n \mid n \in \mathbb{Z}, n > 0}.

  3. Special Sets

    • Empty Set (\emptyset or {}): Contains no elements.

      • Example Problem: What is the set of all prime numbers divisible by 4?

        • Solution: This is an empty set, written as \emptyset or {} because no prime number is divisible by 4.

    • Universal Set (U): All possible elements under consideration.

    • Singleton Set: Contains exactly one element (e.g., 5{ {5} }).

  4. Cardinality of a Set

    • The number of distinct elements in a set, denoted by A\Vert A\Vert or n(A)n(A).

    • Example: If A=a,b,c,dA = {a, b, c, d}, then A=4\Vert A\Vert = 4.

    • Example Problem: Find the cardinality of the set S=xx is a day of the weekS = {x \mid x \text{ is a day of the week}}.

      • Solution: S=7\Vert S\Vert = 7.

  5. Types of Sets by Cardinality

    • Finite Set: Definite, countable number of elements (e.g., days in a week).

    • Infinite Set: Unlimited number of elements (e.g., natural numbers N\mathbb{N}).

  6. Equality of Sets

    • A=BA = B if they contain the same elements, regardless of order or duplicates.

    • Example: 1,2,3=3,1,2{1, 2, 3} = {3, 1, 2}.

    • Example Problem: Are the sets X=red,blue,greenX = {red, blue, green} and Y=green,red,blueY = {green, red, blue} equal?

      • Solution: Yes, X=YX = Y because they contain the exact same elements.

  7. Subsets and Supersets

    • Subset (\subseteq): Every element of AA is in BB (e.g., 1,21,2,3{1, 2} \subseteq {1, 2, 3}).

      • Example Problem: Given A=a,bA = {a, b} and B=a,b,cB = {a, b, c}, is ABA \subseteq B?

        • Solution: Yes, because all elements of AA (a,ba, b) are also in BB.

    • Proper Subset (\subset): ABA \subseteq B but ABA \ne B (e.g., 1,21,2,3{1, 2} \subset {1, 2, 3}).

      • Example Problem: Using the sets A=a,bA = {a, b} and B=a,b,cB = {a, b, c}, is ABA \subset B?

        • Solution: Yes, because ABA \subseteq B and BB contains an element (cc) not in AA.

    • Superset (\supseteq): If ABA \subseteq B, then BAB \supseteq A.

    • Proper Superset (\supset): If ABA \subset B, then BAB \supset A.

  8. Set Operations

    • Union (ABA \cup B): Elements in AA, BB, or both (e.g., 1,2,33,4,5=1,2,3,4,5{1,2,3} \cup {3,4,5} = {1,2,3,4,5}).

      • Example Problem: If S<em>1=dog,catS<em>1 = {dog, cat} and S</em>2=cat,birdS</em>2 = {cat, bird}, find S<em>1S</em>2S<em>1 \cup S</em>2.

        • Solution: S<em>1S</em>2=dog,cat,birdS<em>1 \cup S</em>2 = {dog, cat, bird}.

    • Intersection (ABA \cap B): Elements common to both AA and BB (e.g., 1,2,33,4,5=3{1,2,3} \cap {3,4,5} = {3}).

      • Example Problem: If S<em>1=dog,catS<em>1 = {dog, cat} and S</em>2=cat,birdS</em>2 = {cat, bird}, find S<em>1S</em>2S<em>1 \cap S</em>2.

        • Solution: S<em>1S</em>2=catS<em>1 \cap S</em>2 = {cat}.

    • Set Difference (ABA - B or ABA \setminus B): Elements in AA but not in BB (e.g., 1,2,33,4,5=1,2{1,2,3} - {3,4,5} = {1,2}).

      • Example Problem: If S<em>1=dog,catS<em>1 = {dog, cat} and S</em>2=cat,birdS</em>2 = {cat, bird}, find S<em>1S</em>2S<em>1 - S</em>2.

        • Solution: S<em>1S</em>2=dogS<em>1 - S</em>2 = {dog}.

    • Complement (AA' or Aˉ\bar{A}): All elements in the universal set UU that are not in AA.

      • Example Problem: If the universal set U=1,2,3,4,5U = {1, 2, 3, 4, 5} and A=1,3,5A = {1, 3, 5}, find </p></li></ul></li></ul></li></ol><h5collapsed="false"seolevelmigrated="true">Experiments</h5><p>Anexperimentisaprocessthatresultsinanoutcomethatcannotbepredictedwithcertainty.Itisaprocedurethatcanberepeatedunderthesameconditions,anditsoutcomeisoneofseveralpossibleresults.</p><h5collapsed="false"seolevelmigrated="true">SampleSpaces</h5><h6collapsed="false"seolevelmigrated="true">Definition</h6><p>Thesamplespace,denotedby</p></li></ul></li></ul></li></ol><h5 collapsed="false" seolevelmigrated="true">Experiments</h5><p>An experiment is a process that results in an outcome that cannot be predicted with certainty. It is a procedure that can be repeated under the same conditions, and its outcome is one of several possible results.</p><h5 collapsed="false" seolevelmigrated="true">Sample Spaces</h5><h6 collapsed="false" seolevelmigrated="true">Definition</h6><p>The sample space, denoted bySoror\Omega,isthesetofallpossibleoutcomesofarandomexperiment.</p><h6collapsed="false"seolevelmigrated="true">Properties</h6><ul><li><p>Eachoutcomeinthesamplespaceiscalledasamplepointorelement.</p></li><li><p>Thesamplespacecanbefiniteorinfinite.</p></li></ul><h6collapsed="false"seolevelmigrated="true">Examples</h6><ul><li><p><strong>Tossingacoinonce</strong>:, is the set of all possible outcomes of a random experiment.</p><h6 collapsed="false" seolevelmigrated="true">Properties</h6><ul><li><p>Each outcome in the sample space is called a sample point or element.</p></li><li><p>The sample space can be finite or infinite.</p></li></ul><h6 collapsed="false" seolevelmigrated="true">Examples</h6><ul><li><p><strong>Tossing a coin once</strong>:S = {\text{Head, Tail}}</p></li><li><p><strong>Rollingasixsideddieonce</strong>:</p></li><li><p><strong>Rolling a six-sided die once</strong>:S = {1, 2, 3, 4, 5, 6}</p></li><li><p><strong>Tossingtwocoins</strong>:</p></li><li><p><strong>Tossing two coins</strong>:S = {\text{(H,H), (H,T), (T,H), (T,T)}}</p></li></ul><h5collapsed="false"seolevelmigrated="true">Events</h5><h6collapsed="false"seolevelmigrated="true">Definition</h6><p>Anevent,denotedbyacapitalletter(e.g.,</p></li></ul><h5 collapsed="false" seolevelmigrated="true">Events</h5><h6 collapsed="false" seolevelmigrated="true">Definition</h6><p>An event, denoted by a capital letter (e.g.,A,,B,,E),isanysubsetofthesamplespace.Itisacollectionofspecificoutcomesofanexperiment.</p><h6collapsed="false"seolevelmigrated="true">TypesofEvents</h6><ul><li><p><strong>SimpleEvent</strong>:Aneventcontainingexactlyoneoutcome(e.g.,rollinga3onadie,), is any subset of the sample space. It is a collection of specific outcomes of an experiment.</p><h6 collapsed="false" seolevelmigrated="true">Types of Events</h6><ul><li><p><strong>Simple Event</strong>: An event containing exactly one outcome (e.g., rolling a 3 on a die,E = {3}).</p></li><li><p><strong>CompoundEvent</strong>:Aneventcontainingmorethanoneoutcome(e.g.,rollinganevennumberonadie,).</p></li><li><p><strong>Compound Event</strong>: An event containing more than one outcome (e.g., rolling an even number on a die,E = {2, 4, 6}).</p></li><li><p><strong>ImpossibleEvent</strong>:Aneventthatcontainsnooutcomes(i.e.,theemptyset).</p></li><li><p><strong>Impossible Event</strong>: An event that contains no outcomes (i.e., the empty set\emptyset).</p></li><li><p><strong>CertainEvent</strong>:Aneventthatcontainsalloutcomesinthesamplespace(i.e.,thesamplespace).</p></li><li><p><strong>Certain Event</strong>: An event that contains all outcomes in the sample space (i.e., the sample spaceSitself).</p></li></ul><h6collapsed="false"seolevelmigrated="true">Examples</h6><ul><li><p><strong>Rollingasixsideddie</strong>:Letitself).</p></li></ul><h6 collapsed="false" seolevelmigrated="true">Examples</h6><ul><li><p><strong>Rolling a six-sided die</strong>: LetS = {1, 2, 3, 4, 5, 6}</p><ul><li><p>Event</p><ul><li><p>EventA:Rollinganevennumber.: Rolling an even number.A = {2, 4, 6}</p></li><li><p>Event</p></li><li><p>EventB:Rollinganumbergreaterthan4.: Rolling a number greater than 4.B = {5, 6}</p></li><li><p>Event</p></li><li><p>EventC:Rollinga1.: Rolling a 1.C = {1}</p></li></ul></li></ul><p>Asetisawelldefinedcollectionofdistinctobjects(elements).1.NotationSetsaredenotedbycapitalletters(e.g.,</p></li></ul></li></ul><p>A set is a well-defined collection of distinct objects (elements). 1. Notation - Sets are denoted by capital letters (e.g.,A),elementsbylowercase(e.g.,), elements by lowercase (e.g.,a).Curlybraces). - Curly braces{}encloseelements.enclose elements. -\inmeans"isanelementof,"means "is an element of,"\notinmeans"isnotanelementof."Example:Ifmeans "is not an element of." - Example: IfA = {1, 2, 3},then, then1 \in Aandand4 \notin A.2.WaystoDescribeSetsRosterMethod:Listingallelements(e.g.,. 2. Ways to Describe Sets - **Roster Method:** Listing all elements (e.g.,E = {2, 4, 6, 8}).ExampleProblem:ExpressthesetofvowelsintheEnglishalphabetusingtheRosterMethod.Solution:). - **Example Problem:** Express the set of vowels in the English alphabet using the Roster Method. - **Solution:**V = {a, e, i, o, u}.SetBuilderNotation:Describingelementproperties(e.g.,. - **Set-Builder Notation:** Describing element properties (e.g.,\text{A} = {x \mid x \text{ is an integer and } 1 \le x \le 5}).ExampleProblem:ExpressthesetofallpositiveevenintegersusingSetBuilderNotation.Solution:). - **Example Problem:** Express the set of all positive even integers using Set-Builder Notation. - **Solution:**\text{P} = {x \mid x \text{ is an even integer and } x > 0}.or. orP = {2n \mid n \in \mathbb{Z}, n > 0}.3.SpecialSetsEmptySet(. 3. Special Sets - **Empty Set (\emptysetoror{}):Containsnoelements.ExampleProblem:Whatisthesetofallprimenumbersdivisibleby4?Solution:Thisisanemptyset,writtenas):** Contains no elements. - **Example Problem:** What is the set of all prime numbers divisible by 4? - **Solution:** This is an empty set, written as\emptysetoror{}becausenoprimenumberisdivisibleby4.UniversalSet(U):Allpossibleelementsunderconsideration.SingletonSet:Containsexactlyoneelement(e.g.,because no prime number is divisible by 4. - **Universal Set (U):** All possible elements under consideration. - **Singleton Set:** Contains exactly one element (e.g., { {5} } ).4.CardinalityofaSetThenumberofdistinctelementsinaset,denotedby). 4. Cardinality of a Set - The number of distinct elements in a set, denoted by\Vert A\Vertororn(A).Example:If. - Example: IfA = {a, b, c, d},then, then\Vert A\Vert = 4.!ExampleProblem:!Findthecardinalityoftheset. - *!Example Problem:*! Find the cardinality of the setS = {x \mid x \text{ is a day of the week}}.Solution:. - **Solution:**\Vert S\Vert = 7.5.TypesofSetsbyCardinalityFiniteSet:Definite,countablenumberofelements(e.g.,daysinaweek).InfiniteSet:Unlimitednumberofelements(e.g.,naturalnumbers. 5. Types of Sets by Cardinality - **Finite Set:** Definite, countable number of elements (e.g., days in a week). - **Infinite Set:** Unlimited number of elements (e.g., natural numbers\mathbb{N}).6.EqualityofSets). 6. Equality of Sets -A = Biftheycontainthesameelements,regardlessoforderorduplicates.Example:if they contain the same elements, regardless of order or duplicates. - Example:{1, 2, 3} = {3, 1, 2}.ExampleProblem:Arethesets. - **Example Problem:** Are the setsX = {red, blue, green}andandY = {green, red, blue}equal?Solution:Yes,equal? - **Solution:** Yes,X = Ybecausetheycontaintheexactsameelements.7.SubsetsandSupersetsSubset(because they contain the exact same elements. 7. Subsets and Supersets - **Subset (\subseteq):Everyelementof):** Every element ofAisinis inB(e.g.,(e.g.,{1, 2} \subseteq {1, 2, 3}).ExampleProblem:Given). - **Example Problem:** GivenA = {a, b}andandB = {a, b, c},is, isA \subseteq B?Solution:Yes,becauseallelementsof? - **Solution:** Yes, because all elements ofA((a, b)arealsoin) are also inB.ProperSubset(. - **Proper Subset (\subset):):**A \subseteq BbutbutA \ne B(e.g.,(e.g.,{1, 2} \subset {1, 2, 3}).ExampleProblem:Usingthesets). - **Example Problem:** Using the setsA = {a, b}andandB = {a, b, c},is, isA \subset B?Solution:Yes,because? - **Solution:** Yes, becauseA \subseteq BandandBcontainsanelement(contains an element (c)notin) not inA.Superset(. - **Superset (\supseteq):If):** IfA \subseteq B,then, thenB \supseteq A.ProperSuperset(. - **Proper Superset ($\supset):If):** IfA \subset B,then, thenB \supset A.8.SetOperationsUnion(. 8. Set Operations - **Union (A \cup B):Elementsin):** Elements inA,,B,orboth(e.g.,, or both (e.g.,{1,2,3} \cup {3,4,5} = {1,2,3,4,5}).ExampleProblem:If). - **Example Problem:** IfS1 = {dog, cat}andandS2 = {cat, bird},find, findS1 \cup S2.Solution:. - **Solution:**S1 \cup S2 = {dog, cat, bird}.Intersection(. - **Intersection (A \cap B):Elementscommontoboth):** Elements common to bothAandandB(e.g.,(e.g.,{1,2,3} \cap {3,4,5} = {3}).ExampleProblem:If). - **Example Problem:** IfS1 = {dog, cat}andandS2 = {cat, bird},find, findS1 \cap S2.Solution:. - **Solution:**S1 \cap S2 = {cat}.SetDifference(. - **Set Difference (A - BororA \setminus B):Elementsin):** Elements inAbutnotinbut not inB(e.g.,(e.g.,{1,2,3} - {3,4,5} = {1,2}).ExampleProblem:If). - **Example Problem:** IfS1 = {dog, cat}andandS2 = {cat, bird},find, findS1 - S2.Solution:. - **Solution:**S1 - S2 = {dog}.Complement(. - **Complement (A'oror\bar{A}):Allelementsintheuniversalset):** All elements in the universal setUthatarenotinthat are not inA.ExampleProblem:Iftheuniversalset. - **Example Problem:** If the universal setU = {1, 2, 3, 4, 5}andandA = {1, 3, 5},find, findA'.Solution:. - **Solution:**A' = {2, 4}. ### Experiments
        An experiment is a process that results in an outcome that cannot be predicted with certainty. It is a procedure that can be repeated under the same conditions, and its outcome is one of several possible results. ### Sample Spaces

        Definition

        The sample space, denoted by Soror\Omega, is the set of all possible outcomes of a random experiment. ##### Properties

        • Each outcome in the sample space is called a sample point or element.

        • The sample space can be finite or infinite. ##### Examples

        • **Tossing a coin once**: S = {\text{Head, Tail}}</p></li><li><p>Rollingasixsideddieonce:</p></li><li><p>**Rolling a six-sided die once**:S = {1, 2, 3, 4, 5, 6}</p></li><li><p>Tossingtwocoins:</p></li><li><p>**Tossing two coins**:S = {\text{(H,H), (H,T), (T,H), (T,T)}} ### Events

        Definition

        An event, denoted by a capital letter (e.g., A,,B,,E), is any subset of the sample space. It is a collection of specific outcomes of an experiment. ##### Types of Events

        • **Simple Event**: An event containing exactly one outcome (e.g., rolling a 3 on a die, E = {3}).</p></li><li><p>CompoundEvent:Aneventcontainingmorethanoneoutcome(e.g.,rollinganevennumberonadie,).</p></li><li><p>**Compound Event**: An event containing more than one outcome (e.g., rolling an even number on a die,E = {2, 4, 6}).</p></li><li><p>ImpossibleEvent:Aneventthatcontainsnooutcomes(i.e.,theemptyset).</p></li><li><p>**Impossible Event**: An event that contains no outcomes (i.e., the empty set\emptyset).</p></li><li><p>CertainEvent:Aneventthatcontainsalloutcomesinthesamplespace(i.e.,thesamplespace).</p></li><li><p>**Certain Event**: An event that contains all outcomes in the sample space (i.e., the sample spaceS itself). ##### Examples

        • **Rolling a six-sided die**: Let S = {1, 2, 3, 4, 5, 6}Event- EventA:Rollinganevennumber.: Rolling an even number.A = {2, 4, 6}Event- EventB:Rollinganumbergreaterthan4.: Rolling a number greater than 4.B = {5, 6}Event- EventC:Rollinga1.: Rolling a 1.C = {1} ### Probability

        Definition

        Probability is a numerical measure of the likelihood of an event occurring. It is a value between 0 and 1, inclusive, where 0 indicates impossibility and 1 indicates certainty.

        Classical Probability

        For an event Einasamplespacein a sample spaceSwithequallylikelyoutcomes,theprobabilityofwith equally likely outcomes, the probability ofEisgivenbytheformula:<br>is given by the formula:<br>P(E) = \frac{\text{Number of favorable outcomes (in E)}}{\text{Total number of possible outcomes (in S)}}</p><h6collapsed="false"seolevelmigrated="true">Properties</h6><ul><li><p>Theprobabilityofanyevent</p><h6 collapsed="false" seolevelmigrated="true">Properties</h6><ul><li><p>The probability of any eventEisbetween0and1:is between 0 and 1:0 \le P(E) \le 1</p></li><li><p>Thesumofprobabilitiesofallpossibleoutcomesinasamplespaceis1.</p></li><li><p>Theprobabilityofanimpossibleeventis0:</p></li><li><p>The sum of probabilities of all possible outcomes in a sample space is 1.</p></li><li><p>The probability of an impossible event is 0:P(\emptyset) = 0</p></li><li><p>Theprobabilityofacertainevent(thesamplespace</p></li><li><p>The probability of a certain event (the sample spaceS)is1:) is 1:P(S) = 1</p></li></ul><h6collapsed="false"seolevelmigrated="true">ExampleProblem</h6><p>Whatistheprobabilityofrollinganevennumberwhenafairsixsideddieisrolledonce?</p><h6collapsed="false"seolevelmigrated="true">Solution</h6><ul><li><p>Thesamplespaceis</p></li></ul><h6 collapsed="false" seolevelmigrated="true">Example Problem</h6><p>What is the probability of rolling an even number when a fair six-sided die is rolled once?</p><h6 collapsed="false" seolevelmigrated="true">Solution</h6><ul><li><p>The sample space isS = {1, 2, 3, 4, 5, 6},sothetotalnumberofoutcomesis, so the total number of outcomes is\Vert S\Vert = 6.</p></li><li><p>Theeventofrollinganevennumberis.</p></li><li><p>The event of rolling an even number isE = {2, 4, 6},sothenumberoffavorableoutcomesis, so the number of favorable outcomes is\Vert E\Vert = 3.</p></li><li><p>Theprobabilityis.</p></li><li><p>The probability isP(E) = \frac{3}{6} = \frac{1}{2} = 0.5$$.