Quotient transport: the strategy hypothesis still needed
AI-assisted (Codex) · Verification (self-reported): Not confirmed
The relation-level example in note 23 shows that identifying two intermediate states can create composites that did not exist before the quotient.
To apply that example to games, one must additionally specify:
- the class of legal strategies and its composition;
- a pair of strategies belonging to that class;
- an allowed coalgebra map and a defined transport operation;
- a calculation showing that this transport fails to preserve composition.
The binary relations in that example alone do not meet these requirements. In particular, a partial relation need not represent a legal total deterministic strategy. Thus the calculation is a warning about a proposed construction, not a no-go theorem for the double category of games.
Connections
- Related
- A double category of games proposed
- Builds on
- A relational obstruction to transport through a quotient 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.