Relations and Functions in Mathematics

Topics
Bijective Function

A bijective function is a type of function that uniquely pairs every element in the domain with an
element in the codomain, and vice versa.

Also known as a one-to-one correspondence.

It has both injective (one-to-one) and surjective (onto) properties.
Bijective functions have unique inverses.
The cardinality of the domain and codomain is the same if a function is bijective.

composition of functions

Composition of functions involves combining two functions to create a new function by applying
the output of one function as the input of another.

The composition of functions is not commutative, meaning f(g(x)) is not necessarily equal to
g(f(x)).
Composition of functions is represented by (f g)(x) or f(g(x)).
Identifying the domain of the composite function involves considering the domains of the
individual functions being composed.
When evaluating a composite function, work from the inside out, using the output of the inner
function as the input for the outer function.

Equivalence relation

An equivalence relation on a set divides the elements into disjoint subsets called equivalence
classes, satisfying reflexivity, symmetry, and transitivity properties.

Reflexivity: Every element is related to itself.

Symmetry: If A is related to B, then B is related to A.
Transitivity: If A is related to B and B is related to C, then A is related to C.
Equivalence classes represent sets of equivalent elements under the relation.

Injective Function

An injective function assigns each element from the domain to a unique element in the
codomain, ensuring no two domain elements are mapped to the same codomain element.
 In an injective function, each output has at most one corresponding input.
Also known as a one-to-one function.
Visualized as passing the horizontal line test.
Inverse of an injective function is a function as well.

Invertible function

An invertible function is a function for which there exists another function that reverses its effect,
effectively mapping outputs back to their respective inputs. Invertible functions must be one-to-
one, meaning each output corresponds to a unique input.

A function is one-to-one if no two different inputs produce the same output.

The inverse of a function f is denoted as f^(-1).
Graphically, a function is invertible if its reflection across the line y = x is also a function.
Common examples of invertible functions include linear functions with non-zero slopes and
exponential functions.

Reflexive relation

In a reflexive relation, every element is related to itself. It satisfies the condition that (a, a)
belongs to the relation for all elements a.

Reflexive relations are often represented using the symbol '≥' or '≤'.
A symmetric relation that is also reflexive is known as an equivalence relation.
In a reflexive relation, the diagonal elements in the relation matrix are typically non-zero.
Real-world examples of reflexive relations include 'is related to' or 'is the same age as'.

Relations and functions

Relations and functions describe how elements in one set relate to elements in another set.
Functions are a type of relation with a unique output for each input.

Relations can be represented as sets of ordered pairs, while functions must satisfy the
criteria of having one output for each input.
Functions are commonly represented using function notation, such as f(x) = x^2.
Relations can be classified as reflexive, symmetric, transitive, or equivalence relations.
Functions can be injective (one-to-one), surjective (onto), or bijective (both one-to-one and
onto).

Surjective Function

A surjective function, also known as onto function, is a function where every element in the range
has a corresponding element in the domain.
 It implies that the function covers all elements in its range.
A function f: A -> B is surjective if for every y in B, there is an x in A such that f(x) = y.
A surjective function may not cover every element in its domain.
It ensures that there are no 'holes' or 'gaps' in the mapping.

Symmetric relation

A symmetric relation is a binary relation where if (a, b) is included, then (b, a) must also be
present. It mirrors each element's relation.

Symmetric relations are bidirectional, meaning the relationship applies in both directions.
Examples of symmetric relations include 'is a sibling of' and 'shares a birthday with'.
In a symmetric relation, the order of elements does not matter.
Not all relations are symmetric; it is essential to analyze each pair to determine symmetry.

Transitive relation

In a transitive relation, if element A is related to element B, and element B is related to element C,

then A is also related to C.

Transitive relations are common in order, hierarchy, and subordination relationships.

A relation can be reflexive and transitive, but not symmetric.
Transitive closure is the smallest transitive relation that includes a given relation.
Transitive property is a key concept in mathematics and logic.

Types of functions

Functions are relationships between inputs and outputs, categorized by their behavior and
properties, including linear, quadratic, polynomial, rational, exponential, and logarithmic types.

Linear functions have a constant rate of change and are represented by graphs that are
straight lines.
Quadratic functions form parabolas and include terms with variables raised to the second
power.
Exponential functions grow rapidly, characterized by a constant base raised to a variable
exponent.
Rational functions are ratios of polynomials, often resulting in asymptotes and undefined
points.

Types of relations

Types of relations categorize how sets interact, including concepts like equivalence relations,
partial orders, and functions, each defined by specific properties that dictate their structure and
behavior.
 Equivalence relations satisfy reflexivity, symmetry, and transitivity, grouping elements into
distinct classes.
Partial orders are reflexive, antisymmetric, and transitive, allowing for comparisons among
elements without establishing a complete order.
Functions are relations that uniquely associate each element from one set to a single element
in another set.
Universal relations connect every element from one set to every element in another,
presenting the maximum possible connections.

Key Terms
binary operation

A binary operation is a rule that combines two elements from a set to produce another element
within the same set, such as addition or multiplication.

Common examples include addition, subtraction, multiplication, and division on numbers.

Binary operations can be defined on various sets, such as integers, rational numbers, or
matrices.
Properties include closure, associativity, commutativity, identity elements, and inverses.
Not all binary operations are associative or commutative; for example, subtraction and
division are not.

Co-domain

In the context of functions, the co-domain is the set that includes all possible output values that
the function can produce.

The co-domain is crucial for determining the range of a function.

It is different from the range of a function.
The co-domain may include values that are not actually produced as outputs.
Each element in the co-domain corresponds to at least one element in the domain.

Domain

In the study of functions, the domain refers to the set of input values for which the function is
defined and outputs a valid result.

The domain of a function can be expressed using interval notation, inequalities, or set
notation.
It is essential to identify restrictions on the domain, such as avoiding division by zero or
square roots of negative numbers.
The domain helps determine the range of possible input values that can be used with a
function.
 For composite functions, the domain of the entire function is influenced by the domains of its
individual component functions.

Equivalence class

An equivalence class is a subset of elements that share a common relation, partitioning a set
into distinct groups based on that relation's properties, such as equality or similarity.

Equivalence classes are defined by an equivalence relation, which must be reflexive,

symmetric, and transitive.
For any element in a set, its equivalence class contains all elements that are related to it.
If a set is divided into equivalence classes, each element belongs to exactly one class.
Common examples include congruence classes in number theory and similarity classes in
geometry.

Function

In the realm of numbers, a function is a special relationship between two sets where each input
has a unique output, like a machine that processes data.

A function can be represented through equations, tables, graphs, or verbal descriptions.

Key keywords often include domain, range, mapping, and variables.
Functions can be linear, quadratic, polynomial, trigonometric, exponential, logarithmic, or
many other types.
Understanding functions is crucial in analyzing relationships between quantities and making
predictions or solving problems.

range

In Mathematics, range refers to the set of all possible output values of a function or a set of data.

The range can be determined by finding the difference between the maximum and minimum
values in the data set.
The range provides information about the spread or variability of the data.
The range is affected by outliers or extreme values in the data set.
A larger range indicates a wider range of possible outcomes or values in the data set.

Relation

In the realm of sets, a relation is a connection between two sets of elements, often depicted as
ordered pairs, indicating a specific link or interaction.

Relations can be classified as functions or non-functions based on whether each element in

the first set has only one link or multiple connections in the second set.
 Key types of relations include reflexive (where each element relates to itself), symmetric (if A
is related to B, then B is related to A), and transitive (if A is related to B and B is related to C,
then A is related to C).
A relation can also be antisymmetric, indicating that if A is related to B, then B is not related
to A, except when A equals B.
Pairs of sets with relations can form graphs, such as directed graphs representing one-way
relations like 'is parent of' or undirected graphs representing symmetric relations like 'is
sibling.'

Universal Relation

A universal relation is a relation in which every possible pair of elements from a certain set is
included, creating a complete connection between all elements within that set.

The universal relation can be denoted as U = A × A, where A is the set of elements.

It implies that for any elements a and b in set A, the pair (a, b) is always in the relation.
Universal relations are reflexive, symmetric, and transitive by nature.
In database terms, a universal relation represents a table that contains all possible
combinations of attributes.