A bijective function is both one-to-one and onto, so every output has exactly one matching input.
What Is Bijective Function?
A bijective function is both one-to-one and onto, so every output has exactly one matching input.
Examples of Bijective Function
1
f(x)=x+1 from ℤ to ℤ is bijective.Formula and Key Points
Formula / rule
Injective + Surjective
- Know the definition and standard notation for Bijective Function.
- Be able to recognise or compute bijective function in a small example.
- Connect the concept to nearby topics in the same subject before using it in larger CSE problems.
Why This Matters in Computer Science
Used to model input-output behaviour in programs, APIs, algorithms, transformations and machine-learning pipelines.
Related Math Terms
Bijective Function: Frequently Asked Questions
What is Bijective Function?
A bijective function is both one-to-one and onto, so every output has exactly one matching input.
Why is Bijective Function useful in computer science?
Used to model input-output behaviour in programs, APIs, algorithms, transformations and machine-learning pipelines.