For affine functions in linear algebra and geometry, see affine map.
Rel, bicategory of relations, allegory
left and right euclidean;
extensional, well-founded relations.
constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
equality (definitional, propositional, computational, judgemental, extensional, intensional, decidable)
identity type, equivalence of types, definitional isomorphism
isomorphism, weak equivalence, homotopy equivalence, weak homotopy equivalence, equivalence in an (∞,1)-category
Examples.
basic constructions:
strong axioms
further
Given two -sets and , an affine function or antithesis function or -function is a function which preserves the equivalence relation and reflects the irreflexive symmetric relation:
In dependent type theory, if the -sets are univalent, then the -functions are precisely the strongly extensional functions with respect to the irreflexive symmetric relation. In addition, if the univalent -sets are affirmative, then every function is an affine function.
Created on January 13, 2025 at 16:51:52. See the history of this page for a list of all contributions to it.