In real life, relationship and function provide the link between two entities. We come across various patterns and linkages in our daily lives that describe relationships such as father-son relationships, brother-sister relationships, and so on. In mathematics, we encounter various numerical relationships such as x is less than y, line l is parallel to line m, and so on. Relationships and functions connect components from one domain to those from another (codomain).

Functions are specialised sorts of relationships that describe the exact correspondence between two quantities. In this article, we’ll look at how to link pairs of items from two sets and then establish a relation between them, as well as the many types of relations and functions and the differences between them.

Example: Relation, {(-2, 3), {4, 5), (6, -5), (-2, 3)},

The domain is {-2, 4, 6} and range is {-5, 3, 5}.

What are Relations and Functions?

Relations and functions establish a mapping between two sets (inputs and outputs) that results in ordered pairs of the type (input, output). In algebra, relationship and function are crucial notions. They are commonly utilised in both mathematics and everyday life. To better comprehend the significance of these concepts of connection and function, let’s define them.

A function is a relation that states that each input should have only one output (or) a specific type of relation (a collection of ordered pairs) that follows a rule, i.e., every x-value should be connected with only one y-value.

Domain: It’s a collection of the ordered pair’s initial values.

Range: It’s a collection of the ordered pair’s second values.

Types of Functions

The types of functions can be defined in terms of relations as follows:

• Injective function or one-to-one function: If there is a separate element of Q for each element of P, the function f: P Q is said to be one to one.
• Many to one function: A function that transfers two or more P items to the same Q element.
• Surjective function or onto function: A function that has a pre-image in set P for each element of set Q.
• Bijective function or one-to-one correspondence: Each element of P is matched with a discrete element of Q by the function f, and each element of Q has a pre-image in P.

Types of Relations

• Empty Relations
• Universal Relations
• Identity Relations
• Inverse Relations
• Reflexive Relations
• Symmetric Relations
• Transitive Relations

Empty Relation: The relation R in A is an empty relation, also known as the void relation when no element of set X is associated or mapped to any other member of X.

Universal Relation: R is a set relation; let’s assume A is a universal relation since every element of A is connected to every element of A in this entire relation. R = A, for example.

Relationship in reverse: If R is a relation between sets A and B, then R A X B. R is a relationship.

Identity Relation: If every element of set A is related to itself only, it is called Identity relation.

I={(A, A), ∈ a}.

Reflexive Relation: If every element of set A maps to itself, i.e. for every an A, (a, a) R, the relation is reflexive

Symmetric Relation: For any a & b A, a symmetric relation is a relation R on a set A if (a, b) R then (b, a) R.

Transitive Relation: For any a,b,c A, if (a, b) R, (b, c) R, then (a, c) R, and this relation in set A is transitive.

Equivalence Relation: A relation is termed an equivalency relation if it is reflexive, symmetric, and transitive.

Facts of Relations and Functions

• Relations and functions establish a mapping between two sets (inputs and outputs) that results in ordered pairs of the type (Input, Output).
• Arrow representation, algebraic form, set-builder form, visually, roster form, and tabular form are all examples of ways to describe relations and functions.
• All relations are functions, but not all functions are relations

Conclusion

A database is a set of relations in relational database theory. The relations should be in a canonical form called normalised form in database argot to model a genuine world. That transformation ensures that no information is lost, and that no bogus tuples with no corresponding significance in the database’s reality are inserted. The normalisation process considers features of relations such as functional dependencies between entries, keys and foreign keys, transitive and join dependencies, and so on.