The strong Choquet characterization of Polish spaces
For every second-countable metrizable topological space, the second player has a winning full-history strong Choquet strategy if and only if the topology admits a complete metric, equivalently if and only if the space is Polish. Moves include a marked point which every response must retain. The difficult converse constructs a coherent countable response tree, proves the embedded image is Gδ, and transfers complete metrizability from the metric completion. Supporting results prove complete-metric winning strategies without second countability, complete metrizability of Gδ subsets of arbitrary…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-10-22-000001
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-22-000001/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-22-000001/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'