Injective function: A function f: A → B is injective, or one-to-one, if distinct elements of A always have distinct images. Equivalently, f(a₁) = f(a₂) implies a₁ = a₂.
Surjective function: A function is surjective, or onto, if every element of the codomain B is the image of at least one element of A. For every b ∈ B, there must exist a ∈ A such that f(a) = b.
Bijective function: A function is bijective if it is both injective and surjective. Every codomain element is reached by exactly one domain element.
Inverse functions: A function has an inverse function from B to A if and only if it is bijective. The inverse reverses the mapping.
Composition: The composition of two injective functions is injective, and the composition of two surjective functions is surjective. The composition of bijections is also bijective.
Finite sets: For finite sets A and B with equal cardinality, a function from A to B is injective if and only if it is surjective. This equivalence need not hold for arbitrary infinite sets.
Injective, Surjective and Bijective Functions
Injective, surjective and bijective functions describe how elements of a domain correspond to elements of a codomain. These properties determine whether outputs are unique, whether every codomain element is reached and whether a function has an inverse.
Injective: f(a₁) = f(a₂) ⇒ a₁ = a₂
Explanation
Example or application
A worked example has not yet been added.
Types
| Name | Condition | Meaning |
|---|---|---|
Injective | f(a₁) = f(a₂) implies a₁ = a₂. | No two distinct inputs share an output. |
Surjective | For every b ∈ B, there exists a ∈ A with f(a) = b. | Every codomain element is reached. |
Bijective | The function is both injective and surjective. | Every codomain element has exactly one preimage. |
Examples
| Name | Function | Classification | Explanation |
|---|---|---|---|
Injective example | f: R → R, f(x) = 2x | Bijective, and therefore injective | Different real inputs produce different outputs. |
Surjective but not injective | f: R → [0, ∞), f(x) = x² | Surjective, not injective | Every nonnegative real number is reached, but x and -x have the same square when x is nonzero. |
Injective but not surjective | f: Z → Z, f(n) = 2n | Injective, not surjective | The function reaches only even integers. |
Applications
Determining whether an inverse function exists.
Defining isomorphisms between algebraic structures.
Comparing finite sets and their cardinalities.
Proving equivalence between mathematical systems.
Common Mistakes
Confusing injectivity with surjectivity.
Assuming a function is surjective merely because its formula can produce many values.
Ignoring the specified codomain when checking surjectivity.
Assuming every injective function is bijective.
Related Concepts
Functions
Inverse Functions
Bijections
Isomorphisms
Cardinality
Learning Outcomes
Distinguish injective, surjective and bijective functions.
Test these properties using definitions.
Determine whether an inverse function exists.
Recognize the role of bijections in algebra.
Learning Guide
Core Idea
Injective, surjective and bijective functions describe how elements of a domain correspond to elements of a codomain. These properties determine whether outputs are unique, whether every codomain element is reached and whether a function has an inverse.
Worked Example
Name: Injective example
Function: f: R → R, f(x) = 2x
Classification: Bijective, and therefore injective
Explanation: Different real inputs produce different outputs.
Name: Surjective but not injective
Function: f: R → [0, ∞), f(x) = x²
Classification: Surjective, not injective
Explanation: Every nonnegative real number is reached, but x and -x have the same square when x is nonzero.
How To Study
Write the formal definition and identify every object, operation, and hypothesis.
Work through the supplied example one step at a time; explain why each step is valid.
Check the listed properties and compare the example with at least one common mistake.
Try the self-check questions without looking at the answers, then explain the reasoning aloud or in writing.
Self Check
| Question | Answer |
|---|---|
In your own words, what is injective, surjective and bijective functions? | Injective, surjective and bijective functions describe how elements of a domain correspond to elements of a codomain. These properties determine whether outputs are unique, whether every codomain element is reached and whether a function has an inverse. |
What definition, condition, or property should you check first when solving a problem about injective, surjective and bijective functions? | Start from the formal definition and identify its hypotheses. In particular, check: Injective function: A function f: A → B is injective, or one-to-one, if distinct elements of A always have distinct images. |
How is injective, surjective and bijective functions connected to the wider study of abstract algebra? | It belongs to Foundations and mathematical language. It connects naturally with Functions, Inverse Functions, Bijections, Isomorphisms. |
Mastery Checklist
I can state the definition of injective, surjective and bijective functions accurately.
I can identify the assumptions and notation used in a problem.
I can explain at least one example and justify each important step.
I can recognize a common mistake and explain why it is incorrect.
Key Properties
The concept is governed by its formal definition: Injective, surjective and bijective functions describe how elements of a domain correspond to elements of a codomain. These properties determine whether outputs are unique, whether every codomain element is reached and whether a function has an inverse.
The assumptions in a theorem or definition must be checked before using the result.
Sources and verification
Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.
- Standard introductory function theory; no specific external reference has been independently verified.