Searcharxiv⌕ Search

arXiv subjects

Thierry Coquand

Publications and source records attributed to Thierry Coquand.

At least 37 records · Page 2Linked to original sources
arXiv2024

Type Theory with Explicit Universe Polymorphism (revised and extended version)

The aim of this paper is to refine and extend proposals by Sozeau and Tabareau and by Voevodsky for universe polymorphism in type theory. In those systems judgments can depend on explicit constraints between universe levels. We here present a system where we also have products indexed by universe levels and by constraints. Our theory has judgments for internal universe levels, built up from level variables by a successor operation and a binary supremum operation, and also judgments for equality of universe levels.

cs.LO↗
arXiv2024

The Regular Element Property in Constructive Mathematics

The goal of this note is to present Kaplansky's proof of the Regular Element Property and to explain how this argument can be adapted to the case of a coherent, strongly discrete and Noetherian (with an inductive definition of Noetherian) rings in a constructive setting. We thus get, in this setting, an algorithm which given a f.g. regular ideal, build a regular element in this ideal.

math.AC↗
arXiv2024

Anneaux à diviseurs et anneaux de Krull (une approche constructive)

We give give an elementary and constructive version of the theory of "Prüfer v-Multiplication Domains" (which we call "anneaux à diviseurs" in the paper) and Krull Domains. The main results of these theories are revisited from a constructive point of view, following the Bishop style, and without assuming properties of complete factorizations. Nous présentons dans cet article une approche constructive, dans le style de Bishop, de la théorie des diviseurs et des anneaux de Krull. Nous accordons une place centrale aux "anneaux à diviseurs," appelés PvMD dans la littérature anglaise. Les résultats classiques sont obtenus comme résultats d'algorithmes explicites sans faire appel aux hypothèses de factorisation complète.

math.AC↗
arXiv2023

A Foundation for Synthetic Algebraic Geometry

This is a foundation for algebraic geometry, developed internal to the Zariski topos, building on the work of Kock and Blechschmidt. The Zariski topos consists of sheaves on the site opposite to the category of finitely presented algebras over a fixed ring, with the Zariski topology, i.e. generating covers are given by localization maps $A\to A_{f_1}$ for finitely many elements $f_1,\dots,f_n$ that generate the ideal $(1)=A\subseteq A$. We use homotopy type theory together with three axioms as the internal language of a (higher) Zariski topos. One of our main contributions is the use of higher types -- in the homotopical sense -- to define and reason about cohomology. Actually computing cohomology groups, seems to need a principle along the lines of our ``Zariski local choice'' axiom, which we justify as well as the other axioms using a cubical model of homotopy type theory.

math.AG↗
arXiv2023

A variation of Reynolds-Hurkens Paradox

We present a variation of Hurkens paradox, which can itself be seen as a variation of Reynolds result that there is no set theoretic model of polymorphism.

cs.LO↗
arXiv2023

Reduction Free Normalisation for a proof irrelevant type of propositions

We show normalisation and decidability of convertibility for a type theory with a hierarchy of universes and a proof irrelevant type of propositions, close to the type system used in the proof assistant Lean. Contrary to previous arguments, the proof does not require explicitly to introduce a notion of neutral and normal forms.

cs.LO↗
arXiv2023

Constructive basic theory of central simple algebras

We provide a constructive treatment of basic results in the theory of central simple algebras. One main issue is the fact that one starting result, Wedderburn's Theorem stating that a simple algebra is a matrix algebra over a skew field, is not constructively valid. We solve this problem by proving instead a dynamical version of this theorem. One can use this to give constructive proofs of basic results of the theory of central simple algebras, such as Skolem-Noether Theorem. We illustrate this development by giving an elementary constructive proof of a theorem of Becher (which is itself a consequence of a celebrated theorem of Merkurjev).

math.RA↗
arXiv2022

Some remarks about normal rings

We give a constructive proof that $R[X]$ is normal when $R$ is normal. We apply this result to an operation needed for studying the henselization of a local ring. Our proof is based on the case where $R$ is without zero divisors, which is more involved than the case where $R$ is an integral domain. We have to use a constructive deciphering technique that replaces the use of minimal primes (in classical mathematics) by suitable explicit localizations in a suitable tree.

math.AC↗
arXiv2022

Canonicity and homotopy canonicity for cubical type theory

Cubical type theory provides a constructive justification of homotopy type theory. A crucial ingredient of cubical type theory is a path lifting operation which is explained computationally by induction on the type involving several non-canonical choices. We present in this article two canonicity results, both proved by a sconing argument: a homotopy canonicity result, every natural number is path equal to a numeral, even if we take away the equations defining the lifting operation on the type structure, and a canonicity result, which uses these equations in a crucial way. Both proofs are done internally in a presheaf model.

math.LO↗
arXiv2022

Dimension de Heitmann des treillis distributifs et des anneaux commutatifs

We study a notion of dimension which was introduced by R. Heitmann in his remarkable paper in 1984, and also a related notion, implicit in the proofs in his paper. We develop these notions in the general framework of distributive lattices and spectral spaces. We obtain in this way constructive versions of important theorems in commutative algebra, with simpler proofs than the classical ones, and some new results.

math.AC↗
arXiv2021

A Note on Generalized Algebraic Theories and Categories with Families

We give a new syntax independent definition of the notion of a generalized algebraic theory as an initial object in a category of categories with families (cwfs) with extra structure. To this end we define inductively how to build a valid signature $Σ$ for a generalized algebraic theory and the associated category of cwfs with a $Σ$-structure and cwf-morphisms that preserve this structure on the nose. Our definition refers to uniform families of contexts, types, and terms, a purely semantic notion. Furthermore, we show how to syntactically construct initial cwfs with $Σ$-structures. This result can be viewed as a generalization of Birkhoff's completeness theorem for equational logic. It is obtained by extending Castellan, Clairambault, and Dybjer's construction of an initial cwf. We provide examples of generalized algebraic theories for monoids, categories, categories with families, and categories with families with extra structure for some type formers of dependent type theory. The models of these are internal monoids, internal categories, and internal categories with families (with extra structure) in a category with families.

math.CT↗
arXiv2020

Regular entailment relations

Inspired by the work of Lorenzen on the theory of preordered groups in the forties and fifties, we define regular entailment relations and show a crucial theorem for this structure. We also describe equivariant systems of ideals {à} la Lorenzen and show that the remarkable regularisation process invented by him yields a regular entailment relation. By providing constructive objects and arguments, we pursue Lorenzen's aim of "bringing to light the basic, pure concepts in their simple and transparent clarity"

math.LO↗
arXiv2020

Constructive sheaf models of type theory

We generalise sheaf models of intuitionistic logic to univalent type theory over a small category with a Grothendieck topology. We use in a crucial way that we have constructive models of univalence, that can then be relativized to any presheaf models, and these sheaf models are obtained by localisation for a left exact modality. We provide first an abstract notion of descent data which can be thought of as a higher version of the notion of prenucleus on frames, from which can be generated a nucleus (left exact modality) by transfinite iteration. We then provide several examples.

math.LO↗
arXiv2020

Lorenzen's proof of consistency for elementary number theory [with an edition and translation of "Ein halbordnungstheoretischer Widerspruchsfreiheitsbeweis'']

We present a manuscript of Paul Lorenzen that provides a proof of consistency for elementary number theory as an application of the construction of the free countably complete pseudocomplemented semilattice over a preordered set. This manuscript rests in the Oskar-Becker-Nachlass at the Philosophisches Archiv of Universit{ä}t Konstanz, file OB 5-3b-5. It has probably been written between March and May 1944. We also compare this proof to Gentzen's and Novikov's, and provide a translation of the manuscript.

math.HO↗
arXiv2018

Résolutions libres finies. Méthodes constructives

In this memoir, we give a completely constructive version of the celebrate book 'Finite Free Resolutions' by Northcott, and of some other results related to the depth à la Hochster, the Cayley complexes and their determinants, and the finite projective resolutions.

math.AC↗
arXiv2018

Lattice-ordered groups generated by an ordered group and regular systems of ideals

Unbounded entailment relations, introduced by Paul Lorenzen (1951), are a slight variant of a notion which plays a fundamental rôle in logic (see Scott 1974) and in algebra (see Lombardi and Quitté 2015). We call systems of ideals their single-conclusion counterpart. If they preserve the order of a commutative ordered monoid G and are equivariant w.r.t. its law, we call them equivariant systems of ideals for G: they describe all morphisms from G to meet-semilattice-ordered monoids generated by (the image of) G. Taking an article by Lorenzen (1953) as a starting point, we also describe all morphisms from a commutative ordered group G to lattice-ordered groups generated by G through unbounded entailment relations that preserve its order, are equivariant, and satisfy a regularity property invented by Lorenzen (1950); we call them regular entailment relations. In particular, the free lattice-ordered group generated by G is described through the finest regular entailment relation for G, and we provide an explicit description for it; it is order-reflecting if and only if the morphism is injective, so that the Lorenzen-Clifford-Dieudonné theorem fits into our framework. Lorenzen's research in algebra starts as an inquiry into the system of Dedekind ideals for the divisibility group of an integral domain R, and specifically into Wolfgang Krull's "Fundamentalsatz" that R may be represented as an intersection of valuation rings if and only if R is integrally closed: his constructive substitute for this representation is the regularisation of the system of Dedekind ideals, i.e. the lattice-ordered group generated by it when one proceeds as if its elements are comparable.

math.LO↗
arXiv2018

Canonicity and normalisation for Dependent Type Theory

We show canonicity and normalization for dependent type theory with a cumulative sequence of universes and a type of Boolean. The argument follows the usual notion of reducibility, going back to Godel's Dialectica interpretation and the work of Tait. A key feature of our approach is the use of a proof relevant notion of reducibility.

cs.PL↗