Prove: If a divides b and b divides c, then a divides c.

This theorem is usually written as follows:

Theorem: Let a, b, and c be integers with a \ne 0 and b \ne 0. If a|b and b|c, then a|c.

In order to prove this statement, we first need to understand what the math notation \color{red}a|b implies.

I have a separate lesson discussing the meaning of a|b.

To review, the math notation a|b is read as “a divides b “. The assumption is that both a and b are integers but a doesn’t equal zero, a \ne 0. In addition, the vertical bar in a|b is called pipe.

pipe symbol in a|b

As it stands, the notation a|b is not useful to us because in its current form, there’s no way that we can algebraically manipulate it. We must convert it in an equation form.

Here’s the thing, a|b can be written in the equation as b = ar where r is an integer.


For example, in 2|10, we know that 2 evenly divides 10. That means there is an integer when multiplied to 2 gives a product of 10.

What could that number be? It is \color{red}5 since 2 \times 5 = 10.

Thus, we say 2|10 implies 10 = 2\left( 5 \right)


BRAINSTORM BEFORE WRITING THE PROOF

brainstorm before writing the proof image

Note: The purpose of brainstorming in writing proof is for us to understand what the theorem is trying to convey; and gather enough information to connect the dots, which will be used to bridge the hypothesis and the conclusion.

Since we are using the method of direct proof, we want to show that we can manipulate the hypothesis to arrive at the conclusion.

Hypothesis: a divides b AND b divides c

Conclusion: a divides c

the goal is show if a|b and b|c then a|c

Now, let’s express each notation into an equation. We hope that by doing so will reveal an opportunity so we can proceed with our line of reasoning.

NotationsEquationsNotes
a|bb = am ← Equation #1m is an integer
b|cc = bn ← Equation #2n is an integer

What should we do next? Well, we can substitute the expression for b of Equation #1 into the b of Equation #2.

substitute b=am into c=bn to gt c=(am)n

After substitution, we get the one below.

c = \left( {am} \right)n

Apply the Associative Property of Multiplication. Notice that the grouping symbol (parenthesis) moves from am to mn.

The Associative Property of Multiplication guarantees that when multiplying numbers, the product is always the same no matter how we group the numbers. Thus, \left( {am} \right)n = a\left( {mn} \right).

This property allows us to rewrite the equation without breaking any math laws because the two equations may look different but they are essentially the same or equivalent.

I hope you can see now why we have to perform such slight adjustment using the Associative Property.

c = \left( {am} \right)nc = a\left( {mn} \right)

rewrite c=(am)n as c=a(mn)

After we substitute the expression of \large{b} from Equation #1 into the \large{b} of Equation #2, and apply the Associative Property of Multiplication, we are ready to move to the next step.

Notice that inside the parenthesis are two arbitrary integers that are being multiplied.

If you remember, there is a simple yet very useful property of the Set of Integers ( the symbol for the set of integers is \mathbb{Z} ).

The property is called the Closure Property of Multiplication. It states that if m and n are integers then the product of m and n is also an integer. Therefore, m \times n \in \mathbb{Z}.

From where we left off, we have

c = a\left( {mn} \right).

Since mn is just another integer using the Closure Property of Multiplication, that means we can let mn = k where k is an integer.

We can rewrite c = a\left( {mn} \right) as c = a\left( {k} \right).

The equation c = a\left( {k} \right) can be expressed in notation form as a|c which means that a divides c.

This is exactly where we want to show! Now it’s time to write the actual proof.


WRITE THE PROOF

THEOREM: Let a, b, and c be integers with a \ne 0 and b \ne 0. If a|b and b|c, then a|c.

PROOF: Suppose a, b, and c are integers where both a and b do not equal to zero. Since a divides b, a|b, then there exists an integer m such that b = am (Equation #1). Similarly, since b divides c, b|c, there exists an integer n such that c=bn (Equation #2). Now, substitute the expression of b from Equation #1 into the b in Equation #2. By doing so, the equation c=bm is transformed to c=(am)n. Next, apply the Associative Property of Multiplication on the equation c=(am)n to get c=a(mn). Because m and n are integers, their product must also be an integer by the Closure Property of Multiplication; that is, m \times n \in \mathbb{Z}. Let k = m \times n. In the equation c=a(mn), substitute mn by k to obtain c=ak.The equation c=ak implies that a divides c or when written in shorthand we have a|c. Therefore, we have proved that a divides c. ◾️