ADVERTISEMENT

JUPITER SCIENCE

Featured Articles on: MATHEMATICS

Ordered Pairs

An ordered pair is a 2-tuple formed by taking two elements (generally numbers but can be alphabets, characters, words, or symbols). The general form of representation is (a, b) where a and b represent two distinct objects. The important thing with ordered pairs is…

Cartesian Product

The cartesian product of two sets A and B is defined as a set formed by all the possible ordered pairs of elements from A and B, such that the first element comes from set A and the second element comes from set B. The cartesian product is denoted as A × B….

Intersection operation on two sets

Intersection operation on two sets

The intersection of two sets A & B is defined as a set that contains only those members which are common to both A and B. The intersection operation is denoted by the symbol ∩. Remember, for two disjoint sets (sets having no common elements), the…

Union of two sets

Union of two sets

The union of two sets A & B is defined as a set that contains all the member elements of A and B. the union operation is denoted by the symbol ∪. One point to remember here is that the union of two or more sets always gives a set with distinct…

Complement of a set

Complement of a set

The complement of a set A (that is a subset of a universal set U) is defined as a set that contains all the member elements and all subsets of U that are not part of the set A. The complement of a set is denoted using the symbol ‘ or c. Hence, A’ =…

Venn Diagrams in Sets

Venn Diagrams in Sets

Venn diagrams are the pictorial or graphical representation of sets and the various relationships that exist between sets. The representation consists of a rectangular box representing the universal set(U). All sets that are in context are drawn as circles…

UNIVERSAL SET

When working with sets, a reference superset that contains all the sets and their subsets in context (i.e. the sets which are currently under consideration) is called a universal set. It provides a base set from which all of the sets of interest can be…

Partitions

Partitioning of a set is distributing the member elements of a set among a group of non-empty subsets in such a way that each member lies in only one of these subsets. ⇒ ∅ ( Empty Set ) cannot be the partition of any set. Examples ⇒ The set { 1, 2, 3 } can be…

Disjoint Sets

Two sets A and B are called disjoint when they have no element in common (except the empty set ∅ }.

Power Set

The set of all possible subsets of a set S is called the power set of S, written as P(S). Examples ⇒ The power set of { ‘a’ } is { ∅, {‘a’} }The power set of { 2, 3 } is { ∅, {2}, {3}, {2,3} }The power set of {1, 2, 3 } is { ∅, {1}, {2}, {3}, {1,2}, {1,3}, {2,3},…

Proper Subset

If A is a subset of B but A ≠ B, then A is called the proper subset of B, and B is called the proper superset of A. This relationship is represented as below A ⊂ B ( A is a proper subset of A )B ⊃ A ( B is a proper superset of A ) Examples ⇒ {…

Subset

If there are two sets A & B such that every element of A is also in B, then A is called a subset of B. In other words, A is contained in B.  B is called the superset of A. In the set theory, this relationship is depicted as below…

Equivalent Sets

Two sets A and B are said to be equivalent(≡) if each element of A is also an element of B and each element of B is also an element of A. If elements are repetitive in one set, then it is not required for it to repeat in the other set for the two sets to be…

Equal Sets

Two sets A and B are said to be equal(=) if they have the same elements. The elements may not be in the same order. If an element appears n times in one set, then it must also appear n times in the other set. Mathematically, two sets A and B are equal if For each…

Finite Set

A set that has a definite number of elements is called a finite set else it is called an Infinite set. ⇒ A null set is a finite set. ⇒ For finite set S, n(S) is a finite number. ⇒ The standard mathematical sets like N, Z, R, etc. are all…

Singleton Set

A set that has exactly one member is called a singleton set. { 1 } , { ‘a’ } , { x3 | x ∈ N , 2 < x < 3 } are all singleton sets.