DOCSLIB.ORG

Chapter 2 Set Theory (Page 42 - )

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Chapter 2 Set Theory (Page 42 - ) Chapter 2 Set Theory (page 42 - ) Objectives: • Specify sets using both the listing and set builder notation • Understand when sets are well defined • Use the element symbol property • Find the cardinal number of sets Definition (sets) In mathematical terms a collection of (well defined) objects is called a set and the individual objects in this collection are called the elements or members of the set. Examples: a) S is the collection of all students in Math 1001 CRN 6977 class b) T is the set of all students in Math 1001 CRN 6977 class who are 8 feet tall d) E is the set of even natural numbers less than 2 e) B is the set of beautiful birds (Not a well-defined set) f) U is the set of all tall people (Not a well-defined set) Note: The sets in b) and d) have no elements in them. Definition: (Empty Set): A set containing no element is called an empty set or a null set. Notations: { } denotes empty set. Representations풐풓 ∅ of Sets In general, we represent (describe) a set by listing it elements or by describing the property of the elements of the set, within curly braces. Two Methods: Listing and Set Builder Examples of Listing Method: List the elements of the set a) N5 is the set of natural numbers less than 5 = { , , , } b) the set of positive integers less than 100 퐍ퟓ ퟏ ퟐ ퟑ ퟒ = { , , , . , } ퟏퟎퟎ c) 퐍 = { , +, , , , } 퐍ퟏퟎퟎ ퟏ ퟐ ퟑ ퟏퟎퟎ Set Builder Method: has the general format { : ( )}, here ( ) is the property that the element x 푺 풎 ퟏ ∅ ퟓ ∆ should satisfy to be in the collection Examples, Set-builder Method: 풙 푷 풙 푷 풙 d) = { : 1001 6977 }. Here ( ) = is a student in Math 1001 CRN6977 class 푺 풙 풙 푖푠 푎 푠푡푢푑푒푛푡 푖푛 푀푎푡ℎ 퐶푅푁 푐푙푎푠푠 e) = { : 1 2} = { : 1 < < 2} Here 푷(풙) = 풙 is a real number strictly between -1 and 2 푅 푥 푥 푖푠 푎 푟푒푎푙 푛푢푚푏푒푟 푠푡푟푖푐푡푙푦 푏푒푡푤푒푒푛 − 푎푛푑 푥 − 푥 f) = { : 1 = 0} = { : = 1, 1, , } Here 푷(풙) = 풙 satisfies = 4 푇 푥 푥 푖푠 푎 푠표푙푢푡푖표푛 표푓 푡ℎ푒 푒푞푢푎푡푖표푛 푥 − 푥 푥 − −푖 푖 ퟒ Example: YouTube Videos: 푷 풙 풙 퐱 − ퟏ ퟎ . Sets and set notation: https://www.youtube.com/watch?v=01OoCH-2UWc . Set builder notation: https://www.youtube.com/watch?v=xnfUZ-NTsCE 1 Sets of Numbers commonly used in mathematics = = { : } = { : } 푹 = ℝ = {풙:풙 풊풔 풂 풓풆풂풍 풏풖풎풃풆풓 풙} =풙 풉풂풔: 풂 풅풆풄풊풎풂풍 풆풙풑풂풏풔풊풐 풏 , , 풂 푸= ℚ= 풙= 풙{ 풊풔: 풂 풓풂풕풊풐풏풂풍 풏풖풎풃풆풓} = { . �,풙 풙, 푖푠 표푓, 푡,ℎ푒 ,푓표푟푚, . 풃. .푤} ℎ 푒푟푒 풂 풃 ∈ ℤ 풃 ≠ ퟎ� { } 푰 =풁 : ℤ 풙 풙 풊풔 풂풏 풊풏풕풆품풆풓 = { , , −, ퟐ, − . ퟏ . ퟎ } ퟏ ퟐ { } 푾= 풙=풙 풊풔: 풂 풘풉풐풍풆 풏풖풎풃 풆풓 ퟎ ퟏ = {ퟐ , ퟑ , , . } Definition푵 ℕ (Universal풙 풙 풊풔 풂Set)풏풂풕풖풓풂풍 풏풖풎풃풆풓 ퟏ ퟐ ퟑ The universal set is the set of all elements under consideration in a given discussion. We denote the universal set by the capital letter U. The Element Symbol ( ) We use the symbol to stand for the phrase is an element of, and the symbol means is not an element of ∈ Example1: i) = { , ∈, , ±, , , } , ∉ 푨 , ퟎread−ퟑ as ퟏퟎ0 is an element∀ 흏 푯 of A ퟎ ∈ 푨 , read as 10 is an element of A ퟏ ퟎ ∈ 푨, read as is an element of A 흏 ∈ 푨, read as 흏3 is not an element of A ퟑ ∉ 푨, read as h is not an element of A { { } { } { } } ii) = , 풉, ∉, 푨 , , , . Referring to set B answer the following as True or False. a) d) {{1, 0}, 0} 푩 ∅ ퟎ ∅ ∅ ퟏ ퟎ ퟎ { } b) ∅{ ∈} 퐵 e) 0, ∈ 퐵 c) {∅0} ∈ 퐵 f) 0 ∅ ∈ 퐵 ∈ 퐵 ∉ 퐵 Cardinal Number Definition: The number of elements in set A is called the cardinal number of A and is denoted by ( ). A set is finite if its cardinal number is a whole number. A set is infinite if it is not finite Example 2: Find the cardinal number of 풏 푨 a) = {0, 3, 10, ±, , , } b) = { : 1 = 0} c) 푨 = { ,−{0, }, { }, {1∀, 0}휕, 0퐻} 4 d) 푇 = {푥 }푥 푖푠 푎 푠표푙푢푡푖표푛 표푓 푡ℎ푒 푒푞푢푎푡푖표푛 푥 − e) 퐵 = {∅ } ∅ ∅ f) 퐸 = {∅, , , . } 퐻 Example:ℕ YouTubeퟏ ퟐ ퟑ Videos: . Elements subsets and set equality: https://www.youtube.com/watch?v=kGyOrbbllEY&spfreload=10 . Introduction to Set Concepts & Venn Diagrams: https://www.youtube.com/watch?v=Jt-S9J947C8 2 2.2 Comparing Sets (Page 50) Objectives: • Determine when sets are equal • Know the difference between the relations subsets and proper subsets • Use Venn diagrams to illustrate sets relationships • Distinguish between the ideas of “equal” and “equivalent” sets Sets Equality Definition (Equal sets) Two sets A and B are equal if and only if they have exactly the same members. We write = to mean A is equal to B. If A and B are not equal we write . 푨 푩 푨 ≠ 푩 Example 1: Let = { : 4} = { , , } 푨 풙 풙 푖푠 푎 푛푎푡푢푟푎푙 푛푢푚푏푒푟 퐿푒푠푠 푡ℎ푎푛 = { : 4} 푩 ퟏ ퟐ ퟑ = { : 4} 푪 풚 풚 푖푠 푎 푝표푠푖푡푖푣푒 푖푛푡푒푔푒푟 푙푒푠푠 푡ℎ푎푛 표푟 푒푞푢푎푙 푡표 = { , , , } 푫 풙 풙 푖푠 푎 푤ℎ표푙푒 푛푢푚푏푒푟 푙푒푠푠 푡ℎ푎푛 In the list above, identify the sets that are equal 푬 ퟎ ퟏ ퟐ ퟑ Solution: = and = 푨 푩 푫 푬 Subsets Definition (subset): The set A is said to be a subset of the set B if every element of A is also an element of B. We indicate this relationship by writing . If A is not a subset of B, then we write Example 2: Let = { : 4} 푨 ⊆ 푩 푨 ⊈ 푩 = { , , } 푨 풙 풙 푖푠 푎 푛푎푡푢푟푎푙 푛푢푚푏푒푟 퐿푒푠푠 푡ℎ푎푛 = { : 4} 푩 ퟏ ퟐ ퟑ = { : 4} 푪 풚 풚 푖푠 푎 푝표푠푖푡푖푣푒 푖푛푡푒푔푒푟 푙푒푠푠 푡ℎ푎푛 표푟 푒푞푢푎푙 푡표 In the set list above: and also 푫 풙 풙 푖푠 푎 푤ℎ표푙푒 푛푢푚푏푒푟 푙푒푠푠 푡ℎ푎푛 표푟 푒푞푢푎푙 푡표 but , 푨 ⊆ 푩 푩 ⊆ 푨 Proper Subset 푨 ⊆ 푪 푪 ⊈ 푨 푩 ⊆ 푪 ⊆ 푫 Definition (proper subset): A set A is said to be a proper subset of set B if but B is not a subset of A. We write to mean A is a proper subset of B. 푨 푖푠 푎 푠푢푏푠푒푡 표푓 푩 Example 3: Let = { : 4} 푨 ⊂ 푩 = { : 3} 푨 풙 풙 푖푠 푎 푛푎푡푢푟푎푙 푛푢푚푏푒푟 퐿푒푠푠 푡ℎ푎푛 = { , , , } 푪 풚 풚 푖푠 푎 푝표푠푖푡푖푣푒 푖푛푡푒푔푒푟 푙푒푠푠 푡ℎ푎푛 표푟 푒푞푢푎푙 푡표 Here , A is a proper subset of C 푬 ퟎ ퟏ ퟐ ퟑ , C is a proper subset of E 푨 ⊂ 푪 Example: YouTube Videos: 푪 ⊂ 푬 . Subsets and proper subsets: https://www.youtube.com/watch?v=1wsF9GpGd00 . Subsets and proper subsets: https://www.youtube.com/watch?v=s8FGAclojcs 3 Example 4: Let = { , { , }, { }, { , }, }. Referring to set B, answer the following as True or False. 푩 ∅ ퟎ ∅ ∅ ퟏ ퟎ ퟎ a) d) {{1, 0}, 0} { } b) ∅{ ⊆} 퐵 e) 0, ⊆ 퐵 c) {∅0} ⊆ 퐵 f) 0 ∅ ⊆ 퐵 Example 5:⊆ Finding퐵 all subsets of a set 퐵 Let = { , }, = { , , } and ⊆ = { , , , }. List all subsets of the sets S and T 푺 ퟎ ퟏ 푻 풂 풃 풄 푬 ퟎ ퟏ ퟐ ퟑ Solution: = { , }; the subsets of set S are , { }, { }, { , }. There are 4 = 2 subsets of S { } { } { } { } { } { 2 } 푺 = {ퟎ,ퟏ, }; the subsets of set T are∅ ퟎ, ퟏ, ퟎ, ퟏ , , , , , , , { , , }. There are 푻 = 풂 Subsets풃 풄 of T ∅ 풂 풃 풄 풂 풃 풂 풄 풃 풄 풂 풃 풄 3 ퟖ = ퟐ{ , , , }, Set E has = subsets ퟒ Number푬 of Subsetsퟎ ퟏ ퟐ ퟑof a set: ퟐ ퟏퟔ If a set has k elements, then the number of subsets of the set is given by . 풌 Equivalent Sets ퟐ Definition: Two sets A and B are equivalent, or in one to one correspondence, iff ( ) = ( ). In other words, two sets are equivalent if and only if they have the same Cardinality. 풏 푨 풏 푩 Example 6: Equivalent sets a) = { , , } and = { , , }are equivalent, Note b) 푻 = {풂,풃 풄, , . 푩. } andퟏ ퟐ ퟑ = { , , , , . }푻 are≠ 푩equivalent { } c) ℕ = {ퟏ, ퟐ, ퟑ, . } and 푾= :ퟎ ퟏ ퟐ ퟑ are equivalent d) ℕ = {ퟏ, ퟐ, ퟑ, . } and ℤ = {풙 :풙 풊풔 풂풏 풊풏풕풆품풆풓 } are equivalent e) ℕEqualퟏ setsퟐ areퟑ equivalent ℚ 풙 풙 풊풔 풂 풓풂풕풊풐풏풂풍 풏풖풎풃풆풓 Example 7: Let = 0, , , , {0} . How many subsets of A have: a) One element (list the subsets) 퐴 � 푎 푒 휋 � b) Two elements (list the subsets) c) Four elements (list the subsets) 4 Set Operations (page 57) Objectives: • Perform the set operations of union, intersection, complement and difference • Understand the order in which to perform set operations • Know how to apply DeMorgan’s Laws in set theory • Use Venn diagrams to prove or disprove set theory statements • Use the Inclusion – Exclusion Principle to calculate the cardinal number of the union of two sets Union of Sets Definition (set union ): The union of two sets A and B, written , is the set of elements that are members of A or B (or ∪ both). Using the set-builder notation, = { : } 푨 ∪ 푩 The union of more than two sets is the set of all elements belonging to at least to one of the sets. 푨 ∪ 푩 풙 풙 ∈ 푨 풐풓 풙 ∈ 푩 Example 1: = { : 7 1} = { , , } 푨 풙 풙 푖푠 푎 푛푎푡푢푟푎푙 푛푢푚푏푒푟 퐿푒푠푠 푡ℎ푎푛 푎푛푑 푔푟푒푎푡푒푟 푡ℎ푎푛 = { : 4} 푩 ퟏ ퟐ ퟑ = { : 4} 푪 풚 풚 푖푠 푎 푝표푠푖푡푖푣푒 푖푛푡푒푔푒푟 푙푒푠푠 푡ℎ푎푛 표푟 푒푞푢푎푙 푡표 Find a) c) 푫 풙 풙 푖푠 푎 푤ℎ표푙푒 푛푢푚푏푒푟 푙푒푠푠 푡ℎ푎푛 b) d) 푨 ∪ 푩 푨 ∪ 푩 ∪ 푫 푨 ∪ 푪 푪 ∪ 푩 ∪ 푫 Intersection of Sets Definition (set intersection ) The intersection of two sets A and B, written , is the set of elements common to both A and B.
Load more

Recommended publications
  • Lectures on Fractal Geometry and Dynamics
    Lectures on fractal geometry and dynamics Michael Hochman∗ March 25, 2012 Contents 1 Introduction 2 2 Preliminaries 3 3 Dimension 3 3.1 A family of examples: Middle-α Cantor sets . 3 3.2 Minkowski dimension . 4 3.3 Hausdorff dimension . 9 4 Using measures to compute dimension 13 4.1 The mass distribution principle . 13 4.2 Billingsley's lemma . 15 4.3 Frostman's lemma . 18 4.4 Product sets . 22 5 Iterated function systems 24 5.1 The Hausdorff metric . 24 5.2 Iterated function systems . 26 5.3 Self-similar sets . 31 5.4 Self-affine sets . 36 6 Geometry of measures 39 6.1 The Besicovitch covering theorem . 39 6.2 Density and differentiation theorems . 45 6.3 Dimension of a measure at a point . 48 6.4 Upper and lower dimension of measures . 50 ∗Send comments to [email protected] 1 6.5 Hausdorff measures and their densities . 52 1 Introduction Fractal geometry and its sibling, geometric measure theory, are branches of analysis which study the structure of \irregular" sets and measures in metric spaces, primarily d R . The distinction between regular and irregular sets is not a precise one but informally, k regular sets might be understood as smooth sub-manifolds of R , or perhaps Lipschitz graphs, or countable unions of the above; whereas irregular sets include just about 1 everything else, from the middle- 3 Cantor set (still highly structured) to arbitrary d Cantor sets (irregular, but topologically the same) to truly arbitrary subsets of R . d For concreteness, let us compare smooth sub-manifolds and Cantor subsets of R .
    [Show full text]
  • Reasoning About Equations Using Equality
    Mathematics Instructional Plan – Grade 4 Reasoning About Equations Using Equality Strand: Patterns, Functions, Algebra Topic: Using reasoning to assess the equality in closed and open arithmetic equations Primary SOL: 4.16 The student will recognize and demonstrate the meaning of equality in an equation. Related SOL: 4.4a Materials: Partners Explore Equality and Equations activity sheet (attached) Vocabulary equal symbol (=), equality, equation, expression, not equal symbol (≠), number sentence, open number sentence, reasoning Student/Teacher Actions: What should students be doing? What should teachers be doing? 1. Activate students’ prior knowledge about the equal sign. Formally assess what students already know and what misconceptions they have. Ask students to open their notebooks to a clean sheet of paper and draw lines to divide the sheet into thirds as shown below. Create a poster of the same graphic organizer for the room. This activity should take no more than 10 minutes; it is not a teaching opportunity but simply a data- collection activity. Equality and the Equal Sign (=) I know that- I wonder if- I learned that- 1 1 1 a. Let students know they will be creating a graphic organizer about equality and the equal sign; that is, what it means and how it is used. The organizer is to help them keep track of what they know, what they wonder, and what they learn. The “I know that” column is where they can write things they are pretty sure are correct. The “I wonder if” column is where they can write things they have questions about and also where they can put things they think may be true but they are not sure.
    [Show full text]
  • Algebraic Structure of Genetic Inheritance 109
    BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 34, Number 2, April 1997, Pages 107{130 S 0273-0979(97)00712-X ALGEBRAIC STRUCTURE OF GENETIC INHERITANCE MARY LYNN REED Abstract. In this paper we will explore the nonassociative algebraic struc- ture that naturally occurs as genetic information gets passed down through the generations. While modern understanding of genetic inheritance initiated with the theories of Charles Darwin, it was the Augustinian monk Gregor Mendel who began to uncover the mathematical nature of the subject. In fact, the symbolism Mendel used to describe his first results (e.g., see his 1866 pa- per Experiments in Plant-Hybridization [30]) is quite algebraically suggestive. Seventy four years later, I.M.H. Etherington introduced the formal language of abstract algebra to the study of genetics in his series of seminal papers [9], [10], [11]. In this paper we will discuss the concepts of genetics that suggest the underlying algebraic structure of inheritance, and we will give a brief overview of the algebras which arise in genetics and some of their basic properties and relationships. With the popularity of biologically motivated mathematics continuing to rise, we offer this survey article as another example of the breadth of mathematics that has biological significance. The most com- prehensive reference for the mathematical research done in this area (through 1980) is W¨orz-Busekros [36]. 1. Genetic motivation Before we discuss the mathematics of genetics, we need to acquaint ourselves with the necessary language from biology. A vague, but nevertheless informative, definition of a gene is simply a unit of hereditary information.
    [Show full text]
  • VENN DIAGRAM Is a Graphic Organizer That Compares and Contrasts Two (Or More) Ideas
    InformationVenn Technology Diagram Solutions ABOUT THE STRATEGY A VENN DIAGRAM is a graphic organizer that compares and contrasts two (or more) ideas. Overlapping circles represent how ideas are similar (the inner circle) and different (the outer circles). It is used after reading a text(s) where two (or more) ideas are being compared and contrasted. This strategy helps students identify Wisconsin similarities and differences between ideas. State Standards Reading:INTERNET SECURITYLiterature IMPLEMENTATION OF THE STRATEGY •Sit Integration amet, consec tetuer of Establish the purpose of the Venn Diagram. adipiscingKnowledge elit, sed diam and Discuss two (or more) ideas / texts, brainstorming characteristics of each of the nonummy nibh euismod tincidunt Ideas ideas / texts. ut laoreet dolore magna aliquam. Provide students with a Venn diagram and model how to use it, using two (or more) ideas / class texts and a think aloud to illustrate your thinking; scaffold as NETWORKGrade PROTECTION Level needed. Ut wisi enim adK- minim5 veniam, After students have examined two (or more) ideas or read two (or more) texts, quis nostrud exerci tation have them complete the Venn diagram. Ask students leading questions for each ullamcorper.Et iusto odio idea: What two (or more) ideas are we comparing and contrasting? How are the dignissimPurpose qui blandit ideas similar? How are the ideas different? Usepraeseptatum with studentszzril delenit Have students synthesize their analysis of the two (or more) ideas / texts, toaugue support duis dolore te feugait summarizing the differences and similarities. comprehension:nulla adipiscing elit, sed diam identifynonummy nibh. similarities MEASURING PROGRESS and differences Teacher observation betweenPERSONAL ideas FIREWALLS Conferring Tincidunt ut laoreet dolore Student journaling magnaWhen aliquam toerat volutUse pat.
    [Show full text]
  • MGF 1106 Learning Objectives
    Learning Objectives L01 Set Concepts and Subsets (2.1, 2.2) 1. Indicate sets by the description method, roster method, and by using set builder notation. 2. Determine if a set is well defined. 3. Determine if a set is finite or infinite. 4. Determine if sets are equal, equivalent, or neither. 5. Find the cardinal number of a set. 6. Determine if a set is equal to the empty set. 7. Use the proper notation for the empty set. 8. Give an example of a universal set and list all of its subsets and all of its proper subsets. 9. Properly use notation for element, subset, and proper subset. 10. Determine if a number represents a cardinal number or an ordinal number. 11. Be able to determine the number of subsets and proper subsets that can be formed from a universal set without listing them. L02 Venn Diagrams and Set Operations (2.3, 2.4) 1. Determine if sets are disjoint. 2. Find the complement of a set 3. Find the intersection of two sets. 4. Find the union of two sets. 5. Find the difference of two sets. 6. Apply several set operations involved in a statement. 7. Determine sets from a Venn diagram. 8. Use the formula that yields the cardinal number of a union. 9. Construct a Venn diagram given two sets. 10. Construct a Venn diagram given three sets. L03 Equality of Sets; Applications of Sets (2.4, 2.5) 1. Determine if set statements are equal by using Venn diagrams or DeMorgan's laws.
    [Show full text]
  • The Probability Set-Up.Pdf
    CHAPTER 2 The probability set-up 2.1. Basic theory of probability We will have a sample space, denoted by S (sometimes Ω) that consists of all possible outcomes. For example, if we roll two dice, the sample space would be all possible pairs made up of the numbers one through six. An event is a subset of S. Another example is to toss a coin 2 times, and let S = fHH;HT;TH;TT g; or to let S be the possible orders in which 5 horses nish in a horse race; or S the possible prices of some stock at closing time today; or S = [0; 1); the age at which someone dies; or S the points in a circle, the possible places a dart can hit. We should also keep in mind that the same setting can be described using dierent sample set. For example, in two solutions in Example 1.30 we used two dierent sample sets. 2.1.1. Sets. We start by describing elementary operations on sets. By a set we mean a collection of distinct objects called elements of the set, and we consider a set as an object in its own right. Set operations Suppose S is a set. We say that A ⊂ S, that is, A is a subset of S if every element in A is contained in S; A [ B is the union of sets A ⊂ S and B ⊂ S and denotes the points of S that are in A or B or both; A \ B is the intersection of sets A ⊂ S and B ⊂ S and is the set of points that are in both A and B; ; denotes the empty set; Ac is the complement of A, that is, the points in S that are not in A.
    [Show full text]
  • Instructional Guide for Basic Mathematics 1, Grades 10 To
    REPORT RESUMES ED 016623 SE 003 950 INSTRUCTIONAL GUIDE FOR BASIC MATHEMATICS 1,GRADES 10 TO 12. BY- RICHMOND, RUTH KUSSMANN LOS ANGELES CITY SCHOOLS, CALIF. REPORT NUMBER X58 PUB DATE 66 EDRS PRICE MF -$0.25 HC-61.44 34P. DESCRIPTORS- *CURRICULUM DEVELOPMENT,*MATHEMATICS, *SECONDARY SCHOOL MATHEMATICS, *TEACHING GUIDES,ARITHMETIC, COURSE CONTENT, GRADE 10, GRADE 11, GRADE 12,GEOMETRY, LOW ABILITY STUDENTS, SLOW LEARNERS, STUDENTCHARACTERISTICS, LOS ANGELES, CALIFORNIA, THIS INSTRUCTIONAL GUIDE FORMATHEMATICS 1 OUTLINES CONTENT AND PROVIDES TEACHINGSUGGESTIONS FOR A FOUNDATION COURSE FOR THE SLOW LEARNER IN THESENIOR HIGH SCHOOL. CONSIDERATION HAS BEEN GIVEN IN THEPREPARATION OF THIS DOCUMENT TO THE STUDENT'S INTERESTLEVELS AND HIS ABILITY TO LEARN. THE GUIDE'S PURPOSE IS TOENABLE THE STUDENTS TO UNDERSTAND AND APPLY THE FUNDAMENTALMATHEMATICAL ALGORITHMS AND TO ACHIEVE SUCCESS ANDENJOYMENT IN WORKING WITH MATHEMATICS. THE CONTENT OF EACH UNITINCLUDES (1) DEVELOPMENT OF THE UNIT, (2)SUGGESTED TEACHING PROCEDURES, AND (3) STUDENT EVALUATION.THE MAJOR PORTION OF THE MATERIAL IS DEVOTED TO THE FUNDAMENTALOPERATIONS WITH WHOLE NUMBERS. IDENTIFYING AND CLASSIFYING ELEMENTARYGEOMETRIC FIGURES ARE ALSO INCLUDED. (RP) WELFARE U.S. DEPARTMENT OFHEALTH, EDUCATION & OFFICE OF EDUCATION RECEIVED FROM THE THIS DOCUMENT HAS BEENREPRODUCED EXACTLY AS POINTS OF VIEW OROPINIONS PERSON OR ORGANIZATIONORIGINATING IT. OF EDUCATION STATED DO NOT NECESSARILYREPRESENT OFFICIAL OFFICE POSITION OR POLICY. INSTRUCTIONAL GUIDE BASICMATHEMATICS I GRADES 10 to 12 LOS ANGELES CITY SCHOOLS Division of Instructional Services Curriculum Branch Publication No. X-58 1966 FOREWORD This Instructional Guide for Basic Mathematics 1 outlines content and provides teaching suggestions for a foundation course for the slow learner in the senior high school.
    [Show full text]
  • Basic Structures: Sets, Functions, Sequences, and Sums 2-2
    CHAPTER Basic Structures: Sets, Functions, 2 Sequences, and Sums 2.1 Sets uch of discrete mathematics is devoted to the study of discrete structures, used to represent discrete objects. Many important discrete structures are built using sets, which 2.2 Set Operations M are collections of objects. Among the discrete structures built from sets are combinations, 2.3 Functions unordered collections of objects used extensively in counting; relations, sets of ordered pairs that represent relationships between objects; graphs, sets of vertices and edges that connect 2.4 Sequences and vertices; and finite state machines, used to model computing machines. These are some of the Summations topics we will study in later chapters. The concept of a function is extremely important in discrete mathematics. A function assigns to each element of a set exactly one element of a set. Functions play important roles throughout discrete mathematics. They are used to represent the computational complexity of algorithms, to study the size of sets, to count objects, and in a myriad of other ways. Useful structures such as sequences and strings are special types of functions. In this chapter, we will introduce the notion of a sequence, which represents ordered lists of elements. We will introduce some important types of sequences, and we will address the problem of identifying a pattern for the terms of a sequence from its first few terms. Using the notion of a sequence, we will define what it means for a set to be countable, namely, that we can list all the elements of the set in a sequence.
    [Show full text]
  • A Diagrammatic Inference System with Euler Circles ∗
    A Diagrammatic Inference System with Euler Circles ∗ Koji Mineshima, Mitsuhiro Okada, and Ryo Takemura Department of Philosophy, Keio University, Japan. fminesima,mitsu,[email protected] Abstract Proof-theory has traditionally been developed based on linguistic (symbolic) represen- tations of logical proofs. Recently, however, logical reasoning based on diagrammatic or graphical representations has been investigated by logicians. Euler diagrams were intro- duced in the 18th century by Euler [1768]. But it is quite recent (more precisely, in the 1990s) that logicians started to study them from a formal logical viewpoint. We propose a novel approach to the formalization of Euler diagrammatic reasoning, in which diagrams are defined not in terms of regions as in the standard approach, but in terms of topo- logical relations between diagrammatic objects. We formalize the unification rule, which plays a central role in Euler diagrammatic reasoning, in a style of natural deduction. We prove the soundness and completeness theorems with respect to a formal set-theoretical semantics. We also investigate structure of diagrammatic proofs and prove a normal form theorem. 1 Introduction Euler diagrams were introduced by Euler [3] to illustrate syllogistic reasoning. In Euler dia- grams, logical relations among the terms of a syllogism are simply represented by topological relations among circles. For example, the universal categorical statements of the forms All A are B and No A are B are represented by the inclusion and the exclusion relations between circles, respectively, as seen in Fig. 1. Given two Euler diagrams which represent the premises of a syllogism, the syllogistic inference can be naturally replaced by the task of manipulating the diagrams, in particular of unifying the diagrams and extracting information from them.
    [Show full text]
  • Sets, Functions
    Sets 1 Sets Informally: A set is a collection of (mathematical) objects, with the collection treated as a single mathematical object. Examples: • real numbers, • complex numbers, C • integers, • All students in our class Defining Sets Sets can be defined directly: e.g. {1,2,4,8,16,32,…}, {CSC1130,CSC2110,…} Order, number of occurence are not important. e.g. {A,B,C} = {C,B,A} = {A,A,B,C,B} A set can be an element of another set. {1,{2},{3,{4}}} Defining Sets by Predicates The set of elements, x, in A such that P(x) is true. {}x APx| ( ) The set of prime numbers: Commonly Used Sets • N = {0, 1, 2, 3, …}, the set of natural numbers • Z = {…, -2, -1, 0, 1, 2, …}, the set of integers • Z+ = {1, 2, 3, …}, the set of positive integers • Q = {p/q | p Z, q Z, and q ≠ 0}, the set of rational numbers • R, the set of real numbers Special Sets • Empty Set (null set): a set that has no elements, denoted by ф or {}. • Example: The set of all positive integers that are greater than their squares is an empty set. • Singleton set: a set with one element • Compare: ф and {ф} – Ф: an empty set. Think of this as an empty folder – {ф}: a set with one element. The element is an empty set. Think of this as an folder with an empty folder in it. Venn Diagrams • Represent sets graphically • The universal set U, which contains all the objects under consideration, is represented by a rectangle.
    [Show full text]
  • The Universal Finite Set 3
    THE UNIVERSAL FINITE SET JOEL DAVID HAMKINS AND W. HUGH WOODIN Abstract. We define a certain finite set in set theory { x | ϕ(x) } and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any desired larger finite set in top-extensions of that universe. Specifically, ZFC proves the set is finite; the definition ϕ has complexity Σ2, so that any affirmative instance of it ϕ(x) is verified in any sufficiently large rank-initial segment of the universe Vθ ; the set is empty in any transitive model and others; and if ϕ defines the set y in some countable model M of ZFC and y ⊆ z for some finite set z in M, then there is a top-extension of M to a model N in which ϕ defines the new set z. Thus, the set shows that no model of set theory can realize a maximal Σ2 theory with its natural number parameters, although this is possible without parameters. Using the universal finite set, we prove that the validities of top-extensional set-theoretic potentialism, the modal principles valid in the Kripke model of all countable models of set theory, each accessing its top-extensions, are precisely the assertions of S4. Furthermore, if ZFC is consistent, then there are models of ZFC realizing the top-extensional maximality principle. 1. Introduction The second author [Woo11] established the universal algorithm phenomenon, showing that there is a Turing machine program with a certain universal top- extension property in models of arithmetic.
    [Show full text]
  • Chapter I Set Theory
    Chapter I Set Theory There is surely a piece of divinity in us, something that was before the elements, and owes no homage unto the sun. Sir Thomas Browne One of the benefits of mathematics comes from its ability to express a lot of information in very few symbols. Take a moment to consider the expression d sin( θ). dθ It encapsulates a large amount of information. The notation sin( θ) represents, for a right triangle with angle θ, the ratio of the opposite side to the hypotenuse. The differential operator d/dθ represents a limit, corresponding to a tangent line, and so forth. Similarly, sets are a convenient way to express a large amount of information. They give us a language we will find convenient in which to do mathematics. This is no accident, as much of modern mathematics can be expressed in terms of sets. 1 2 CHAPTER I. SET THEORY 1 Sets, subsets, and set operations 1.A What is a set? A set is simply a collection of objects. The objects in the set are called the elements . We often write down a set by listing its elements. For instance, the set S = 1, 2, 3 has three elements. Those elements are 1, 2, and 3. There is a special symbol,{ }, that we use to express the idea that an element belongs to a set. For instance, we∈ write 1 S to mean that “1 is an element of S.” For∈ the set S = 1, 2, 3 , we have 1 S, 2 S, and 3 S.
    [Show full text]