Related papers: Synthetic Differential Geometry in Lean
We study the projective systems in both continuous and discrete settings. These systems are linearizable by construction and thus, obviously, integrable. We show that in the continuous case it is possible to eliminate all variables but one…
In this paper we provide a framework for quantitative statements on distances and measures when studying algebraic varieties and morphisms of algebraic varieties over local fields. We will concentrate on local fields of the type…
This is yet another version of the course notes in chao-dyn/9407003. Here we change the universal Turing machine that is used to measure program-size complexity so that the constants in our information-theoretic incompleteness theorems are…
This work explores the tensor and combinatorial constructs underlying the linearised higher-order variational equations of a generic autonomous system along a particular solution. The main result of this paper is a compact yet explicit and…
We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…
A central question in verification is characterizing when a system has invariants of a certain form, and then synthesizing them. We say a system has a $k$ linear invariant, $k$-LI in short, if it has a conjunction of $k$ linear (non-strict)…
Synthetic Data Generation (SDG), leveraging Large Language Models (LLMs), has recently been recognized and broadly adopted as an effective approach to improve the performance of smaller but more resource and compute efficient LLMs through…
The behavior of physical systems is typically modeled using differential equations which are too complex to solve analytically. In practical problems, these equations are discretized on a computational domain, and numerical solutions are…
We give a sufficient criterion for complex analyticity of nonlinear maps defined on direct limits of normed spaces. This tool is then used to construct new classes of (real and complex) infinite dimensional Lie groups: (a) groups of germs…
Presented here is a preliminary study of a strictly linear, discontinuous-Petrov-Galerkin scheme for the discrete-ordinates method in slab geometry. By ``linear'', we mean the discretization does not depend on the solution itself as is the…
We study the existence of formal Taylor expansions for functions defined on fields of generalised series. We prove a general result for the existence and convergence of those expansions for fields equipped with a derivation and an…
We present a generalization of the sl(2) algebra where the algebraic relations are constructed with the help of a general function of one of the generators. When this function is linear this algebra is a deformed sl(2) algebra. In the…
We propose LeanLTL, a unifying framework for linear temporal logics in Lean 4. LeanLTL supports reasoning about traces that represent either infinite or finite linear time. The library allows traditional LTL syntax to be combined with…
Differential calculus on discrete spaces is studied in the manner of non-commutative geometry by representing the differential calculus by an operator algebra on a suitable Krein space. The discrete analogue of a (pseudo-)Riemannian metric…
The theory uses methods and language of linear algebra to study nonlinear spaces. These techniques can be used particularly to describe analytic geometry of non-linear elliptic, hyperbolic, De Sitter and Anti de Sitter spaces. The main…
We develop a validated numerical procedure for continuation of local stable/unstable manifold patches attached to equilibrium solutions of ordinary differential equations. The procedure has two steps. First we compute an accurate high order…
We re-evaluate universal computation based on the synthesis of Turing machines. This leads to a view of programs as singularities of analytic varieties or, equivalently, as phases of the Bayesian posterior of a synthesis problem. This new…
We investigate the problem of safety verification of infinite-state parameterized programs that are formed based on a rich class of topologies. We introduce a new proof system, called parametric proof spaces, which exploits the underlying…
The Lie linearizability criteria are extended to complex functions for complex ordinary differential equations. The linearizability of complex ordinary differential equations is used to study the linearizability of corresponding systems of…
We develop the theory of derived differential geometry in terms of bundles of curved $L_\infty[1]$-algebras, i.e. dg manifolds of positive amplitudes. We prove the category of derived manifolds is a category of fibrant objects. Therefore,…