- biunique correspondence
- bijective correspondence
are sometimes seen for bijection.
Authors who prefer to limit the jargon of mathematics tend to use the term one-one and onto mapping for bijection.
The symbol $f: S \leftrightarrow T$ is sometimes seen to denote that $f$ is a bijection from $S$ to $T$.
Also seen sometimes is the notation $f: S \cong T$ or $S \stackrel f \cong T$ but this is cumbersome and the symbol has already got several uses.
The $\LaTeX$ code for \(f: S \leftrightarrow T\) is
f: S \leftrightarrow T .
The $\LaTeX$ code for \(f: S \cong T\) is
f: S \cong T .
The $\LaTeX$ code for \(S \stackrel f \cong T\) is
S \stackrel f \cong T .
- 1964: Steven A. Gaal: Point Set Topology ... (previous) ... (next): Introduction to Set Theory: $1$. Elementary Operations on Sets
- 1971: Robert H. Kasriel: Undergraduate Topology ... (previous) ... (next): $\S 1.11$: Relations: Theorem $11.11$
- 1977: K.G. Binmore: Mathematical Analysis: A Straightforward Approach ... (previous) ... (next): $\S 7.11$
- 1978: John S. Rose: A Course on Group Theory ... (previous) ... (next): $0$: Some Conventions and some Basic Facts
- 1989: Ephraim J. Borowski and Jonathan M. Borwein: Dictionary of Mathematics: Entry: bijection