Lesson plan

Bijection

In mathematics, a bijection, bijective function, or one-to-one correspondence is a function between two sets such that each element of the second set (the codomain) is the image of exactly one element of the first set (the domain). Given a function f:A\to B , the image of an element a\in A is the element f(a)\in B in the codomain. The pre-image of an element b\in B is any element a\in A in the domain such that f(a)=b . Equivalently, a bijection is a relation between two sets such that each element of either set is paired with exactly one element of the other set. A function is bijective if and only if it is invertible; that is, a function f:X\to Y is bijective if and only if there is a function g:Y\to X, the inverse of , such that each of the two ways for composing the two functions produces an identity function: g(f(x)) = x for each x in X and f(g(y)) = y for each y in Y. For example, the multiplication by two defines a bijection from the integers to the even numbers, which has the division by two as its inverse function. A function is bijective if and only if it is both injective (or one-to-one)—meaning that each element in the codomain is mapped from at most one element of the domain—and surjective (or onto)—meaning that each element of the codomain is mapped from at least one element of the domain.…

Back to article

Article summary

In mathematics, a bijection, bijective function, or one-to-one correspondence is a function between two sets such that each element of the second set (the codomain) is the image of exactly one element of the first set (the domain). Given a function f:A\to B , the image of an element a\in A is the element f(a)\in B in the codomain. The pre-image of an element b\in B is any element a\in A in the domain such that f(a)=b . Equivalently, a bijection is a relation between two sets such that each element of either set is paired with exactly one element of the other set. A function is bijective if and only if it is invertible; that is, a function f:X\to Y is bijective if and only if there is a function g:Y\to X, the inverse of , such that each of the two ways for composing the two functions produces an identity function: g(f(x)) = x for each x in X and f(g(y)) = y for each y in Y. For example, the multiplication by two defines a bijection from the integers to the even numbers, which has the division by two as its inverse function. A function is bijective if and only if it is both injective (or one-to-one)—meaning that each element in the codomain is mapped from at most one element of the domain—and surjective (or onto)—meaning that each element of the codomain is mapped from at least one element of the domain.…

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.