1
   

Injective and Surjective Functions

 
 
RK4
 
Reply Thu 2 Mar, 2006 06:48 pm
Let f : B --> C, g : A --> B, and h : A --> B be functions satisfying

f dot g = f dot h.

Prove or disprove:

(a). If f is surjective, then g = h.

(b). If f is injective, then g = h.
  • Topic Stats
  • Top Replies
  • Link to this Topic
Type: Discussion • Score: 1 • Views: 628 • Replies: 0
No top replies

 
 

Related Topics

Evolution 101 - Discussion by gungasnake
Typing Equations on a PC - Discussion by Brandon9000
The Future of Artificial Intelligence - Discussion by Brandon9000
The well known Mind vs Brain. - Discussion by crayon851
Scientists Offer Proof of 'Dark Matter' - Discussion by oralloy
Blue Saturn - Discussion by oralloy
Bald Eagle-DDT Myth Still Flying High - Discussion by gungasnake
DDT: A Weapon of Mass Survival - Discussion by gungasnake
 
  1. Forums
  2. » Injective and Surjective Functions
Copyright © 2024 MadLab, LLC :: Terms of Service :: Privacy Policy :: Page generated in 0.04 seconds on 05/18/2024 at 06:01:03