D.1: Set Theory
From
m (→External resources for Set Theory) |
m (→Discrete Math Learning modules) |
||
Line 12: | Line 12: | ||
== Discrete Math Learning modules == | == Discrete Math Learning modules == | ||
<br/> <br/> | <br/> <br/> | ||
+ | [[media:SetTheory.pptx | Set Theory Overview]]<br/><br/> | ||
== Resources for Set Theory == | == Resources for Set Theory == |
Revision as of 20:06, 6 January 2011
Oregon Department of Education knowledge and skills for Set Theory
D.1.1 Demonstrate understanding of the definitions of set equality, subset and null set.
D.1.2 Perform set operations such as union and intersection, difference, and complement.
D.1.3 Use Venn diagrams to explore relationships and patterns, and to make arguments about relationships between sets.
D.1.4 Demonstrate the ability to create the cross-product or set-theoretic product of two sets.
Discrete Math Learning modules
Resources for Set Theory
We all have some intuitive understanding of the notion of a set. However, the notion of set is know in mathematics as primitive; that is, it is a basic term that is commonly understood but is extremely difficult to define in a way that would be acceptable to mathematicians (other primitives include point, line, and plane).
Informally then a set is a collection of objects, real or imagined. Generally, these objects have one or more common properties that separate them from other objects. An example of a set would be A = {banana, lemon, strawberry, orange, grape}. Clearly, all the objects of this set are fruits. This is an example of a set of real objects, but a set can just as well be made up of abstractions. Let B = {democracy, republic, communistic, dictatorship}. B is a set of forms of government. The elements of a set as all the things that belong in that set. In the first example the elements are banana, lemon, strawberry, orange, and grape.If we denote the name of a set with a capital letter, then the elements are denoted with the lower-case letter with subscript to give the elements distinction but not order. Thus, A is the given set of fruits, then a1 = banana, a2 = lemon, a3 = strawberry, a4 = orange, a5 = grape. We could have just as readily said a3 = banana since there is no order to the set.
Two sets are called equal if and only if every element in one set exactly matches another element in the second set for all elements in both sets. Mathematically we say given A and B are sets, then A = B iff a = b for all a in A and all b in B. Notice that the definition requires that both sets be the same size; that is, they both have the same number of elements.
If we look at the set A above of fruits, there are several ways that we can group elements into smaller groups. For example, within the set there are two fruits that are yellow when ripe: banana and lemon. Alternately, there are two fruits that are generally called citrus: lemon and orange. Both of these are examples of what are called a subset. Mathematically, a subset of a set, denoted A
For further information about basic set concepts or a more rigorous treatment, refer to the following:
♦ University of Massachusetts, Basic Concepts of Set Theory, Functions and Relations[1]
♦ Stanford University, Basic Set Theory [2]