Find the error in the "proof" of the following "theorem." "theorem": let r be a relation on a set a that is symmetric and transitive. then r is reflexive. "proof ": let a ∈ a. take an element b ∈ a such that (a, b) ∈ r. because r is symmetric, we also have (b, a) ∈r. now using the transitive property, we can conclude that (a, a) ∈ r because (a, b) ∈ r and (b, a) ∈ r.

The proof is wrong. The part that says 'take an element b ∈ A such that (a, b) ∈ R' is assuming that such an element b exists, and that may not be the case.  We can give the 'theorem' validation by adding the hypothesis ' each element of A is related to any other element of A', otherwise the 'theorem' is false. An example for that is the following relation on the natural numbers:

'a R b if both numbers are even'

This relation if crearly symmetric and transitive, but it is not reflexive, an odd number does not relate with itself. In fact, odd numbers dont relate with any number.

it should all of then except C. everything from the left is doubled bc of the scale