Math Is Fun Forum

  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#1 2016-02-29 16:42:27

mrpace
Member
Registered: 2012-08-16
Posts: 88

Proof involving a bijection.

Suppose that a, b, and y are all functions.
If ay=by and y is one-to-one and onto, prove that a=b.

This looked very straightforward at first then I realised that a and b are functions, not values. I am therefore stuck on what to do.
Any help is much appreciated.

Offline

#2 2016-02-29 19:33:06

Grantingriver
Member
Registered: 2016-02-01
Posts: 129

Re: Proof involving a bijection.

It is easy. Suppose that D is the domain of y and R is its range, since y is one to one then ∀ m ∋ D there is one and only one image in R and since y is outo ∀ n ∋ R there is a distinct inverse image "x" in D hence:

(a∘y)∘yˉ¹=(b∘y)∘yˉ¹ ⇒ a∘(y∘yˉ¹)=b∘(y∘yˉ¹) ⇒ a∘x= b∘x ⇒ a=b ( since x is a variable)

Note: the "ay" and "by" is a composition "∘" operation not multiplication "×" since if it was so, it could be solved by division as ordinary numbers.

Offline

Board footer

Powered by FluxBB