Scribd
Upload
46 views1 page

Binary Relations in Logic and Algebra

This document defines and explains binary relations. It provides the definition of a relation between two sets A and B, and notes that if A=B the relation is onto A. It introduces terminology for domain, range, inverse, and composition of relations. It notes that a relation where each element in the domain maps to at most one element in the range is essentially a function.

Uploaded by

GoranHuygh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
46 views1 page

Binary Relations in Logic and Algebra

This document defines and explains binary relations. It provides the definition of a relation between two sets A and B, and notes that if A=B the relation is onto A. It introduces terminology for domain, range, inverse, and composition of relations. It notes that a relation where each element in the domain maps to at most one element in the range is essentially a function.

Uploaded by

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

Binary relations

Date created: 2023-10-23 19:01


Tags: #Type/Object #Topic/Logic #Topic/Abstract_Algebra

Types: Equivalence relationships, Functions


Examples: Not applicable
Construction: Not applicable
Generalization: Relations

Properties: Properties of relations


Sufficiencies: Not applicable
Equivalences: Not applicable
Justifications: Sets, Cartesian product

Given a set A and B, we define a relation R from A to B as follows:

Definition: Relation

R ⊆ {(a, b) : a ∈ A ∧ b ∈ B} ⟺ R ⊆ A × B

If A = B we say R is a relation onto A. We usually define a property to rule out what elements from the Cartesian product are in R.

The statement (x,y) ∈ R reads "x is R-related to y" and is denoted as xRy

In a similar fashion to functions we can now add some terminology to our relations:

Notion: Terminology

Dom(R) = {a ∈ A : ∃b ∈ B((a, b) ∈ R)}

Ran(R) = {b ∈ B : ∃a ∈ A((a, b) ∈ R)}


−1
R = {(b, a) ∈ B × A : (a, b) ∈ A × B}

S ∘ R = {(a, c) ∈ A × C : ∃b ∈ B((a, b) ∈ R ∧ (b, c) ∈ S)}

Now one can notice that if every a in the domain of the has at most one b in B such that (a, b) ∈ R, then we essentially have a
function. And this would look like:

f : A → B : a ↦ b ∧ (a, b) ∈ R

More formally, R is actually the graph of a function f .

You might also like