Related papers: Formalization of Transform Methods using HOL Light
We use the classical Fourier analysis to introduce analytic families of weighted differential operators on the unit sphere. These operators are polynomial functions of the usual Beltrami-Laplace operator. New inversion formulas are obtained…
We present a general framework to study relativistic compound systems in a Hamiltonian formalism. This formalism is based on the explicitly covariant formulation of light-front dynamics, with a decomposition of the state vector in Fock…
We present a mechanized embedding of higher-order logic (HOL) and algebraic data types (ADT) into first-order logic with ZFC axioms. We implement this in the Lisa proof assistant for schematic first-order logic and its library based on…
A form of the Laplace transform is reviewed as a paradigm for an entire class of fractional functional transforms. Various of its properties are discussed. Such transformations should be useful in application to differential/integral…
This document reports on the use of an algebraic, visual, formal approach to the specification of patterns for the formalization of the GoF design patterns. The approach is based on graphs, morphisms and operations from category theory and…
We review recent developments in holographic hydrodynamics. We start from very basic discussion on hydrodynamic systems and motivate why string theory is an essential tool to deal with these systems when they are strongly coupled. The main…
Following up on the linear transformer part of the article from Katharopoulos et al., that takes this idea from Shen et al., the trick that produces a linear complexity for the attention mechanism is re-used and extended to a second-order…
Scaling language models to handle longer contexts introduces substantial memory challenges due to the growing cost of key-value (KV) caches. Motivated by the efficiency gains of hybrid models and the broad availability of pretrained large…
We present an experimental system strongly inspired by miniKanren, implemented on top of the tactics mechanism of the HOL~Light theorem prover. Our tool is at the same time a mechanism for enabling the logic programming style for reasoning…
We describe our ongoing project of formalization of algebraic methods for geometry theorem proving (Wu's method and the Groebner bases method), their implementation and integration in educational tools. The project includes formal…
In this book, there are five chapters: The Laplace Transform, Systems of Homogeneous Linear Differential Equations (HLDE), Methods of First and Higher Orders Differential Equations, Extended Methods of First and Higher Orders Differential…
In this paper, we introduce a novel semi-analytical method for solving a broad class of initial value problems involving differential, integro-differential, and delay equations, including those with fractional and variable-order…
This paper proposes a natural language translation method for machine-verifiable formal proofs that leverages the informalization (verbalization of formal language proof steps) and summarization capabilities of LLMs. For evaluation, it was…
The study of fundamental optics effects has been stimulated through the increasing ability to structure light in all its degrees of freedom (DOFs) in sophisticated but simple experimental settings. However, with such an increase in…
The present dissertation introduces the research project on HOLMS (\textbf{HOL} Light Library for \textbf{M}odal \textbf{S}ystems), a growing modular framework for modal reasoning within the HOL Light proof assistant. To provide an…
The Fourier Transform is one of the most important linear transformations used in science and engineering. Cooley and Tukey's Fast Fourier Transform (FFT) from 1964 is a method for computing this transformation in time $O(n\log n)$. From a…
Many automatic theorem provers are restricted to untyped logics, and existing translations from typed logics are bulky or unsound. Recent research proposes monotonicity as a means to remove some clutter when translating monomorphic to…
This paper introduces Generalized Fourier transform (GFT) that is an extension or the generalization of the Fourier transform (FT). The Unilateral Laplace transform (LT) is observed to be the special case of GFT. GFT, as proposed in this…
We present a formalization of convex polyhedra in the proof assistant Coq. The cornerstone of our work is a complete implementation of the simplex method, together with the proof of its correctness and termination. This allows us to define…
Consistent initialization of the Laplace transform has been a fundamental and long-standing issue. The consistency of the L- approach has been questioned, yet it is a popular approach since the L+ approach requires a priori computation of…