How Can We Restrict the Function f(x)=x^3-x to Create a Bijective Function g?

  • Thread starter kidsasd987
  • Start date
  • Tags
    Map
In summary, the conversation discusses how to obtain a bijective function g from f by restricting its domain and range appropriately. This is achieved by finding roots of the polynomial form of f and choosing an interval where f is purely non-increasing or non-decreasing. The chosen interval can be used to define a 1-to-1 map g from R to R, which satisfies the conditions of a bijective function.
  • #1
kidsasd987
143
4

Homework Statement


Let f: R->R and f(x)=x3-x. By restricting the domain and range of f appropriately, obtain from f a bijective function g.

Homework Equations


x3-x=(x+1)(x-1)x
g(x): R->R

The Attempt at a Solution


we can find roots from the polynomial form (x+1)(x-1)x and restrict the domain and range by avoiding intervals including more than one root. There are several ways to obtain g, because we are free to choose an interval, but what I'm interested in is this.

if we say g:R->R such that
x=-1 -> g(x)=-∞
x=0 -> g(x)=0
x=1 -> g(x)=∞

we can define a 1 to 1 map because R is an infinite set, then can we say this is also an answer? Because it is bijective to R.
 
Physics news on Phys.org
  • #2
Although they do not say so explicitly, one can infer that they want the function g to match f on the shared domain.
Since f is not injective, some of the domain of f is going to have to be removed.

BTW, avoiding intervals including more than one root is not necessary or sufficient. What you need is an interval on which f is purely non-increasing or purely non-decreasing.
 

FAQ: How Can We Restrict the Function f(x)=x^3-x to Create a Bijective Function g?

What is a bijective map?

A bijective map, also known as a bijection, is a function between two sets that is both injective (one-to-one) and surjective (onto). This means that for every element in the first set, there is a unique element in the second set that it maps to, and every element in the second set has a corresponding element in the first set.

How is a bijective map different from other types of maps?

A bijective map is different from other types of maps, such as injective and surjective maps, because it must satisfy both conditions of being both injective and surjective. This means that it is a one-to-one and onto function, ensuring that each element in one set has a unique and corresponding element in the other set.

What is the importance of bijective maps in mathematics?

Bijective maps are important in mathematics because they provide a way to establish a one-to-one correspondence between two sets. This allows for the concept of cardinality, or the number of elements in a set, to be defined and compared between different sets. Bijective maps are also used in many areas of mathematics, such as graph theory and abstract algebra.

Can a bijective map exist between two infinite sets?

Yes, a bijective map can exist between two infinite sets. In fact, Cantor's theorem states that there are different sizes of infinity, and that a bijective map can be used to show that two infinite sets have the same cardinality. For example, the set of natural numbers and the set of even numbers have the same cardinality because there exists a bijective map between them (n → 2n).

How do you prove that a function is a bijective map?

To prove that a function is a bijective map, you must show that it is both injective and surjective. To prove injectivity, you must show that for any two elements in the first set, if they have the same image in the second set, then they must be the same element. To prove surjectivity, you must show that every element in the second set has a corresponding element in the first set. Once both conditions are satisfied, the function can be considered a bijective map.

Back
Top