Relations

Definition

In mathematics and set theory, a Relation is a set of ordered pairs that establishes a connection between elements of two sets. Formally, a relation $R$ from set $A$ to set $B$ is a subset of the Cartesian product $A \times B$. It describes how elements of one set relate to elements of another based on a specific rule.

Main Content

1. Cartesian Product

• A Cartesian product, denoted as $A \times B$, is the set of all possible ordered pairs $(a, b)$ where $a \in A$ and $b \in B$.
• If set $A = {1, 2}$ and $B = {x, y}$, then $A \times B = {(1, x), (1, y), (2, x), (2, y)}$.

2. Domain and Range

• The Domain of a relation is the set of all first components (inputs) of the ordered pairs.
• The Range of a relation is the set of all second components (outputs) of the ordered pairs.

3. Visual Representation

• Relations are often represented using mapping diagrams or coordinate planes to show connections between sets.

Set A     Set B
  1 ------> x
  2 ------> y

(Diagram: Mapping of relation R = {(1, x), (2, y)})

Working / Process

1. Identify Sets

• Clearly define your input set ($A$) and your output set ($B$).
• Ensure all elements are distinct and well-defined before forming pairs.

2. Apply Rule

• Define the criteria for the relationship (e.g., "is greater than," "is a factor of," or "is equal to").
• Filter the Cartesian product $A \times B$ by checking which pairs satisfy the given condition.

3. Form Ordered Pairs

• Write down the resulting subset $R$ containing only the pairs that satisfied the rule.
• Verify that every ordered pair in your relation is indeed a member of the original Cartesian product.

Advantages / Applications

• Database Management: Relational databases use tables to store data where relations define connections between different entities (e.g., Customers and Orders).
• Computer Science: Used in graph theory to represent connections between nodes in a network.
• Logic and Programming: Essential for defining functions, equivalence relations, and partial ordering in algorithms.

Summary

A relation is a formal mapping between elements of two sets, represented as a subset of their Cartesian product. It serves as the foundation for defining functions and logical structures in mathematics and computer science. Important terms to remember include Domain (input set), Range (output set), Cartesian Product (total possible pairs), and Ordered Pair (a specific linked element).