Lesson Notes By Weeks and Term v3 - Senior Secondary 1
Binary operation
Download the Lessonotes Mobile Nigeria 2025 app for faster lesson access on Android and iPhone.
Binary operation
Download the Lessonotes Mobile Nigeria 2025 app for faster lesson access on Android and iPhone.
Subject: Further Mathematics
Class: Senior Secondary 1
Term: 3rd Term
Week: 2
Theme: Pure Mathematics
This page supports the lesson note with a companion video and a short classroom-ready summary.
For class groups and homework, share this lesson page so learners also get the summary, objectives, and full lesson context.
Define binary operation Identify the different laws of binary operations Draw multiplication table for a binary operation
2. 1. Definition of Binary Operation A binary operation on a non-empty set S is a rule that assigns to every ordered pair of elements (a, b) from S, a unique element c in S. Symbolically, if `` represents a binary operation on a set S, then for any `a ∈ S` and `b ∈ S`, `a b` must also be `∈ S`. The symbol `` (or other symbols like `o`, `∆`, `⊕`, etc.) is used to denote the operation.
Example 1: Consider the set of natural numbers, `N = {1, 2, 3, ...}`. Addition (`+`): `3 + 5 = 8`. Since `3 ∈ N`, `5 ∈ N`, and `8 ∈ N`, addition is a binary operation on `N`. Subtraction (`-`): `3 - 5 = -2`. Since `3 ∈ N`, `5 ∈ N`, but `-2 ∉ N`, subtraction is not a binary operation on `N`.
However, subtraction is a binary operation on the set of integers, `Z`. Multiplication (`×`): `3 × 5 = 15`. Since `3 ∈ N`, `5 ∈ N`, and `15 ∈ N`, multiplication is a binary operation on `N`. Division (`÷`): `3 ÷ 5 = 0.6`. Since `0.6 ∉ N`, division is not a binary operation on `N`. 2.
2. Laws of Binary Operations For a given set S and a binary operation ``: 2.2.
1. Closure Law An operation `` is closed on a set S if, for every `a ∈ S` and `b ∈ S`, the result `a b` is also `∈ S`.
Explanation: This is the defining property of a binary operation. If an operation produces an element outside the set, it is not closed on that set, and therefore not a binary operation on that set.
Example 2: Let `S = {even numbers}`. Operation is addition (`+`). Take `a = 2`, `b = 4`. `a + b = 2 + 4 = 6`. `6` is an even number, so `6 ∈ S`. Take `a = 10`, `b = 20`. `a + b = 10 + 20 = 30`. `30` is an even number, so `30 ∈ S`. Addition is closed on the set of even numbers. Let `S = {odd numbers}`. Operation is addition (`+`). Take `a = 3`, `b = 5`. `a + b = 3 + 5 = 8`. `8` is an even number, so `8 ∉ S`. Addition is not closed on the set of odd numbers. 2.2.
2. Commutative Law An operation `` is commutative on a set S if, for every `a ∈ S` and `b ∈ S`, `a b = b a`. The order of operands does not affect the result.
Explanation: Think of exchanging items in a market stall – the items are the same whether you pick `a` then `b`, or `b` then `a`.
Example 3: Let `a b = a + b - 1` for integers. `a b = a + b - 1` `b a = b + a - 1` Since `a + b - 1 = b + a - 1`, the operation is commutative. Let `a b = a - 2b` for integers. `3 5 = 3 - 2(5) = 3 - 10 = -7` `5 3 = 5 - 2(3) = 5 - 6 = -1` Since `-7 ≠ -1`, the operation is not commutative. 2.2.
3. Associative Law An operation `` is associative on a set S if, for every `a ∈ S`, `b ∈ S`, and `c ∈ S`, `(a b) c = a (b c)`. The grouping of operands does not affect the result.
Explanation: This law is important when dealing with more than two elements. It allows us to perform operations in any order of grouping.
Example 4: Let `a b = a + b + ab` for integers.
LHS: `(a b) c` `(a b) c = (a + b + ab) * c` `= (a + b + ab) + c + (a + b + ab)c` `= a + b + ab + c + ac The grouping of operands does not affect the result.
Explanation: This law is important when dealing with more than two elements. It allows us to perform operations in any order of grouping.
Example 4: Let `a b = a + b + ab` for integers.
LHS: `(a b) c` `(a b) c = (a + b + ab) c` `= (a + b + ab) + c + (a + b + ab)c` `= a + b + ab + c + ac + bc + abc` RHS: `a (b c)` `a (b c) = a (b + c + bc)` `= a + (b + c + bc) + a(b + c + bc)` `= a + b + c + bc + ab + ac + abc` Since LHS = RHS, the operation is associative. 2.2.
4. Identity Element (or Neutral Element) An element `e ∈ S` is called the identity element for the operation `` if, for every `a ∈ S`, `a e = a` and `e a = a`.
Explanation: The identity element acts like '0' for addition (a + 0 = a) or '1' for multiplication (a × 1 = a). It leaves the element unchanged.
Example 5: Let `a b = a + b - 5` for real numbers. To find the identity element `e`, we set `a e = a`. `a + e - 5 = a` `e - 5 = 0` `e = 5` Check: `e a = 5 a = 5 + a - 5 = a`. So, `e = 5` is the identity element. 2.2.
5. Inverse Element For a given element `a ∈ S` and an identity element `e ∈ S`, an element `a−1 ∈ S` is called the inverse of a with respect to the operation `` if `a a−1 = e` and `a−1 a = e`.
Explanation: The inverse 'undoes' the effect of the element `a`, resulting in the identity element. For addition, the inverse of `a` is `-a` (e.g., `5 + (-5) = 0`). For multiplication, the inverse of `a` is `1/a` (e.g., `5 × (1/5) = 1`).
Example 6: Using the operation `a b = a + b - 5` from Example 5, where `e = 5`. To find the inverse `a−1` of an element `a`, we set `a a−1 = e`. `a + a−1 - 5 = 5` `a−1 = 5 + 5 - a` `a−1 = 10 - a` Check: If `a = 7`, `a−1 = 10 - 7 = 3`. `7 3 = 7 + 3 - 5 = 10 - 5 = 5` (which is the identity). 2.2.
6. Distributive Law This law applies when there are two binary operations (say `` and `o`) on the same set
S. The operation `` is distributive over the operation `o` if, for every `a, b, c ∈ S`: `a (b o c) = (a b) o (a c)` (left distributive) `(b o c) a = (b a) o (c a)` (right distributive)
Explanation: This law links two operations, similar to how multiplication distributes over addition in ordinary arithmetic: `a × (b + c) = (a × b) + (a × c)`.
Example 7: Consider `S = Z` (integers). Let `` be multiplication (`×`) and `o` be addition (`+`). We know `a × (b + c) = (a × b) + (a × c)`. So, multiplication is distributive over addition on the set of integers. 2.
3. Multiplication Table (Cayley Table) A multiplication table (or Cayley table) is a way to define a binary operation on a finite set. The elements of the set are listed in the first row and first column. The entry in a cell is the result of the operation on the row element and the column element.
Construction:
1. List the elements of the set in the first row and first column.
2. For each cell `(row_element, column_element)`, calculate the result of the operation distributive over addition on the set of integers. 2.
3. Multiplication Table (Cayley Table) A multiplication table (or Cayley table) is a way to define a binary operation on a finite set. The elements of the set are listed in the first row and first column. The entry in a cell is the result of the operation on the row element and the column element.
Construction:
1. List the elements of the set in the first row and first column.
2. For each cell `(row_element, column_element)`, calculate the result of the operation `row_element column_element`.
Interpretation: Closure: If all entries in the table are elements of the original set, the operation is closed.
Commutativity: If the table is symmetric about its main diagonal (i.e., `table[i][j] = table[j][i]`), the operation is commutative.
Identity Element: If there is a row (and column) that is identical to the header row (and column), the element corresponding to that row/column is the identity element.
Inverse Element: To find the inverse of an element `a`, locate the identity element `e` in the row of `a`. The column header corresponding to `e` is `a−1`. (Similarly for the column of `a` and row header).
Example 8: Modulo Arithmetic Consider the set `S = {0, 1, 2, 3}` and the operation `` defined as `a b = (a + b) mod 4`. This means add `a` and `b`, then divide the sum by 4 and take the remainder.
Let's construct the multiplication table: | | 0 | 1 | 2 | 3 | |---|---|---|---|---| | 0 | 0 | 1 | 2 | 3 | | 1 | 1 | 2 | 3 | 0 | | 2 | 2 | 3 | 0 | 1 | | 3 | 3 | 0 | 1 | 2 | Closure: All entries in the table `{0, 1, 2, 3}` are within the set `S`. So, the operation is closed.
Commutativity: The table is symmetric about the main diagonal. For example, `1 2 = 3` and `2 1 = 3`. So, the operation is commutative.
Identity Element: The row for `0` (`0, 1, 2, 3`) is identical to the header row. The column for `0` (`0, 1, 2, 3`) is identical to the header column. So, `0` is the identity element.
Inverse Elements: Inverse of `0`: `0 x = 0`. From the table, `0 0 = 0`. So `0−1 = 0`. Inverse of `1`: `1 x = 0`. From the table, `1 3 = 0`. So `1−1 = 3`. Inverse of `2`: `2 x = 0`. From the table, `2 2 = 0`. So `2−1 = 2`. Inverse of `3`: `3 x = 0`. From the table, `3 1 = 0`. So `3−1 = 1`. --- 3.
1. Introduction (5-10 minutes)
Teacher Activity: Begin by asking students to recall basic arithmetic operations (addition, subtraction, multiplication, division).
Pose questions like: "What happens when you add two numbers?" "Is the result always a number of the same type (e.g., integer + integer = integer)?" Introduce the idea of generalizing these "rules of combination" to any set of elements, not just numbers. This leads to the concept of a binary operation. Briefly state the lesson objectives. 3.
2. Lesson Development - Definition and Closure (15-20 minutes)
Teacher Activity: Define "binary operation" formally, explaining `a b = c` where `a, b, c ∈ S`. Emphasize the closure property as critical to the definition. Provide simple, concrete examples relevant to Nigeria (e.g., combining two types of farm produce, `Yam Rice`, if `*` means mixing, what's the result? Is it still farm produce?). Demonstrate examples and non-examples of binary operations (e.g., addition on integers vs. division on integers). Use guided questioning to check understanding of closure.
Student Activity: Actively participate in answering questions about basic operations. Copy definitions and examples. Attempt to determine if given operations are binary on specified sets. Engage in class discussion and ask clarifying questions. 3.
3. Lesson Development - Laws of Binary Operations (30-40 minutes)
Teacher Activity: Introduce and explain each law sequentially: Commutative, Associative, Identity, Inverse, Distributive.
For each law: State the formal definition. Provide clear, worked examples, contrasting operations that obey the law with those that do not (e.g., `a+b` vs `a-b`). Emphasize algebraic manipulation for verification. Encourage mental checks with simple numbers first.
Student Activity: Take notes on each law and its definition. Work through examples provided by the teacher, step-by-step. Attempt to verify specific laws for given operations during short in-class practice. Ask questions regarding the application of each law. 3.
4. Lesson Development - Multiplication Tables (Cayley Tables) (20-25 minutes)
Teacher Activity: Explain the purpose and construction of a multiplication table for a finite set. Walk students through the step-by-step creation of a simple Cayley table (e.g., using modulo arithmetic on `S={0,1,2}`). Demonstrate how to use the table to check for closure, commutativity, and to identify identity and inverse elements. Emphasize the visual nature of checking these properties from the table.
Student Activity: Observe and follow the teacher's example of table construction. Individually or in pairs, attempt to construct a small multiplication table for a different given set and operation. Practice identifying properties (closure, commutativity, identity, inverse) from a completed table. 3.
5. Consolidation and Wrap-up (5-10 minutes)
Teacher Activity: Recap the main concepts covered: definition of binary operation, the six laws, and multiplication tables. Address any lingering questions or misconceptions. Assign practice problems for independent work.
Student Activity: Ask final questions. Review notes. Prepare for independent practice.
Materials: Whiteboard/chalkboard, markers/chalk, prepared examples and exercises, (optional: chart showing laws). ---
Logistics and Resource Management (e.g., Food Distribution): Imagine a community food bank in Nigeria that combines different types of food items (e.g., bags of rice, cartons of noodles, cans of oil) for distribution. A "binary operation" could be defined as a specific method of combining two types of food items to form a single distribution package. For instance, `Rice Oil` might represent "a package containing a specific ratio of rice and oil". The rules for combination must ensure that the resulting package is always a valid "distribution item" (closure). Whether combining `Rice Oil` gives the same result as `Oil * Rice` (commutativity) depends on the blending/packaging rules. This abstract thinking helps in designing efficient and standardized distribution processes. Team Sports and Group Dynamics (e.g., Football Clubs): In Nigerian football, coaches combine players to form a team. If the 'elements' are individual players and the 'operation' is team formation, different rules apply. For example, `Player A Player B` could represent forming a strike partnership.
The question of commutativity arises: Does `Ronaldo Messi` yield the same partnership outcome as `Messi Ronaldo`? (Often yes, in terms of skills, but maybe not in terms of on-field dynamics). The associative law could apply to combining three players: `(Attacker Midfielder) Defender` might involve selecting two upfront then adding a third, which could be different from `Attacker (Midfielder * Defender)` where a midfield-defense pairing is established first. The concept of an "identity player" could be a player whose inclusion doesn't change the core strategy, or an "inverse player" who balances out a team's weakness. Traditional Medicine and Ingredient Blending: Many Nigerian traditional remedies involve precise combinations of herbs, roots, and other natural ingredients. Let the ingredients be elements of a set `S`. The process of mixing two ingredients `A` and `B` (`A B`) results in a new compound. For this to be a valid "binary operation" within the context of traditional medicine, the resulting compound must itself be a recognized therapeutic substance or intermediate (`closure`). The order of mixing (commutativity) can be crucial for chemical reactions – `Water Powder` is different from `Powder * Water` in some contexts. The identity element could be a 'base' ingredient that doesn't alter the core property of other ingredients when mixed. ---