Papers
Topics
Authors
Recent
Search
2000 character limit reached

The Convolution Algebra

Published 9 Feb 2017 in math.LO | (1702.02847v1)

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 $LX$ 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 LX$ 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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.