bijective

Associating to each element of the codomain exactly one element of the domain; establishing a perfect (one-to-one) correspondence between the elements of the domain and the codomain; (formally) both injective and surjective.

1987, James S. Royer, A Connotational Theory of Program Structure, Springer, LNCS 273, page 15, Then, by a straightforward, computable, bijective numerical coding, this idealized FORTRAN determines an EN. (Note: In this FORTRAN example, we could have omitted restrictions on I/O and instead used a computable, bijective, numerical coding for inputs and outputs to get another EN determined by FORTRAN.)

1993, Susan Montgomery, Hopf Algebras and Their Actions on Rings, American Mathematical Society, CBMS, Regional Conference Series in Mathematics, Number 83, page 124, Recent experience indicates that for infinite-dimensional Hopf algebras, the “right” definition of Galois is to require that β be bijective.

Having a component that is (specified to be) a bijective map; that specifies a bijective map.

Proving the conjecture is equivalent to constructing a PCP that reads 2 symbols and accepts iff these symbols satisfy a bijective constraint.