Every relation which is symmetric and transitive is also reflexive.

Explanation

To determine whether every relation that is symmetric and transitive is also reflexive, we can analyze a specific example.

### Step-by-Step Solution:

1. **Define the Relation and Set**:
Let \( R = \{(1, 2), (2, 1), (1, 1), (2, 2)\} \) be a relation defined on the set \( A = \{1, 2, 3\} \).

2. **Check for Symmetry**:
A relation \( R \) is symmetric if for every \( (a, b) \in R \), \( (b, a) \) is also in \( R \).
- In our relation, we see that \( (1, 2) \in R \) and \( (2, 1) \in R \).
- Additionally, \( (1, 1) \) and \( (2, 2) \) do not violate symmetry as they are self-pairs.
- Therefore, \( R \) is symmetric.

3. **Check for Transitivity**:
A relation \( R \) is transitive if whenever \( (a, b) \in R \) and \( (b, c) \in R \), then \( (a, c) \) must also be in \( R \).
- We have \( (1, 2) \in R \) and \( (2, 1) \in R \). Since both are in \( R \), we check if \( (1, 1) \) is in \( R \), which it is.
- The pairs \( (1, 1) \) and \( (2, 2) \) do not affect transitivity since they are self-pairs.
- Therefore, \( R \) is transitive.

4. **Check for Reflexivity**:
A relation \( R \) is reflexive if for every element \( a \in A \), \( (a, a) \in R \).
- We check the elements in set \( A \):
- For \( 1 \): \( (1, 1) \in R \)
- For \( 2 \): \( (2, 2) \in R \)
- For \( 3 \): \( (3, 3) \notin R \)
- Since \( (3, 3) \) is not in \( R \), the relation is not reflexive.

5. **Conclusion**:
Since we found a relation that is symmetric and transitive but not reflexive, we conclude that the statement "Every relation which is symmetric and transitive is also reflexive" is false.

### Final Answer:
The statement is **false**.

---