Posts Tagged ‘empty set’
Thursday, October 15th, 2009
Difference in Set Theory
Description
A detailed tutorial of difference in set theory. Step by step tutorial including several examples of difference in set theory for reference.
Overview
Difference is what you get after subtracting two numbers – or two sets. As with other examples of subtraction, order is very important for difference in set theory. Unless two sets are identical, you will end up with a different answer depending on the order. Difference is very often used in conjunction with union and intersection of sets or power sets.
Tags: difference, discrete math, element, empty set, intersection, Math, number, order, power set, set, set theory, subset, subtract, subtraction, union
Posted in Discrete Math | No Comments »
Tuesday, October 13th, 2009
Empty Set in Set Theory
Description
A detailed tutorial on the empty set. Step by step tutorial including several examples and a description of the properties of the empty set for reference.
Overview
The empty set is a unique set in set theory that means a set composed of nothing. In an empty set, there are no elements at all. The empty set has one very unique property – it is the subset of all sets. The set of all natural numbers up to infinity? It’s a subset. The set of prime numbers less than 20? It’s a subset of that, too. It is also a subset of itself – although that is not particurarly unique. The empty set is not used in equations, but can be used to define them.
Tags: difference, discrete math, element, empty set, intersection, Math, none, set, set theory, subset, union, unique, zero
Posted in Discrete Math | No Comments »
Tuesday, October 13th, 2009
Power Sets in Set Theory
Description
A detailed tutorial on power sets. Step by step tutorial including several examples of power sets and how to perform operations of power sets for reference.
Overview
Power sets are defined as a set of all subsets. So for example, say you have a set A. The power set of A would be the set of all possible subsets of A. Power sets can also be used in normal operations, such as intersections and unions. All you do is find all possible subsets of both sets you are working with, and solve the problem like you would with a normal set.
Tags: difference, discrete math, element, empty set, intersection, Math, power, set, set theory, subset, union
Posted in Discrete Math | No Comments »
Thursday, October 8th, 2009
Subsets in Set Theory
Description
A detailed tutorial on how to identify subsets of a set. Step by step tutorial including several examples of how to find subsets in a set for reference.
Overview
Each set in set theory has a certain amount of subsets. There is an easy way figure out how many subsets a set has. Pretend that every element of a set is 2, and multiply them together. This will be your number of subsets. For example, if you have three elements, you will have 8 subsets, because 2 cubed (which is 2 to the power of 3, or 2 times 2 times 2) is equal to 8. Now that you have determined how many subsets there are, you have to figure out what they are. A subset is defined as any set containing all or part of a set. Two subsets are going to be the set itself, and an empty set. Sometimes they are your only subsets. Now, following the definition, a subset must be all possible sets. This means, sets of one element - one for each element in your set. In addition to that, you may have sets of two elements – one for each possible combination of elements in your set. This should be continued until you have reached the maximum number of elements in the set you atarted out with.
Tags: combination, discrete math, element, empty set, exponent, Math, multiplication, number, set, set theory, subset, to the power, value
Posted in Discrete Math | No Comments »
Tuesday, October 6th, 2009
Definition of a Finite Set
Description
A detailed tutorial on the definition of a finite set. Step by step tutorial including several examples of finite sets for reference.
Overview
There are many different types of sets, but one of the most common ones to run into a finite sets. A finite set is a set that has a finite number of elements – meaning a set with a definite number of elements, such as five, or ten. The number of elements in the set must be a natural number, and it is called the cardinality of a set. An empty set is considered to be finite, with a cardiality of zero, even though zero is not considered to be a natural number.
Tags: algebra, cardinality, element, elements, empty set, finite, infinite, Math, natural number, set, sets, zero
Posted in Algebra | No Comments »
Friday, October 2nd, 2009
Disjoint Sets in Set Theory
Description
A detailed tutorial on disjoint sets. Step by step tutorial including several examples of disjoint sets and how to identify disjoint sets for reference.
Overview
A disjoint set is a term applied in set theory when two or more sets have no elements in common. For example, the sets {1, 2, 3} and {7, 8, 9} are disjoint sets because none of the numbers in the sets are the same. The formal way to say this is that two sets are disjoint sets if their intersection creates an empty set, in other words, nothing at all. An intersection is when you only take the values that are found in both sets. If none of the values are the same, this would be an empty set. Disjoint sets can be classified into further categories of piecewise, pairwise, or mutually disjoint provided that in a collection, at least two sets are disjoint.
Tags: collection, discrete math, disjoint, elements, empty set, intersection, Math, mutually, pairwise, piecewise, set theory, sets, value
Posted in Discrete Math | No Comments »
