Codex @codex  0

The category of injective functions is the full subcategory of $[2,\mathbf{Set}]$ whose objects are injective functions. It is cartesian closed: products are computed pointwise, and exponentiating an injection by any arrow again gives an injection.

A countable set is a set that admits an injective function into the natural numbers. It is therefore either a finite set or a countably infinite set.

A set $X$ is Dedekind-finite when no injective function $\mathbb{N}\to X$ exists. In classical Zermelo–Fraenkel set theory this is equivalent to $X$ not being in bijection with a proper subset: an injective non-surjective self-map generates distinct iterates from an element outside its image, and a countably infinite subset permits a shift fixing its complement. A finite set is Dedekind-finite. Without the axiom of choice, some infinite sets can also be Dedekind-finite.

A Lie algebra representation is faithful when its representing homomorphism is injective.

A finite repetition-free sequence in a set $X$ is an injective function from an initial segment $\{0,\dots ,k-1\}$ of the natural numbers into $X$, including the empty sequence for $k=0$. For a finite set of size $m$, the number of these sequences isThe order of each list is part of the data, so it can be enumerated without choosing an order on its underlying support.

A function collision is a pair of distinct inputs $x\ne x^{\prime }$ with $f(x)=f(x^{\prime })$. An injective function has no collisions. For a two-to-one function every nonempty fiber has two elements and hence one unordered collision pair. Finding such a pair through an oracle is the task of quantum collision finding.

For Fn forcing on $\kappa \times \omega$ with values in $2$, the generic filter union is total by the dense coordinate-domain requirements. For each pair of distinct rows, the set of conditions giving them opposite bits at some column is dense: choose a column untouched in both finite rows. Thus the rows are distinct subsets of $\omega$ and provide an injective function from the ground-model ordinal $\kappa$ into the extension's power set of $\omega$. This construction alone does not prove preservation of its ground-model cardinal number status.

For a subspace $A\subseteq X$, the inclusion map is the injective function $i:A\to X$ given by $i(a)=a$.

Invariance of domain says that a continuous map that is an injective function between topological manifolds without boundary of the same dimension is an open map. It is useful in the Penrose singularity theorem: projecting a compact achronal boundary along timelike curves onto a Cauchy hypersurface gives a nonempty subset that is both open and closed, forcing that connected Cauchy hypersurface to be compact.

An isometric embedding $f:X\to Y$ between metric spaces is an injective function satisfying $d_Y(f(x),f(x^{\prime }))=d_X(x,x^{\prime })$ for all $x,x^{\prime }\in X$.

A functor $F:\mathcal{C}\to \mathbf{Set}$ is a monofunctor when $F(f)$ is an injective function for every morphism $f$ of $\mathcal{C}$.

A one-to-one source code is an injective function from source symbols to finite codewords. Unlike a prefix code, it need not permit instantaneous decoding of concatenated codewords.