A partially ordered set is a set with a relation that is reflexive, antisymmetric, and transitive. The set of all subsets of a given set is a partially ordered set with the subset relation.

A set A is a subset of a set B if every element of A is also an element of B. In this case, every element of B is also an element of A, so B is a subset of A.

An equivalence relation is a relation that is reflexive, symmetric, and transitive. The relation of congruence modulo 5 on the set of integers is an equivalence relation because it is reflexive (every integer is congruent to itself modulo 5), symmetric (if a is congruent to b modulo 5, then b is congruent to a modulo 5), and transitive (if a is congruent to b modulo 5 and b is congruent to c modulo 5, then a is congruent to c modulo 5).

The inverse of a relation R is the relation that consists of all the ordered pairs (b, a) such that (a, b) is in R. In this case, the inverse of R is {(2, 1), (3, 2), (4, 3)}.

A function is a relation that assigns to each element of a set a unique element of another set. The relation of divisibility on the set of integers is a function because each integer is assigned a unique set of divisors.

The domain of a function is the set of all possible values of the independent variable. In this case, the independent variable is x, and x can be any real number. Therefore, the domain of the function f(x) = x² + 1 is the set of all real numbers.

The range of a function is the set of all possible values of the dependent variable. In this case, the dependent variable is f(x), and f(x) is always a positive real number. Therefore, the range of the function f(x) = x² + 1 is the set of all positive real numbers.

A one-to-one function is a function that assigns to each element of the domain a unique element of the range. In other words, each element of the range is assigned to exactly one element of the domain. The function f(x) = sin(x) is one-to-one because each value of x is assigned to a unique value of sin(x).

An onto function is a function that assigns to each element of the range at least one element of the domain. In other words, every element of the range is assigned to at least one element of the domain. The function f(x) = cos(x) is onto because every value of cos(x) is assigned to at least one value of x.

A bijective function is a function that is both one-to-one and onto. In other words, each element of the domain is assigned to a unique element of the range, and every element of the range is assigned to at least one element of the domain. The function f(x) = sin(x) is bijective because it is both one-to-one and onto.

The composition of the functions f(x) and g(x) is the function f(g(x)). To find f(g(x)), we first substitute g(x) into f(x). This gives us f(g(x)) = f(x + 1). We then simplify f(x + 1) to get f(g(x)) = x² + 2x + 1.

To find the inverse of a function, we switch the roles of the independent and dependent variables. In other words, we solve the equation y = f(x) for x in terms of y. In this case, we have y = x³ - 1. Solving for x, we get x = (y + 1)^1/3. Therefore, the inverse of the function f(x) = x³ - 1 is f^-1(x) = x^1/3 + 1.

A reflexive relation is a relation that relates every element of a set to itself. In other words, for every element x in the set, (x, x) is in the relation. The relation of equality on the set of real numbers is reflexive because for every real number x, (x, x) is in the relation.

An antisymmetric relation is a relation that does not relate any element to itself. In other words, for every element x in the set, (x, x) is not in the relation. The relation of divisibility on the set of integers is antisymmetric because for every integer x, (x, x) is not in the relation.

A transitive relation is a relation that relates any two elements that are related to a third element. In other words, if (x, y) is in the relation and (y, z) is in the relation, then (x, z) is in the relation. The relation of divisibility on the set of integers is transitive because if x divides y and y divides z, then x divides z.