The Central Idea
Suppose a finite set
\[ S=\{a,b,c\} \]has a binary operation \(\star\).
Every ordered pair
\[ (x,y)\in S\times S \]must produce one output
\[ x\star y\in S. \]An operation table records all of these outputs in one organized grid.
Operation Tables Represent Functions
A binary operation on \(S\) is a function
\[ \star:S\times S\to S. \]If \(S\) is finite, the entire function can be displayed as a table.
The row identifies the first input, the column identifies the second input, and the cell where they meet contains the output.
Thus each table entry represents
\[ \boxed{x\star y}. \]Basic Layout of an Operation Table
Let
\[ S=\{a,b,c\}. \]A general operation table has the form
| \(\star\) | \(a\) | \(b\) | \(c\) |
|---|---|---|---|
| \(a\) | \(a\star a\) | \(a\star b\) | \(a\star c\) |
| \(b\) | \(b\star a\) | \(b\star b\) | \(b\star c\) |
| \(c\) | \(c\star a\) | \(c\star b\) | \(c\star c\) |
The row element comes first in the operation, and the column element comes second.
Reading a Table Correctly
Suppose a table contains the following entry:
| \(\star\) | \(a\) | \(b\) |
|---|---|---|
| \(a\) | \(a\) | \(b\) |
| \(b\) | \(a\) | \(b\) |
The entry in row \(b\), column \(a\) is \(a\).
Therefore,
\[ \boxed{b\star a=a}. \]Reversing the row and column would ask a different question:
\[ a\star b=b. \]Ordered Inputs Matter
In general,
\[ a\star b \]and
\[ b\star a \]may be different.
Therefore row and column positions cannot be casually reversed.
If the table happens to be symmetric across its main diagonal, then the operation is commutative. Otherwise, order matters.
Example: Addition Modulo 3
Let
\[ S=\{0,1,2\}, \]and let \(\oplus\) mean addition modulo \(3\).
| \(\oplus\) | \(0\) | \(1\) | \(2\) |
|---|---|---|---|
| \(0\) | \(0\) | \(1\) | \(2\) |
| \(1\) | \(1\) | \(2\) | \(0\) |
| \(2\) | \(2\) | \(0\) | \(1\) |
The table records all nine possible ordered pairs.
Reading the Modulo-3 Table
The entry in row \(1\), column \(2\) is \(0\), so
\[ \boxed{1\oplus2=0}. \]The entry in row \(2\), column \(2\) is \(1\), so
\[ \boxed{2\oplus2=1}. \]These results agree with ordinary addition followed by reduction modulo \(3\):
\[ 1+2=3\equiv0\pmod3, \] \[ 2+2=4\equiv1\pmod3. \]Constructing a Table from a Formula
Suppose
\[ S=\{0,1,2\} \]and define
\[ a\star b\equiv a+2b\pmod3. \]To construct the table, evaluate the formula for every ordered pair in \(S\times S\).
For example,
\[ 1\star2 \equiv 1+2(2) = 5 \equiv2\pmod3. \]So the row \(1\), column \(2\) entry is \(2\).
Complete Table for the Custom Operation
For
\[ a\star b\equiv a+2b\pmod3, \]the table is
| \(\star\) | \(0\) | \(1\) | \(2\) |
|---|---|---|---|
| \(0\) | \(0\) | \(2\) | \(1\) |
| \(1\) | \(1\) | \(0\) | \(2\) |
| \(2\) | \(2\) | \(1\) | \(0\) |
The operation is completely determined by these nine entries.
Checking Closure from a Table
If a table is intended to represent a binary operation on \(S\), every output must belong to \(S\).
For
\[ S=\{0,1,2\}, \]every table entry must be one of
\[ 0,\qquad1,\qquad2. \]If an entry such as \(3\) appeared, closure would fail.
Closure Is Visible Immediately
Operation tables make closure especially easy to inspect.
If every cell contains an element of the underlying set, the table is closed.
If even one cell contains something outside the set, then the proposed operation is not closed on that set.
This is the finite-table version of
\[ a,b\in S \Longrightarrow a\star b\in S. \]Checking Commutativity from a Table
An operation is commutative if
\[ a\star b=b\star a \]for every pair \(a,b\in S\).
In an operation table, this means the entry in row \(a\), column \(b\) must equal the entry in row \(b\), column \(a\).
Therefore a commutative table is symmetric across the main diagonal.
The Main Diagonal
The main diagonal contains
\[ a\star a, \] \[ b\star b, \] \[ c\star c, \]and so on.
Commutativity does not impose a special value on these diagonal entries, but it requires matching values on opposite sides of the diagonal.
Example: Detecting Noncommutativity
Consider
| \(\diamond\) | \(a\) | \(b\) |
|---|---|---|
| \(a\) | \(a\) | \(a\) |
| \(b\) | \(b\) | \(b\) |
From the table,
\[ a\diamond b=a, \]while
\[ b\diamond a=b. \]If \(a\ne b\), then
\[ a\diamond b\ne b\diamond a. \]Therefore the operation is not commutative.
Finding an Identity from a Table
An identity \(e\) satisfies
\[ e\star a=a \]and
\[ a\star e=a \]for every \(a\in S\).
In a table, the row for \(e\) must reproduce the column labels in order, and the column for \(e\) must reproduce the row labels in order.
Identity in the Modulo-3 Table
Return to addition modulo \(3\):
| \(\oplus\) | \(0\) | \(1\) | \(2\) |
|---|---|---|---|
| \(0\) | \(0\) | \(1\) | \(2\) |
| \(1\) | \(1\) | \(2\) | \(0\) |
| \(2\) | \(2\) | \(0\) | \(1\) |
The row for \(0\) reads
\[ 0,1,2, \]and the column for \(0\) also reads
\[ 0,1,2. \]Therefore,
\[ \boxed{0} \]is the identity.
Finding Inverses from a Table
Once the identity \(e\) is known, an inverse of \(a\) is an element \(b\) satisfying
\[ a\star b=e \]and
\[ b\star a=e. \]In a commutative table, finding an identity entry in row \(a\) is enough to locate the same relation in the corresponding column.
In a noncommutative table, both directions must be checked.
Inverses in Addition Modulo 3
The identity is \(0\).
From the table,
\[ 0\oplus0=0, \]so \(0\) is self-inverse.
Also,
\[ 1\oplus2=0 \]and
\[ 2\oplus1=0. \]Therefore,
\[ \boxed{1^{-1}=2,\qquad2^{-1}=1} \]relative to \(\oplus\).
Self-Inverse Elements in a Table
An element \(a\) is self-inverse if
\[ a\star a=e. \]Therefore self-inverse elements can be found by examining the main diagonal for occurrences of the identity.
This is another example of structural information becoming visually accessible in an operation table.
Does Every Row Need Every Element?
Not for an arbitrary binary operation.
A binary operation table only requires each entry to belong to the set.
It does not require every row or column to contain every element exactly once.
That stronger pattern appears in important structures such as finite groups, but it is not part of the definition of a binary operation itself.
Repeated Entries Are Allowed
Consider the operation
\[ a\star b=a \]on
\[ S=\{a,b,c\}. \]Its table is
| \(\star\) | \(a\) | \(b\) | \(c\) |
|---|---|---|---|
| \(a\) | \(a\) | \(a\) | \(a\) |
| \(b\) | \(b\) | \(b\) | \(b\) |
| \(c\) | \(c\) | \(c\) | \(c\) |
Repetition is perfectly valid.
Associativity Is Harder to Read Directly
Closure, commutativity, and identity elements have convenient visual signatures in a table.
Associativity is different.
To test associativity, we must compare
\[ (a\star b)\star c \]with
\[ a\star(b\star c) \]for triples of elements.
Testing One Associative Triple
Suppose we want to test the triple
\[ (a,b,c). \]First look up
\[ a\star b. \]Suppose the result is \(d\). Then look up
\[ d\star c. \]This gives
\[ (a\star b)\star c. \]Separately, look up \(b\star c\), then combine \(a\) with that result.
Associativity requires both final answers to match.
How Many Associativity Checks?
If \(S\) has \(n\) elements, then there are
\[ n^3 \]ordered triples
\[ (a,b,c)\in S\times S\times S. \]A direct brute-force associativity test therefore may require up to
\[ \boxed{n^3} \]comparisons.
For small finite tables this is manageable. For larger structures, structural arguments are usually preferable.
Building a Table Systematically
To construct an operation table:
- List the elements of the set across the top.
- List the same elements down the left side.
- Choose a row element as the first input.
- Choose a column element as the second input.
- Apply the operation rule.
- Place the output in the corresponding cell.
- Repeat until every cell is filled.
- Check that every output lies in the set.
Number of Entries in a Table
If a finite set contains
\[ n \]elements, then there are
\[ n^2 \]ordered pairs.
Therefore an operation table contains
\[ \boxed{n^2} \]output cells.
A four-element set requires
\[ 4^2=16 \]entries.
How Many Tables Are Possible?
If \(S\) has \(n\) elements, each of the \(n^2\) cells may contain any one of the \(n\) elements.
Therefore the number of possible binary operation tables on \(S\) is
\[ \boxed{n^{n^2}}. \]For a two-element set,
\[ 2^{2^2}=2^4=16 \]different binary operations are possible.
Tables Can Define Operations Without Formulas
A formula is not required.
For a finite set, the table itself can be the complete definition of the operation.
Once every ordered pair has exactly one specified output in the set, the operation is fully determined.
This is useful when studying systems whose operations are most naturally described by finite behavior rather than arithmetic formulas.
Tables and Symmetry Operations
Operation tables are especially important when the elements represent transformations or symmetries.
In that setting, the operation is often composition.
The table records which transformation results when one symmetry is followed by another.
This viewpoint will become important when we study subgroups and symmetry groups.
Tables and Modular Arithmetic
Modular arithmetic provides some of the most accessible finite operation tables.
For addition modulo \(n\), the set
\[ \{0,1,\ldots,n-1\} \]is closed under modular addition.
For multiplication modulo \(n\), the same set is also closed, although inverse behavior can differ dramatically depending on the modulus and the chosen element.
Example: Multiplication Modulo 4
Consider
\[ S=\{0,1,2,3\} \]under multiplication modulo \(4\).
| \(\odot\) | \(0\) | \(1\) | \(2\) | \(3\) |
|---|---|---|---|---|
| \(0\) | \(0\) | \(0\) | \(0\) | \(0\) |
| \(1\) | \(0\) | \(1\) | \(2\) | \(3\) |
| \(2\) | \(0\) | \(2\) | \(0\) | \(2\) |
| \(3\) | \(0\) | \(3\) | \(2\) | \(1\) |
The identity is \(1\).
The element \(3\) is self-inverse because
\[ 3\odot3=1. \]But \(2\) has no multiplicative inverse modulo \(4\), because no entry in row \(2\) equals \(1\).
Identity Does Not Guarantee Universal Inverses
The multiplication-modulo-\(4\) table contains an identity,
\[ 1, \]but not every element has an inverse.
This distinction becomes critical in classifying algebraic structures.
A system with an associative operation and identity is a monoid. Requiring every element to have an inverse produces the stronger structure called a group.
Operation Tables as Structural Fingerprints
For a finite algebraic structure, an operation table captures the complete behavior of the operation.
From it we can investigate:
- closure;
- commutativity;
- identity elements;
- inverse elements;
- idempotent elements;
- absorbing elements;
- associativity through repeated lookup;
- subsets that may form smaller structures.
Idempotent Elements
An element \(a\) is idempotent under \(\star\) if
\[ \boxed{a\star a=a}. \]These elements appear directly on the main diagonal of an operation table.
If the diagonal entry in row \(a\), column \(a\) equals \(a\), then \(a\) is idempotent.
Absorbing Elements
An element \(z\) is an absorbing element if
\[ z\star a=a\star z=z \]for every \(a\in S\).
Ordinary \(0\) is absorbing under multiplication because
\[ 0a=a0=0. \]In an operation table, the row and column for an absorbing element are filled entirely with that element.
Identity and Absorbing Elements Are Different
An identity leaves the other element unchanged:
\[ e\star a=a. \]An absorbing element replaces the result with itself:
\[ z\star a=z. \]Under ordinary multiplication,
\[ 1 \]is the identity, while
\[ 0 \]is absorbing.
Common Error: Reversing Row and Column Inputs
The standard convention used here is:
\[ \text{row element}\star\text{column element}. \]Therefore row \(a\), column \(b\) represents
\[ a\star b. \]If the operation is not commutative, reversing these positions can give a different answer.
Common Error: Assuming Symmetry
A table does not need to be symmetric.
Symmetry across the main diagonal is evidence of commutativity.
If the operation is noncommutative, the entries above and below the diagonal may differ.
Common Error: Assuming Every Table Has an Identity
A binary operation can be perfectly valid without having an identity.
To find an identity, one row and one corresponding column must reproduce the element labels exactly.
If no element satisfies both conditions, no two-sided identity exists.
Common Error: Assuming Every Element Has an Inverse
Inverses are defined relative to an identity.
Even if an identity exists, some rows may contain no identity entry at all.
Such an element has no right inverse. Similar inspection of columns is needed for left inverses in noncommutative settings.
Common Error: Reading Associativity from Symmetry
Table symmetry tests commutativity, not associativity.
Associativity compares
\[ (a\star b)\star c \]and
\[ a\star(b\star c). \]It requires repeated lookup or a separate structural proof.
A Reliable Procedure for Reading a Table
- Identify the underlying set.
- Identify the operation symbol.
- Use the row as the first input.
- Use the column as the second input.
- Read the cell as the output.
- Check whether every output belongs to the set.
- Look for symmetry if testing commutativity.
- Look for an identity row and identity column.
- Use the identity to locate inverses.
- Use repeated lookup when testing associativity.
Example: Full Table Analysis
Consider
\[ S=\{e,a,b\} \]with operation \(\star\):
| \(\star\) | \(e\) | \(a\) | \(b\) |
|---|---|---|---|
| \(e\) | \(e\) | \(a\) | \(b\) |
| \(a\) | \(a\) | \(b\) | \(e\) |
| \(b\) | \(b\) | \(e\) | \(a\) |
Closure
Every entry is one of \(e,a,b\), so the operation is closed.
Commutativity
The table is symmetric across the main diagonal, so the operation is commutative.
Identity
The row and column for \(e\) reproduce the labels, so
\[ \boxed{e} \]is the identity.
Inverses
Since
\[ e\star e=e, \]\(e\) is self-inverse.
Also,
\[ a\star b=e \]and
\[ b\star a=e. \]Therefore \(a\) and \(b\) are inverses of one another.
Practice 1: Read an Entry
Using addition modulo \(3\), find
\[ 2\oplus1. \]Practice 2: Read Another Entry
Using addition modulo \(3\), find
\[ 2\oplus2. \]Practice 3: Check Commutativity
Is the addition-modulo-\(3\) table commutative? Explain how the table shows your answer.
Practice 4: Find the Identity
Find the identity element in the addition-modulo-\(3\) table.
Practice 5: Find an Inverse
Find the inverse of \(1\) under addition modulo \(3\).
Practice 6: Multiplication Modulo 4
Using the multiplication-modulo-\(4\) table, find
\[ 3\odot3. \]Practice 7: Identify a Noninvertible Element
Does \(2\) have an inverse under multiplication modulo \(4\)? Explain using the table.
Practice 8: Identify an Absorbing Element
In the multiplication-modulo-\(4\) table, which element is absorbing?
Practice 9: Count Table Entries
How many output cells are required for an operation table on a set with five elements?
Practice 10: Identify the Error
A student says:
“The table is symmetric, so the operation must be associative.”
Explain the error.
Practice Answers
Practice 1
\[ \boxed{2\oplus1=0}. \]Practice 2
\[ \boxed{2\oplus2=1}. \]Practice 3
Yes. The table is symmetric across the main diagonal, so
\[ a\oplus b=b\oplus a \]for all \(a,b\in\{0,1,2\}\).
Practice 4
The identity is
\[ \boxed{0}. \]Practice 5
Since
\[ 1\oplus2=0 \]and \(0\) is the identity, the inverse of \(1\) is
\[ \boxed{2}. \]Practice 6
\[ \boxed{3\odot3=1}. \]Practice 7
No. Row \(2\) contains
\[ 0,2,0,2, \]so it never produces the identity \(1\).
Practice 8
The absorbing element is
\[ \boxed{0}, \]because every entry in row \(0\) and column \(0\) is \(0\).
Practice 9
A five-element set has
\[ 5^2=25 \]ordered pairs, so the table requires
\[ \boxed{25} \]output cells.
Practice 10
Symmetry across the main diagonal indicates commutativity:
\[ a\star b=b\star a. \]Associativity is a different property:
\[ (a\star b)\star c=a\star(b\star c). \]It must be tested with triples or proved separately.
What to Remember
An operation table represents a binary operation
\[ \boxed{\star:S\times S\to S} \]on a finite set.
- The row gives the first input.
- The column gives the second input.
- The cell gives the output.
- Closure requires every cell to contain an element of the set.
- Commutativity appears as symmetry across the main diagonal.
- An identity reproduces the element labels in both its row and column.
- Inverses are located by finding where pairs produce the identity.
- Associativity requires repeated lookup across triples.
For a finite set, the operation table acts as a complete structural record of the operation.
Where We Go Next
Operation tables let us see the properties of finite operations directly. We are now ready to organize those properties into named algebraic structures.
The next lesson, Semigroups, Monoids, and Groups, shows how closure, associativity, identity elements, and inverses combine to create a hierarchy of increasingly structured algebraic systems.