Search arXivSearch

arXiv · 1702.02847

The Convolution Algebra

Abstract

For a complete lattice $L$ and a relational structure $\mathfrak{X}=(X,(R_i)_I)$, we introduce the convolution algebra $L^{\mathfrak{X}}$. This algebra consists of the lattice $L^X$ equipped with an additional $n_i$-ary operation $f_i$ for each $n_i+1$-ary relation $R_i$ of $\mathfrak{X}$. For $\alpha_1,\ldots,\alpha_{n_i}\in L^X$ and $x\in X$ we set $f_i(\alpha_1,\ldots,\alpha_{n_i})(x)=\bigvee\{\alpha_1(x_1)\wedge\cdots\wedge\alpha_{n_i}(x_{n_i}):(x_1,\ldots,x_{n_i},x)\in R_i\}$. For the 2-element lattice $2$, $2^\mathfrak{X}$ is the reduct of the familiar complex algebra $\mathfrak{X}^+$ obtained by removing Boolean complementation from the signature. It is shown that this construction is bifunctorial and behaves well with respect to one-one and onto maps and with respect to products. When $L$ is the reduct of a complete Heyting algebra, the operations of $L^\mathfrak{X}$ are completely additive in each coordinate and $L^\mathfrak{X}$ is in the variety generated by $2^\mathfrak{X}$. Extensions to the construction are made to allow for completely multiplicative operations defined through meets instead of joins, as well as modifications to allow for convolutions of relational structures with partial orderings. Several examples are given.

Explore related subjects

Keep this discovery

BibTeXRIS

John Harding, Carol Walker, Elbert Walker. 2017-02-09. The Convolution Algebra. https://arxiv.org/abs/1702.02847

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO