Bijective means a function or linear transformation is both injective and surjective. In Linear Algebra and Differential Equations, that means every vector in the codomain is hit exactly once, so the map has a true inverse.
Bijective is the word you use when a linear transformation has no repeats and no misses. In this course, that means the map is both injective, so different inputs never collapse to the same output, and surjective, so every vector in the codomain gets hit.
For linear algebra, that idea is usually attached to a matrix transformation like T(x) = Ax. If T is bijective, then each output vector comes from exactly one input vector. That makes the transformation reversible, which is why bijective maps are the ones that can be undone with an inverse matrix.
This is more than a vocabulary label. Bijectivity tells you that the transformation has perfect matching between the domain and codomain. If the matrix is square and bijective, then it has full rank, the columns are linearly independent, and the nullity is 0. There is no nonzero vector in the kernel, because the only way to map to the zero vector is to start with the zero vector.
A quick way to picture it is with coordinates. If a 2 by 2 matrix sends every vector in R^2 to a unique vector in R^2, then you can go backward without guessing. If two different inputs land on the same output, or if some output is never reached, the map is not bijective.
In differential equations, bijectivity shows up less as a standalone buzzword and more in the background of solving systems. When you solve a linear system by transforming it, you want the transformation to preserve enough information that the solution is unique and recoverable. A non-bijective transformation loses information, which is exactly what creates free variables or missing solutions.
The easiest mistake is to treat injective and surjective as interchangeable. They are different checks, and bijective needs both. A map can avoid collisions but still miss part of the codomain, or it can cover the codomain but still send multiple inputs to the same output.
Bijective matters because it is the cleanest way to tell whether a linear transformation can be reversed without ambiguity. That shows up everywhere in this course, especially when you are deciding whether a matrix represents a one-to-one change of coordinates or a system you can solve uniquely.
It also connects several big ideas at once. If a matrix is bijective, then it has full rank, zero nullity, and an inverse matrix. Those facts are linked, not separate, so a single check can tell you a lot about how the transformation behaves.
In rank and nullity problems, bijective is the fast clue that the kernel is trivial and the image fills the whole codomain. That means no lost dimensions, no collapsed directions, and no missing outputs. When a homework problem asks whether a transformation is reversible or whether a system has a unique solution, bijectivity is one of the first things to test.
It also gives you a clean way to compare maps. Two spaces with the same finite dimension can only be connected by a bijective linear map if the matrix is square and full rank. That makes bijective a bridge between algebraic structure and geometric behavior, which is a big part of what this course is about.
Keep studying Linear Algebra and Differential Equations Unit 3
Visual cheatsheet
view galleryInjective
Injective means no two different inputs land on the same output. That is the "one-to-one" half of bijective, so a map can be injective without being bijective if it still misses part of the codomain. In matrix terms, injectivity is tied to having a trivial kernel, but you still need surjectivity to call the map bijective.
Surjective
Surjective means every vector in the codomain is reached by at least one input. That is the "onto" half of bijective. A transformation can be surjective and still fail to be bijective if two different inputs produce the same output, so surjectivity alone does not guarantee reversibility.
Full Rank Matrix
A full rank matrix has as many pivots as possible, which is the matrix version of having no wasted directions. For a square matrix, full rank is what you expect when the transformation is bijective. If the rank drops, something is collapsing or being missed, so the map cannot be one-to-one and onto at the same time.
Zero Matrix
The zero matrix is the opposite of bijective behavior because it sends every input to the zero vector. That makes it maximally non-injective and non-surjective in any nontrivial space. Comparing a zero matrix to a bijective matrix is a good way to see the difference between total collapse and perfect reversibility.
A problem set question might give you a matrix and ask whether the associated linear transformation is bijective. You would check for both injective and surjective behavior, often by finding pivots, rank, or the null space. If the matrix is square, full rank usually means bijective, and nullity 0 tells you the kernel is trivial.
You may also be asked to justify why a transformation has an inverse or why a system has a unique solution. In those questions, bijective is the word that connects the algebra to the result. If a map is not bijective, you should be ready to say whether the issue is collapsing inputs, missing outputs, or both.
Injective only means different inputs cannot share the same output. Bijective is stronger because it also requires surjective, so every output is hit. A function can be injective without being bijective if the codomain is larger than the image.
Bijective means both injective and surjective, so the map is one-to-one and onto.
In linear algebra, bijective transformations are reversible because they have inverses.
For a square matrix, bijective behavior lines up with full rank and nullity 0.
If a transformation is not bijective, it either collapses different inputs together, misses part of the codomain, or both.
Bijective is one of the fastest checks for whether a linear map preserves enough information to solve backward.
Bijective means a function or linear transformation is both injective and surjective. In linear algebra, that means each output comes from exactly one input, so the map can be reversed with an inverse. It is a strong way of saying the transformation preserves all the information you need.
For a square matrix, check whether it has full rank or an inverse. If every column has a pivot, the map is both one-to-one and onto, so it is bijective. If there is a free variable or a missing pivot, the map fails one of those conditions.
No. Injective only says two different inputs cannot land on the same output. Bijective also requires surjective, which means every vector in the codomain is hit. So injective is part of bijective, but it is not enough by itself.
An inverse needs a unique way to go backward from output to input. If a map is not one-to-one, you would not know which input to choose. If it is not onto, some outputs would not even be reachable, so a true inverse could not be defined on the whole codomain.