 |
| Fig(vi) |
Function as a correspondence Let A and B be two non-empty sets. Then a function ‘f ‘ from set A to set B is a rule or method or correspondence which associates elements of set A to elements of set B such that: Fig. 2(a) (i) all elements of set A are associated to…
Laws of algebra of set THEOREM 1 (Idempotent Laws) For any set A (i) A ∪ A = A (ii) A ∩ A = A PROOF (i) A ∪ A= { x : x ∈ A or x ∈ A} ={x : x ∈ A} = A (ii) A ∩ A = {x : x…
Get Way learning
Relation Let A and B be two sets. Then a relation from set A to B is a subset of A × B. Thus, R is a relation from A to B⇔R ⊆ A × B. If R is a relation from a non-void set A to non-void set B and my if (a, b)…
Types of relation Void relation:- Let A be a set. Then, Φ ⊆ A x A and so it is a relation on A. This relation is called the void or empty relation on set A. In other words, a relation R on a set A is called void or empty relation, if no element…
Range of relation Let R be a relation from a set A to a set B. Then the of all second components or coordinates of the ordered pairs belonging to R is called the range of R. Thus, Range of R = { b : (a, b) ∈ R} Clearly, range of R ⊆ B…
