What does bijective mean?
"Bijective" is an adjective from mathematics describing a special kind of function: one that matches every element of one set with exactly one element of another, perfectly and completely, in both directions. Such a function is said to be both injective (no two inputs share an output) and surjective (every possible output is achieved). A useful way to picture a bijective mapping is as a flawless handshake between two groups, where everyone has exactly one partner and no one is left out. Because a bijective function can always be reversed without ambiguity, the concept underpins key ideas such as inverse functions, encryption, and counting arguments. In combinatorics, a "bijective proof" demonstrates that two sets have equal size by exhibiting such a perfect pairing between them. Though strictly technical in register, "bijective" is essential vocabulary for anyone studying higher mathematics, logic, or theoretical computer science.
adjectiveRelating to or being a function that pairs every element of one set with exactly one element of another set, in both directions — a mapping that is both injective (one-to-one) and surjective (onto). Informally, a bijective correspondence establishes a perfect one-to-one matching between the members of two sets.
- Of a function or mapping: both injective and surjective, so that each element of the domain corresponds to exactly one element of the codomain and every element of the codomain is reached exactly once.
- (By extension) Establishing a perfect one-to-one correspondence between two collections, as in combinatorics where a bijective proof counts one set by matching it with another.
"The function f(x) = 2x + 1 is bijective from the real numbers onto themselves, so it has an inverse."
"Since the mapping is bijective, we can safely invert it to recover the original data."
"The puzzle was solved by finding a bijective correspondence between the tiles and the squares of the board."
A bijection is how mathematicians prove that two infinite sets are the same size — even when both are endless.
Reviewed by Deb Chak, Editor. AI-assisted content curated by RJS Tech Solutions LLP.
Etymology of bijective
The word "bijective" derives from the combining forms "bi-" (Latin, meaning "two" or "twice") and "-jective," from Latin "iacere," meaning "to throw." It was formed within twentieth-century mathematical usage alongside the parallel terms "injective" and "surjective," which together classify functions by how they map elements between sets. Its close relatives "bijection," "injection," and "surjection" all trace back to the same Latin root, which also yields everyday words like "project" and "reject."
Related word forms
How bijective is actually used
"Bijective" is a technical term used almost exclusively in mathematics — particularly set theory, algebra, combinatorics, and computer science. It carries no figurative or informal use; outside these fields it will read as jargon. The related noun "bijection" names the mapping itself, while "bijective" describes its property.
Easily confused with bijective
An injective (one-to-one) function never maps two different inputs to the same output, but may leave some elements of the target set unmatched; a bijective function is injective and also covers the entire target set.
A surjective (onto) function hits every element of the target set but may map multiple inputs to one output; a bijective function does both, pairing each input with a unique output and vice versa.