Zulip Chat Archive

Stream: combinatorial-games

Topic: Computability


Violeta Hernández (Sep 06 2025 at 09:46):

I've just been informed that docs#Shrink is now computable, which through a chain of events implies that our operations on games (in particular the ofSets function) are now computable.

Violeta Hernández (Sep 06 2025 at 09:46):

Is this anything?

Violeta Hernández (Sep 06 2025 at 09:51):

I don't really expect this to do much for us. There's still the underlying problem that Set carries no data (it's a function into Prop, and any term in Prop carries no data).

Violeta Hernández (Sep 06 2025 at 09:51):

But hey, at least we don't have to open noncomputable section all over

Aaron Liu (Sep 06 2025 at 10:09):

yeah this does nothing for us

Aaron Liu (Sep 06 2025 at 10:10):

but it's certainly more convenient to not write noncomputable everywhere

Violeta Hernández (Sep 06 2025 at 10:12):

https://github.com/vihdzp/combinatorial-games/pull/232

Violeta Hernández (Sep 06 2025 at 10:22):

Actually, there's something I realize

Violeta Hernández (Sep 06 2025 at 10:22):

The functor trick could be used in FGame

Violeta Hernández (Sep 06 2025 at 10:29):

...or maybe not

Violeta Hernández (Sep 06 2025 at 10:29):

def FiniteGameFunctor (α : Type) : Type :=
  Player  Finset α

open Classical in
noncomputable instance : Functor FiniteGameFunctor where
  map f s := fun p  (s p).image f

Violeta Hernández (Sep 06 2025 at 10:29):

Finset.image requires a decidability assumption that we just don't have

Aaron Liu (Sep 06 2025 at 10:30):

I guess that's tricky

Violeta Hernández (Sep 06 2025 at 10:30):

I have a potential fix

Aaron Liu (Sep 06 2025 at 10:30):

you could do what DFinsupp does and make it a quotient multiset

Violeta Hernández (Sep 06 2025 at 10:31):

You beat me to it

Violeta Hernández (Sep 06 2025 at 11:11):

...I don't think that works either

Aaron Liu (Sep 06 2025 at 11:21):

what's wrong

Violeta Hernández (Sep 06 2025 at 11:23):

Let me put it like this

Violeta Hernández (Sep 06 2025 at 11:23):

How would you give a QPF instance for Multiset?

Violeta Hernández (Sep 06 2025 at 11:26):

It should be a quotient of the polynomial functor Fin, I believe

Violeta Hernández (Sep 06 2025 at 11:26):

Small problem

Violeta Hernández (Sep 06 2025 at 11:27):

How do you computably define the function (m : Multiset α) → Fin m.size → α?

Violeta Hernández (Sep 06 2025 at 11:28):

I might be completely misunderstanding this, but I think this problem carries over to Finset

Aaron Liu (Sep 06 2025 at 11:32):

it's not computable

Aaron Liu (Sep 06 2025 at 11:32):

uhoh

Aaron Liu (Sep 06 2025 at 11:45):

you should be able to compute the map into the quotient though

Violeta Hernández (Sep 06 2025 at 12:13):

Again, maybe I misunderstand

Aaron Liu (Sep 06 2025 at 12:17):

I am trying to make this work but having universe issues

Aaron Liu (Sep 06 2025 at 12:17):

maybe Shrink can help me

Violeta Hernández (Sep 06 2025 at 12:19):

Universe issues? Everything here should be fully contained within universe 0.

Aaron Liu (Sep 06 2025 at 12:22):

Type is in universe one

Aaron Liu (Sep 06 2025 at 12:22):

and I don't know what universe α is in

Aaron Liu (Sep 06 2025 at 12:26):

but I do know that the universe of α is not in itself

Violeta Hernández (Sep 07 2025 at 00:43):

Maybe try writing it down when α is in universe 0


Last updated: Dec 20 2025 at 21:32 UTC