Problems with fixpoints of polynomials of polynomials
Pith reviewed 2026-05-16 11:42 UTC · model grok-4.3
The pith
Interpreting ζ-expressions in type 2 computable maps captures Weihrauch degrees from closed choice on two points to determinacy of infinite parity games via an answerable part operator.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
We show how to compute initial algebras, terminal coalgebras and ζ-fixpoints for fibred endofunctors represented by families of polynomial endofunctors over categories of containers. We introduce ζ-expressions as the syntax of μ-bicomplete categories extended with ζ-binders and parallel products. Interpreting certain ζ-expressions in a category of type 2 computable maps captures meaningful Weihrauch degrees ranging from closed choice on {0,1} to determinacy of infinite parity games via an answerable part operator.
What carries the argument
ζ-expressions (syntax for μ-bicomplete categories with ζ-binders and parallel products) interpreted through the answerable part operator in the category of type 2 computable maps.
Load-bearing premise
Fibred endofunctors over the fibrewise opposite of the codomain fibration can be represented by families of polynomial endofunctors and the target categories are μ-bicomplete so that the ζ-fixpoints exist and the expressions are well-defined.
What would settle it
A concrete ζ-expression whose interpretation in the category of type 2 computable maps yields a Weihrauch degree different from closed choice on {0,1} or from determinacy of infinite parity games.
read the original abstract
Motivated by applications in computable analysis, we study fixpoints of certain endofunctors over categories of containers. More specifically, we focus on fibred endofunctors over the fibrewise opposite of the codomain fibration that can be themselves be represented by families of polynomial endofunctors. In this setting, we show how to compute initial algebras, terminal coalgebras and another kind of fixpoint $\zeta$. We then explore a number of examples of derived operators inspired by Weihrauch complexity and the usual construction of the free polynomial monad. We introduce $\zeta$-expressions as the syntax of $\mu$-bicomplete categories, extended with $\zeta$-binders and parallel products, which thus have a natural denotation in containers. By interpreting certain $\zeta$-expressions in a category of type 2 computable maps, we are able to capture a number of meaningful Weihrauch degrees, ranging from closed choice on $\{0, 1\}$ to determinacy of infinite parity games, via an "answerable part" operator.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript studies fixpoints of fibred endofunctors over the fibrewise opposite of the codomain fibration, represented by families of polynomial endofunctors on categories of containers. It develops methods to compute initial algebras, terminal coalgebras, and a third kind of fixpoint denoted ζ. The paper introduces ζ-expressions as an extension of the syntax for μ-bicomplete categories that includes ζ-binders and parallel products, and interprets selected ζ-expressions inside the category of type-2 computable maps; via an “answerable part” operator these interpretations are claimed to recover a range of Weihrauch degrees, from closed choice on {0,1} to determinacy of infinite parity games.
Significance. If the technical development is sound, the work supplies a uniform categorical syntax for expressing a spectrum of Weihrauch degrees that arises naturally from fixpoint constructions on polynomial endofunctors. The explicit link between ζ-fixpoints, the answerable-part operator, and concrete Weihrauch degrees could provide new structural insight into computable analysis and Weihrauch reducibility.
major comments (2)
- [Abstract and the section introducing ζ-fixpoints] The existence of ζ-fixpoints is asserted to follow from μ-bicompleteness of the category of type-2 computable maps (with respect to the fibred endofunctors given by families of polynomial endofunctors). No proof, reference, or verification that this specific category satisfies the required μ-bicompleteness hypotheses appears in the manuscript; this property is load-bearing for the subsequent interpretation of ζ-expressions and the recovery of the claimed Weihrauch degrees.
- [Section on interpretation in type-2 computable maps] The definition of the “answerable part” operator and its interaction with parallel products and ζ-binders is not supplied with sufficient detail to confirm that the resulting denotations indeed coincide with the standard Weihrauch degrees (closed choice on {0,1}, parity-game determinacy, etc.). A concrete example computation for at least one degree should be given to substantiate the claim.
minor comments (2)
- [Preliminaries] The notation for the fibrewise opposite of the codomain fibration and for the families of polynomial endofunctors should be introduced with explicit diagrams or equations at the first use.
- [Examples section] The manuscript would benefit from a short table or list that maps each concrete ζ-expression to the Weihrauch degree it is claimed to realize.
Simulated Author's Rebuttal
We thank the referee for their thorough review and valuable comments. We will revise the manuscript to provide the missing justification for μ-bicompleteness and to include a detailed definition and example for the answerable part operator.
read point-by-point responses
-
Referee: [Abstract and the section introducing ζ-fixpoints] The existence of ζ-fixpoints is asserted to follow from μ-bicompleteness of the category of type-2 computable maps (with respect to the fibred endofunctors given by families of polynomial endofunctors). No proof, reference, or verification that this specific category satisfies the required μ-bicompleteness hypotheses appears in the manuscript; this property is load-bearing for the subsequent interpretation of ζ-expressions and the recovery of the claimed Weihrauch degrees.
Authors: We acknowledge that the manuscript lacks an explicit verification or reference for the μ-bicompleteness of the category of type-2 computable maps. This category is known to be μ-bicomplete in the relevant sense from the literature on domain theory and computable analysis (e.g., as it supports the necessary fixed-point constructions for polynomial functors). We will add a short subsection or paragraph with a reference and brief argument in the revised version. revision: yes
-
Referee: [Section on interpretation in type-2 computable maps] The definition of the “answerable part” operator and its interaction with parallel products and ζ-binders is not supplied with sufficient detail to confirm that the resulting denotations indeed coincide with the standard Weihrauch degrees (closed choice on {0,1}, parity-game determinacy, etc.). A concrete example computation for at least one degree should be given to substantiate the claim.
Authors: We agree that additional detail is required for clarity. In the revision, we will provide the full definition of the answerable part operator, explain its interaction with the parallel products and ζ-binders, and include a concrete example computation demonstrating how a specific ζ-expression yields the Weihrauch degree for closed choice on {0,1}. revision: yes
Circularity Check
No circularity: direct interpretation of ζ-expressions yields known Weihrauch degrees
full rationale
The paper defines ζ-expressions syntactically in μ-bicomplete categories (with ζ-binders and parallel products) and gives them denotations in containers. It then interprets selected expressions inside the category of type-2 computable maps, producing an 'answerable part' operator whose values coincide with independently studied Weihrauch degrees (closed choice on {0,1} through parity-game determinacy). No equation equates a derived quantity to a fitted parameter or to a self-referential definition; the μ-bicompleteness hypothesis is an external assumption on the target category rather than a result derived inside the paper. No self-citation is invoked to justify the central mapping, and the construction does not rename or smuggle in prior results by definition. The derivation chain therefore remains non-circular.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption Categories of containers admit fibred endofunctors representable by families of polynomial endofunctors
- domain assumption The target categories are μ-bicomplete
invented entities (2)
-
ζ-fixpoint
no independent evidence
-
ζ-expression
no independent evidence
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.