Scribd
Upload
209 views3 pages

Reflexive Property

The reflexive property of equality simply states that a value is equal to itself. Further, this property states that for all real numbers, x = x.

Uploaded by

Nadine Ellington
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
209 views3 pages

Reflexive Property

The reflexive property of equality simply states that a value is equal to itself. Further, this property states that for all real numbers, x = x.

Uploaded by

Nadine Ellington
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Reflexive means something relating to itself.

The
reflexive property of equality simply states that a value
is equal to itself. Further, this property states that for
all real numbers, x = x.
We learned that the reflexive property of equality
means that anything is equal to itself. The formula for
this property is a = a. This property tells us that any
number is equal to itself. For example, 3 is equal to 3.

An example of a reflexive relation is the relation “is


equal to” on the set of real numbers, since every real
numbers is equal to itself. A reflexive relation is said to
have the reflexive property or said to have possess
reflexivity.
In mathematics, a binary relation R over a set X is
reflexive if every element of X is related to itself.
Formally, this may be written ∀x ∈ X : x R x.
Related terms:

A binary relation is called irreflexive, or anti-reflexive,


if it doesn't relate any element to itself. An example is
the "greater than" relation (x > y) on the real
numbers. Not every relation which is not reflexive is
irreflexive; it is possible to define relations where some
elements are related to themselves but others are not
(i.e., neither all nor none are). For example, the binary
relation "the product of x and y is even" is reflexive on
the set of even numbers, irreflexive on the set of odd
numbers, and neither reflexive nor irreflexive on the
set of natural numbers.
A reflexive relation on a nonempty set X can neither
be irreflexive, nor asymmetric, nor antitransitive.
The reflexive closure ≃ of a binary relation ~ on a set
X is the smallest reflexive relation on X that is a
superset of ~. Equivalently, it is the union of ~ and the
identity relation on X, formally: (≃) = (~) ∪ (=). For
example, the reflexive closure of (<) is (≤).
The reflexive reduction, or irreflexive kernel, of a
binary relation ~ on a set X is the smallest relation ≆
such that ≆ shares the same reflexive closure as ~. It
can be seen in a way as the opposite of the reflexive
closure. It is equivalent to the complement of the
identity relation on X with regard to ~, formally: (≆) =
(~) \ (=). That is, it is equivalent to ~ except for where
x~x is true. For example, the reflexive reduction of (≤)
is (<).

You might also like