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 of in-person instruction and of independent online study per week.
- In-person sessions take place twice per week: Mondays () and Wednesdays ().
- The in-person sessions compress a traditional lecture schedule into 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 () 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 to , or over ) 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 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 to 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 or 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 cumulative test consisting of 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., , , ).
- Elements within a set are enclosed inside curly brackets .
Three Methods of Representing Sets:
- Description Method: Describes the elements of the set using plain words.
- Example: Set is the set of letters in the English alphabet.
- Roster Method: Explicitly lists all elements or shows a clear sequential pattern enclosed in curly brackets.
- Ellipses () are used to indicate omitted elements that follow an established pattern.
- Example 1: (represents all letters of the English alphabet).
- Example 2: (represents the set of whole numbers).
- Set-Builder Notation: Represents sets using symbolic mathematical conditions and variables.
- Format: .
- The vertical bar symbol 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 contains exactly elements.
- Infinite Set: A set containing an endless, uncountably infinite number of elements.
- Example: Set continues indefinitely toward infinity ().
Cardinality of a Set:
- The cardinal number or cardinality of a set , denoted as , represents the total number of distinct elements contained within the set.
- Example 1: For set , .
- Example 2: For set , (infinite cardinality).
- Example 3: For a class attendance roster listing student names, .
Mathematical Analysis of Sets and Inequality Conditions
Rules for Inequality Symbols in Set-Builder Notation:
- Inclusive inequality symbols ( or ) 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 for set .
- Analyze boundaries: Include (due to ); exclude (due to ).
- Filter odd numbers in range: .
- Roster form: .
- Cardinality: .
- Example 2: Find for set .
- Analyze boundaries: Exclude and exclude (no equal signs).
- Filter even numbers in range starting after : .
- Roster form: .
- Cardinality: .
- Example 3: Word Description to Roster Conversion: "Set of natural numbers greater than ".
- Definition of natural numbers: Positive integers starting at ().
- Natural numbers greater than : Starts at and continues indefinitely ().
- Note: "Natural numbers less than " is incorrect because it includes .
- Example 4: Natural numbers between and .
- Word "between" excludes boundary values and 4$.\n * Elements between 04: \{1, 2, 3}\\n * Cardinality: 3.\n * **Example 5**: Find n(B)B = {x \mid x \text{ is a natural number and } 1 \le x < 9}.\n * Included elements: 1, 2, 3, 4, 5, 6, 7, 89).\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}E = {3, 1, 5}D = E).\n * If F = {1, 2, 3}D eq F5F2D$.
- Equivalent Sets (): Sets that have the exact same cardinal number (), regardless of whether their elements are identical.
- Example: If set () and set (), set and set are equivalent.
The Empty Set (Null Set):
- An empty set is a unique set that contains zero elements ().
- Represented symbolically by or empty curly brackets .
- Critical Distinction: The set is not empty because it contains one element (the symbol ), giving it a cardinality of . Similarly, is not empty, whereas is empty.
Set Membership Symbols:
- Belonging symbol : Indicates that an element is a member of a specified set.
- Non-belonging symbol : Indicates that an element is not a member of a specified set.
- Example 1: is True.
- Example 2: The statement is False, because is an odd natural number ().
Word Elements vs. Individual Character Sets:
- For set containing the single word "seven", n(B) = 1$.\n * For a set containing individual character elements {s, e, v, e, n}{s, e, v, n}4$.
Universal Sets and Subsets
Universal Set:
- Symbolized as .
- Represents the comprehensive master set containing all possible elements under consideration in a specific problem or context.
Subsets:
- A set is a subset of set (written ) if every element contained in 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 = 82^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** ('^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}A = {1, 2, 3, 5}B = {2, 3, 4, 5}:\n * **Union** (A \cup B):\n * Combine elements from AB{1, 2, 3, 4, 5}U).\n * **Intersection** (A \cap B):\n * Shared elements present in both AB{2, 3, 5}.\n * **Complement of AA'):\n * Remove elements of A1, 2, 3, 5U1, 2, 3, 4, 5A' = {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 BU(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}U(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}A{a, b, c}B{c, d}{c}{e, f}:\n * A \cup B = {a, b, c, d}\n * A \cap B = {c}\n * A' = {d, e, f}A and list all remaining elements)\n * B' = {a, e, f}B and list all remaining elements)\n * (A \cap B)' = {a, b, d, e, f}Uc)\n * *Evaluation Example with Letter Sets*:\n * Given Set B{q, s, y}zr$$).