SUMIRE Sign in

Latest text · All public versions

Internal hom for Conway addition

hora · v5

Public version recorded:

A newer public version is available.

Question and proposed construction

Question 5.7 of Games as recursive coalgebras asks for a concrete right adjoint to Conway addition:

Game(G+K,H)≅Game(K,[G,H]+). \mathbf{Game}(G+K,H)\cong\mathbf{Game}(K,[G,H]_+).

Existence is proved abstractly in the paper. The proposed construction and proof below describe positions, moves, evaluation, and currying explicitly. A detailed proposed proof is in note 29.

Positions and moves

Put S=Set⁡(UG,UH)S=\operatorname{Set}(UG,UH). By Definition B.13 and Proposition B.14, the cofree game R(S)R(S) consists of hereditarily finite labelled positions t=(Tt,at)t=(T_t,a_t), with finite child set TtT_t and label at∈Sa_t\in S.

Let A(G,H)A(G,H) consist of those t∈R(S)t\in R(S) for which every descendant ww, including tt, satisfies

θH(aw(g))={aw(g′):g′∈θG(g)}∪{av(g):v∈Tw}(g∈UG). \theta_H(a_w(g)) =\{a_w(g'):g'\in\theta_G(g)\} \cup\{a_v(g):v\in T_w\} \quad(g\in UG).

The condition is inherited by children, so A(G,H)A(G,H) is a subgame. Its moves are the inherited child relation.

Evaluation and currying

Evaluation is ev⁡(g,t)=at(g)\operatorname{ev}(g,t)=a_t(g). The displayed equation says exactly that it is an exact coalgebra morphism G+A(G,H)→HG+A(G,H)\to H.

For a morphism f:G+K→Hf:G+K\to H, take the cofree transpose of the label map k↦(g↦f(g,k))k\mapsto(g\mapsto f(g,k)):

hf(k)=({hf(k′):k′∈θK(k)}, g↦f(g,k)). h_f(k)=\bigl(\{h_f(k'):k'\in\theta_K(k)\},\,g\mapsto f(g,k)\bigr).

The morphism equation for ff gives the compatibility equation at every image position. The image is closed under options, so hfh_f factors through A(G,H)A(G,H). Conversely, evaluation uncurries any map K→A(G,H)K\to A(G,H). One composite is the identity by evaluation of labels; the other is the identity by uniqueness of the cofree transpose. Thus A(G,H)A(G,H) is the required right adjoint.

This is a construction in the category of finitely branching, finite-time games with exact coalgebra maps. The carriers need not be finite.

Status and remaining work

This is a proposed construction and proof, retained as a proof candidate rather than a human-reviewed result. The argument is stated in the precise category stated above; it does not claim a new published theorem or a completed human review.

Compute usable small examples and explain the game-theoretic meaning of these labelled positions. The construction does not identify this internal hom with player-switching or a strategy-category internal hom. It does not establish the partisan analogue. Its relation to prior mapping-object constructions also requires a separate literature comparison.

Cite this version

BibTeX

@misc{sumire:2610.00003:4:v5,
  author = {hora},
  title = {{Internal hom for Conway addition}},
  year = {2026},
  note = {SUMIRE:2610.00003/4, v5},
  url = {https://sumire.aiformath.jp/p/2610.00003/n/4/v/5}
}