• Bijection - wikipedia
  In mathematics, a bijection, or a bijective function is a function f from a set X to a set Y with the property that, for every y in Y, there is exactly one x in X such that f(x) = y. Alternatively, f is bijective if it is a one-to-one correspondence between those sets; i.e., both one-to-one (injective) and onto (surjective).[1] (See also Bijection, injection and surjection.)
  2009 articles axiomatic bijection bijective cardinal cardinality from lacking march number numeration proof set sources theory
  in Educational > Mathematics > Ideas/Explanations/Wiki or Mathworld lookups with bijection community-based community-driven educational functions map math mathematics maths one-to-one uni university wiki wikipedia wikipedia.org
• Bijection, injection and surjection - Wikipedia
  In mathematics, injections, surjections and bijections are classes of functions distinguished by the manner in which arguments (input expressions from the domain) and images (output expressions from the codomain) are related or mapped to each other.
  and axiom bijection bijective bourbaki cardinality category choice codomain domain function injection mathematics surjection
  in Educational > Mathematics > Ideas/Explanations/Wiki or Mathworld lookups with bijection community-based community-driven educational functions injection maps math mathematics maths surjection uni university wiki wikipedia wikipedia.org
  Note: Need to learn this.

bijection from all users