
TL;DR
This paper establishes that the strong Weihrauch degrees form a non-distributive lattice by introducing a join operation, contrasting with the distributive structure of Weihrauch degrees, and answers an open question in the field.
Contribution
It proves that the strong Weihrauch degrees form a lattice with a join operation, and shows this lattice is not distributive, resolving an open problem.
Findings
Strong Weihrauch degrees form a lattice with a join operation.
The lattice of strong Weihrauch degrees is not distributive.
Strong and Weihrauch degrees are not isomorphic structures.
Abstract
The Weihrauch degrees and strong Weihrauch degrees are partially ordered structures representing degrees of unsolvability of various mathematical problems. Their study has been widely applied in computable analysis, complexity theory, and more recently, also in computable combinatorics. We answer an open question about the algebraic structure of the strong Weihrauch degrees, by exhibiting a join operation that turns these degrees into a lattice. Previously, the strong Weihrauch degrees were only known to form a lower semi-lattice. We then show that unlike the Weihrauch degrees, which are known to form a distributive lattice, the lattice of strong Weihrauch degrees is not distributive. Therefore, the two structures are not isomorphic.
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.
Joins in the strong Weihrauch degrees
Damir D. Dzhafarov
Department of Mathematics
University of Connecticut
341 Mansfield Road
Storrs, Connecticut 06269-1009 U.S.A.
Abstract.
The Weihrauch degrees and strong Weihrauch degrees are partially ordered structures representing degrees of unsolvability of various mathematical problems. Their study has been widely applied in computable analysis, complexity theory, and more recently, also in computable combinatorics. We answer an open question about the algebraic structure of the strong Weihrauch degrees, by exhibiting a join operation that turns these degrees into a lattice. Previously, the strong Weihrauch degrees were only known to form a lower semi-lattice. We then show that unlike the Weihrauch degrees, which are known to form a distributive lattice, the lattice of strong Weihrauch degrees is not distributive. Therefore, the two structures are not isomorphic.
The author was supported in part by NSF Grant DMS-1400267. He thanks Vasco Brattka for numerous helpful comments and suggestions during the preparation of this paper, and in particular, for noticing an error in an earlier version of Proposition 3.5.
1. Introduction
Weihrauch reducibility provides a framework for measuring the relative complexity of solving certain mathematical problems, and in particular, of telling when the task of solving one mathematical problem can be reduced to the task of solving another. The program of classifying mathematical problems using Weihrauch reducibility was initiated by Brattka and Gherarrdi [4] and Gherardi and Marcone [10]. Weihrauch reducibility itself goes back to Weihrauch [19], and has been widely deployed in computable analysis. More recently, the concept was independently re-discovered by Dorais, Dzhafarov, Hirst, Mileti, and Shafer [6] in the context of computable combinatorics. The classification program can be seen as a foundational one, in the spirit of Friedman and Simpson’s program of reverse mathematics (cf. Simpson [16]). In many ways, Weihrauch reducibility leads to a refinement and extension of reverse mathematics; see Hirschfeldt [12, Section 2.2] or Hirschfeldt and Jockusch [13, Section 1] for detailed discussions.
Intuitively, a mathematical problem consists of a collection of instances, and for each instance, a collection of solutions to this instance (in that problem). Given math problems and , we can then informally define to be strongly Weihrauch reducible to if there is an effective way to convert every instance of into an instance of , and an effective way to convert every solution to in into a solution to in . This method of reducing the task of solving to that of solving is natural, and shows up frequently throughout mathematics (see, e.g., [6], Section 1, for some specific examples). It is, however, somewhat restrictive in that the backward conversion is not allowed access to the original instance of . For this reason, we also define to be Weihrauch reducible to if there is an effective way to convert every instance of into an instance of , and an effective way to convert , together with any solution to in , into a solution to in . Both types of reductions have been examined at length in the literature, with the past few years in particular seeing a surge of interest. An updated bibliography of publications contributing to this study is maintained by Brattka [1]. (See also Dzhafarov [7, 8], and Remark 4.6 below, for a non-uniform version of Weihrauch reducibility; and see Pauly [15] for a version in which computable transformations are replaced by continuous ones.)
In this paper, we focus on the algebraic structure of these reducibilities. For Weihrauch reducibility, this has been studied extensively, e.g., by Brattka and Gherardi [3], Brattka and Pauly [5], Higuchi and Pauly [11], and others. We focus here on strong Weihrauch reducibility. It is known that the Weihrauch degrees (i.e., the equivalence classes under Weihrauch reducibility) form a lattice under certain natural operations (see Theorem 2.6 below). We prove the corresponding result for the strong Weihrauch degrees, thereby answering an open question (see, e.g., Brattka [2], or Hölzl and Shafer [14], Section 2). Further, we show that as in the case of the Weihrauch lattice, every countable distributive lattice can be embedded into the strong Weihrauch lattice. However, unlike in the Weihrauch case, we show that the strong Weihrauch lattice is itself not distributive. Hence, in particular, the Weihrauch degrees and strong Weihrauch degrees are not isomorphic structures.
The paper is organized as follows. In Section 2, we give some general background about Weihrauch reducibility, including precise definitions of the Weihrauch and strong Weihrauch degrees. In Section 3, we define the supremum (join) operation on the strong Weihrauch degrees, and prove our main result that this turns the strong Weihrauch degrees into a lattice. Finally, in Section 4, we prove the non-distributivity of this lattice, and consider lattice embeddings.
2. Background
Our notation and terminology is mostly standard, following, e.g., Soare [17] and Weihrauch [20]. Throughout, we identify subsets of with their characteristic functions, and so regard them as elements of . For convenience, if and , we will frequently write and instead of and , respectively, and refer to as being or not being an element of . We let denote the standard computable pairing function on , and also the effective join on (in place of the more commonly used symbol ). For , we write and for and , respectively. For a finite binary string and a bit , we write for the element with for all and for all . In particular, we write and for all the all-[math] and all- infinite binary sequence, respectively.
For Turing functionals, we follow the following conventions.
Convention 2.1**.**
Let be a Turing functional and .
- •
If for some then also for all .
- •
For each there is at most one for which is least such that .
Further, we regard all Turing functionals as being -valued, so that if is total for some and , then is an element of .
We use here merely as a convenience, but will not rely on any of its specific properties as a topological space. Hence, everything in our treatment would go through equally well for Baire space in place of Cantor space.
We shall consider functions below which can take on multiple values, called multifunctions. Formally, a multifunction from a set to a set , denoted , represents that the value of for each is a subset of . If is a function or multifunction with domain a (possibly proper) subset of , we denote this by or , respectively. In this case, we refer to as a partial function/multifunction (on ), and we denote its domain by .
A multifunction thus formalizes the concept of a mathematical problem, as was informally discussed in the introduction. The elements of are regarded as the instances of this problem, and for each , the elements of are regarded as the solutions to the instance (in the problem ).
Unlike in the introduction, there are no restrictions above that the domains and co-domains of problems be subsets of the natural numbers, which was necessary in order to define computations from instances and solutions. The following definition will allow us to develop computability theory on a broader class of spaces for when we define Weihrauch reducibility below.
Definition 2.2**.**
A representation of a set is a partial surjective function . The pair is a represented space.
Given represented spaces and , we can define by for each and , and by for all . These provided representations for and , respectively, which will play an important role in our work below.
Definition 2.3**.**
Let be a partial multifunction on represented spaces. A function is realizer of , in symbols , if for all .
Definition 2.4**.**
Let and be partial multifunctions on represented spaces.
- •
is Weihrauch reducible to , in symbols , if there are Turing functionals such that for all .
- •
is strongly Weihrauch reducible to , in symbols , if there are Turing functionals such that for all .
If the above applies, we say that or via and .
The notion above formalizes the intuitive one of reducing one mathematical problem to another, as discussed in the introduction. We give an alternative definition, due to Dorais et al. [6, Definition 1.5], in Section 4.
It is customary to refer to equivalence classes of under and as the Weihrauch degrees and strong Weihrauch degrees, respectively. Formally, of course, these objects are not sets but proper classes. Thus, we implicitly identify each partial multifunction with , whereby the (strong) Weihrauch degrees can be regarded just as equivalence classes of multifunctions on Cantor space.
The following definition gives two important operations on multifunctions.
Definition 2.5**.**
Let and be partial multifunctions on represented spaces.
- •
is defined by
[TABLE]
for all , and
[TABLE]
for all .
- •
is defined by
[TABLE]
for all and .
To save on notation, given a degree structure defined as the set of equivalence classes under some reducibility, we identify degree-invariant operations on the elements of the underlying space with operations on the degrees themselves. It is easy to see that both and are invariant under , and we have the following result establishing their main properties.
Theorem 2.6** (Pauly [15], Theorem 4.22; Brattka and Gherardi [4], Theorem 3.14).**
The Weihrauch degrees form a bounded distributive lattice under , with as supremum and as infimum.
The proof of the theorem also shows that gives the infimum operation for the strong Weihrauch degrees, and hence that these form a lower semi-lattice. The precise definitions of the top and bottom elements in Weihrauch and strong Weihrauch degrees are somewhat complicated, but as these are not needed for our work here, we refer the reader to [5, Sections 2.1] for details.
3. Main construction
We begin in this section with a series of computability-theoretic definitions, leading up to the definition of the supremum operation in the strong Weihrauch degrees.
Definition 3.1**.**
A monotone approximation111Monotone approximations were also considered, in an unrelated context, by Dzhafarov and Igusa [9], where they were called partial oracles. is an element with the following properties:
- •
every element of is of the form , where and ;
- •
for all and , if then and ;
- •
for all and , if and then .
The monotone approximation is total if for every there is an and such that .
An important class of monotone approximations for our purposes come from Turing computations.
Definition 3.2**.**
Given a Turing functional and , let consist of all the where , , and is least such that .
Convention 2.1 ensures that is indeed a monotone approximation, as well as the following basic facts.
Proposition 3.3**.**
For each Turing functional and each , is uniformly computable from and (an index for) . Further, if is total (i.e., is an element of ) then is total as a monotone approximation.
Proof.
Immediate. ∎
Definition 3.4**.**
Let be the partial function with domain the set of all total monotone approximations , such that for any such and all and we have if and only if for some .
Proposition 3.5**.**
- (1)
The partial function is a Turing functional. 2. (2)
For each Turing functional and each , if is total then .
Proof.
For part (1), fix . We can uniformly computably check, for each , whether the defining conditions of being a monotone approximation hold for all numbers less than . Now for each for which this is the case and for each , is computed by searching through until, if ever, an and are found with , in which case the output is . Thus, if is a total monotone approximation, will be defined for all , and hence will be defined as an element of . Otherwise, either fails to be a monotone approximation, or it fails to be total, and in both cases will be undefined for some . Thus, is a Turing functional with the desired domain.
For part (2), note that by Proposition 3.3, is total, so is an element of . Now by definition, for all we have that if and only if for some , if and only if . ∎
In what follows, if is any set, we use to denote a fixed element not in .
Definition 3.6**.**
Let be a represented space.
- (1)
Let . 2. (2)
Define by
[TABLE]
for all .
Clearly, is a representation of . The definition gives rise to the following operation on partial multifunctions.
Definition 3.7**.**
Let and be partial multifunctions on represented spaces. We define
[TABLE]
by
[TABLE]
for all , and
[TABLE]
for all .
It is not difficult to check that is invariant, commutative, and associative, up to strong Weihrauch equivalence. We are now ready to prove our main theorem, that the above definition gives the supremum operation on the strong Weihrauch degrees222The definition of has a product on the input side and a co-product on the output, unlike the definition of , which has a product on both sides. (In this sense, is dual to the definition of , which has a co-product on the input and a product on the output.) We learn from Vasco Brattka [personal communication] that Peter Hertling and he also attempted to construct a supremum for the strong Weihrauch degrees of this form. Unfortunately, their approach was unsuccessful because it did not consider the move from to the completed space . This points to the importance of the addition of the and elements..
Theorem 3.8**.**
Let and be partial multifunctions on represented spaces. Then is the supremum of and under .
Proof.
Fix and . We divide our proof into the following two lemmas.
Lemma 3.9**.**
* and .*
Proof.
For each , let be the map , and let be the map . Note that and are Turing functionals by Proposition 3.5. We show that via and ; a symmetric argument shows that via and .
Suppose and fix any . We must show that
[TABLE]
Since and , we have
[TABLE]
Thus, is a pair with , so in particular, . Letting , this means that and , and hence by definition,
[TABLE]
We conclude that , but since , this is what we wanted. ∎
Lemma 3.10**.**
Let be a partial multifunction on represented spaces, and suppose and . Then .
Proof.
Suppose via and , and via and . Let be the map with domain all pairs for and , and with . Let be the map . We claim that via and .
Suppose and fix any element in the domain of , which must have the form for some . Without loss of generality, assume ; a symmetric argument works if . We aim to show that
[TABLE]
Since and , this is equivalent to showing
[TABLE]
Now , so by definition. And since via and and , this implies that
[TABLE]
In particular, this means that , so by Proposition 3.3, is total, and by Proposition 3.5,
[TABLE]
It also means that , and so . Now by definition, for some , we have
[TABLE]
Combining this with (2) now gives (1). ∎
The proof of the theorem is complete. ∎
Corollary 3.11**.**
The strong Weihrauch degrees form a bounded lattice under , with as supremum and as infimum.
As noted above, the operation does not give the supremum in the strong Weihrauch degrees, so and are in general different. However, as the next proposition shows, this is no longer the case if we move from strong Weihrauch degrees to the more general setting of (non-strong) Weihrauch degrees.
Proposition 3.12**.**
Let and be partial multifunctions on represented spaces. Then .
Proof.
Since by Theorem 3.8, and is the supremum of and under , it follows that . So, we only need to show that , and in fact, we show that . Let be the identity functional, and let be defined by
[TABLE]
and
[TABLE]
for all . Fix , and any element in the domain of , which must have the form for some . We assume ; the case follows by a symmetric argument. We must show that
[TABLE]
By definition,
[TABLE]
so the above is equivalent to
[TABLE]
Since , we have
[TABLE]
Thus, it must be that for some , and hence that for some with . Thus, we have
[TABLE]
Since we have , so . We conclude that
[TABLE]
for some . Combining this with (4) gives (3). ∎
4. Distributivity
Our aim is to examine some of the lattice-theoretic properties of the strong Weihrauch degrees. Recall that a lattice is distributive if the operations of join and meet distribute over one another, i.e., if for all we have . As noted above, the Weihrauch lattice is distributive. By contrast, we will show below that the strong Weihrauch lattice is not.
We begin with the following result, showing that one half of the distributivity identity in the strong Weihrauch degrees does indeed hold under , while the other holds if we replace by .
Proposition 4.1**.**
Let , , and be partial multifunctions on represented spaces. Then we have:
- (1)
; 2. (2)
.
Proof.
For part (1), let be the map for all and all . Let be the identity functional, and let be the map given by
[TABLE]
for all , and
[TABLE]
for all . We claim that via and .
Fix any , and any element in the domain of . This must have the form for some and some in the domain of if or if , and some in the domain of . Assume ; a symmetric argument works if . We must then show that
[TABLE]
We have
[TABLE]
and
[TABLE]
Thus, it is enough to show that
[TABLE]
Now since , we have
[TABLE]
Therefore, is either for some and , or for some . In the first case, since , it must be that for some with , meaning . Consequently, and . It follows that
[TABLE]
which is what was to be shown. In the second case, if for some , it must be that for some with . We then have
[TABLE]
This completes the proof of part (1).
Part (2) can be proved similarly, but can also be observed more directly: the standard proof that actually shows . We omit the details. ∎
In the remainder of this section, we will be dealing with multifunctions on Cantor space. We regard Cantor space as a represented space under the trivial (identity) representation, which we also denote by for consistency of notation when viewing it as a representation. In this setting, we can then use the following alternative definition of Weihrauch reducibility, which will be slightly easier to work with.
Definition 4.2**.**
Let and be multifunctions.
- •
if there are Turing functionals such that for every , and for every .
- •
if there are Turing functionals such that for every , and for every .
See [6], Appendix A, for a discussion and comparison of this approach to that in Definition 2.4, and for a proof of the equivalence of the two.
The following observation will be useful.
Lemma 4.3**.**
Let and be given. Let be the multifunction with domain consisting of all pairs for , and for , and satisfying the following:
- •
* consists of all pairs with , where is a monotone approximation with and ;*
- •
* consists of all pairs with , where is a monotone approximation with and .*
Then .
Proof.
It is clear that , hence . We thus only need to show that , and we claim that this is so via the identity map, , in both directions. To see this, fix , and any element in the domain of . Without loss of generality, assume this has the form for some ; a symmetric argument works if it has the form for . We must show that
[TABLE]
Since , we have that
[TABLE]
Thus, for some and . In particular, , so by definition, for some with . In other words, , whence we conclude that , as desired. ∎
We now come to our main result in this section, in which we will demonstrate that the inequality of Proposition 4.1 cannot in general be reversed.
Theorem 4.4**.**
The lattice of strong Weihrauch degrees is not distributive.
Proof.
Choose with the following properties:
- •
and ;
- •
and .
Define to be , , and , respectively. We claim that
[TABLE]
which gives the theorem.
Seeking a contradiction, suppose and actually witness the reduction above. For each , we must then have that
[TABLE]
For otherwise there would be with and
[TABLE]
whence we would have , contrary to our assumption.
Now fix any monotone approximation such that and and . By Lemma 4.3, is a solution to in . Hence, must be a solution to in , and hence be equal either to , or else, again by the lemma, to for some monotone approximation with and . In the latter case, we would have , contradicting our choice of and . So it must be the first case that applies.
Let be the use of computing that the first coordinate of is . Fix a monotone approximation with and and and . Let , noting that is computable. Then is a solution to in , and must therefore be a solution to in . But the first coordinate of agrees with , so we must have that . We then have that , contradicting our choice of and . ∎
Corollary 4.5**.**
The strong Weihrauch lattice is not isomorphic to the Weihrauch lattice.
Remark 4.6**.**
The above proof does not go through if is replaced by the related strong computable reducibility (). Along with computable reducibility (), these form non-uniform variants of strong Weihrauch and Weihrauch reducibility, respectively. (See, e.g., [8], Definition 1.1, for the precise definitions.) The corresponding algebraic structures have not previously been studied, but it is easy to see that they form lattices under and , just as in the Weihrauch case. The distributivity of then follows from the distributivity of . For , it follows from Proposition 4.1, together with Proposition 3.12, the proof of which also shows that and are the same up to strong computable equivalence. We can conclude that the non-distributivity of the strong Weihrauch lattice is not a feature of uniformity alone, or of denying access to the original instance alone, but rather of the two properties in combination.
We finish by showing that, in spite of Theorem 4.4, the strong Weihrauch lattice is nonetheless very rich. Recall that a set is Medvedev reducible to if there is a functional such that for every . The Medvedev degrees are the equivalence classes under this reducibility. It is easy to see that these form a lattice, with serving as the join of and , and serving as the meet. Sorbi [18, Lemma 6.1] has shown that every countable distributive lattice embeds into the Medvedev lattice. It is easy to see that the Medvedev degrees embed into the Weihrauch degrees as a partial order, via the embedding sending to , but it was shown by Higuchi and Pauly [11, Corollary 5.3] that this is not a lattice embedding. However, they also established the following reverse-embedding result.
Proposition 4.7** (Higuchi and Pauly [11], Lemma 5.6).**
The Medvedev lattice reverse-embeds into the Weihrauch lattice.
The proof uses the following embedding, originally due to Brattka (see [11], Definition 5.5).
Definition 4.8**.**
Given , let be the map .
We show that the same map works to reverse-embed the Medvedev degrees into the strong Weihrauch degrees as lattices.
Proposition 4.9**.**
The Medvedev lattice reverse-embeds into the strong Weihrauch lattice.
Proof.
Given , if is a Turing functional such that for every then via and the identity. Conversely, if via and then for every . We have , so . In the other direction, we have via the identity and the constant map. Similarly, we have and hence . And via the identity map and the map . ∎
Corollary 4.10**.**
Every countable distributive lattice can be embedded into the strong Weihrauch lattice.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Vasco Brattka, Bibliography on Weihrauch complexity, website: http://cca-net.de/publications/weibib.php .
- 2[2] by same author, Measuring the Complexity of Computational Content: Weihrauch Reducibility and Reverse Analysis , Tutorial at Dagstuhl Seminar 15392, 20–25 September, 2015.
- 3[3] Vasco Brattka and Guido Gherardi, Effective choice and boundedness principles in computable analysis , Bull. Symbolic Logic 17 (2011), no. 1, 73–117. MR 2760117 (2012 c:03108)
- 4[4] by same author, Weihrauch degrees, omniscience principles and weak computability , J. Symbolic Logic 76 (2011), no. 1, 143–176. MR 2791341
- 5[5] Vasco Brattka and Arno Pauly, On the algebraic structure of weihrauch degrees , to appear.
- 6[6] François G. Dorais, Damir D. Dzhafarov, Jeffry L. Hirst, Joseph R. Mileti, and Paul Shafer, On uniform relationships between combinatorial problems , Trans. Amer. Math. Soc. 368 (2016), no. 2, 1321–1359. MR 3430365
- 7[7] Damir D. Dzhafarov, Cohesive avoidance and strong reductions , Proc. Amer. Math. Soc. 143 (2015), no. 2, 869–876. MR 3283673
- 8[8] by same author, Strong reductions between combinatorial principles , The Journal of Symbolic Logic 81 (2016), no. 4, 1405–1431.
