Course Logistics, Set Theory, and Set Operations Study Guide

Course Structure, Grading, and Administrative Policies

  • Class Format and Schedule:

    • The course is a hybrid model comprising 4 hours4\,\text{hours} of in-person instruction and 3 hours3\,\text{hours} of independent online study per week.
    • In-person sessions take place twice per week: Mondays (2 hours2\,\text{hours}) and Wednesdays (2 hours2\,\text{hours}).
    • The in-person sessions compress a traditional 7 hour7\,\text{hour} lecture schedule into 4 hours4\,\text{hours} by proceeding at an accelerated pace, supplemented with targeted exercises, practice problems, and examples.
  • Online Work Requirements:

    • Students do not need to read new course material or learn new topics independently online from scratch; all foundational concepts are taught during in-person lectures.
    • Required online tasks on Brightspace consist exclusively of homework assignments, quizzes, bonus assignments, and submission of designated coursework.
  • Official Communication Policy:

    • Students must communicate with the instructor exclusively using their official Kingsborough Community College (KBCC\text{KBCC}) email account.
    • Personal email accounts (such as Gmail) will not receive responses regarding grades, exam scores, or student records due to identity verification and privacy policies.
  • Course Materials and Booklet:

    • Purchasing the official textbook (which costs approximately $60.00\$60.00 to $70.00\$70.00, or over $100.00\$100.00) is strictly unnecessary.
    • A physical booklet and syllabus are distributed directly to students in class; students must sign their initials next to their name on the roster when receiving them.
    • Students must bring this booklet to every class session. If lost, material must be printed from home via Brightspace.
  • Brightspace Learning Management System:

    • Students can access the Content section on Brightspace to view instructional videos covering specific units and review modules.
  • Assignments and Bonus Points:

    • Homework: Three main homework assignments are assigned online via Brightspace. Homework 1 opens immediately at the start of the term. Students can save their progress mid-assignment and return later. The final submission deadline for Homework 1 is Sunday, October 7 (extended until right before the Monday class session).
    • Bonus Assignment: A single online bonus assignment worth up to 10 points10\,\text{points} is offered per semester.
    • Points earned are added directly to the student's lowest midterm exam score.
    • Submission deadline: September 29.
    • Students are advised to wait 77 to 10 days10\,\text{days} until relevant course material is covered in class before submitting.
    • No additional extra credit or grade-boosting requests are permitted at the end of the term in December.
  • Exams and Testing Schedule:

    • Midterm Exams: Three midterm examinations will be administered in the classroom. Each midterm consists of either 2020 or 2525 multiple-choice questions.
    • Test 1 Schedule: Test 1 takes place on Tuesday, October 13 (which follows a Monday schedule). A comprehensive review is conducted during the first hour of class on the day of the test, followed immediately by the exam during the second hour.
    • Final Exam: The final exam takes place on Wednesday, December 9. It is a 2 hour2\,\text{hour} cumulative test consisting of 3030 multiple-choice questions.
    • Exam Reviews: Three midterm exam reviews and final exam review materials/videos are provided online and in class.
  • Scientific Calculator Policy and Guidance:

    • A scientific calculator is strictly required for class exercises and examinations.
    • Option 1 (Basic Scientific): Inexpensive, but does not calculate exact simplified radicals directly (outputs standard decimal approximations instead, requiring manual matching to multiple-choice options).
    • Option 2 (Intermediate Scientific): Acceptable performance and functional capabilities.
    • Option 3 (Casio Scientific): Highly recommended as the best choice. It is affordable, user-friendly, and directly displays exact simplified radical expressions matching exam choices.
    • Graphing Calculators: Permitted if already owned, but not recommended due to complex nested menus that obscure basic algebra, probability, and statistics functions. Instructor assistance for graphing models is limited.
    • An instructional video covering five different calculator models is provided online.
  • Accommodations and Academic Integrity:

    • Accommodations: Students requiring special accommodations must email official documentation promptly to receive timed extensions on the online bonus assignment (homework assignments are untimed).
    • Academic Integrity: Cheating is strictly prohibited and monitored. Fabricated excuses for missed deadlines or extensions (e.g., personal stories or car accidents) are discouraged in favor of direct communication.

Fundamentals of Set Theory

  • Definition of a Set:

    • A set is defined as a well-defined collection of distinct elements.
    • Sets are named using uppercase capital letters (e.g., AA, BB, WW).
    • Elements within a set are enclosed inside curly brackets {}\{\}.
  • Three Methods of Representing Sets:

    1. Description Method: Describes the elements of the set using plain words.
    • Example: Set AA is the set of letters in the English alphabet.
    1. Roster Method: Explicitly lists all elements or shows a clear sequential pattern enclosed in curly brackets.
    • Ellipses (…\dots) are used to indicate omitted elements that follow an established pattern.
    • Example 1: A={a,b,c,…,x,y,z}A = \{a, b, c, \dots, x, y, z\} (represents all 2626 letters of the English alphabet).
    • Example 2: W={0,1,2,3,… }W = \{0, 1, 2, 3, \dots\} (represents the set of whole numbers).
    1. Set-Builder Notation: Represents sets using symbolic mathematical conditions and variables.
    • Format: A={x∣x is a letter of the English alphabet}A = \{x \mid x \text{ is a letter of the English alphabet}\}.
    • The vertical bar symbol ∣\mid is read as "such that".
  • Classification of Sets:

    • Finite Set: A set containing an exact, fixed, and countable number of elements with a clear beginning and end.
    • Example: Set A={a,b,c,…,z}A = \{a, b, c, \dots, z\} contains exactly 2626 elements.
    • Infinite Set: A set containing an endless, uncountably infinite number of elements.
    • Example: Set W={0,1,2,3,… }W = \{0, 1, 2, 3, \dots\} continues indefinitely toward infinity (∞\infty).
  • Cardinality of a Set:

    • The cardinal number or cardinality of a set AA, denoted as n(A)n(A), represents the total number of distinct elements contained within the set.
    • Example 1: For set A={a,b,c,…,z}A = \{a, b, c, \dots, z\}, n(A)=26n(A) = 26.
    • Example 2: For set W={0,1,2,3,… }W = \{0, 1, 2, 3, \dots\}, n(W)=∞n(W) = \infty (infinite cardinality).
    • Example 3: For a class attendance roster listing 2929 student names, n(Roster)=29n(\text{Roster}) = 29.

Mathematical Analysis of Sets and Inequality Conditions

  • Rules for Inequality Symbols in Set-Builder Notation:

    • Inclusive inequality symbols (≤\le or ≥\ge) contain an equal sign; the boundary number must be included in the set if it satisfies set parameters.
    • Strict inequality symbols (<< or >>) do not contain an equal sign; the boundary number must be excluded from the set.
  • Evaluated Set Examples:

    • Example 1: Find n(B)n(B) for set B={x∣x is an odd number and 3≤x<9}B = \{x \mid x \text{ is an odd number and } 3 \le x < 9\}.
    • Analyze boundaries: Include 33 (due to ≤\le); exclude 99 (due to <<).
    • Filter odd numbers in range: 3,5,73, 5, 7.
    • Roster form: B={3,5,7}B = \{3, 5, 7\}.
    • Cardinality: n(B)=3n(B) = 3.
    • Example 2: Find n(C)n(C) for set C={x∣x is an even number and 3<x<11}C = \{x \mid x \text{ is an even number and } 3 < x < 11\}.
    • Analyze boundaries: Exclude 33 and exclude 1111 (no equal signs).
    • Filter even numbers in range starting after 33: 4,6,8,104, 6, 8, 10.
    • Roster form: C={4,6,8,10}C = \{4, 6, 8, 10\}.
    • Cardinality: n(C)=4n(C) = 4.
    • Example 3: Word Description to Roster Conversion: "Set of natural numbers greater than 99".
    • Definition of natural numbers: Positive integers starting at 11 (1,2,3,4,…1, 2, 3, 4, \dots).
    • Natural numbers greater than 99: Starts at 1010 and continues indefinitely (10,11,12,13,…10, 11, 12, 13, \dots).
    • Note: "Natural numbers less than 1414" is incorrect because it includes 1,2,3,4,5,6,7,8,91, 2, 3, 4, 5, 6, 7, 8, 9.
    • Example 4: Natural numbers between 00 and 44.
    • Word "between" excludes boundary values 00 and 4$.\n * Elements between 0andand4: \{1, 2, 3}\\n * Cardinality: 3.\n * **Example 5**: Find n(B)forsetfor setB = {x \mid x \text{ is a natural number and } 1 \le x < 9}.\n * Included elements: 1, 2, 3, 4, 5, 6, 7, 8(exclude(exclude9).\n * Cardinality: n(B) = 8.\n * **Example 6**: Classify set S = {x \mid x \text{ is a natural number and } x \ge 100}.\n * Included elements: 100, 101, 102, 103, \dots.\n * Classification: Infinite set.\n\n# Set Relationships, Membership, and Special Sets\n\n* **Equal Sets vs. Equivalent Sets**:\n * **Equal Sets** (=): Sets that contain the exact same elements. Element order does not affect equality.\n * *Example*: Set D = {1, 3, 5}andsetand setE = {3, 1, 5}areequal(are equal (D = E).\n * If F = {1, 2, 3},then, thenD eq Fbecauseelementbecause element5ismissingfromis missing fromFandand2ismissingfromis missing fromD$.
    • Equivalent Sets (∼\sim): Sets that have the exact same cardinal number (n(A)=n(B)n(A) = n(B)), regardless of whether their elements are identical.
    • Example: If set A={a,b,c,d}A = \{a, b, c, d\} (n(A)=4n(A) = 4) and set B={1,2,3,4}B = \{1, 2, 3, 4\} (n(B)=4n(B) = 4), set AA and set BB are equivalent.
  • The Empty Set (Null Set):

    • An empty set is a unique set that contains zero elements (n=0n = 0).
    • Represented symbolically by ∅\emptyset or empty curly brackets {}\{\}.
    • Critical Distinction: The set {0}\{0\} is not empty because it contains one element (the symbol 00), giving it a cardinality of 11. Similarly, J={0}\text{J} = \{0\} is not empty, whereas K={}\text{K} = \{\} is empty.
  • Set Membership Symbols:

    • Belonging symbol ∈\in: Indicates that an element is a member of a specified set.
    • Non-belonging symbol ∉\notin: Indicates that an element is not a member of a specified set.
    • Example 1: 7∈{1,2,3,…,15}7 \in \{1, 2, 3, \dots, 15\} is True.
    • Example 2: The statement 3∉{x∣x is an odd natural number}3 \notin \{x \mid x \text{ is an odd natural number}\} is False, because 33 is an odd natural number (1,3,5,7,…1, 3, 5, 7, \dots).
  • Word Elements vs. Individual Character Sets:

    • For set B={"seven"}B = \{\text{"seven"}\} containing the single word "seven", n(B) = 1$.\n * For a set containing individual character elements {s, e, v, e, n},distinctuniqueelementsare, distinct unique elements are{s, e, v, n},givingacardinalityof, giving a cardinality of4$.

Universal Sets and Subsets

  • Universal Set:

    • Symbolized as UU.
    • Represents the comprehensive master set containing all possible elements under consideration in a specific problem or context.
  • Subsets:

    • A set BB is a subset of set AA (written B⊆AB \subseteq A) if every element contained in BB is also present in A$.\n * The empty set \emptyset is a subset of every set.\n * Every set is a subset of itself.\n\n* **Systematic Method for Building Subsets**:\n * Given universal set A = {1, 2, 3}:\n * 0\text{-element subset}::\emptyset\n * 1\text{-element subsets}::{1}, {2}, {3}\n * 2\text{-element subsets}::{1, 2}, {1, 3}, {2, 3}\n * 3\text{-element subset}::{1, 2, 3}\n * Total number of subsets = 8(calculatedviaformula(calculated via formula2^n = 2^3 = 8).\n\n# Set Operations and Venn Diagrams\n\n* **Three Fundamental Set Operations**:\n 1. **Union** (\cup):\n * Combines all elements from two or more sets into one single set (duplicate elements are written only once).\n * Conceptually represents "OR" / putting elements together.\n 2. **Intersection** (\cap):\n * Identifies only the shared or overlapping elements common to both sets.\n * Conceptually represents "AND" / common elements.\n 3. **Complement** ('oror^c):\n * Identifies all elements in the universal set U that are **not** present in the specified set.\n * Conceptually represents "NOT" / excluding the set from the universal set.\n\n* **Step-by-Step Worked Example with Universal Set**:\n * Given Universal Set U = {1, 2, 3, 4, 5},Set, SetA = {1, 2, 3, 5},Set, SetB = {2, 3, 4, 5}:\n * **Union** (A \cup B):\n * Combine elements from AandandB::{1, 2, 3, 4, 5}(matches(matchesU).\n * **Intersection** (A \cap B):\n * Shared elements present in both AandandB::{2, 3, 5}.\n * **Complement of A∗∗(** (A'):\n * Remove elements of A((1, 2, 3, 5)from) fromU((1, 2, 3, 4, 5):):A' = {4}.\n * **Complement of Union** ((A \cup B)'):\n * Find A \cup B = {1, 2, 3, 4, 5}.\n * Remove all elements of A \cup BfromfromU::(A \cup B)' = \emptyset (Empty set).\n * **Complement of Intersection** ((A \cap B)'):\n * Find A \cap B = {2, 3, 5}.\n * Remove {2, 3, 5}fromfromU::(A \cap B)' = {1, 4}.\n\n* **Venn Diagram Interpretations**:\n * Consider a Venn diagram with Universal Set U = {a, b, c, d, e, f},whereCircle, where CircleAcontainscontains{a, b, c},Circle, CircleBcontainscontains{c, d},commonoverlappingregioncontains, common overlapping region contains{c},andoutsidespacecontains, and outside space contains{e, f}:\n * A \cup B = {a, b, c, d}\n * A \cap B = {c}\n * A' = {d, e, f}(Covercircle(Cover circleA and list all remaining elements)\n * B' = {a, e, f}(Covercircle(Cover circleB and list all remaining elements)\n * (A \cap B)' = {a, b, d, e, f}(Everythingin(Everything inUexceptoverlappingelementexcept overlapping elementc)\n * *Evaluation Example with Letter Sets*:\n * Given Set Bcontainingletterscontaining letters{q, s, y},matchingoptionsmuststrictlypreservethoseelementswhileexcludingnon−members(suchas, matching options must strictly preserve those elements while excluding non-members (such aszororr$$).