I have the following proof, i understand the injective proof but I have no clue how and why they do the surjective proof, is there a certain plan or steps I have to follow? Please explain in more detail and show why each step is taken Result 10.9 The function f : R − {2} → R − {3} defined by3xx-2is bijective.3aProof Here it is necessary to show that f is both one-to-one and onto. We begin with the firstof these. Assume that ƒ(a) = f(b), where a, b = R − {2}. ThenMulti-plying both sides by (a − 2)(b − 2), we obtain 3a(b − 2) = 3b(a − 2). Simplifying, wehave 3ab 6a = 3ab - 6b. Adding −3ab to both sides and dividing by −6, we obtaina = b. Thus, f is one-to-one.3bb-2a-2To show that f is onto, let r = R - {3}. We show that there exists x ЄR - {2} such2rthat f(x) =r. Choose x =Thenr-33 (2)2r-3implying that f is onto. Therefore f is bijective.f(x) = f ƒ (₂2rf(x) =r - 3=6r2r – 2(r-3)=6r== r,

Answered: Image /qna-images/answer/cf4c7c60-e211-470b-acb8-f91acf5511cc.jpg

I have the following proof, i understand the injective proof but I have no clue how and why they do the surjective proof, is there a certain plan or steps I have to follow? Please explain in more detail and show why each step is taken

I have the following proof, i understand the injective proof but I have no clue how and why they do the surjective proof, is there a certain plan or steps I have to follow? Please explain in more detail and show why each step is taken

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

22. What property is NOT illustrated in the statement ? (1)(n) = (n)(1)? b. Commutative property c. Identity property a. Closure property d. Distributive property
please just answer (1.2) If you can answer both i would be thankful so i can compare my answers to both problems with their solutions but i am mainly posting this for the second subpart (1.2). Thank you.
For the second picture I only need numbers #11 and #13 to be done For each proof, you must include (i.e., write) the premises in that proof. I do not want to see any proofs without premises. Do not use any transformation rules (e.g. contraposition) in your proof other than DN. Only use the eight inference rules. YOU CANNOT USE CONDITIONAL PROOF (CP), INDIRECT PROOF (IP), OR ASSUMED PREMISES (AP).
kindly answer it perfectly
How many ways can we climb a staircase with 8 steps if we can take either 1 or 2 steps at a time? Hint: Group the different ways according to the number of double steps.|
Write the following statement as a mathematical statement. Use variable names to denote arbitrary numbers in the domain. Your statements and should be expressed using algebra. "There is no largest integer."
For each one, state whether the statement is TRUE, FALSE. Then, state the negation:1.∃a(ais a prime number)2.∀a(ais a power of 2)3.∃a∃b(a+b <0)
please help with this problem
Thank you for this solution. I should have specified that I needed help doing the proof with laws/properties. Could you please do the proof using the boolean laws/properties instead. Thanks, again.