Related papers: Formalizing equivalences without tears
Most of the engineering and physical systems are generally characterized by differential and difference equations based on their continuous-time and discrete-time dynamics, respectively. Moreover, these dynamical models are analyzed using…
This paper develops techniques which are used to answer a number of questions in the theory of equivalence relations generated by continuous actions of abelian groups. The methods center around the construction of certain specialized…
Motivated by the recent work of Algom-Kfir and Bestinva introducing the mapping class group of an infinite graph via proper homotopy equivalences, we give a necessary and sufficient condition for a surface to be properly homotopy equivalent…
In this note on coarse geometry we revisit coarse homotopy. We prove that coarse homotopy indeed is an equivalence relation, and this in the most general context of abstract coarse structures. We introduce (in a geometric way) coarse…
We show that certain diagrams of $\infty$-logoses are reconstructed in homotopy type theory extended with some lex, accessible modalities, which enables us to use plain homotopy type theory to reason about not only a single $\infty$-logos…
In paper arXiv:1109.6031 the author introduced stable formality quasi-isomorphisms and described the set of its homotopy classes. This result can be interpreted as a complete description of formal quantization procedures. In this note we…
We propose a scalable framework for deciding, proving, and explaining (in-)equivalence of context-free grammars. We present an implementation of the framework and evaluate it on large data sets collected within educational support systems.…
This paper describes an algorithm for the compilation of a two (or more) level orthographic or phonological rule notation into finite state transducers. The notation is an alternative to the standard one deriving from Koskenniemi's work: it…
It is well-known that in homotopy type theory (HoTT), one can prove the Eckmann-Hilton theorem: given two 2-loops p, q : 1 = 1 on the reflexivity path at an arbitrary point a : A, we have pq = qp. If we go one dimension higher, i.e., if p…
We describe the behaviour of the homotopy similarity relations and finite-order invariants under the function $[X,Y]\to[X,Z]$ induced by a map $Y\to Z$ strongly $r$-similar to the constant map.
One of the interesting and important rational homotopy properties of a topological space $X$ is that of {\em formality}. In this paper we prove the non-formality property of some family homogeneous spaces.
We study the homotopy type of the simplicial set of continuous semi-algebraic simplexes of an algebraic variety defined over a real closed field, which we will call the real homotopy type. We prove an analogue of the theorem of Artin-Mazur…
As previously known, all 3-manifolds of genus two can be represented by edge-coloured graphs uniquely defined by 6-tuples of integers satisfying simple conditions. The present paper describes an ``elementary transformation'' on these…
We observe that the notion of two sets being equal up to finitely many elements is a homotopy equivalence relation in a model category, and suggest a homotopy-invariant variant of Generalised Continuum Hypothesis about which more can be…
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…
We develop a localisation theory for certain categories, yielding a 3-arrow calculus: Every morphism in the localisation is represented by a diagram of length 3, and two such diagrams represent the same morphism if and only if they can be…
"[M]athematicians care no more for logic than logicians for mathematics." Augustus de Morgan, 1868. Proofs are traditionally syntactic, inductively generated objects. This paper presents an abstract mathematical formulation of propositional…
We present a deterministic way of finding contraction maps for candidate holographic entanglement entropy inequalities modulo choices due to actual degeneracy. We characterize its complexity and give an argument for the completeness of the…
There are multiple ways to formalise the metatheory of type theory. For some purposes, it is enough to consider specific models of a type theory, but sometimes it is necessary to refer to the syntax, for example in proofs of canonicity and…
We give a method for constructing a regularizing decomposition of a matrix pencil, which is formulated in terms of the linear mappings. We prove that two pencils are topologically equivalent if and only if their regularizing decompositions…