nLab bijection

Contents

 Idea

A bijection is an isomorphism in Set.

Since Set is a balanced category, bijections can also be characterized as functions which are both injective (monic) and surjective (epic).

Definition

Given sets AA and BB, a function f:ABf:A \to B is a bijection if it comes with an inverse function f 1:BAf^{-1}:B \to A such that for all elements bBb \in B, f(f 1(b))=bf(f^{-1}(b)) = b and for all elements aAa \in A, if f(a)=bf(a) = b, then a=f 1(b)a = f^{-1}(b)

bB.(f(f 1(b))=baA.(f(a)=ba=f 1(b)))\forall b \in B.(f(f^{-1}(b)) = b \wedge \forall a \in A.(f(a) = b \implies a = f^{-1}(b)))

The condition that f(f 1(b))=bf(f^{-1}(b)) = b could also be made more general, by any element a:Aa:A such that a=f 1(b)a = f^{-1}(b). This then becomes

aA.bB.((a= Af 1(b))(f(a)= Bb))((f(a)= Bb)(a= Af 1(b))\forall a \in A.\forall b \in B.((a =_A f^{-1}(b)) \implies (f(a) =_B b)) \wedge ((f(a) =_B b) \implies (a =_A f^{-1}(b))

This could be simplified down to the statement that f(a)=bf(a) = b if and only if a=f 1(b)a = f^{-1}(b).

aA.bB.((f(a)= Bb)(a= Af 1(b))\forall a \in A.\forall b \in B.((f(a) =_B b) \iff (a =_A f^{-1}(b))

This is an adjoint equivalence between two thin univalent groupoids.

Terminology

In older literature, a bijection may be called a one-to-one correspondence, or (as a compromise) bijective correspondence.

See also

computational trinitarianism =
propositions as types +programs as proofs +relation type theory/category theory

logicset theory (internal logic of)category theorytype theory
propositionsetobjecttype
predicatefamily of setsdisplay morphismdependent type
proofelementgeneralized elementterm/program
cut rulecomposition of classifying morphisms / pullback of display mapssubstitution
introduction rule for implicationcounit for hom-tensor adjunctionlambda
elimination rule for implicationunit for hom-tensor adjunctionapplication
cut elimination for implicationone of the zigzag identities for hom-tensor adjunctionbeta reduction
identity elimination for implicationthe other zigzag identity for hom-tensor adjunctioneta conversion
truesingletonterminal object/(-2)-truncated objecth-level 0-type/unit type
falseempty setinitial objectempty type
proposition, truth valuesubsingletonsubterminal object/(-1)-truncated objecth-proposition, mere proposition
logical conjunctioncartesian productproductproduct type
disjunctiondisjoint union (support of)coproduct ((-1)-truncation of)sum type (bracket type of)
implicationfunction set (into subsingleton)internal hom (into subterminal object)function type (into h-proposition)
negationfunction set into empty setinternal hom into initial objectfunction type into empty type
universal quantificationindexed cartesian product (of family of subsingletons)dependent product (of family of subterminal objects)dependent product type (of family of h-propositions)
existential quantificationindexed disjoint union (support of)dependent sum ((-1)-truncation of)dependent sum type (bracket type of)
logical equivalencebijection setobject of isomorphismsequivalence type
support setsupport object/(-1)-truncationpropositional truncation/bracket type
n-image of morphism into terminal object/n-truncationn-truncation modality
equalitydiagonal function/diagonal subset/diagonal relationpath space objectidentity type/path type
completely presented setsetdiscrete object/0-truncated objecth-level 2-type/set/h-set
setset with equivalence relationinternal 0-groupoidBishop set/setoid with its pseudo-equivalence relation an actual equivalence relation
equivalence class/quotient setquotientquotient type
inductioncolimitinductive type, W-type, M-type
higher inductionhigher colimithigher inductive type
-0-truncated higher colimitquotient inductive type
coinductionlimitcoinductive type
presettype without identity types
set of truth valuessubobject classifiertype of propositions
domain of discourseuniverseobject classifiertype universe
modalityclosure operator, (idempotent) monadmodal type theory, monad (in computer science)
linear logic(symmetric, closed) monoidal categorylinear type theory/quantum computation
proof netstring diagramquantum circuit
(absence of) contraction rule(absence of) diagonalno-cloning theorem
synthetic mathematicsdomain specific embedded programming language

Last revised on January 7, 2023 at 05:48:28. See the history of this page for a list of all contributions to it.