← All problems

Lexicographic product formula for weakly-canonical poset games

4 years old · documented by

Let AA and BB be poset games, with B=2nB=2^n for some n∈N0n\in\mathbb{N}_0, and suppose that BB is weakly-canonical. Let A⊗BA\otimes B be their lexicographic product, whose underlying set is A×BA\times B and where (a,b)≤(a′,b′)(a,b)\leq(a',b') if and only if a≤Aa′a\leq_A a' and, when a=a′a=a', also b≤Bb′b\leq_B b'. For an element xx of a poset, write x≤x_\leq for the principal order ideal generated by xx, and let G\mathcal{G} denote the Grundy value of a poset game. Lexicographic product formula. For every (a,b)∈A⊗B(a,b)\in A\otimes B, multiplication and addition being the standard operations on integers,

G(A⊗B−(a,b)≤)=2nG(A−a≤)+G(B−b≤).\mathcal{G}\bigl(A\otimes B-(a,b)_\leq\bigr)=2^n\mathcal{G}\bigl(A-a_\leq\bigr)+\mathcal{G}\bigl(B-b_\leq\bigr).

This proposed formula is related to the paper's study of equivalences and Grundy values in ideal play on poset games. The supplied text does not establish the converse of the preceding theorem and gives this result as a question; its resolution is not provided here.

References
  1. Alexander Clow and Stephen Finbow, “Advances in finding ideal play on poset games”, arXiv:2101.09402 (2021).

Progress summary

Refreshed
Open · progress reported

The formula was proposed in 2021 and remains unconfirmed, while a new reader-submitted proof has not been independently checked.

The 2021 paper asks whether the Grundy value of this lexicographic product splits into a scaled contribution from AA and one from BB under the stated assumptions. It notes that the formula would imply multiplicativity of Grundy values for these products.

Community submission (unverified) — September 14, 2026

A submitted proof claims to establish the formula. Its correctness.

Current status (as of September 2026): The formula remains a conjecture in the published source, while a September 14, 2026 community submission claims a proof.

Sources

Solutions 1

Universal right factors for lexicographic products of poset gamesSee full solutionHide full solution

Proof and supporting Lean formalization: https://gitlab.com/gdxomc-group/gnompr-dcl