Linked from

The 20 pages that link to Injective function, each with the reason it gives.

• Inverse functionRelated: Injectivity is the precise condition that prevents two inputs sharing an inverse output.

• Ordered pairRelated: The pair encoding must preserve enough information to recover each entry.

• Pigeonhole principleRelated: The principle says no function from a larger finite set to a smaller one can be injective.

• BijectionRelated: This property prevents two domain elements from sharing an image.

• IsometryRelated: A distance-preserving map must be injective, since distinct points have positive distance.

• Cantor's theoremRelated: A hypothetical injection into the power set would assign each element a distinct subset.

• CodomainRelated: Injectivity concerns collisions among outputs, independently of unused codomain elements.

• Image (mathematics)Related: Its image retains enough information to identify each input uniquely.

• Hall's marriage theoremRelated: Choosing distinct representatives is an injective assignment from sets to their elements.

• Graph embeddingRelated: Injectivity ensures that distinct source vertices do not collapse onto one target vertex.

• Left inverseRelated: A left inverse can recover each input only if f never merges distinct inputs.

• Koebe quarter theoremRelated: Injectivity is the condition that makes the theorem’s image guarantee possible.

• Partial permutationRelated: Injectivity is the defining condition that prevents repeated selected elements.