English
Related papers

Related papers: Decomposing the Univalence Axiom

200 papers

Homotopy type theory is a modern foundation for mathematics that introduces the univalence axiom and is particularly suitable for the study of homotopical mathematics and its formalization via proof assistants. In order to better comprehend…

Category Theory · Mathematics 2025-08-13 Nima Rasekh

Univalence was first defined in the setting of homotopy type theory by Voevodsky, who also (along with Kapulkin and Lumsdaine) adapted it to a model categorical setting, which was subsequently generalized to locally Cartesian closed…

Category Theory · Mathematics 2021-03-31 Nima Rasekh

We prove Marchenko-type uniqueness theorems for inverse Sturm-Liouville problems. Moreover, we prove a generalization of Ambarzumyans theorem.

Spectral Theory · Mathematics 2017-09-04 Yuri Ashrafyan

In this paper we partly extend the Beauville-Bogomolov decomposition theorem to the singular setting. We show that any complex projective variety of dimension at most five with canonical singularities and numerically trivial canonical class…

Algebraic Geometry · Mathematics 2016-06-30 Stéphane Druel

This is an expository paper, giving a simplified proof of the cubic case of the main conjecture for Vinogradov's mean value theorem.

Number Theory · Mathematics 2015-12-11 D. R. Heath-Brown

This paper continues the series of papers that develop a new approach to syntax and semantics of dependent type theories. Here we study the interpretation of the rules of the identity types in the intensional Martin-Lof type theories on the…

Category Theory · Mathematics 2015-05-26 Vladimir Voevodsky

The term UniMath refers both to a formal system for mathematics, as well as a computer-checked library of mathematics formalized in that system. The UniMath system is a core dependent type theory, augmented by the univalence axiom. The…

Logic in Computer Science · Computer Science 2019-07-16 Benedikt Ahrens , Ralph Matthes , Anders Mörtberg

This article focuses on properties of monotone convolutions. A criterion for infinite divisibility and time evolution of convolution semigroups are mainly studied. In particular, we clarify that many analogues of the classical results of…

Operator Algebras · Mathematics 2010-08-30 Takahiro Hasebe

The classical Beauville-Bogomolov Decomposition Theorem asserts that any compact K\"ahler manifold with numerically trivial canonical bundle admits an \'etale cover that decomposes into a product of a torus, and irreducible,…

Algebraic Geometry · Mathematics 2016-11-08 Daniel Greb , Stefan Kebekus , Thomas Peternell

We consider the problem of rationalizing choice data by a preference satisfying an arbitrary collection of invariance axioms. Examples of such axioms include quasilinearity, homotheticity, independence-type axioms for mixture spaces,…

Theoretical Economics · Economics 2024-08-09 Peter Caradonna , Christopher P. Chambers

We introduce Voevodsky's univalent foundations and univalent mathematics, and explain how to develop them with the computer system Agda, which is based on Martin-L\"of type theory. Agda allows us to write mathematical definitions,…

Logic in Computer Science · Computer Science 2022-09-05 Martín Hötzel Escardó

We present an accessible account of Voevodsky's construction of a univalent universe of Kan fibrations.

Algebraic Topology · Mathematics 2018-10-30 Chris Kapulkin , Peter LeFanu Lumsdaine , Vladimir Voevodsky

We present a unified and simple method for deriving work theorems for classical and quantum Hamiltonian systems, both under equilibrium conditions and in a steady state. Throughout the paper, we adopt the partitioning of the total…

Statistical Mechanics · Physics 2008-07-30 M. F. Gelin , D. S. Kosov

We contribute XTT, a cubical reconstruction of Observational Type Theory which extends Martin-L\"of's intensional type theory with a dependent equality type that enjoys function extensionality and a judgmental version of the unicity of…

Logic in Computer Science · Computer Science 2021-04-20 Jonathan Sterling , Carlo Angiuli , Daniel Gratzer

We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlying a theorem prover. We also show a close relation with the…

Logic in Computer Science · Computer Science 2015-07-01 Benjamin Werner

We propose an abstract notion of a type theory to unify the semantics of various type theories including Martin-L\"{o}f type theory, two-level type theory and cubical type theory. We establish basic results in the semantics of type theory:…

Category Theory · Mathematics 2023-08-10 Taichi Uemura

The uniequness theorem for the Tsallis entropy by introducing the generalized Faddeev's axiom is proven. Our result improves the recent result, the uniqueness theorem for Tsallis entropy by the generalized Shannon-Khinchin's axiom in…

Statistical Mechanics · Physics 2010-12-30 Shigeru Furuichi

A typoid is a type equipped with an equivalence relation, such that the terms of equivalence between the terms of the type satisfy certain conditions, with respect to a given equivalence relation between them, that generalise the properties…

Category Theory · Mathematics 2022-05-16 Iosif Petrakis

We present a unifying framework for type systems for process calculi. The core of the system provides an accurate correspondence between essentially functional processes and linear logic proofs; fragments of this system correspond to…

Logic in Computer Science · Computer Science 2015-05-29 Emmanuel Beffara

We systematically study the moduli theory of symplectic varieties (in the sense of Beauville) which admit a resolution by an irreducible symplectic manifold. In particular, we prove an analog of Verbitsky's global Torelli theorem for the…

Algebraic Geometry · Mathematics 2021-01-07 Benjamin Bakker , Christian Lehn