Does the Definition of an Inverse Depend on Injectivity and Surjectivity?

  • Context: Undergrad 
  • Thread starter Thread starter Bipolarity
  • Start date Start date
  • Tags Tags
    Inverse
Click For Summary
SUMMARY

The discussion centers on the relationship between injective and surjective functions and their role in defining the inverse of a function. It establishes that both properties are necessary for a function to have a well-defined inverse. Specifically, for a function f(x) to have an inverse g(x), it must be injective (one-to-one) to satisfy the condition (f ∘ g)(x) = x, and surjective (onto) to satisfy (g ∘ f)(x) = x. An example provided illustrates that while an injective function can exist without being surjective, a surjective function is required to ensure both properties hold for the inverse.

PREREQUISITES
  • Understanding of injective functions
  • Understanding of surjective functions
  • Knowledge of function composition
  • Familiarity with mathematical notation and terminology
NEXT STEPS
  • Study the properties of bijective functions and their inverses
  • Learn about function composition in detail
  • Explore examples of injective and surjective functions
  • Investigate the implications of inverse functions in various mathematical contexts
USEFUL FOR

Mathematics students, educators, and anyone interested in understanding the foundational concepts of function theory, particularly in relation to injectivity, surjectivity, and inverses.

Bipolarity
Messages
773
Reaction score
2
Consider a function [itex]f(x)[/itex] and its inverse [itex]g(x)[/itex].

Then [itex](f \circ g)(x) = x[/itex] and [itex](g \circ f)(x) = x[/itex]

Are both these statements separate requirements in order for the inverse to be defined? Is it possible that one of the above statements is true but not the other? If so, could I see an example of such a case?

Otherwise, could you prove one having knowledge of the other?

Thanks!

BiP
 
Physics news on Phys.org
do you know what injective and surjective functions are? every injective g has an f with the first property, but only surjective g's have an f with the second property.

e.g. if g is multiplication by 2, as a map from the integers to themselves, then there is an f with property 1. namely f sends every even integer to half itself, and sends every odd integer to zero.
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 26 ·
Replies
26
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 8 ·
Replies
8
Views
10K