final coalgebra of the 𝓟${_{<κ}}$(A×X) endo-functor in $Set^*$?












3














In the paper Coalgebraic Games and Strategies F. Honsell, M. Lenisa, and R. Redamalla use the functor $F_A$(X) = ${mathscr{P}_{<κ}}$(A×X) to define games coalgebraically. This is a functor from the category of $Set^* to Set^*$ where $Set^*$ is the category of sets satisfying the antifoundation axioms.



They state that the final $F_A$ coalgebra is ($G_A$,id) and that a game is to be understood as an element of $G_A$, but I don't know where the final coalgebra construction for $F_A$ is explained in detail. Why would id be the coalgebraic function?



They write




The elements of the final coalgebra $G_A$ are the minimal graphs
up-to bisimilarity.




To add a bit more context as to how this relates to games:




We consider a general notion of 2-player game of perfect information,
where the two players are called Left (L) and Right (R). A game x is
identified with its initial position; at any position, there are moves
for L and R, taking to new positions of the game. By abstracting from
superficial features of positions, games can be viewed as elements of
the final coalgebra for the functor F$_A$(X) = $mathscr{P}_{<κ}$(A×X), where A is a
parametric set of atoms which encode information on moves and
positions, i.e. move names, and the player who has moved, and $mathscr{P}_{<κ}$ is
the set of all subsets of cardinality < κ. The coalgebra structure
captures, for any position, the moves of the players and the
corresponding next positions.




as for the meaning of $mathscr{P}_{<κ}$ this is explained in a later article "Multigames and strategies, coalgebraically"




$mathscr{P}_{<κ}$is the set of all subsets of cardinality < κ, where κ can be ω, if only finitely branching games are considered, or it can be an inaccessible cardinal, if we are interested in more general games.




PS I posted this question on mathoverflow yesterday, thinking I was on math.stackexchange...










share|cite|improve this question





























    3














    In the paper Coalgebraic Games and Strategies F. Honsell, M. Lenisa, and R. Redamalla use the functor $F_A$(X) = ${mathscr{P}_{<κ}}$(A×X) to define games coalgebraically. This is a functor from the category of $Set^* to Set^*$ where $Set^*$ is the category of sets satisfying the antifoundation axioms.



    They state that the final $F_A$ coalgebra is ($G_A$,id) and that a game is to be understood as an element of $G_A$, but I don't know where the final coalgebra construction for $F_A$ is explained in detail. Why would id be the coalgebraic function?



    They write




    The elements of the final coalgebra $G_A$ are the minimal graphs
    up-to bisimilarity.




    To add a bit more context as to how this relates to games:




    We consider a general notion of 2-player game of perfect information,
    where the two players are called Left (L) and Right (R). A game x is
    identified with its initial position; at any position, there are moves
    for L and R, taking to new positions of the game. By abstracting from
    superficial features of positions, games can be viewed as elements of
    the final coalgebra for the functor F$_A$(X) = $mathscr{P}_{<κ}$(A×X), where A is a
    parametric set of atoms which encode information on moves and
    positions, i.e. move names, and the player who has moved, and $mathscr{P}_{<κ}$ is
    the set of all subsets of cardinality < κ. The coalgebra structure
    captures, for any position, the moves of the players and the
    corresponding next positions.




    as for the meaning of $mathscr{P}_{<κ}$ this is explained in a later article "Multigames and strategies, coalgebraically"




    $mathscr{P}_{<κ}$is the set of all subsets of cardinality < κ, where κ can be ω, if only finitely branching games are considered, or it can be an inaccessible cardinal, if we are interested in more general games.




    PS I posted this question on mathoverflow yesterday, thinking I was on math.stackexchange...










    share|cite|improve this question



























      3












      3








      3







      In the paper Coalgebraic Games and Strategies F. Honsell, M. Lenisa, and R. Redamalla use the functor $F_A$(X) = ${mathscr{P}_{<κ}}$(A×X) to define games coalgebraically. This is a functor from the category of $Set^* to Set^*$ where $Set^*$ is the category of sets satisfying the antifoundation axioms.



      They state that the final $F_A$ coalgebra is ($G_A$,id) and that a game is to be understood as an element of $G_A$, but I don't know where the final coalgebra construction for $F_A$ is explained in detail. Why would id be the coalgebraic function?



      They write




      The elements of the final coalgebra $G_A$ are the minimal graphs
      up-to bisimilarity.




      To add a bit more context as to how this relates to games:




      We consider a general notion of 2-player game of perfect information,
      where the two players are called Left (L) and Right (R). A game x is
      identified with its initial position; at any position, there are moves
      for L and R, taking to new positions of the game. By abstracting from
      superficial features of positions, games can be viewed as elements of
      the final coalgebra for the functor F$_A$(X) = $mathscr{P}_{<κ}$(A×X), where A is a
      parametric set of atoms which encode information on moves and
      positions, i.e. move names, and the player who has moved, and $mathscr{P}_{<κ}$ is
      the set of all subsets of cardinality < κ. The coalgebra structure
      captures, for any position, the moves of the players and the
      corresponding next positions.




      as for the meaning of $mathscr{P}_{<κ}$ this is explained in a later article "Multigames and strategies, coalgebraically"




      $mathscr{P}_{<κ}$is the set of all subsets of cardinality < κ, where κ can be ω, if only finitely branching games are considered, or it can be an inaccessible cardinal, if we are interested in more general games.




      PS I posted this question on mathoverflow yesterday, thinking I was on math.stackexchange...










      share|cite|improve this question















      In the paper Coalgebraic Games and Strategies F. Honsell, M. Lenisa, and R. Redamalla use the functor $F_A$(X) = ${mathscr{P}_{<κ}}$(A×X) to define games coalgebraically. This is a functor from the category of $Set^* to Set^*$ where $Set^*$ is the category of sets satisfying the antifoundation axioms.



      They state that the final $F_A$ coalgebra is ($G_A$,id) and that a game is to be understood as an element of $G_A$, but I don't know where the final coalgebra construction for $F_A$ is explained in detail. Why would id be the coalgebraic function?



      They write




      The elements of the final coalgebra $G_A$ are the minimal graphs
      up-to bisimilarity.




      To add a bit more context as to how this relates to games:




      We consider a general notion of 2-player game of perfect information,
      where the two players are called Left (L) and Right (R). A game x is
      identified with its initial position; at any position, there are moves
      for L and R, taking to new positions of the game. By abstracting from
      superficial features of positions, games can be viewed as elements of
      the final coalgebra for the functor F$_A$(X) = $mathscr{P}_{<κ}$(A×X), where A is a
      parametric set of atoms which encode information on moves and
      positions, i.e. move names, and the player who has moved, and $mathscr{P}_{<κ}$ is
      the set of all subsets of cardinality < κ. The coalgebra structure
      captures, for any position, the moves of the players and the
      corresponding next positions.




      as for the meaning of $mathscr{P}_{<κ}$ this is explained in a later article "Multigames and strategies, coalgebraically"




      $mathscr{P}_{<κ}$is the set of all subsets of cardinality < κ, where κ can be ω, if only finitely branching games are considered, or it can be an inaccessible cardinal, if we are interested in more general games.




      PS I posted this question on mathoverflow yesterday, thinking I was on math.stackexchange...







      category-theory game-theory coalgebras






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited 2 days ago







      Henry Story

















      asked 2 days ago









      Henry StoryHenry Story

      25318




      25318






















          0






          active

          oldest

          votes











          Your Answer





          StackExchange.ifUsing("editor", function () {
          return StackExchange.using("mathjaxEditing", function () {
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
          });
          });
          }, "mathjax-editing");

          StackExchange.ready(function() {
          var channelOptions = {
          tags: "".split(" "),
          id: "69"
          };
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function() {
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled) {
          StackExchange.using("snippets", function() {
          createEditor();
          });
          }
          else {
          createEditor();
          }
          });

          function createEditor() {
          StackExchange.prepareEditor({
          heartbeatType: 'answer',
          autoActivateHeartbeat: false,
          convertImagesToLinks: true,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          imageUploader: {
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          },
          noCode: true, onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          });


          }
          });














          draft saved

          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3062970%2ffinal-coalgebra-of-the-%25ce%25baa%25c3%2597x-endo-functor-in-set%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          0






          active

          oldest

          votes








          0






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes
















          draft saved

          draft discarded




















































          Thanks for contributing an answer to Mathematics Stack Exchange!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid



          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.


          Use MathJax to format equations. MathJax reference.


          To learn more, see our tips on writing great answers.





          Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


          Please pay close attention to the following guidance:


          • Please be sure to answer the question. Provide details and share your research!

          But avoid



          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3062970%2ffinal-coalgebra-of-the-%25ce%25baa%25c3%2597x-endo-functor-in-set%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          Popular posts from this blog

          Mario Kart Wii

          The Binding of Isaac: Rebirth/Afterbirth

          What does “Dominus providebit” mean?