Proving a function is bijective

  • Thread starter Thread starter avg5
  • Start date Start date
  • Tags Tags
    Function
Click For Summary

Homework Help Overview

The problem involves proving that a function defined from the real numbers to a set of equivalence classes is bijective. The relation R is defined on pairs of real numbers, and the function f maps real numbers to equivalence classes based on this relation.

Discussion Character

  • Conceptual clarification, Problem interpretation, Assumption checking

Approaches and Questions Raised

  • Participants discuss the nature of the equivalence class [(0,a)] and its representation in the xy-plane. There is an exploration of how to demonstrate that the function is both onto and one-to-one.

Discussion Status

Participants are actively engaging with the definitions and implications of the equivalence class and the function. Some have offered insights into the graphical representation of the equivalence class, while others express confusion about the requirements for proving bijectivity.

Contextual Notes

There is an indication of confusion regarding the initial understanding of the problem and the definitions involved, particularly concerning the graphical interpretation of the equivalence class and the function's mapping.

avg5
Messages
4
Reaction score
0

Homework Statement



The relation R, on the set ℝxℝ, is defined by (x,y)R(a,b) if and only if x+b=a+y for any real number x,y,a, and b.

Let G denote the set of equivalence classes of the relation R.

Question: Let f: ℝ -> G be defined by f(a)=[(0,a)]. Prove that f is a bijection.


The Attempt at a Solution



I think I have to come up with an equation, for f(a)=[(0,a)]. I also think I could prove this using induction.

I am very confused and need a leg up on how to start! Any help would be greatly appreciated.
 
Physics news on Phys.org
avg5 said:

Homework Statement



The relation R, on the set ℝxℝ, is defined by (x,y)R(a,b) if and only if x+b=a+y for any real number x,y,a, and b.

Let G denote the set of equivalence classes of the relation R.

Question: Let f: ℝ -> G be defined by f(a)=[(0,a)]. Prove that f is a bijection.

The Attempt at a Solution



I think I have to come up with an equation, for f(a)=[(0,a)]. I also think I could prove this using induction.

I am very confused and need a leg up on how to start! Any help would be greatly appreciated.

I think you need to understand what the question is actually asking first. [(0,a)] is the equivalence class consisting of all (x,y) such that (x,y)R(0,a). What does that set look like if you graph it in the xy plane?
 
Dick said:
I think you need to understand what the question is actually asking first. [(0,a)] is the equivalence class consisting of all (x,y) such that (x,y)R(0,a). What does that set look like if you graph it in the xy plane?
Do you mean the graph of the set (0,a)? The x-values are stationary at 0 and the y-values are varying.

I know that I need to prove that the function is both onto and 1:1. Ergh, am I really confused
 
avg5 said:
Do you mean the graph of the set (0,a)? The x-values are stationary at 0 and the y-values are varying.

I know that I need to prove that the function is both onto and 1:1. Ergh, am I really confused

I still don't think you really understand what they are asking. No. (0,a) is just a point. I mean the graph of the equivalence class [(0,a)] with a fixed. The brackets mean 'equivalence class'. (0,a)R(x,y) means 0+y=x+a, right?
 
Dick said:
Slow down you are jumping to conclusions. No. (0,a) is just a point. I mean the graph of the equivalence class [(0,a)] with a fixed. The brackets mean 'equivalence class'. (0,a)R(x,y) means 0+y=x+a, right?
Yes.. so the graph is y=x+a then?
 
avg5 said:
Yes.. so the graph is y=x+a then?

Right. So [(0,a)] is a straight line with y-intercept a and slope 1. So your function f takes a in R and maps it to that straight line. Now can you see why it's a bijection?
 
Yes. Thank you so, so much.
 

Similar threads

Replies
1
Views
2K
Replies
5
Views
2K
  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 11 ·
Replies
11
Views
1K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
Replies
1
Views
1K
Replies
3
Views
2K
Replies
2
Views
1K