Show that the relation `R` in `R` defined as `R={(a,b):ageb}` is transitive.

Explanation

To show that the relation \( R \) defined as \( R = \{(a, b) : a > b\} \) is transitive, we need to verify the definition of transitivity.

### Step-by-Step Solution:

1. **Understanding Transitivity**: A relation \( R \) is transitive if for all \( a, b, c \in R \), whenever \( (a, b) \in R \) and \( (b, c) \in R \), it must follow that \( (a, c) \in R \).

2. **Assume the Conditions**: Let's assume that \( (a, b) \in R \) and \( (b, c) \in R \). This means:
- From \( (a, b) \in R \), we have \( a > b \).
...