Loading...
MY DIGITAL CLASSROOMLoading...
Operations in ClustersLoading...
mathematicsLoading...
Loading...
Loading...
Loading...
Universal Cluster and Integration
We will call the cluster that contains all the elements in a given problem as a universal set and will show this set with E.
A cluster of all elements that are not in an A cluster but in the universal cluster is called the complement of A and A is shown in universal.
We will call the cluster that contains all the elements in a given problem as a universal set and will show this set with E.
A cluster of all elements that are not in an A cluster but in the universal cluster is called the complement of A and A is shown in universal.
Since A's complement contains all elements that are not A, the following two results are obvious:
De Morgan Rules
The process of integration and intersection has the following two properties:
The process of integration and intersection has the following two properties:
Since A's complement contains all elements that are not A, the following two results are obvious:
De Morgan Rules
The process of integration and intersection has the following two properties:
The process of integration and intersection has the following two properties:
Sample
Composition, Intersection, Difference and Symmetrical Difference
Compound
1. The set of all of the elements of the two sets is called the composition set and shown as AlarB. The components of the composition must be at least one of the elements A and B. We can show that.
Composition, Intersection, Difference and Symmetrical Difference
Compound
1. The set of all of the elements of the two sets is called the composition set and shown as AlarB. The components of the composition must be at least one of the elements A and B. We can show that.
x is such that x is element A or (V) x element B.
The two sets of A and B can be represented by the following set of compositions with the Venn diagram.
The two sets of A and B can be represented by the following set of compositions with the Venn diagram.
Properties of the composition process
Change Feature
A∪B=B∪A
Single Force Feature
A∪A= A
Merger Feature
A∪ (B∪C) = (A∪B) ∪C
Change Feature
A∪B=B∪A
Single Force Feature
A∪A= A
Merger Feature
A∪ (B∪C) = (A∪B) ∪C
Properties of the composition process
Change Feature
A∪B=B∪A
Single Force Feature
A∪A= A
Merger Feature
A∪ (B∪C) = (A∪B) ∪C
Change Feature
A∪B=B∪A
Single Force Feature
A∪A= A
Merger Feature
A∪ (B∪C) = (A∪B) ∪C
Symmetric Difference
The combination of sets of different elements of two clusters, or the combination of sets A inin B and B B A, is called a symmetric difference set and shown as A elemanB.
The combination of sets of different elements of two clusters, or the combination of sets A inin B and B B A, is called a symmetric difference set and shown as A elemanB.
As can be seen, the number of elements of the composition set may not be the same as the number of elements of the two sets. As the intersecting sets are not able to double the common elements, the number of elements of the composite set is reduced by the intersection. The number of elements of a set A is shown in s (A). Number of elements of the composition set
Sample
A = {2,3,4,5} and B = {3,4,7}.
Solution
We assign all of the elements in the two sets to the join set, and of course we don't put the same element more than once because of the cluster definition.
A = {2,3,4,5} and B = {3,4,7}.
Solution
We assign all of the elements in the two sets to the join set, and of course we don't put the same element more than once because of the cluster definition.
Intersection
The cluster of common elements of the two clusters is called the intersection set and shown as AındanB. The elements in the intersection set must be in both A and B. We can show that.
The cluster of common elements of the two clusters is called the intersection set and shown as AındanB. The elements in the intersection set must be in both A and B. We can show that.
