Reflexive pronouns are words like myself, yourself, himself, herself, itself, ourselves, yourselves and themselves. They refer back to a person or thing. We often use reflexive pronouns when the subject and the object of a verb are the same.

adj. 1 involving the maximum use of land, time, or some other resource.

Reflexive pronouns and intensive pronouns may look exactly the same, but they serve very different functions in sentences. A reflexive pronoun reflects back on the subject of the sentence while an intensive pronoun adds emphasis or intensity to a noun. Reflexive: Drew decided to treat himself to a fancy dinner.

1a : directed or turned back on itself also : overtly and usually ironically reflecting conventions of genre or form a reflexive novel. b : marked by or capable of reflection : reflective.

responses to stimuli that are involuntary or free from conscious control (e.g., the salivation that occurs with the presentation of food) and therefore serve as the basis for classical conditioning. Compare planned behavior; voluntary behavior.

Take any integer x∈Z, and observe that n|0, so n|(x−x). By definition of congruence modulo n, we have x≡x(modn). This shows x≡x(modn) for every x∈Z, so ≡(modn) is reflexive.

This property tells us that any number is equal to itself. For example, 3 is equal to 3. We use this property to help us solve problems where we need to make operations on just one side of the equation to find out what the other side equals.

Thus, in an identity relation, every element is related to itself only. Then R1 is an identity relation on A, but R2 is not an identity relation on A as the element a is related to a and c. Reflexive relation. Every identity relation on a non-empty set A is a reflexive relation, but not conversely.

As we know the definition of void relation is that if A be a set, then ϕ ⊆ A×A and so it is a relation on A. This relation is called void relation or empty relation on A. In other words, a relation R on set A is called an empty relation, if no element of A is related to any other element of A.

In mathematics, a binary relation R over a set X is reflexive if it relates every element of X to itself. An example of a reflexive relation is the relation “is equal to” on the set of real numbers, since every real number is equal to itself.

(1) Identity relation : Let A be a set. Then the relation I = (a, a) : a ∈ A} on A is called the identity relation on A. In other words, a relation I on A is called the identity relation if every element of A is related to itself only. Every identity relation will be reflexive, symmetric and transitive.

f(a) = a ∀ a ∈ R For example, f(2) = 2 is an identity function. In set theory, when a function is described as a particular kind of binary relation, the identity function is given by the identity relation or diagonal of A, where A is a set.

Identities and relationships explores identity; beliefs and values; personal, physical, mental, social and spiritual health; human relationships including families, friends, communities and cultures; what it means to be human.

You can easily check that, since (1,1)∈R and (1,1)∈R, then (1,1)∈R (this is pretty obvious). The same goes for (2,2). Therefore R is transitive. By definition, a relation is said to be an equivalence relation iff it is reflexive, symmetric and transitive.

It is not antisymmetric unless |A|=1. The identity relation consists of ordered pairs of the form (a,a), where a∈A. In other words, aRb if and only if a=b. It is reflexive (hence not irreflexive), symmetric, antisymmetric, and transitive.

An identity relation on a set ‘A’ is the set of ordered pairs (a,a), where ‘a’ belongs to set ‘A’. For example, suppose A={1,2,3}, then the set of ordered pairs {(1,1), (2,2), (3,3)} is the identity relation on set ‘A’.