4.1 Sets, Their Properties and Applications

This section introduced sets as foundational structures for grouping and organizing data, emphasizing membership notation, cardinality, subset relationships, and set builder notation. You practiced operations such as union, intersection, difference, and complement, and used Venn diagrams to visualize these relationships. The section also covered power sets and the Fundamental Laws of Set Theory, which provide algebraic rules for simplifying expressions. These ideas form the basis for later work with relations, partitions, and database structures.

4.2 Relations, their Properties and Applications

You learned that relations are subsets of Cartesian products and can be represented using ordered pairs, directed graphs, or matrices. The key relational properties of reflexive, symmetric, antisymmetric, and transitive were explored, along with the concepts of partial and total orders. The section also introduced inverse relations and composition of relations, including matrix-based composition (Theorem 4.3), which supports efficient computation in algorithms, databases, and network modelling.

4.3 Pairs and Tuples and Cartesian Products

This section explained ordered pairs and tuples as ordered lists of elements, with the Cartesian product [latex]A \times B[/latex] representing all possible pairings between sets. You examined important properties such as non-commutativity and the behaviour of products involving the empty set. The connection to databases was emphasized: tuples correspond directly to table rows, and schemas define the structure and meaning of each tuple position, making Cartesian products essential to data representation.

4.4 Domain, Range, Field and Graphical Representation of Relations

Here, you focused on identifying the domain, range, and field of a relation, which indicate which elements participate as inputs, outputs, or anywhere in the relation. You also learned to visualize relations using directed graphs, making patterns such as cycles, isolated elements, and reachability relationships easy to observe. The graphical viewpoint supports the interpretation of system behaviours, such as messaging connections, access permissions, and communication flows.

4.5 Properties of Binary Relations and Equivalence Relations

This section examined functions as special relations, distinguishing injective, surjective, and bijective mappings, and explored inverse functions and function composition. You then studied equivalence relations (those that are reflexive, symmetric, and transitive). You saw how they group elements into equivalence classes based on shared attributes such as file types, user permissions, or enrollment patterns. These structures support classification and organization in many IT systems.

4.6 Partitions and Equivalent Classes and Closure of Relations

You learned that partitions divide a set into non-overlapping subsets and that every equivalence relation generates a partition, and vice versa. The section also introduced reflexive, symmetric, and transitive closures, which extend relations minimally to satisfy a specific property. Warshall’s algorithm was presented as a matrix-based method for computing transitive closures, enabling efficient reachability analysis in graphs, networks, and dependency systems.

4.7 Relational Model of Databases and Functions

The final section connected relations directly to relational databases, where n-ary relations correspond to tables and tuples to rows. You explored key database operators such as selection, projection, and join, and saw how functions can describe mappings between sets of values, such as IDs and names. This section highlighted how mathematical precision in relations and functions underpins data integrity, query design, and the structure of modern relational database systems.