Related papers: A Rocq Formalization of Monomial and Graded Orders
Formalization of mathematics is a major topic, that includes in particular numerical analysis, towards proofs of scientific computing programs. The present study is about the finite element method, a popular method to numerically solve…
We present a Rocq library for monoidal categories, which includes a decision procedure for proving equality of morphisms as well as notations that make it possible to reason as if they were strict, inferring MacLane isomorphims…
Traditional category theory is typically based on set-theoretic principles and ideas, which are often non-constructive. An alternative approach to formalizing category theory is to use E-category theory, where hom sets become setoids. Our…
The free-variable tableau method has been widely used in order to automate proofs in multiple kinds of logics. Many automated theorem provers rely on this approach, either because it is the only available method-e.g., in certain modal…
In this paper, we study properties of nodal orders defined over arbitrary base fields. In particular we give a classification of complete real nodal orders.
We describe a formalization of higher-order rewriting theory and formally prove that an AFS is strongly normalizing if it can be interpreted in a well-founded domain. To do so, we use Coq, which is a proof assistant based on dependent type…
We use linear algebraic methods to obtain general results about linear operators on a space of polynomials that we apply to the operators associated with a polynomial sequence by the monomiality property. We show that all such operators are…
We give a finite axiomatization for the variety generated by relational, integral ordered monoids. As a corollary we get a finite axiomatization for the language interpretation as well.
Complexity and decidability of logics is a major research area involving a huge range of different logical systems. This calls for a unified and systematic approach for the field. We introduce a research program based on an algebraic…
Ordered, linear, and other substructural type systems allow us to expose deep properties of programs at the syntactic level of types. In this paper, we develop a family of unary logical relations that allow us to prove consequences of…
One can perform equational reasoning about computational effects with a purely functional programming language thanks to monads. Even though equational reasoning for effectful programs is desirable, it is not yet mainstream. This is partly…
For performance and verification in machine learning, new methods have recently been proposed that optimise learning systems to satisfy formally expressed logical properties. Among these methods, differentiable logics (DLs) are used to…
We study the set of monomial ideals in a polynomial ring as an ordered set, with the ordering given by reverse inclusion. We give a short proof of the fact that every antichain of monomial ideals is finite. Then we investigate ordinal…
Let $K$ be a field, and $A=K[a_1,\ldots ,a_n]$ a solvable polynomial algebra in the sense of [K-RW, {\it J. Symbolic Comput.}, 9(1990), 1--26]. It is shown that if $A$ is an $\mathbb{N}$-graded algebra of $({\cal B},d(~))$-type, then $A$…
This paper presents a Coq formalization of linear algebra over elementary divisor rings, that is, rings where every matrix is equivalent to a matrix in Smith normal form. The main results are the formalization that these rings support…
We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters. We consider two variants of…
Type theory plays an important role in foundations of mathematics as a framework for formalizing mathematics and a base for proof assistants providing semi-automatic proof checking and construction. Derivation of each theorem in type theory…
Symmetric monoidal categories (SMCs) are a common framework for reasoning about computation, focusing on the parallel and sequential compositionality of operations. String diagrams are a ubiquitous and powerful tool for reasoning about…
We study monomial operators on $ L^2[0,1]$, that is bounded linear operators that map each monomial $x^n$ to a multiple of $x^{p_n}$ for some $p_n$. We show that they are all unitarily equivalent to weighted composition operators on a Hardy…
We obtain the specialization of monomial symmetric functions on the alphabet (a-b)/(1-q). This gives a remarkable algebraic identity, and four new developments for the Macdonald polynomial associated with a row. The proofs are given in the…