Abstract
This chapter presents an overview of the relations between individual elements of a set. Each relation on the set produces its own set of ordered pairs. The chapter presents a theorem stating that a relation on a set S is represented by a set of ordered pairs (a, b), where a, b є S. If a connective phrase is used to describe the relation, then this will be represented by R and one shall write a R b to indicate that elements a and b are so related. The pairs (a, b), (b, a) will not necessarily be pairs in the same relation R. The chapter also discusses various types of relations, namely, reflexive relations, symmetric relation, anti-symmetric relation, transitive relation, equivalence relation, order relations, and inverse relations. The chapter presents information regarding the graphs of relations. The graph of a relation is a record of all its ordered pairs, and the compiling of such a record is known as graphing the relation. The pictorial or graphic representation of a relation is done on a piece of graph paper suitably scaled for size and carrying two perpendicular axes so that the position of any point on the graph paper can be fixed by reference to its distance from each of these axes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
