We say that a set A is numerically equivalent to a set B if there exists a bijective function f : A → B. Let S be a collection of sets, and let R be the relation of numerical equivalence on S. Prove that R is an equivalence relation.

Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter1: Fundamentals
Section1.7: Relations
Problem 6TFE: Label each of the following statements as either true or false. Let R be a relation on a nonempty...
icon
Related questions
Question
We say that a set A is numerically equivalent to a set B if there exists a bijective function f : A → B.
Let S be a collection of sets, and let R be the relation of numerical equivalence on S. Prove that R
is an equivalence relation.
Transcribed Image Text:We say that a set A is numerically equivalent to a set B if there exists a bijective function f : A → B. Let S be a collection of sets, and let R be the relation of numerical equivalence on S. Prove that R is an equivalence relation.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

Blurred answer