The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
67 views
Let R be set of all real numbers, and

A = B = R*R

A function A-> B is defined by

f(a,b) = (a+b,a-b)

How to prove it is a bijective function?
in Set Theory & Algebra by Junior (853 points) | 67 views
0
You have to prove that sum and difference of 2 real numbers are always unique.
0
To prove a function is bijective, prove that it is one-one and onto i.e for every value of (a,b) there exists a unique value of f(a,b) and that for every value (x,y) present in the codomain, there exists a value (a,b) such that f(a,b) = (x,y).

1 Answer

0 votes
Let's there is a value $(x, y)$  in co-domain of $RXR$. From there we can get $a=(x+y)/2$ & $b=(x-y) /2$ and $a, b \epsilon R$. Thus proves Range = Co domain... This also proves for every $(x, y)$, there is unique pair or $(a, b) $. Thus proves function is bijective.
by Active (1.9k points)

Related questions

+2 votes
1 answer
2
asked Jan 29, 2018 in Set Theory & Algebra by srestha Veteran (116k points) | 64 views
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,339 questions
55,763 answers
192,339 comments
90,772 users