Proofs Involving Inequalities

When working with inequalities, there are a number of logical relationships we can use to create new inquealities from an initial premise. These relationships are based on the inherent ordering that inequalities place on numbers on the number line.

For example, if we are told that a<ba < b and b<cb < c, then what can we say about the relationship between aa and cc:

  • a<ba < b tells us that bb lies to the right of aa on the number line
  • b<cb < c tells us that cc lies to the right of bb on the number line

If we consider the location of bb on the number line, we see that aa must lie to its left, and cc must lie on its right. Therefore, we can be certain that cc lies to the right of aa on the number line, and so we can conclude that

a<ca < c

The transitive property of inequalities

On the other hand, if we are told that a<ba < b and b>cb > c, then we do not have enough information to assert any propositions about the relationship between aa and cc

  • a<ba < b tells us that bb lies to the right of aa on the number line
  • b>cb > c tells us that cc lies to the left of bb on the number line
    • cc could be further left of bb than aa is, which would mean that c<ac < a
    • cc could be closer to bb than aa is, which would mean that a<ca < c
    • cc could even be equal to aa

Indeterminate inequalities

With this in mind, we do need to be careful when combining information from multiple inequalities. We also need to be careful when we consider weak inequalities like \leq and \geq. For example, suppose we are told:

  • aba \leq b, which tells us that bb lies to the right of aa or is in fact equal to a
  • b<cb < c, which tells us that cc lies to the left of bb but they are not equal

When we compare aa and cc, we can still be certain that a<ca < c and that they are not equal. This is because, even though bb can be equal to aa, cc cannot be equal to bb and therefore to aa.

But, if we were instead told that aba \leq b and bcb \leq c, then it is possible that cc can be equal to bb and therefore can also be equal to aa, so we conclude that aca \leq c. We refer to these as the transitive properties of inqualities. These are summarised in the table below

Inequality 1Inequality 2Conclusion
a<ba < bb<cb < ca<ca < c
a<ba < bbcb \leq ca<ca < c
aba \leq bb<cb < ca<ca < c
aba \leq bbcb \leq caca \leq c
a<ba < bb>cb > cUnknown
a<ba < bbcb \geq cUnknown
aba \leq bb>cb > cUnknown
aba \leq bbcb \geq cUnknown

...

Log in or sign up to see more