From the free course Relations and Functions Course Wiki on Lykke

1.1 Introduction

Key concepts: Relations (recap) · Functions (recap) · Domain · Codomain · Range · Mathematical Definition of a Relation · Functions as Special Relations

This section reviews fundamental concepts of relations and functions from Class XI, including domain, codomain, and range. It formally defines a relation as a subset of a Cartesian product and sets the stage for the chapter's topics, such as different types of relations and functions, composition, and invertible functions.

1.1 Introduction

The study of relations and functions forms the bedrock of advanced mathematics, providing the language and structure to describe connections between mathematical objects. This section serves as a crucial re-introduction and formalization of concepts initially encountered in Class XI, laying the groundwork for more complex topics such as inverse functions, composition of functions, and binary operations. We will revisit the fundamental definitions of relations and functions, precisely define their associated components like domain, codomain, and range, and establish the formal mathematical definition of a relation.

Recapping Foundational Concepts from Class XI

In Class XI, the preliminary notions of relations and functions were introduced, along with their graphical representations and key attributes such as domain, codomain, and range. These concepts are not merely abstract constructs but are essential tools for modeling real-world phenomena, from physical laws to economic trends. A clear understanding of these foundational elements is paramount before delving into their more intricate manifestations.

Relations and Functions: A Précis

A relation intuitively describes a connection or association between elements of two or more sets. For instance, "is less than" is a relation between numbers, and "is the capital of" is a relation between cities and countries. Mathematically, this intuitive idea is formalized through ordered pairs. A function, on the other hand, is a special type of relation where each input from the first set is associated with exactly one output in the second set. This uniqueness constraint is what gives functions their predictive power and makes them central to virtually every branch of mathematics and science.

Domain, Codomain, and Range

To precisely define and understand relations and functions, three critical terms are used to describe the sets involved in their definition: domain, codomain, and range. These terms help delineate the scope of the inputs, the potential outputs, and the actual outputs of a relation or function.

Term Definition For a Relation R from A to B For a Function f from A to B
Domain The set of all possible input values for which the relation or function is defined. The set A. The set A.
Codomain The set of all possible output values that the relation or function could produce. It is the target set where outputs reside. The set B. The set B.
Range The set of all actual output values produced by the relation or function when applied to its domain. It is a subset of the codomain. R_range = {b ∈ B : (a, b) ∈ R for some a ∈ A} f_range = {f(a) : a ∈ A}

For real-valued functions, these concepts are often visualized through graphs on a Cartesian plane, where the domain corresponds to the x-axis values and the range to the y-axis values that the graph covers.

The Mathematical Definition of a Relation

The intuitive notion of a "connection" is rigorously defined using the concept of a Cartesian product of sets. This definition is fundamental as it provides a universal framework for describing any relationship between elements of sets.

What it is: Precise Definition

A relation R from a non-empty set A to a non-empty set B is formally defined as any arbitrary subset of the Cartesian product A × B.

The Cartesian product A × B is the set of all possible ordered pairs (a, b) where a ∈ A and b ∈ B. If A has m elements and B has n elements, then A × B will have m × n ordered pairs. A relation R then simply selects some (or all, or none) of these possible pairs to define the specific connection.

Notation

If an ordered pair (a, b) belongs to the relation R, we can express this in two equivalent ways:

  • (a, b) ∈ R
  • a R b (read as "a is related to b by R")

Why it Matters: Foundational Structure

This definition is crucial because it provides a precise, unambiguous way to describe relationships. Without it, mathematical discourse about connections between objects would lack rigor. It forms the basis for defining more specialized structures like functions, equivalence relations, order relations, and graphs, all of which are essential in various fields, from computer science to physics.

How it Works: Mechanics of Definition

To construct a relation R from set A to set B:

  1. Identify the elements of set A and set B.
  2. Form the Cartesian product A × B, which includes every possible ordered pair (a, b) where a is from A and b is from B.
  3. Define a specific rule or condition that elements a and b must satisfy to be "related."
  4. Select all ordered pairs (a, b) from A × B that satisfy this condition. This collection of selected pairs forms the relation R.

Concrete Example

Let A = {1, 2, 3} and B = {2, 4, 6}. The Cartesian product A × B is: {(1, 2), (1, 4), (1, 6), (2, 2), (2, 4), (2, 6), (3, 2), (3, 4), (3, 6)}

Now, let's define a relation R from A to B with the rule: a R b if a divides b. We check each pair in A × B against this rule:

  • (1, 2): 1 divides 2 (True)
  • (1, 4): 1 divides 4 (True)
  • (1, 6): 1 divides 6 (True)
  • (2, 2): 2 divides 2 (True)
  • (2, 4): 2 divides 4 (True)
  • (2, 6): 2 divides 6 (True)
  • (3, 2): 3 does not divide 2 (False)
  • (3, 4): 3 does not divide 4 (False)
  • (3, 6): 3 divides 6 (True)

Therefore, the relation R is the subset of A × B containing only the pairs that satisfy the condition: R = {(1, 2), (1, 4), (1, 6), (2, 2), (2, 4), (2, 6), (3, 6)}

In this example:

  • Domain of R: {1, 2, 3} (all elements of A are involved as first components)
  • Codomain of R: {2, 4, 6} (the target set B)
  • Range of R: {2, 4, 6} (all elements of B are involved as second components in R)

Functions as Special Relations

While every function is a relation, not every relation is a function. Functions are a particularly important class of relations due to their deterministic nature.

What makes a relation a function?

A relation f from set A to set B is a function if it satisfies two specific conditions:

  1. Every element in the domain A must be related to some element in the codomain B. (No element in A is left "unmapped").
  2. Each element in the domain A must be related to exactly one element in the codomain B. (An element in A cannot map to two different elements in B).

This "one and only one" output for each input is the defining characteristic of a function.

Comparison: Relations vs. Functions

Feature Relation R from A to B Function f from A to B
Definition Any subset of A × B. A special subset of A × B.
Input Mapping An element in A can be related to zero, one, or many elements in B. Every element in A must be related to exactly one element in B.
Domain The set A. The actual elements involved as first components form the domain of R, which is a subset of A. The set A (every element of A must be an input).
Output Mapping Elements in B can be outputs for multiple inputs, or no inputs. Elements in B can be outputs for multiple inputs, or no inputs.
Notation (a, b) ∈ R or a R b (a, f(a)) ∈ f or f(a) = b
Example R = {(1, 2), (1, 4), (2, 2)} (1 maps to 2 and 4) f = {(1, 2), (2, 4), (3, 6)} (each input maps to one output)

Chapter Topics Overview

Building upon these foundational concepts, this chapter will delve deeper into the various classifications and properties of relations and functions. The subsequent sections will cover:

  • Different Types of Relations: Exploring classifications such as empty, universal, reflexive, symmetric, transitive, and equivalence relations.
  • Different Types of Functions: Examining one-one (injective), onto (surjective), and bijective functions.
  • Composition of Functions: Understanding how functions can be combined to form new functions.
  • Invertible Functions: Investigating functions that have inverses and the conditions for their existence.
  • Binary Operations: Introducing operations that combine two elements from a set to produce another element of the same set.

This structured approach ensures a comprehensive understanding of relations and functions, equipping readers with the necessary tools for advanced mathematical analysis.

1.1 Introduction - Relations and Functions Course Wiki - diagram 1
1.1 Introduction - Relations and Functions Course Wiki - diagram 1

Source Materials

Study Relations and Functions Course Wiki on Lykke

This course page is free to open: signed out, you can read its first two sections, and signing in, on any plan, opens the rest. The free Lykke Chrome extension syncs your own Canvas courses, so ChatGPT, Claude and Muse can answer from your classes and deadlines. It only reads Canvas.

Add the free extensionSign in to open every section

All sections of Relations and Functions Course Wiki · Browse more course pages

1.1 Introduction — Relations and Functions Course Wiki | Lykke