Question: A relation R on a set A is called irreflexive if for all a A, (a, a) R. (a) Give an example of

A relation R on a set A is called irreflexive if for all a ∈ A, (a, a) ∉ R.
(a) Give an example of a relation R on Z where R is irreflexive and transitive but not symmetric.
(b) Let R be a nonempty relation on a set A. Prove that if R satisfies any two of the following properties - irreflexive, symmetric, and transitive - then it cannot satisfy the third.
(c) If | A | = n ≥ 1, how many different relations on A are irreflexive? How many are neither reflexive nor irreflexive?

Step by Step Solution

3.55 Rating (162 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a xRy if x y b For example suppose that R satisfies cond... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

954-M-L-A-L-S (7826).docx

120 KBs Word File

Students Have Also Explored These Related Linear Algebra Questions!