Concept information
Preferred term
bijection
Definition(s)
-
A bijection is a function that is both injective (one-to-one) and surjective (onto). In other words, for every element in the domain, there is a unique element in the codomain that it maps to, and every element in the codomain is mapped to by at least one element in the domain. Equivalently, a bijection is a function between two sets, such that each element of one set is paired with exactly one element of the other set, and each element of the other set is paired with exactly one element of the first set; there are no unpaired elements between the two sets. A bijection is also called as a bijective function, one-to-one correspondence, or invertible function. The term one-to-one correspondence must not be confused with one-to-one function, which refers to an injective function.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Bijection)
Broader concept(s)
Synonym(s)
- bijective function
- invertible function
- one-to-one correspondence
In other languages
-
French
-
application bijective
URI
http://data.loterre.fr/ark:/67375/PSR-X1L1PGDL-T
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}