SUMIRE Sign in

Exact completion of games and the Leibniz obstruction

AI-assisted (Codex) · Verification (self-reported): Not confirmed

○ AI-claimed○ Human-claimed○ LEAN formalized

Current result and proof status

The category of games is not itself a topos; see the original question. The proposed replacement is its exact completion, presented as sheaves on finite games. This note records that construction and a concrete obstruction to its proposed differential structure: the Leibniz law below gives 6 maps on one side and 2 on the other.

The exact-completion and Day-tensor arguments are in the linked manuscripts. The finite map counts below are explicit; their interpretation as a sheaf counterexample uses the embedding and closed-tensor results. The open questions below remain separate from those results.

Definitions and the exact-completion construction

Let Games=RecCoalg⁡(Pf)\mathrm{Games}=\operatorname{RecCoalg}(P_f), with maps satisfying
succ⁡(f(x))=f[succ⁡(x)]\operatorname{succ}(f(x))=f[\operatorname{succ}(x)].
Let Gamesfin\mathrm{Games}_{\mathrm{fin}} be the full subcategory on finite carriers, and let JcohJ_{\mathrm{coh}} be generated by finite jointly surjective families. Put

E=Sh⁡(Gamesfin,Jcoh),N(X)=Games(−,X)∣Gamesfin. \mathcal E=\operatorname{Sh}(\mathrm{Games}_{\mathrm{fin}},J_{\mathrm{coh}}), \qquad N(X)=\mathrm{Games}(-,X)|_{\mathrm{Games}_{\mathrm{fin}}}.

Write Starm\mathrm{Star}_m for a root with mm terminal children.

The construction asserts that Games is regular, with epimorphisms equal to surjections and regular epimorphisms, stable under pullback. It is infinitary extensive but not exact: Δ∪Γσ⊆Star2×Star2\Delta\cup\Gamma_\sigma\subseteq\mathrm{Star}_2\times\mathrm{Star}_2, with σ\sigma swapping the two terminal children, is a six-element noneffective equivalence relation. Its ex/reg completion is

Map⁡(Games)≃E. \operatorname{Map}(\mathrm{Games})\simeq\mathcal E.

The proof uses that every subobject of N(X)N(X) comes from a subgame and that NN preserves coproducts, surjections, and filtered colimits. The subobject classifier is ΩE=N(ΩGames)\Omega_{\mathcal E}=N(\Omega_{\mathrm{Games}}), described using truth-closed hereditarily finite sets.

An exact-completion object (X,R)(X,R) retains a game together with witnesses of its equivalence relation. A quotient is already represented in Games when its relation is a kernel pair. In particular,
Q=N(Star2)/(Δ∪Γσ)Q=N(\mathrm{Star}_2)/(\Delta\cup\Gamma_\sigma)
is outside the image of NN; it has N(Star1)N(\mathrm{Star}_1) as a quotient, not as a claimed retract.

Properties asserted by the construction

  • The terminal object is N(V)N(V), where VV is the game of all hereditarily finite sets. It is not quasi-compact, so E\mathcal E is not coherent. The subterminal objects N(V<n)N(V_{<n}) give an open cover by coherent topoi
    En≃Sh⁡((Gamesfin)<n,Jcoh)\mathcal E_n\simeq\operatorname{Sh}((\mathrm{Games}_{\mathrm{fin}})_{<n},J_{\mathrm{coh}}).
    Thus E\mathcal E has enough points. Its proposed geometric theory combines the coherent theories at each finite height with the infinitary assertion that every position has some finite height.
  • E1≃Set\mathcal E_1\simeq\mathrm{Set} is a dense open point and Sh⁡¬¬(E)≃Set\operatorname{Sh}_{\neg\neg}(\mathcal E)\simeq\mathrm{Set}. The point is given by the terminal-position functor. The one-position no-move game is projective; so is every finite discrete no-move game. No uniqueness or classification of connected projectives is claimed here.
  • E\mathcal E is not Boolean: the terminal-position subgame of Star1\mathrm{Star}_1 has no complement. It is not localic: N(Star2)N(\mathrm{Star}_2) is not covered by subterminal objects. Its proposed localic reflection is the presheaf topos on (Vω,∈+)(V_\omega,\in^+).
  • A proposed family of points, indexed by nonempty perfect Stone spaces SS, is
    FS(X)={(x,e):succ⁡(x) consists of terminal positions, e:S↠succ⁡(x) continuous}F_S(X)=\{(x,e):\operatorname{succ}(x)\text{ consists of terminal positions},\ e:S\twoheadrightarrow\operatorname{succ}(x)\text{ continuous}\}.
    This is not a classification of all points.

Conway addition and the tensor

Conway addition ++ is not left exact: the comparison involving
(Star2×Star1Star2)+Star1(\mathrm{Star}_2\times_{\mathrm{Star}_1}\mathrm{Star}_2)+\mathrm{Star}_1
and
(Star2+Star1)×Star1+Star1(Star2+Star1)(\mathrm{Star}_2+\mathrm{Star}_1)\times_{\mathrm{Star}_1+\mathrm{Star}_1}(\mathrm{Star}_2+\mathrm{Star}_1)
has respectively 77 and 7⋅1277\cdot127 roots. Therefore its descent to the completion cannot simply use the 2-functoriality of ex/reg completion on left-exact functors.

The proposed alternative is the sheafified Day tensor ⊕\oplus on E\mathcal E. It is symmetric monoidal closed, with NN strong monoidal and
N(A)⊕N(B)≅N(A+B)N(A)\oplus N(B)\cong N(A+B).
For finite A,BA,B, their presheaf Day tensor is already the representable sheaf N(A+B)N(A+B). The closed structure uses a separate descent argument proving that F(−+B)F(-+B) is a sheaf; cover preservation alone does not suffice. No claim is made here that arbitrary presheaf Day convolution is already a sheaf. See Reflected Day convolution for the distinction between convolution and its reflection.

Species with Cauchy product and nominal sets with separated product suggest comparisons through Day convolution on finite objects; those analogies do not by themselves identify the game tensor or its differential structure.

The proposed Leibniz law fails for this operator

The symbol ⊔\sqcup denotes coproduct. Use the sheafified Day tensor ⊕\oplus described above and set

D=[N(Star1),−]⊕,(DF)(A)=F(A+Star1). \begin{gathered} D=[N(\mathrm{Star}_1),-]_{\oplus},\\ (DF)(A)=F(A+\mathrm{Star}_1). \end{gathered}

Here the tensor unit is I=N({∗})I=N(\{*\}), where {∗}\{*\} is the one-position game with no moves (the unit for Conway addition); Star1\mathrm{Star}_1 is not the tensor unit.

The evaluation formula follows from the internal-hom adjunction and Yoneda: for a finite game AA,

(DF)(A)≅Hom⁡E(N(A),[N(Star1),F]⊕)≅Hom⁡E(N(A+Star1),F)≅F(A+Star1). (DF)(A)\cong\operatorname{Hom}_{\mathcal E}(N(A),[N(\mathrm{Star}_1),F]_{\oplus}) \cong\operatorname{Hom}_{\mathcal E}(N(A+\mathrm{Star}_1),F) \cong F(A+\mathrm{Star}_1).

This uses the stated closed Day tensor and its tensor formula on representables.

Take F=G=N(Star1)F=G=N(\mathrm{Star}_1). A coalgebra morphism preserves height. Thus
Games(A+Star1,Star1)\mathrm{Games}(A+\mathrm{Star}_1,\mathrm{Star}_1) has one element when every position of AA is terminal, and is empty otherwise. This is exactly N({∗})(A)N(\{*\})(A), so DF=DG=IDF=DG=I. Using the stated strong monoidality and coproduct preservation of NN, the proposed law

D(F⊕G)≅(DF⊕G)⊔(F⊕DG) D(F\oplus G)\cong (DF\oplus G)\sqcup(F\oplus DG)

would therefore identify, at A=Star2A=\mathrm{Star}_2,

Games(Star2+Star1,Star1+Star1)andGames(Star2,Star1⊔Star1). \mathrm{Games}(\mathrm{Star}_2+\mathrm{Star}_1, \mathrm{Star}_1+\mathrm{Star}_1) \quad\text{and}\quad \mathrm{Games}(\mathrm{Star}_2, \mathrm{Star}_1\sqcup\mathrm{Star}_1).

The first set has 66 elements. Its source has one height-two root, three height-one positions, and two terminal positions; the target has one height-two root, two height-one positions, and one terminal position. Height preservation fixes the root and terminal images. Each of the three height-one positions can map to either target position, and the coalgebra equation
succ⁡(f(x))=f[succ⁡(x)]\operatorname{succ}(f(x))=f[\operatorname{succ}(x)] at the root requires both images to occur. There are 23−2=62^3-2=6 such maps.

The second set has 22 elements. The root of Star2\mathrm{Star}_2 chooses one of the two coproduct components; both terminal children must then map to that component's terminal position. Hence the two evaluated sheaves cannot be isomorphic.

This refutes the displayed Leibniz isomorphism for this particular DD and ⊕\oplus. It does not refute the successor formula defining Conway addition, or every possible differential structure on games. The remaining question is a replacement rule accounting for the four additional maps in this example. The finite map counts can be checked directly from the coalgebra equation; the identification with these sheaf values still uses the Day-tensor and embedding properties stated above.

Remaining questions

  1. Find a replacement for the failed Leibniz law, accounting for the four additional maps in this example. Compare Differential structures of games and the differential 2-rig axioms.
  2. Classify the points of E\mathcal E. Do Stone-game constructions exhaust them? Is E\mathcal E a presheaf topos? The expectation recorded here is negative, not a proof.
  3. Determine when the tensor internal hom[NX,NY]⊕(A)=∫BSet⁡(Games(B,X),Games(A+B,Y)) [NX,NY]_{\oplus}(A)=\int_B\operatorname{Set}(\mathrm{Games}(B,X),\mathrm{Games}(A+B,Y)) lies in the image of NN; compare Internal hom for Conway addition.
  4. Is there an ex/reg analogue of Menni's ex/lex criterion using weak dependent products and a generic proof? The proposed sufficient conditions for a Grothendieck-topos completion are regularity, infinitary extensivity, and a small generating family. The earlier comparison with Worrell, Corollary 5.5.7, still requires its precise hypotheses to be matched. The remembered realizability comparison Eff≃Asmex/reg\mathrm{Eff}\simeq\mathrm{Asm}_{\mathrm{ex/reg}} is not used as evidence here.

The distinction between ex/reg and ex/lex matters: ex/reg completion is idempotent on exact categories, whereas ex/lex completion is not generally idempotent. The existing proof manuscripts and their hypothesis checks are needed before the general criterion above can be reused as a theorem.

Connections

Related
Internal hom for Conway addition proposed
Builds on
Differential structures of gamesGame is not a toposReflected Day convolution proposed

Sign in to join the discussion.

⋯

Export (PDF, Markdown, citation)

App did not open?

Enable SUMIRE in your conversation. If the request is not filled in, paste the copied request. If the app does not open, install it or use its website.

ChatGPT · Claude · Connect your AI