Welcome to the World of Binary Operations!
In this chapter, we are going to explore the fundamental building blocks of Discrete Mathematics. While "Binary Operations" might sound like something out of a sci-fi movie, you actually use them every day! Whenever you add two numbers or multiply them, you are performing a binary operation.
We will learn how to define our own rules for combining elements, how to organise these rules into tables, and eventually, how to identify special structures called Groups. Don't worry if this seems abstract at first; we will use plenty of analogies to keep things grounded.
1. What is a Binary Operation? (DG1)
A binary operation is simply a rule that takes two elements from a set and combines them to produce a single result. We usually use a symbol like \(\star\) or \(\circ\) to represent this rule.
Prerequisite Check: A set is just a collection of things (like the set of all integers, or the set of numbers on a clock). For an operation to be "binary" on a set, the result of the operation must also be in that same set.
Common Examples:
- Modular Arithmetic: Think of a clock. If it's 10 o'clock and you add 4 hours, it's 2 o'clock. This is "addition modulo 12." The result stays within the set of numbers 1 to 12.
- Matrix Multiplication: Taking two matrices and following a specific rule to get a new matrix.
Quick Review: A binary operation combines two things to make one new thing.
2. Key Properties: Order and Grouping (DG2 & DG3)
Not all operations behave the same way. We look for two main properties:
Commutativity (DG2)
An operation is commutative if the order doesn't matter.
Formula: \(a \star b = b \star a\)
Analogy: Putting sugar in tea. Sugar then tea is the same as tea then sugar. However, putting on socks then shoes is not commutative!
Associativity (DG3)
An operation is associative if the way we group them doesn't matter.
Formula: \((a \star b) \star c = a \star (b \star c)\)
Real-world check: Most "normal" math (like addition) is associative. If you add 2 + 3 then add 4, it's the same as 2 plus the result of 3 + 4.
Common Mistake: Don't assume all operations are commutative! Matrix multiplication, for example, is usually not commutative (\(AB \neq BA\)).
3. Cayley Tables (DG4)
For small, finite sets, we can draw a Cayley Table (which is just a fancy name for a multiplication table) to show every possible result of an operation.
How to read a Cayley Table:
1. Look at the element in the left-hand column (let's call it \(a\)).
2. Look at the element in the top row (let's call it \(b\)).
3. The result of \(a \star b\) is where they meet in the grid.
Did you know? You can spot commutativity in a Cayley table instantly! If the table is symmetrical across the main diagonal (top-left to bottom-right), the operation is commutative.
4. Identity and Inverses (DG5 & DG6)
These are the "superpowers" of certain elements in a set.
The Identity Element (\(e\))
The identity is the "do-nothing" element. When you combine it with any other element, that element remains unchanged.
Formula: \(a \star e = a\) and \(e \star a = a\)
Example: In normal addition, 0 is the identity because \(5 + 0 = 5\). In multiplication, 1 is the identity.
The Inverse Element (\(a^{-1}\))
The inverse is the "undo" button. If you combine an element with its inverse, you get back to the identity.
Formula: \(a \star a^{-1} = e\)
Example: If the operation is addition (identity is 0), the inverse of 5 is -5, because \(5 + (-5) = 0\).
Key Takeaway: Every element in a Group must have an inverse, but the Identity is always its own inverse!
5. What is a Group? (DG8)
A Group is a set and an operation that follow four strict rules (Axioms). Use the mnemonic CAIN to remember them:
- C - Closure: Every possible result of the operation must be back in the original set. No "escaping" the set!
- A - Associativity: \((a \star b) \star c = a \star (b \star c)\).
- I - Identity: There must be an identity element \(e\) in the set.
- N - iNverses: Every single element in the set must have an inverse that is also in the set.
Quick Review: If it's a Commutative Group (also called an Abelian Group), it follows one extra rule: \(a \star b = b \star a\).
6. Group Language and Subgroups (DG7 & DG9)
To talk about groups like a mathematician, you need the right vocabulary:
- Order of a Group: The total number of elements in the group.
- Order (or Period) of an Element: The number of times you have to apply the operation to an element to get back to the identity.
- Subgroup: A smaller set of elements within the group that is a group in its own right (it must follow all 4 CAIN rules).
- Trivial Subgroup: The simplest subgroup, containing only the identity \(\{e\}\).
- Proper Subgroup: Any subgroup that isn't the whole group itself.
- Cyclic Group: A group where every element can be "generated" by repeatedly applying the operation to one single element (called the Generator).
7. Lagrange’s Theorem (DG10)
This is a very powerful shortcut!
Lagrange’s Theorem states: The order of any subgroup must be a factor of the order of the main group.
Example: If a group has 6 elements, its subgroups can only have sizes 1, 2, 3, or 6. You will never find a subgroup of size 4 or 5 in a group of size 6!
8. Isomorphism (DG12)
Sometimes, two groups look completely different but behave exactly the same way. We call these groups isomorphic.
Analogy: Imagine a game of Chess played with wooden pieces versus a game played with plastic pieces. The "elements" look different, but the "rules" (the operation) and the way the pieces interact are identical. They are fundamentally the same game.
How to tell if two groups are isomorphic: 1. They must have the same order (same number of elements). 2. They must have the same number of elements of each period. 3. If one is Abelian, the other must be too. 4. Their Cayley Tables will show the same pattern if you re-label the elements.
Final Summary Table
Closure: Result is in the set.
Associative: Grouping doesn't matter.
Identity: \(a \star e = a\).
Inverse: \(a \star a^{-1} = e\).
Abelian: \(a \star b = b \star a\).
Lagrange: Subgroup size divides Group size.
Don't worry if this seems tricky at first! Binary operations are about patterns. Once you start drawing the Cayley tables, the patterns will start to pop out at you.