Continuous Varieties of Metric and Quantitative Algebras
Wataru Hino

TL;DR
This paper extends universal algebra to metric structures, establishing variety theorems for classes of metric algebras characterized by metric equations and continuous inferences.
Contribution
It introduces the concepts of congruential pseudometric and continuous varieties, providing a framework for classifying metric algebras via closure properties.
Findings
Metric versions of the variety theorem are established.
Introduction of congruential pseudometric as an analogue of classical congruence.
Characterization of strict and continuous varieties through closure properties.
Abstract
A metric algebra is a metric variant of the notion of -algebra, first introduced in universal algebra to deal with algebras equipped with metric structures such as normed vector spaces. In this paper, we showed metric versions of the variety theorem, which characterizes strict varieties (classes of metric algebras defined by metric equations) and continuous varieties (classes defined by a continuous family of basic quantitative inferences) by means of closure properties. To this aim, we introduce the notion of congruential pseudometric on a metric algebra, which corresponds to congruence in classical universal algebra, and we investigate its structure.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Advanced Topics in Algebra · Advanced Algebra and Logic
Continuous Varieties of Metric and Quantitative Algebras
Wataru Hino
The University of Tokyo
Japan
Abstract
A metric algebra is a metric variant of the notion of -algebra, first introduced in universal algebra to deal with algebras equipped with metric structures such as normed vector spaces. In this paper, we showed metric versions of the variety theorem, which characterizes strict varieties (classes of metric algebras defined by metric equations) and continuous varieties (classes defined by a continuous family of basic quantitative inferences) by means of closure properties. To this aim, we introduce the notion of congruential pseudometric on a metric algebra, which corresponds to congruence in classical universal algebra, and we investigate its structure.
1 Introduction
1.1 Metric and Quantitative Algebra
A quantitative algebra is introduced by Mardare et al. as a quantitative variant of the notion of -algebra, in the sense of classical universal algebra in [18]. They use an atomic formula of the form , where is a non-negative real number, instead of an equation , and give a complete deductive system with respect to quantitative algebras. They investigate classes defined by basic quantitative inferences, which are formulas of the form where and are restricted to variables. They show that various well-known metric constructions, such as the Hausdorff metric, the Kantorovich metric and the Wasserstein metric, naturally arise as free quantitative algebras with suitable axioms consisting of basic quantitative inferences. The theory of quantitative algebra is applied to the axiomatization of the behavioral distance [2].
In fact, the idea of using indexed binary relations to axiomatize metric structures is already in the literature of universal algebra [21, 16] under the name of metric algebra. This notion is slightly wider than that of quantitative algebra in the sense that operations in metric algebras are not required to be non-expansive. Weaver [21] and Khudyakov [16] prove continuous versions of the characterization theorem for quasivarieties, i.e., classes of algebras defined by implications, and the decomposition theorem corresponding to the one in the classical theory.
However a metric version of the variety theorem has been missing for long. We give a very straightforward version in [10], and Mardare et al. [19] give the characterization theorem for -variety, where is a cardinal, which generalizes our result in [10].
1.2 Contributions
In this paper, we will investigate the universal algebraic treatment of metric and quantitative algebra. More specifically,
- •
We give a clean formulation of the theory of metric and quantitative algebra based on congruential pseudometric (Definition 3.7). We prove some basic results on congruential pseudometric, including the metric variant of the isomorphism theorems. Especially the characterization theorem of direct products via congruential pseudometrics seems non-trivial since we need to assume that the given metric space is complete.
- •
We prove the variety theorem for classes of metric (or quantitative) algebras defined by metric equations. This is proved in our previous work [10]. Here we give a more concise proof by congruential pseudometrics.
- •
We prove the variety theorem for continuous varieties, which are classes of metric (or quantitative) algebras defined by basic quantitative inferences and satisfy the continuity condition.
As we mentioned, a basic quantitative inference is an implicational formula whose assumptions are metric equations between variables. One of the main challenges when considering implicationally defined classes is the size problem; it is often easy to show that a given class is defined by implications if we allow infinitely many assumptions, and difficulties arise when we want to have finitary axioms. We use ultraproduct to deal with the size problem, following the approach in [21], but we make the relation between ultraproducts and the size problem more explicit: we first show the weak version of the compactness theorem for metric algebras, and use it for the restriction of the size of assumptions.
A variety theorem for -variety111a class defined by -basic quantitative inferences. is already shown in [19], but it lacks the continuity condition. The continuity condition is important, especially when we work with complete metric spaces. Indeed, as pointed out in [18], a class defined by basic quantitative inferences is closed under completion if its axioms satisfy the continuity condition (the situation is the same for quasivarieties [21]). Moreover the continuity condition also implies the closure property under ultralimits, which can be seen as a robustness condition in some sense. This point is discussed in Section 2.4.
2 Preliminaries
In this section, we review some notions that we will need in the following sections.
2.1 Classical Universal Algebra
Let be an algebraic signature, i.e., a set with an arity map . We define by for each .
Definition 2.1** (See e.g. [5]).**
- •
A -algebra is a tuple where is a set endowed with an operation for each . We will just write for if is clear from the context.
- •
A map between -algebras is a -homomorphism if it preserves all -operations, i.e., for each and .
- •
A subalgebra of a -algebra is a subset of closed under -operations, regarded as a -algebra by restricting operations. A subalgebra is identified with (the isomorphic class of) a pair , where is a -algebra and is an injective homomorphism.
- •
The product of -algebras is the direct product of the underlying sets endowed with the pointwise -operations.
- •
A quotient (also called a homomorphic image) of a -algebra is a pair where is a -algebra and is a surjective homomorphism.
- •
Given a set , the set of -terms over is inductively defined as follows: each is a -term (called a variable), and if and are -terms, then is a -term.
The set is endowed with a natural -algebra structure, and this algebra is called the free -algebra over . It satisfies the following universality: for each -algebra , a map uniquely extends to a -homomorphism . We also denote by .
- •
Given a set , a -equation over is a formula where .
We say that a -algebra satisfies a -equation over (denoted by ) if holds for any map .
For a set of -equations, we say if satisfies all equations in .
- •
A class of -algebras is a variety if there is a set of equations such that \mathcal{K}=\left\{\,A\colon\text{a \Sigma-algebra}\mathrel{}\middle|\mathrel{}A\models E\,\right\} holds.
If the signature is obvious from the context, we omit the prefix and just say homomorphism, equation, etc.
The following theorem is fundamental in universal algebra, and is proved by Birkhoff. It states that the property of being a variety is equivalent to a certain closure property; see e.g. [5]. Our main goal is to prove the metric version of this theorem.
Theorem 2.2** (Variety theorem [3]).**
A class of -algebras is a variety if and only if is closed under subalgebras, products and quotients.
2.2 Metric Space and Pseudometric
Now we review the notions regarding metric spaces.
Definition 2.3** (e.g. [11]).**
- •
An extended real is an element of .
- •
Given a set , an (extended) pseudometric on is a function that satisfies , and . A pseudometric is a metric if it also satisfies .
A pseudometric space (resp. metric space) is a tuple where is a set and is a pseudometric (resp. metric) on .
- •
A map between metric spaces is non-expansive if it satisfies for each .
- •
For a family of metric spaces, its product is defined by where , and is called the supremum metric.
Note that we admit infinite distances, called extended, because the category of extended metric spaces is categorically more amenable than that of ordinary metric spaces; it has coproducts and arbitrary products. Moreover a set can be regarded as a discrete metric space, where every pair of two distinct points has an infinite distance.
In this paper, we denote by . To consider a metric structure as a family of binary relations works well with various metric notions; e.g. is non-expansive if and only if implies for each and . The supremum metric of the product space is also compatible with this relational view of metric spaces; it is characterized by for all .
We adopt the supremum metric rather than other metrics (e.g. the 2-product metric) for the product of metric spaces. One reason is the compatibility with the relational view above. Another reason is that it corresponds to the product in the category of extended metric spaces and non-expansive maps.
Recall that the supremum metric does not always give rise to the product topology; the product of uncountably many metrizable spaces is not in general metrizable.
Given a pseudometric space, we can always turn it into a metric space by identifying points whose distance is zero.
Proposition 2.4** (e.g. [11]).**
Given a pseudometric on , the binary relation on defined by is an equivalence relation. Moreover defines a metric on and yields to a metric space .
Definition 2.5** (e.g. [11]).**
The equivalence relation defined in Proposition 2.4 is called the metric identification of , and is called a metric space induced by the pseudometric . We denote it by .
Technically, whenever we encounter a pseudometric space, we can regard it as a metric space by the above construction. However it does not mean that pseudometric is a totally redundant notion. Our slogan is: pseudometrics is to metric spaces what equivalence relations is to sets. Later we discuss pseudometrics that are compatible with given algebraic structures, which correspond to congruences in classical universal algebra. We utilize this notion intensively in the proof of the variety theorem.
2.3 Filter and Limit
Limits with respect to filters play an important role in the construction of ultralimits of metric spaces. Most of the results are straightforward generalizations of those for the usual limits.
Definition 2.6** (e.g. [13]).**
Let be a nonempty set. A filter on is a subset of that satisfies the following conditions:
, . 2. 2.
If and , then . 3. 3.
If and , then .
A filter is an ultrafilter if, for any , either or holds.
Example 2.7**.**
Let be a nonempty set.
- •
For , a set defined by is an ultrafilter on . It is called the principal ultrafilter at .
- •
Assume is infinite. The set of cofinite (i.e. its complement is finite) subsets of is a filter on . It is called the cofinite filter on . A filter is free if it contains the cofinite filter.
Lemma 2.8** (e.g. [13]).**
**
For a filter on and , the family is a filter on . If is an ultrafilter, then is an ultrafilter. 2. 2.
Let be an ultrafilter on and . If holds, then either or holds.
Definition 2.9**.**
Let be a filter on . For an -indexed family of extended reals, we define and by
[TABLE]
When , we write .
Example 2.10**.**
- •
For a set and , we have .
- •
For the cofinite filter on , we have and . Thus the limit with respect to a filter is the generalization of the usual limit.
The following results on filters and limits are all elementary.
Lemma 2.11**.**
Let and be a filter on where . For a family of extended reals, and .
Proof.
Obvious from the definition of limit infimum and supremum. ∎
Lemma 2.12**.**
Let be a filter on and be families of reals. Then we have:
[TABLE]
Proof.
For , there exist such that
[TABLE]
Since , we have
[TABLE]
Then letting completes the proof. ∎
Lemma 2.13**.**
Let be a filter on , and be a family of extended reals. Then if and only if for any .
Proposition 2.14**.**
Let be a filter on , be a continuous function and be families of real numbers. If for each , then .
Proof.
Fix . Since is continuous, there exists such that for any with , we have . Let and . By Lemma 2.13 we have , and since holds, we also have . Again by Lemma 2.13, we conclude , which completes the proof. ∎
Proposition 2.15**.**
Let be a free filter on , and be a sequence of real numbers. If , then
[TABLE]
Proof.
Since contains the cofinite filter, by Lemma 2.11,
[TABLE]
∎
Proposition 2.16**.**
Given an ultrafilter on and a family of real numbers , then exists, i.e., and coincide.
Proof.
First we show that holds. Let . By the nonemptiness of , we have . Since this inequality holds for any and , we have .
Now we show the equality. (1) Consider , i.e, for some . Let be a division of the interval to intervals whose lengths are smaller than . We define by . Since and is an ultrafilter, there exists such that , and by the construction of , holds. Thus we conclude . (2) Consider . For , we have the division for and . Since , we have and then . Therefore we have and this inequality holds for any . (3) is dual. ∎
2.4 Ultralimit of Metric Spaces
Ultralimit of metric spaces is introduced in [15]. It is a metric variant of ultraproduct of first order structures, and in some sense it is considered as the limit (in the topological sense) of metric spaces.
Lemma 2.17**.**
Let be a filter on . For a family of metric spaces, the function defined by
[TABLE]
is a pseudometric.
Proof.
Let , and be sequences of points where . First, by taking , we have . Next obviously follows from the symmetricity of the definition. Finally, for the triangle inequality:
[TABLE]
∎
Definition 2.18**.**
Let be a filter on . For a family of metric spaces, the reduced limit of by is a metric space where and . It is called ultralimit [15] when is an ultrafilter.
The pointwise limit of metrics can be viewed as an example of ultralimit.
Proposition 2.19**.**
Let be a free filter on . Let be a set, and and be metrics on . If , then is isometric to a subspace of by .
Proof.
For , we have
[TABLE]
Therefore is an embedding. ∎
At first sight, ultralimit appears to be just a technical generalization of classical ultraproduct. However it can be understood from a more topological (or metric) point of view for compact spaces. First we review the Hausdorff distance.
Definition 2.20** (e.g. [8]).**
Let be a metric space. For and , we define and as follows.
[TABLE]
This construction defines a metric on the set of closed subsets of , which is called the Hausdorff metric.
The Hausdorff metric gives a way to measure a distance between subsets of a fixed metric space. Using this metric, we can define a distance between metric spaces by embedding.
Definition 2.21** ([8]).**
For compact metric spaces and , the Gromov-Hausdorff distance is defined to be the infimum of where is a metric space and and are embeddings. This defines a metric on the set of (isometric classes of) compact metric spaces, which is called the Gromov-Hausdorff metric.
The ultralimit of compact metric spaces is indeed a generalization of the limit in the Gromov-Hausdorff metric.
Proposition 2.22** ([15]).**
Let and be compact metric spaces and be a free ultrafilter on . If converges to in the Gromov-Hausdorff metric, then is isometric to . ∎
Remark 2.23**.**
The converse of Proposition 2.22 does not hold. Take two distinct metric spaces and , and consider the sequence . The ultralimit always exists but this sequence does not have a limit with respect to the Gromov-Hausdorff metric.
The ultralimit construction preserves some metric and topological properties of metric spaces; see [20, 15] for more details and examples.
Proposition 2.24**.**
Let be a filter on and be a family of metric spaces. If each is compact, then is also compact.
Proof.
We know that is compact by Tychonoff’s theorem. The canonical surjection is non-expansive, then it is also continuous. Therefore its image is also compact. ∎
Proposition 2.25** (e.g. [22]).**
Let be an ultrafilter on and be a family of metric spaces. If each is complete, then is also complete.
Proof.
Let be a sequence in where , and assume holds for each . We show converges. Let be the set defined by:
[TABLE]
Given , define as follows: if for some , and otherwise . We use the completeness of here. Then holds for each , which concludes . ∎
In fact, the ultraproduct of a countable family of metric spaces is automatically complete, even if each metric space is not complete.
Proposition 2.26** ([4]).**
Let be a free ultrafilter on and be a family of (not necessarily complete) metric spaces. Then is complete.
Proof.
Define as in Proposition 2.25 and . We know since is free, and holds by construction. We define where satisfies , and then we have as Proposition 2.25. ∎
In the following corollary, you can find an immediate application of Proposition 2.26. We can prove the existence of the completion of a metric space.
Corollary 2.27**.**
Given a metric space , its completion exists.
Proof.
Let be some free ultrafilter on . Consider the ultrapower and a canonical map . Since is isometric and is complete, the closure of is the completion of . ∎
Note that we use the existence of real nubmers in Theorem 2.26, so Corollary 2.27 cannot entirely replace the usual construction of completions by Cauchy sequences.
3 Metric and Quantitative Algebra
In this section, we introduce the notion of metric algebra and quantitative algebra. We also introduce some elementary constructions of metric algebras such as subalgebra, product and quotient. These constructions are used in the metric version of the variety theorem.
3.1 Metric and Quantitative Algebra
By combining metric structures and -algebraic structures, we acquire the definitions of metric algebra. They go as follows.
Definition 3.1** ([21]).**
- •
A metric algebra is a tuple where is a metric space and is a -algebra. We denote the class of metric algebras by .
- •
A map between metric algebras is called a homomorphism if is -homomorphic and non-expansive.
- •
A subalgebra of a metric algebra is a subalgebra (as -algebra) equipped with the induced metric. An embedding is an isometric homomorphism.
- •
The product of metric algebras is the product (as -algebras) equipped with the supremum metric.
- •
A quotient of a metric algebra is a pair where is a metric algebra and is a surjective homomorphism.
The definition of metric algebra says nothing about the relationship between its metric structure and its algebraic structure. One natural choice is to require their operations to be non-expansive, which leads us to quantitative algebra.
Definition 3.2** ([18]).**
A metric algebra is a quantitative algebra if each is non-expansive for each , where is equipped with the supremum metric. We denote the class of quantitative algebras by .
The non-expansiveness requirement for operations is categorically natural since it says that a quantitative algebra is an algebra in the category of metric spaces and non-expansive maps in the sense of Lawvere theory. However this formulation does not allow normed vector spaces, since the scalar multiplications are not non-expansive. More extremely, even is not quantitative since . Thus basically we try to build our theory for general metric algebras.
Instead of respectively discussing the variety theorems for metric algebras and quantitative algebras, we show the variety theorem relative to a given class . In that case, is well-behaved when it is a prevariety. For example, and are prevarieties.
Definition 3.3** ([21]).**
A class of metric algebras is called a prevariety if it is closed under subalgebras and products.
In [19], Mardare et al. introduce the notion of -reflexive homomorphism for a cardinal , and give the characterization theorem of -varieties by -reflexive quotients.
Notation 3.4**.**
For a set and a cardinal , we write when is a subset whose cardinality is smaller than . For example, is a finite subset and is an at most countable subset.
Definition 3.5** ([19]).**
A surjective homomorphism between metric algebras is -reflexive if, for any subset , there exists a subset such that restricts to a bijective isometry .
We also use a variant of -reflexive homomorphism in our variety theorem, but our notion is unbounded; we do not impose any size condition.
Definition 3.6**.**
A surjective homomorphism between metric algebras is reflexive if there exists a subset such that is a bijective isometry. Equivalently is reflexive if and only if there exists an embedding as metric space such that . Note that is not required to be homomorphic.
In the rest of this paper, when we say “a class of metric algebras”, we implicitly assume that is closed under isomorphisms; it is a natural assumption since we are interested in properties of metric algebras, and they must be preserved by isomorphisms between metric algebras.
3.2 Congruential Pseudometric
The notion of quotient seems to be external and difficult to deal with. For example, it is not trivial to see that the class of quotients of a metric algebra (up to isomorphism) turns out to be a small set.
In the case of classical universal algebra, there is a bijective correspondence between quotient algebras and congruences, which enables us to treat quotients internally and concretely. To extend this correspondence to the metric case, we are led to the notion of congruential pseudometric instead of the usual congruence in classical universal algebra. The idea of using pseudometrics as the metric version of congruences also appears in [19].
Definition 3.7**.**
A congruential pseudometric of a metric algebra is a pseudometric on such that holds for each and the equivalence relation is a congruence as -algebra. We think that the set of congruential pseudometrics is ordered by the reversed pointwise order: for and , we say when holds for any .
Given a congruential pseudometric , the metric space is viewed as a metric algebra by the algebra structure defined by and equipped with a canonical homomorphic projection .
We adopt the reversed pointwise order for the consistency with the classical case. In the classical case, the set of congruences are ordered by inclusion, and for two congruences on , we have a canonical surjective homomorphism . In the metric case, for the congruential pseudometrics , their metric identifications satisfy , and we have a surjective homomorphism between metric algebras.
As in classical universal algebra, we can prove the first isomorphism theorem and a bijective correspondence between quotients and congruences. The other isomorphism theorems are presented in Section 4.
Definition 3.8**.**
Given a homomorphism between metric algebras,
- •
The image of is a subalgebra of defined by .
- •
The kernel of is a congruential pseudometric on that is defined by .
Proposition 3.9** (First Isomorphism Theorem).**
Let be a homomorphism between metric algebras, and be a congruence on . If , there exists a unique homomorphism such that for all . Moreover if , then is an isometry and the induced map is an isomorphism.
Proof.
First we show is well-defined. Assume , i.e., . Since , we have hence . Next we show is non-expansive; for , we have . In the case , we also have and then . ∎
Corollary 3.10**.**
For a metric algebra , quotients of bijectively correspond with congruences on by and . ∎
Proposition 3.11**.**
For a metric algebra and a congruence on , there is a lattice isomorphism between and .
Proof.
Given , we define a pseudometric on by . It is well-defined: if , then we have by . Therefore by the triangle inequality. Conversely, given , we have a congruence on by pulling back along the canonical projection .
It is easy to see that they are inverse and order-preserving. ∎
3.3 Ultraproduct of Metric Algebras
As in classical first order logic, we want to define the reduced product and the ultraproduct of a family of metric algebras. However there is a difficulty; the pseudometric defined in Definition 2.18 is not necessarily a congruential pseudometric, i.e., the relation is not preserved by operations. For this reason, we think of ultraproduct as a partial operation, following [21].
Definition 3.12** ([21]).**
Let be a filter on a set . For a family of metric algebras, the reduced product of by exists when the pseudometric on is congruential. When it exists, it is defined by . We denote the equivalence class of by .
If is an ultrafilter, it is called an ultraproduct. Moreover when for each , it is called an ultrapower of .
We say that a class of metric algebras is closed under reduced products if, for any nonempty set , any filter on , and any family of metric algebras in , the reduced product of by exists and belongs to . We define the closedness under ultraproducts in the same way. Note that we require the existence.
We have no general method to judge whether the ultraproduct exists or not, but there is a convenient sufficient condition.
Proposition 3.13** ([21]).**
In Definition 3.12, the pseudometric is congruential if each -operation is uniformly equicontinuous: for any and , there is such that for any and with , we have (Here we define ).
In particular, when for all and each is uniformly continuous, then the ultrapower of by exists.
Corollary 3.14**.**
The reduced product of exists in the following cases.
- •
When is a family of quantitative algebras.
- •
When is a family of normed vector spaces.
As in the case of metric spaces in Corollary 2.27, we can construct the completion of a metric algebra via ultraproduct.
Proposition 3.15** ([21]).**
If a class of metric algebras is closed under ultraproducts and subalgebras, then is also closed under completions.
Proof.
The same construction as Corollary 2.27 works. Note that the ultrapower of exists since we assume so. ∎
We can think, in some sense, that ultraproduct defines a “topology” on the class of metric algebras222If we appropriately restrict the size, this construction gives rise to a topological space., as the Gromov-Hausdorff metric defines a metric on the set of compact metric spaces.
Definition 3.16**.**
A class of metric algebras is called continuous if it is closed under taking ultraproducts.
Proposition 3.17**.**
If , and are continuous classes of metric algebras, then and are also continuous.
Proof.
The continuity of is obvious.
Let be a family of metric algebras where , and be an ultrafilter on . Let us define and by . Since and is an ultrafilter, either or holds; we can assume without loss of generality. Then . ∎
In the light of Proposition 3.17, it might be more natural to adopt the adjective closed rather than continuous. However the use of closed seems confusing since we also use it for the closedness under algebraic operations, therefore we prefer the word continuous. As we will see in Section 5, this terminology is consistent with continuous quasivariety defined in [16].
3.4 Closure Operator
It is sometimes convenient to view a construction of metric algebras as an operator on classes of metric algebras. See [7] for the classical case, and [19] for the quantitative case.
Definition 3.18** (cf. [19]).**
We define the class operators , , , and as follows.
[TABLE]
For class operators and , we denote their composition by , and write when holds for any class .
Proposition 3.19** (cf. [19]).**
**
- •
* and .*
- •
* and .*
- •
* and .*
Proof.
The proof is almost analogous to the classical case [7]; we only give a proof for . Let be a class of metric algebras. Assume and , that is, there exists a reflexive homomorphism and is a subalgebra. Let be a metric embedding such that and let us define . Then is a subalgebra of and restricts to a map . Therefore is a reflexive quotient of , thus . ∎
4 Congruence Lattice on Metric Algebras
Congruence not only gives a concrete description of quotient but is a fundamental tool in universal algebra. We can characterize various constructions of -algebra by congruence, and use the congruence theory in the proof of the variety theorem.
As we saw in the previous section, the notion of congruence is generalized to congruential pseudometric in the theory of metric algebra. In this section, we give the metric counterpart of the congruence theory in classical universal algebra.
4.1 Isomorphism Theorem
We showed the metric version of the first isomorphism theorem in Proposition 3.9. In this section we prove the rest of the isomorphism theorems.
Definition 4.1**.**
Let be a metric algebra and be a congruential pseudometric on .
- •
For a subalgebra of , the restriction of to is defined by the usual restriction of pseudometric, which we denote by .
- •
For a subset , we define .
Theorem 4.2**.**
In the situation above, if is a subalgebra of , so is .
Proof.
Let be an -ary operation in . Suppose . By the definition of , there exists such that for . Since the relation is preserved by , we also have . Since is a subalgebra, we have and then we conclude . ∎
Theorem 4.3** (Second and Third Isomorphism Theorem).**
**
Given a metric algebra , a subalgebra of and a congruence on , we have a canonical isomorphism . 2. 2.
Given a metric algebra and congruences , on with , we have a canonical isomorphism .
Proof.
(1) Let be an inclusion map. Since is a restriction of , we have for each . Then induces an embedding . It is surjective; for , there exists such that by the definition of , therefore .
(2) Let be the natural projection. It is easy to see that induces an isomorphism as (1). ∎
4.2 Congruence Lattice
In classical universal algebra, it is sometimes convenient to consider the poset of congruences rather than a congruence (see e.g. [5]).
In this section, we show that the poset of congruential pseudometrics is a complete lattice as in the classical case. Thus we can take arbitrary join and meet of congruential pseudometrics.
Definition 4.4**.**
Let be a class of metric algebras. A congruence on is -congruential if belongs to . We denote by the set of congruences on , and by the set of -congruential pseudometrics on .
Definition 4.5** ([21]).**
Let be a family of metric algebras.
A subdirect product of is a subalgebra of the product where each projection map is surjective.
A homomorphism between metric algebras is a subdirect embedding if is an embedding and is a subdirect product of , that is, each component is surjective.
Lemma 4.6**.**
Let be a metric algebra, be a family of congruences on and be the product of their projections. Then its kernel is presented by for . Moreover, the induced map is a subdirect embedding.
Proof.
Since is endowed with the supremum metric, then we have . The rest of the theorem follows from Proposition 3.9. ∎
Corollary 4.7**.**
If is a family of congruences on , then is also a congruence on . If is closed under subdirect products and each is -congruential, then is also -congruential.
Therefore is a complete lattice, and if is closed under subdirect products, is also a complete lattice. We denote the meet and join of in by and respectively. Recall that we adopt the reversed pointwise order for congruences, so Corollary 4.7 means that the meet of congruences in and is their pointwise supremum.
In general, it is difficult to give a concrete description of the join of congruences, but it can be done for some cases. For example, the assumption of the following theorem is satisfied if is a quantitative algebra, or if is a normed vector space.
Theorem 4.8**.**
Let be congruences on , and assume the following condition: for each , there exists a positive real number such that for any and we have . Then we have:
[TABLE]
Moreover holds for .
Proof.
Let and be the right hand side.
() Since for all , we have:
[TABLE]
Taking the infimum, we have
() Since for each and , it is sufficient to show that is congruential. It is easy to see that is a pseudometric, so we only have to show that each preserves the metric identification . We only prove the case for the simplicity; the other cases are very similar.
Suppose , that is, for , there exists and such that . Since , we also have . Therefore by letting , which completes the proof. ∎
Corollary 4.9**.**
If is -congruential for , then is -congruential.
4.3 Permutable Congruences
In the classical case, products are characterized by permutable congruences; this generalizes the characterization theorem of product of groups via normal subgroups, and that of product of commutative rings by ideals (see [5]).
In this section, we prove the metric version of this characterization theorem; in our formulation, completeness is crucial to prove the theorem.
Definition 4.10**.**
Let be a metric algebra. For congruences and on , a function is defined by
[TABLE]
The congruences and are permutable if holds.
Lemma 4.11**.**
Let be a metric algebra and , be congruences on . Then the following propositions hold:
* for each .* 2. 2.
* for each .* 3. 3.
.
Proof.
(1) For , we have . The case is exactly the same.
(2) It directly follows from (1) and .
(3) Let . For any , we have . Taking the infimum over , we have . ∎
Theorem 4.12**.**
For congruences and , the followings are equivalent:
, i.e., they are permutable. 2. 2.
. 3. 3.
.
Proof.
By (1) and (3) of Lemma 4.11, we only have to show is a congruence. By (2) of Lemma 4.11, we have . For , we have , and by the permutability, it is equal to . It remains to prove the triangle inequality. For ,
[TABLE]
by definition. Let us fix . Since , there exists some such that . Then
[TABLE]
Letting , we have . By taking the infimum over and , the proof is complete.
By (3) of Lemma 4.11, we have .
It suffices to show . For , we have , which concludes the proof. ∎
Lemma 4.13**.**
Let be a metric algebra and be congruences on satisfying for . Then and .
In particular, if and are permutable, and are also permutable.
Proof.
For any ,
[TABLE]
Therefore holds. The equation easily follows from the definition of the quotient of congruences. ∎
Theorem 4.14**.**
Let be a complete metric algebra and , be congruences on . The canonical homomorphism is isomorphic if the following conditions hold:
. 2. 2.
. 3. 3.
* and are permutable.*
Proof.
For , we have , so is isometric. We show that is surjective. Suppose . Since , there exists a sequence in such that for each . Since for and , we also have by . Therefore is a Cauchy sequence in and has a convergent point . Since (as ), we conclude , that is, . ∎
By inductively applying Theorem 4.14, we acquire a slightly generalized version of the theorem for the arbitrary finite cases.
Corollary 4.15**.**
Let be a complete metric algebra and be a family of congruences on . The canonical homomorphism is isomorphic if the following conditions hold:
. 2. 2.
* for each .* 3. 3.
* and are permutable for each .*
Proof.
The proof is by induction on . The case is obviously valid. Let us suppose that the proposition holds for ; then we prove it for . Assume is a family of congruences satisfying the conditions. Let and . Since , and and are permutable, then is canonically isomorphic to . The family of congruences on satisfies the assumption of the proposition, therefore is isomorphic to by the induction hypothesis. ∎
Remark 4.16**.**
The completeness of is essential. Let . Consider with the supremum metric and congruences for . These congruences satisfy ; let and in . For , take and then we have . Letting , we get . Similarly we have . However and is not isometric to .
5 Syntax and Logic
So far we have explained the model theoretic aspect of metric algebras. In this section, we give the syntax to describe properties of metric algebras, and prove some basic theorems such as a weak form of the compactness theorem.
5.1 Syntax for Metric Algebra
We use indexed equations for atomic formulas in the theory of metric algebras, differently from usual equations in the classical case.
Definition 5.1** ([21, 18]).**
Let be a variable set.
- •
A metric equation (also called an atomic inequality [21]) over is a formula of the form where and .
A metric implication over is a formula of the form where and are metric equations over . We will identify a metric equation with a metric implication where .
A basic quantitative inference over is a metric implication where and are restricted to variables. A -basic quantitative inference is its generalization that allows infinitely many assumptions smaller than .
- •
Given a metric algebra , a metric equation over , and a map , we say satisfies under , denoted by , if we have . We simply say satisfies , denoted by , when holds for any . These notions are similarly defined for metric implications.
- •
Let be a class of metric algebras and be a set of metric implications. We write if holds for any . We also define and similarly.
- •
Let be a set of metric equations over . We write if, for and a map with , we have .
- •
Given a class of metric algebras and a set of metric implications, we define the class by , called the class defined in by . When , we simply call it the class defined by
Given a pseudometric on a set , we identify with a set of metric equations over defined by . This view is consistent with the reversed pointwise order on : we have if and only if holds.
5.2 Presentation and Free Algebra
As in classical universal algebra, a metric algebra can be presented by generators and relations in a given class . As the special case, we give the construction of -free algebras.
Definition 5.2**.**
A presentation of a metric algebra is a pair where is a set and is a set of metric equations over .
Let be a class of metric algebras. Given a presentation , the metric algebra defined by in is a metric algebra where is the smallest -congruential pseudometric that contains . It is equipped with a map defined by , which is called its unit.
We write when , which is called the -free algebra over , and write for a metric space when , which is called the -free algebra over .
Lemma 5.3**.**
Let be a metric equation. In Definition 5.2:
* holds.* 2. 2.
For any and a map where holds, there exists a unique homomorphism such that . 3. 3.
* if and only if .* 4. 4.
If is a prevariety, then belongs to .
Proof.
(1) It is obvious from and .
(2) Let us consider . Since holds by assumption and is -congruential, we have . By Proposition 3.9, there exists a unique homomorphism such that .
(3) (if) Assume . Since holds by (1), then we conclude . (only if) Let and be a map with . By (2), we have a homomorphism such that . Therefore .
(4) Directly follows from Corollary 4.7. ∎
5.3 Weak Compactness Theorem
We do not have the full version of the compactness theorem. There are two restrictions: we restrict ourselves to metric equations, and a finite subset of the assumptions is chosen only for each perturbation of the conclusion by .
Theorem 5.4** (Weak compactness).**
Let be a continuous class of metric algebras and be a set of metric equations over . If , then for any there exists a finite subset such that .
Proof.
We prove the theorem by contradiction. Suppose that there exists such that, for any finite subset , we have and a map where and hold.
Let be the set of finite subsets of . We define for each and . Since satisfies the finite intersection property, there exists an ultrafilter containing . Let be the ultraproduct of metric algebras, and be a map defined by . Then and , hence , which contradicts and the assumption. ∎
Corollary 5.5**.**
Let be a continuous class of metric algebras, be a presentation and be the unit. Then holds if and only if for any there is a finite subset such that .
Proof.
By Lemma 5.3 (3) and Theorem 5.4. ∎
Using this weak version of the compact theorem, we can show that continuous quasivarieties in [16] (simply called quasivarieties in [21]) are expectedly quasivarieties that are continuous in our terminology.
Definition 5.6** ([21]).**
Given a class of metric algebras and a metric implication , we say satisfies equicontinuously if, for any , there exists such that .
Proposition 5.7**.**
Let be a continuous class and be a metric implication. If satisfies , then satisfies equicontinuously.
Proof.
Let . We have by assumption. Given , by Theorem 5.4, there exists a finite subset such that . Since is finite, we can take the minimum that arises in . And then we have . ∎
Definition 5.8** ([16]).**
A continuous family of metric implications is a set of metric implications that satisfies the following conditions:
- •
For each , the formula belongs to .
- •
If belongs to and , then there exists such that also belongs to .
Lemma 5.9**.**
Let be a continuous family of metric implications. Then is closed under reduced products.
Proof.
Let be a filter on and be a family of metric algebras with . Let be a metric implication over that belongs to , and we show where .
Let be a family of maps, and be a map defined by . Assume for each , and let us fix . Since is a continuous family of metric implications, there exists such that belongs to . By the definition of reduced product, there exists such that, for each , we have . Since , we also have . Letting , we conclude . ∎
Proposition 5.10**.**
Let be a quasivariety. The followings are equivalent:
* is a continuous quasivariety.* 2. 2.
The set of metric implications that holds in is continuous. 3. 3.
* is defined by a continuous family of metric implications.*
Proof.
It follows from Proposition 5.7.
is defined by .
Directly follows from Lemma 5.9. ∎
5.4 Generalized Metric Inequality
In Subsection 5.3, we saw the ultraproduct construction preserves properties described by a continuous family of metric implications. We will see that some richer properties are preserved by ultraproducts.
Definition 5.11**.**
A (generalized) metric inequality over a set is a tuple of a continuous function and terms , over , denoted by .
Given a metric algebra and a map , the metric inequality holds under , if the following condition holds.
[TABLE]
Other expressions such as and are defined and interpreted naturally.
Theorem 5.12**.**
Let be a metric inequality, be an ultrafilter on , and be a family of metric algebras. If satisfies for any , the ultraproduct also satisfies .
Proof.
Let be a family of maps, and be a map defined by . Let us define and , and assume for each . By Proposition 2.14 and , we have . ∎
An immediate application is on the class of inner product spaces. An inner product space is equipped with the norm determined by its inner product. A classical result of functional analysis states that a norm that satisfies a certain equation comes from an inner product. Then we can apply Theorem 5.12 and prove that the class of inner product spaces is closed under ultraproducts. See [9, 17] for more examples from functional analysis and operator algebra.
Example 5.13**.**
For the signature of normed vector space,
[TABLE]
is a metric inequality, where is a shorthand for . This metric inequality characterizes the class of inner product spaces [14].
Corollary 5.14** ([17]).**
Ultraproducts of inner product spaces are inner product spaces. Moreover ultraproducts of Hilbert spaces are Hilbert spaces.
Proof.
By Theorem 5.12 and Proposition 2.25. ∎
6 Variety Theorem
Now we prove the variety theorems of metric algebras.
6.1 Basic Closure Properties
We know the following closure properties of classes defined by a certain formula.
Proposition 6.1** ([21, 19]).**
Let be a metric implication.
The class is closed under subalgebras, products. 2. 2.
If is a quantitative basic inference, then is closed under -reflexive quotients, and then closed under reflexive quotients. 3. 3.
If is a metric equation, then is closed under quotients.
Our goal is to prove the converse of this result: if a class of metric algebras is closed under some constructions, it is defined by a certain class of formulas.
6.2 Strict Variety Theorem
First we give a very simple version of metric variety theorems. As we will see, this formulation is very naive, which excludes normed vector spaces as example.
Definition 6.2**.**
A class of metric algebras is called a strict variety (also called a 1-variety in [19]) if it is defined by a set of metric equations.
The proof of the strict variety theorem is almost analogous to the classical case in [5]; we use congruential pseudometrics instead of congruences.
Theorem 6.3** ([10]).**
A class of metric algebras is a strict variety if and only if is closed under products, subalgebras and quotients.
Proof.
(only if) Directly follows from Proposition 6.1.
(if) Let be the set of metric equations that hold in . Since is trivial, we only have to show . Let be a metric algebra that satisfies , and be its underlying set. Let be the homomorphic extension of the identity map and be the canonical projection. By Lemma 5.3 we have . Since and are surjective, by Proposition 3.9, it suffices to show that for any .
Assume , that is, . By Lemma 5.3 (3), we have . Since satisfies all metric equations that hold in , we have and especially , which concludes the proof. ∎
Applying Theorem 6.3, we can prove that the class of normed vector spaces is not a variety of metric algebras for the signature of vector space.
Example 6.4**.**
For the signature , the class of normed vector spaces is a quasivariety of metric algebras [21, 16], but it is not a strict variety. Indeed consider and let be a metric algebra that has the same algebraic structure as but whose metric is defined by . The identity map is a quotient while . Therefore is not closed under quotient, hence not a strict variety.
The class of normed vector space is a prototypical example of classes of metric algebras, but Example 6.4 showed that it cannot be expressed by metric equations. To deal with such classes, we need to use more expressive formulas.
We can extend the strict variety theorem to the quantitative case. For a generality, we give the notion of variety relative to (see [7] for the classical case) and deal with the quantitative case as its particular case.
Definition 6.5**.**
A class of metric algebras is a strict variety relative to if it is defined in by a set of metric equations.
Theorem 6.6**.**
Let be a prevariety. A class of metric algebras is a strict variety relative to if and only if is closed under products, subalgebras and -quotients.
Proof.
By Proposition 3.19, is closed under quotients, subalgebras and products. Then by Theorem 6.3, there exists a set of metric equations such that . Thus by assumption , which concludes the proof. ∎
Corollary 6.7** ([10]).**
A class of quantitative algebras is a strict variety relative to if and only if is closed under products, subalgebras and -quotients.
6.3 Continuous Variety Theorem
We give a characterization of classes defined by basic quantitative inferences.
Mardare et al. give a solution for this characterization problem in [19].
Theorem 6.8** ([19]).**
For a cardinal , a class of metric algebras is defined by a set of -basic quantitative inferences if and only if it is closed under subalgebras, products and -reflexive quotients.
Differently from their result, our goal is to prove the continuous version. In this case, the size condition is included in the continuity assumption.
Theorem 6.9** (Continuous variety theorem).**
A class of metric algebras is defined by a continuous family of basic quantitative inferences if and only if it is closed under subalgebras, products, reflexive quotients and ultraproducts.
Proof.
(only if) Directly follows from Proposition 6.1 and Lemma 5.9.
(if) Let be the set of basic quantitative inferences that hold in . We show . Let be a metric algebra that satisfies , and be its underlying metric space. Let be the homomorphic extension of the identity map and be the canonical projection. It suffices to show that (1) for any , and (2) for any .
(1) Assume , that is, . By Lemma 5.3 (3), we have , where . Given , by Theorem 5.4 there exists a finite subset such that . Since satisfies all quantitative basic inferences that holds in , we have . Since by the definition of , we have , that is, . Letting , we conclude .
(2) We only have to show that . Let us assume . Since is an identity on , we have . This means and then .
Therefore the class is defined by , hence a quasivariety. By Proposition 5.10, the family is moreover continuous, which concludes the proof. ∎
Corollary 6.10**.**
A class of quantitative algebras is defined by a continuous family of basic quantitative inferences in if and only if is closed under products, subalgebras, ultraproducts and reflexive -quotients.
Proof.
Exactly the same as Corollary 6.7. ∎
7 Conclusions and Future Work
We developed a general theory of metric and quantitative algebra from the viewpoint of universal algebra. We investigated the lattices of congruential pseudometrics on a metric algebra, and proved the metric variants of the variety theorem by using their structure.
Our work is different from [19] because we aim at continuous classes of metric and quantitative algebras, following the work by Weaver [21] and Khudyakov [16]. This design choice seems to be natural since the continuity of classes of metric algebras can be understood as a sort of closedness in the topological sense, hence a sort of robustness. Moreover our result is mainly on general metric algebras rather than quantitative algebras, which enables our theory to include examples from functional analysis and operator algebra.
We did not pursue the connection to the category theoretic treatments of universal algebra: Lawvere theory, monad and orthogonality.
The theory of quantitative algebra can be viewed as a special case of enriched Lawvere theory. More specifically, it is the discrete Lawvere theory [12] enriched by the category of metric spaces. Here the adjective discrete means that we only consider operations whose arities are natural numbers, while in enriched Lawvere theory an operation whose arity is a finite metric space is allowed. It would be possible to give a syntax and prove the variety theorem for that situation.
The use of monads and Eilenberg-Moore categories is another way to deal with equational theories in category theory. Mardare et al. showed that a class of quantitative algebras defined by basic quantitative inferences induce a monad on the category of metric spaces. The next problem is whether the class of quantitative algebras is monadic.
It would also be interesting to check whether our work is an instance of the categorical variety theorem formulated by Adámek et al. in [1]. Our theory seems to implicitly use the orthogonal factorization system on the category of metric algebras that consists of embeddings and quotients. But there is another factorization system: closed embeddings and dense maps. The natural question is what kind of variety theorems is acquired if we use this factorization system instead of embeddings and quotients.
The metric structures on free algebras are also yet to be investigated. For example, we could investigate whether the free algebra on a metric space is complete, or compact for a given axiom of metric algebras.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Jir̆í Adámek, Horst Herrlich, and George Strecker. Abstract and Concrete Categories: The Joy of Cats . Wiley Interscience, 1990.
- 2[2] Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, and Radu Mardare. Complete axiomatization for the bisimilarity distance on markov chains. In Proc. 27th CONCUR 2016 , pages 21:1–21:14, 2016.
- 3[3] Garrett Birkhoff. On the structure of abstract algebras. Mathematical Proceedings of the Cambridge Philosophical Society , 31(4):433–454, Oct 1935.
- 4[4] Martin R. Bridson and André Haefliger. Metric Spaces of Non-Positive Curvature . Springer Berlin Heidelberg, 1999.
- 5[5] Stanley Burris and H.P. Sankappanavar. A Course in Universal Algebra . Graduate texts in mathematics. Springer-Verlag, 1981.
- 6[6] Zoé Chatzidakis, Dugald Macpherson, Anand Pillay, and Alex Editors Wilkie, editors. Model Theory with Applications to Algebra and Analysis , volume 2. Cambridge University Press, 2008.
- 7[7] Viktor A. Gorbunov. Algebraic Theory of Quasivarieties . Siberian School of Algebra and Logic. Plenum Publishing, 1998.
- 8[8] Mikhail Gromov. Metric Structures for Riemannian and Non-Riemannian Spaces . Birkhäuser Boston, 1999.
