English

The Convolution Algebra

Logic 2017-02-10 v1

Abstract

For a complete lattice LL and a relational structure X=(X,(Ri)I)\mathfrak{X}=(X,(R_i)_I), we introduce the convolution algebra LXL^{\mathfrak{X}}. This algebra consists of the lattice LXL^X equipped with an additional nin_i-ary operation fif_i for each ni+1n_i+1-ary relation RiR_i of X\mathfrak{X}. For α1,,αniLX\alpha_1,\ldots,\alpha_{n_i}\in L^X and xXx\in X we set fi(α1,,αni)(x)={α1(x1)αni(xni):(x1,,xni,x)Ri}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 22, 2X2^\mathfrak{X} is the reduct of the familiar complex algebra X+\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 LL is the reduct of a complete Heyting algebra, the operations of LXL^\mathfrak{X} are completely additive in each coordinate and LXL^\mathfrak{X} is in the variety generated by 2X2^\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.

Keywords

Cite

@article{arxiv.1702.02847,
  title  = {The Convolution Algebra},
  author = {John Harding and Carol Walker and Elbert Walker},
  journal= {arXiv preprint arXiv:1702.02847},
  year   = {2017}
}