Search arXiv⌕ Search

arXiv · 1807.06862

Mix $\star$-autonomous quantales and the continuous weak order

Abstract

The set of permutations on a finite set can be given a lattice structure (known as the weak Bruhat order). The lattice structure is generalized to the set of words on a fixed alphabet $Σ= \{ x, y, z, ... \}$, where each letter has a fixed number of occurrences (these lattices are known as multinomial lattices and, in dimension 2, as lattices of lattice paths). By interpreting the letters $x, y, z, ...$ as axes, these words can be interpreted as discrete increasing paths on a grid of a $d$-dimensional cube, where $d = {\rm card}(Σ)$. We show in this paper how to extend this order to images of continuous monotone paths from the unit interval to a $d$-dimensional cube. The key tool used to realize this construction is the quantale $\mathsf{L}_{\vee}(\mathbb{I})$ of join-continuous functions from the unit interval to itself; the construction relies on a few algebraic properties of this quantale: it is $\star$-autonomous and it satisfies the mix rule. We begin developing a structural theory of these lattices by characterizing join-irreducible elements, and by proving these lattices are generated from their join-irreducible elements under infinite joins.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Maria João Gouveia, Luigi Santocanale. 2018-07-18. Mix $\star$-autonomous quantales and the continuous weak order. https://arxiv.org/abs/1807.06862

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

KEEP EXPLORING

Related papers

Extension of Lipschitz maps definable in Hensel minimal structures

In this paper, we establish a theorem on extension of Lipschitz maps $f$ definable in Hensel minimal fields $K$. This may be regarded as a definable, non-Archimedean, non-locally compact version of Kirszbraun's extension theorem. We proceed with double induction with respect to the dimensions of the ambient space and of the domain of $f$. To this end, we introduce the concept of a definable open cell package with a skeleton which, along with the concept of a risometry, plays a key role in our induction procedure.

math.LO↗

Convex Team Logics

We prove expressive completeness results for convex propositional and modal team logics, where a logic is convex if, for each formula, if it is true in two teams $t$ and $u$ and $t\subseteq s\subseteq u$, then it is also true in $s$. We introduce propositional/modal team logics which are expressively complete for the class of all convex propositional/modal team properties. We also answer an open question concerning the expressive power of classical propositional logic extended with the nonemptiness atom NE: we show that it is expressively complete for the class of all convex and union-closed properties. A modal analogue of this result additionally yields an expressive completeness theorem for Aloni's (2022) Bilateral State-Based Modal Logic. There is a specific sense in which one of the propositional convex logics we introduce extends propositional dependence logic; this sense corresponds to the existence of a compositional translation between the two logics. Another of the convex logics extends propositional inquisitive logic in the same manner. We generalize the notion of uniform definability, as considered in the team semantics literature, to formalize this notion of compositional extension.

math.LO↗

A definable matching theorem and approximate Grothendieck semigroups

For an arbitrary first-order structure, we introduce the notion of an approximate Grothendieck semigroup, which satisfies a Banach-Schröder-Bernstein Theorem, as well as a weak Cancellation Law (wCL). At the heart of the proof of the wCL lies a definable matching theorem, which vastly generalizes a related result in Maříková \cite{mat}, and is of independent interest.

math.LO↗