Bijective function
Summary
A function is bijective when it is both injective and surjective, so each element of the codomain is the value at exactly one input.
What this node needs for W2
- edge instance_of in: at least two examples (1 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
Sources
- Web https://en.wikipedia.org/wiki/Bijection, lead section
What links here
Instances
- Cantor pairing function 0NP5N5PYW5
Definitions
- Bijective function 0SNQEF7Z53