natural deduction metalanguage, practical foundations
type theory (dependent, intensional, observational type theory, homotopy type theory)
computational trinitarianism =
propositions as types +programs as proofs +relation type theory/category theory
analysis (differential/integral calculus, functional analysis, topology)
metric space, normed vector space
open ball, open subset, neighbourhood
convergence, limit of a sequence
compactness, sequential compactness
continuous metric space valued function on compact metric space is uniformly continuous
…
…
There are many possible definitions of the (two-sided, Dedekind) real numbers type in dependent type theory. If the dependent type theory has a type universe or a type of all propositions, then one can translate the impredicative definition of the Dedekind real numbers over to dependent type theory.
However, in dependent type theory without a type universe or a type of all propositions, the impredicative definition of the Dedekind real numbers no longer works. Nonetheless, it is possible to define the type of real numbers via inference rules as a type with a type family of domains of the structural Dedekind cut associated with each real number.
We shall assume the minimum amount of type formers in dependent type theory to define Dedekind cuts of the rational numbers:
The types in the dependent type theory form the (infinity,1)-categorical version of a Heyting category with exponential objects and a natural numbers object.
In addition, if one has a type of all propositions in the dependent type theory, one can define the type of real numbers as the type of all (two-sided) Dedekind cuts, which are subtypes or predicates of the product type which satisfy the following axioms:
Dedekind cuts are bounded:
Dedekind cuts are rounded:
Dedekind cuts are disjoint:
Dedekind cuts are located:
Usually, Dedekind cuts are presented as pairs of predicates , but this is equivalent to the above definition, since for any types , , and , one has that
and for any type , one has that
The predicate is defined as the product of all the axioms above, and the type of real numbers is defined as
In dependent type theory with a type universe , one can take the type of all -small propositions by the dependent sum type
and define locally -small Dedekind cuts and the (locally -small) real numbers using .
So, what happens if the dependent type theory has neither a type of all propositions nor a type universe, so that we are working in fully predicative mathematics? It is no longer possible to quantify over all subtypes of , so one cannot define the type of real numbers impredicatively. Also, without impredicativity, a subtype of the sum type is a type with an embedding of types . One can show from the definition of embedding that given an element , the fiber type of at is a mere proposition
so everywhere in the definition above where one would have used the type family one can instead use the dependent sum type .
Then a Dedekind cut consists of a type with an embedding of types , which satisfies the following axioms:
Dedekind cuts are bounded:
Dedekind cuts are rounded:
Dedekind cuts are disjoint:
Dedekind cuts are located:
The predicate is defined as the product of all the axioms above, and the type of all Dedekind cuts with domain is given by the dependent sum type
If there existed a type universe, one can simply define the real numbers as the type of Dedekind cuts in ;
However, while there is no type universe , one can add inference rules for the type of real numbers such that behaves as the dependent sum type if the hypothetical contained every single type in the type theory.
Formation rules for the real numbers type:
Introduction rules for real numbers type:
Elimination rules for real numbers type:
Computation rules for real numbers type:
Uniqueness rules for real numbers type:
The inference rules for the real numbers type imply that the real numbers type are a Tarski universe with universal type family indexed by , where is the domain of the Dedekind cut
associated with the real number . This makes the real numbers type similar to other type universes such as the type of all propositions or the type of finite types.
An Archimedean ordered field can be defined in any dependent type theory with the following types:
Then the real numbers type is the homotopy terminal Archimedean ordered field.
If the dependent type theory has quotient sets, then it is provable that is Cauchy complete. From the definition of homotopy terminal Archimedean ordered field, is an algebra of the endofunctor which takes Archimedean ordered fields to the Archimedean ordered field of equivalence classes of Cauchy sequences in . Every algebra of the endofunctor in the type of Archimedean ordered field is a Cauchy complete Archimedean ordered field.
Similarly, if power sets of Archimedean ordered fields exist, then it is provable that is Dedekind complete. From the definition of homotopy terminal Archimedean field, is an algebra of the endofunctor which takes Archimedean ordered fields to the Archimedean ordered field of two-sided Dedekind cuts in . Every algebra of the endofunctor in the type of Archimedean ordered field is a Dedekind complete Archimedean ordered field.
If a real numbers type as defined in the previous section also exists, then it is a subtype of this real numbers type defined as the terminal Archimedean ordered field, since is provably Archimedean ordered, and any ring homomorphisms between two field objects is an embedding of types, and by definition of terminal object, there is always a ring homomorphism .
The type of real numbers is the Coquand universe of all Dedekind cuts. Since real numbers and Dedekind cuts are interdefinable via the rules of Coquand universes, we shall just be directly defining the algebraic operations and order relations on Dedekind cuts; the corresponding operations on real numbers follow from the rules of Coquand universes.
Addition of two Dedekind cuts and is given by the type
with the embedding given by the first projection function of the dependent sum type into the product type .
The swap function on the booleans is inductively defined by and .
The additive inverse of a Dedekind cut is given by the type
with the embedding given by the first projection function of the dependent sum type into the product type .
With these operations, the real numbers form an abelian group.
For the impredicative definition of the real numbers using a type of propositions, as well as the algebraic operations and order relations for real numbers see section 11.2 of:
Last revised on September 26, 2024 at 21:01:44. See the history of this page for a list of all contributions to it.