Math Problem Statement

Prove that the relation R on A is complete if and only if R ∪R^−1 =A ×A.

Solution

To prove that a relation RR on a set AA is complete if and only if RR1=A×AR \cup R^{-1} = A \times A, we proceed as follows:


Definitions:

  1. A relation RR on AA is complete if for every pair a,bAa, b \in A, either (a,b)R(a, b) \in R or (b,a)R(b, a) \in R.
  2. The inverse of RR, denoted R1R^{-1}, is defined as R1={(b,a)(a,b)R}R^{-1} = \{(b, a) \mid (a, b) \in R \}.
  3. The Cartesian product A×AA \times A contains all ordered pairs (a,b)(a, b) where a,bAa, b \in A.

Proof:

(⇒) If RR is complete, then RR1=A×AR \cup R^{-1} = A \times A.

  • Assume RR is complete. By definition, for any pair a,bAa, b \in A:
    • Either (a,b)R(a, b) \in R or (b,a)R(b, a) \in R.
  • The set RR1R \cup R^{-1} includes all pairs in RR and all pairs in R1R^{-1}, so:
    • If (a,b)R(a, b) \in R, then (a,b)RR1(a, b) \in R \cup R^{-1}.
    • If (b,a)R(b, a) \in R, then (b,a)R1(b, a) \in R^{-1}, which implies (b,a)RR1(b, a) \in R \cup R^{-1}.
  • Since for every pair (a,b)A×A(a, b) \in A \times A, either (a,b)R(a, b) \in R or (b,a)R(b, a) \in R, it follows that RR1=A×AR \cup R^{-1} = A \times A.

(⇐) If RR1=A×AR \cup R^{-1} = A \times A, then RR is complete.

  • Assume RR1=A×AR \cup R^{-1} = A \times A.
  • Take any pair a,bAa, b \in A. Since (a,b)A×A(a, b) \in A \times A, it must be true that:
    • (a,b)R(a, b) \in R, or
    • (a,b)R(a, b) \notin R, in which case (b,a)R1(b, a) \in R^{-1} because RR1=A×AR \cup R^{-1} = A \times A.
  • If (b,a)R1(b, a) \in R^{-1}, by the definition of R1R^{-1}, (b,a)R(b, a) \in R.
  • Therefore, for every pair a,bAa, b \in A, either (a,b)R(a, b) \in R or (b,a)R(b, a) \in R, which means RR is complete.

Conclusion:

We have shown both directions:

  1. If RR is complete, then RR1=A×AR \cup R^{-1} = A \times A.
  2. If RR1=A×AR \cup R^{-1} = A \times A, then RR is complete.

Thus, RR is complete if and only if RR1=A×AR \cup R^{-1} = A \times A. \blacksquare


Questions for Further Exploration:

  1. What is an example of a complete relation on a finite set?
  2. How does the concept of completeness differ for partial orders and equivalence relations?
  3. Can a relation RR be complete but not transitive? Why or why not?
  4. How does the symmetry of RR affect RR1R \cup R^{-1}?
  5. What happens if RR is not defined on all pairs of A×AA \times A?

Tip:

When working with relations, always write down the definitions of key terms like completeness, symmetry, and transitivity to avoid confusion.

Ask a new question for Free

By Image

Drop file here or Click Here to upload

Math Problem Analysis

Mathematical Concepts

Set Theory
Relations on Sets
Completeness of Relations
Cartesian Products

Formulas

R ∪ R^−1 = A × A
R^−1 = {(b, a) | (a, b) ∈ R}

Theorems

Definition of Complete Relations

Suitable Grade Level

Undergraduate (Discrete Mathematics)