Ma · Mathematics

How to Make Addition and Multiplication Tables for a Ring or Ideal

Published By the 9to5Science editorial team

At a glance

  1. 1. List the elements

    Write the ring elements along the top and side of each table.

  2. 2. Apply the operations

    Compute each row-column pair using the ring’s operations, reducing results when working modulo n.

  3. 3. Restrict to the ideal

    For an ideal, use only its elements as row and column labels; calculate with the inherited operations.

  4. 4. Check closure

    Confirm every result in an ideal’s tables is still in the ideal.

An addition or multiplication table for a ring is a Cayley-style table: its row and column labels are ring elements, and each cell records the result of applying the operation to that pair. For an ideal, make tables using only the ideal’s elements as labels and the operations inherited from the larger ring.

Here is a complete example using the ring Z4\mathbb{Z}_4 and its ideal I={0,2}I=\{0,2\}. All arithmetic in the example is modulo 4.

How to read a table

Choose an ordering of the elements and write it across the top and down the left side. The entry in a row and column is the operation applied to those two labels. For example, if the row is 22 and the column is 33, the addition table entry is 2+32+3 reduced modulo 4, and the multiplication table entry is 2⋅32\cdot3 reduced modulo 4.

For these rings, addition and multiplication are commutative, so each table is symmetric across its main diagonal. That symmetry is a useful check, but it does not replace calculating the entries.

Tables for the ring Z4

The elements are 0,1,2,30,1,2,3. The addition table is:

++0123
00123
11230
22301
33012

For instance, the entry in row 3 and column 2 is 1 because 3+2=5≡1(mod4)3+2=5\equiv1\pmod4.

The multiplication table is:

⋅\cdot0123
00000
10123
20202
30321

For example, the entry in row 3 and column 3 is 1 because 3⋅3=9≡1(mod4)3\cdot3=9\equiv1\pmod4. The entry in row 2 and column 2 is 0 because 2⋅2=4≡0(mod4)2\cdot2=4\equiv0\pmod4.

Tables for the ideal {0, 2}

The subset I={0,2}I=\{0,2\} is an ideal of Z4\mathbb{Z}_4. It is closed under addition and additive inverses, and multiplying either of its elements by any element of Z4\mathbb{Z}_4 gives an element of II.

To form its operation tables, keep only 00 and 22 as row and column labels. The calculations still use arithmetic modulo 4:

++02
002
220
⋅\cdot02
000
200

For the addition entry at row 2, column 2, calculate 2+2=4≡0(mod4)2+2=4\equiv0\pmod4. For the multiplication entry at the same position, calculate 2⋅2=4≡0(mod4)2\cdot2=4\equiv0\pmod4. Every entry is in II, as required for these inherited operations to be closed on the ideal.

What the tables show about an ideal

An ideal is first of all an additive subgroup of its ring, so its addition table is closed and includes the additive identity and additive inverses. It is also closed under multiplication of its own elements: if a,b∈Ia,b\in I, then ab∈Iab\in I, since an ideal absorbs multiplication by elements of the ring.

However, an ideal of a ring with identity does not have to contain the ring’s identity. In this example, 1∉I1\notin I. If your course defines a unital subring as one that must share the ambient ring’s identity, II is not such a subring, even though it is an ideal and its inherited operations are closed. Terminology about whether a ring must have an identity can vary, so follow the convention used in your course.

Common mistakes

  • Forgetting to reduce modulo nn. In Z4\mathbb{Z}_4, the result 4 is represented by 0, not by 4.
  • Using elements outside the ideal as labels. An ideal’s own tables have only ideal elements as row and column labels.
  • Changing the operation. The ideal table uses the operations inherited from the ring; it does not introduce a new addition or multiplication.
  • Assuming closure proves every ring axiom. Tables can show closure for a finite set. The other ring laws hold here because they are inherited from the containing ring.
  • Expecting a finite table for every ring. Infinite rings and ideals do not have finite operation tables; the same rule applies, but there are infinitely many pairs to consider.

References

  1. Abstract Algebra, David S. Dummit and Richard M. Foote
  2. A First Course in Abstract Algebra, John B. Fraleigh

Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.