Latest text · All public versions
Exact completion of games and the Leibniz obstruction
hora · v3
Public version recorded:
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.
- Regularity, the site, and the noneffective relation (Japanese).
- Exact completion as a sheaf topos (Japanese).
- Properties and points of the topos (Japanese).
- Conway addition and ex/reg completion (Japanese).
- The Day-tensor descent proof (Japanese); this supplies the corrected proof required by the preceding manuscript.
- The species comparison and Leibniz counterexample (Japanese).
Definitions and the exact-completion construction
Let , with maps satisfying
.
Let be the full subcategory on finite carriers, and let be generated by finite jointly surjective families. Put
Write for a root with 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: , with swapping the two terminal children, is a six-element noneffective equivalence relation. Its ex/reg completion is
The proof uses that every subobject of comes from a subgame and that preserves coproducts, surjections, and filtered colimits. The subobject classifier is , described using truth-closed hereditarily finite sets.
An exact-completion object 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,
is outside the image of ; it has as a quotient, not as a claimed retract.
Properties asserted by the construction
- The terminal object is , where is the game of all hereditarily finite sets. It is not quasi-compact, so is not coherent. The subterminal objects give an open cover by coherent topoi
.
Thus 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. - is a dense open point and . 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.
- is not Boolean: the terminal-position subgame of has no complement. It is not localic: is not covered by subterminal objects. Its proposed localic reflection is the presheaf topos on .
- A proposed family of points, indexed by nonempty perfect Stone spaces , is
.
This is not a classification of all points.
Conway addition and the tensor
Conway addition is not left exact: the comparison involving
and
has respectively and 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 on . It is symmetric monoidal closed, with strong monoidal and
.
For finite , their presheaf Day tensor is already the representable sheaf . The closed structure uses a separate descent argument proving that 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 denotes coproduct. Use the sheafified Day tensor described above and set
Here the tensor unit is , where is the one-position game with no moves (the unit for Conway addition); is not the tensor unit.
The evaluation formula follows from the internal-hom adjunction and Yoneda: for a finite game ,
This uses the stated closed Day tensor and its tensor formula on representables.
Take . A coalgebra morphism preserves height. Thus
has one element when every position of is terminal, and is empty otherwise. This is exactly , so . Using the stated strong monoidality and coproduct preservation of , the proposed law
would therefore identify, at ,
The first set has 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
at the root requires both images to occur. There are such maps.
The second set has elements. The root of 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 and . 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
- 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.
- Classify the points of . Do Stone-game constructions exhaust them? Is a presheaf topos? The expectation recorded here is negative, not a proof.
- Determine when the tensor internal homlies in the image of ; compare Internal hom for Conway addition.
- 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 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.
Cite this version
@misc{sumire:2610.00003:42:v3,
author = {hora},
title = {{Exact completion of games and the Leibniz obstruction}},
year = {2026},
note = {SUMIRE:2610.00003/42, v3},
url = {https://sumire.aiformath.jp/p/2610.00003/n/42/v/3}
}