Software:Finite promise games and greedy clique sequences

Short description: Collection of mathematical games

The finite promise games are a collection of mathematical games developed by American mathematician Harvey Friedman in 2009 which are used to develop a family of fast-growing functions $FPLCI(k)$, $FPCI(k)$ and $FLCI(k)$. The greedy clique sequence is a graph theory concept, also developed by Friedman in 2010, which are used to develop fast-growing functions $USGCS(k)$, $USGDCS(k)$ and $USGDC{S}_2(k)$.

$\mathsf{S}\mathsf{M}\mathsf{A}\mathsf{H}$ represents the theory of ZFC plus, for each $k$, "there is a strongly $k$-Mahlo cardinal", and $\mathsf{S}\mathsf{M}\mathsf{A}{\mathsf{H}}^{\mathsf{+}}$ represents the theory of ZFC plus "for each $k$, there is a strongly $k$-Mahlo cardinal". $\mathsf{S}\mathsf{R}\mathsf{P}$ represents the theory of ZFC plus, for each $k$, "there is a $k$-stationary Ramsey cardinal", and $\mathsf{S}\mathsf{R}{\mathsf{P}}^{\mathsf{+}}$ represents the theory of ZFC plus "for each $k$, there is a strongly $k$-stationary Ramsey cardinal". $\mathsf{H}\mathsf{U}\mathsf{G}\mathsf{E}$ represents the theory of ZFC plus, for each $k$, "there is a $k$-huge cardinal", and $\mathsf{H}\mathsf{U}\mathsf{G}{\mathsf{E}}^{\mathsf{+}}$ represents the theory of ZFC plus "for each $k$, there is a strongly $k$-huge cardinal".

Finite promise games

Each of the games is finite, predetermined in length, and has two players (Alice and Bob). At each turn, Alice chooses an integer or a number of integers (an offering) and the Bob has to make one of two kinds of promises restricting his future possible moves. In all games, Bob wins if and only if Bob has kept all of his promises.

Finite piecewise linear copy/invert games

Here, $\mathbb{\mathbb{Z}}$ is the set of integers, and $\mathbb{\mathbb{N}}$ is the set of non-negative integers. Here, all letters represent integers. We say that a map $T:{\mathbb{\mathbb{N}}}^k\to \mathbb{\mathbb{N}}$ is piecewise linear if $T$ can be defined by various affine functions with integer coefficients on each of finitely many pieces, where each piece is defined by a finite set of linear inequalities with integer coefficients. For some piecewise linear map $T:{\mathbb{\mathbb{N}}}^k\to \mathbb{\mathbb{N}}$, a $T$-inversion of $x$ is some $y_1,\dots ,y_k<x$ such that $T(y_1,\dots ,y_k)=x$. We then define the game $G(T,n,s)$ for nonzero $n,s$.

$G(T,n,s)$ has $n$ rounds, and alternates between Alice and Bob. At every stage of the game, Alice is required to play $x\in [0,s]$, called her offering, which is either of the form $y+z$ or $w!$, where $y$ and $z$ are integers previously played by Bob. Bob is then required to either:

• Accept $x$, thereby playing $x$ and promising that there will be no $T$-inversion of $x$ among the integers ever played by Bob. This promise applies to all past, present and future plays in the game.
• Reject $x$, thereby play a $T$-inversion of $x$ and promising that $x$ is never played by Bob.

In RCA₀, it can be proven that Bob always has a winning strategy for any given game. The game $G_m(T,n,s)$ is a modified version where Bob is forced to accept all factorial offers by Alice $>m$. Bob always has a winning strategy for $G_m(T,n,s)$ for sufficiently large $m,s$, although this cannot be proven in any given consistent fragment of $\mathsf{S}\mathsf{M}\mathsf{A}\mathsf{H}$, and only $\mathsf{S}\mathsf{M}\mathsf{A}{\mathsf{H}}^{\mathsf{+}}$. The function $FPLCI(a)$ is the smallest $N$ such that Bob can win $G_m(T,n,s)$ for any $(m,T,n,s)$ such that $m$ and $s$ are greater than or equal to $N$ and all the following values are less than $a$:

• $n$
• $k$ (the domain of $T$ is ${\mathbb{\mathbb{N}}}^k$)
• the number of pieces of $T$
• the absolute values of the coefficients of the inequalities in $T$
• the absolute values of the coefficients of the affine functions in $T$

Finite polynomial copy/invert games

Let $P:{\mathbb{\mathbb{Z}}}^k\to Z$ be a polynomial with integer coefficients. A special $P$-inversion at $x$ in $\mathbb{\mathbb{Z}}$ consists of $0<y_1,\dots ,y_n<\frac{x}{2}$ such that $P(y_1,\dots ,y_n)=x$. We now define the game $G(P,Q,n,s)$ for nonzero $n,s$, where $P,Q:{\mathbb{\mathbb{Z}}}^k\to \mathbb{\mathbb{Z}}$ are polynomials with integer coefficients. $G(P,Q,n,s)$ consists of $n$ alternating plays by Alice and Bob. At every stage of the game, Alice is required to play $x\in [-s,s]$ of the form $P(y)$, $Q(y)$ or $(z!)!$, where $y$ is a $k$-tuple of integers previously played by Bob. Bob is then required to either:

• Accept $x$, thereby playing $x$ and promising that there will be no special $P$- or $Q$-inversion of $x$ among the integers ever played by Bob. This promise applies to all past, present and future plays in the game.
• Reject $x$, thereby playing a special $P$- or $Q$-inversion of $x$ and promising that $x$ is never played by Bob.

Let $P,Q:{\mathbb{\mathbb{Z}}}^k\to \mathbb{\mathbb{Z}}$ be polynomials with integer coefficients. In RCA₀, it can be proven that Bob always has a winning strategy for any given game. If $m,s$ are sufficiently large then Bob wins $G_m(P,Q,n,s)$, which is $G(P,Q,n,s)$ where Bob is forced to accept all double factorials $>m$ offered by Alice. However, once again, this cannot be proven in any given consistent fragment of $\mathsf{S}\mathsf{M}\mathsf{A}\mathsf{H}$, and only $\mathsf{S}\mathsf{M}\mathsf{A}{\mathsf{H}}^{\mathsf{+}}$. The function $FPCI(a)$ is the smallest $N$ such that Bob can win $G_m(P,Q,n,s)$ for any $(m,P,Q,n,s)$ such that $m$ and $s$ are greater than or equal to $N$ and all the following values are less than $a$:

• $n$
• $k$ (the domain of the polynomials is ${\mathbb{\mathbb{Z}}}^k$)
• the degrees of $P$ and $Q$
• the absolute values of the coefficients of $P$ and $Q$

Finite linear copy/invert games

We say that $x,y\in {\mathbb{\mathbb{N}}}^k$ are additively equivalent if and only if $\sum _{q=1}^i{x}_q=\sum _{q=1}^j{x}_q⟹\sum _{q=1}^i{y}_q=\sum _{q=1}^j{y}_q$. For nonzero integers $p,n,s$ and $v_1,\dots ,v_p\in {\mathbb{\mathbb{N}}}^k$, we define the game $G(v_1,\dots ,v_p;n,s)$ which consists of $n$ alternating rounds between Alice and Bob. At every stage of the game, Alice is required to play an integer $x\in [0,s]$ of the form $y+z$ or $w!$, where $y,z$ are integers previously played by Bob. Bob is then required to either:

• Accept $x$, thereby playing $x$ and promising that $x$ cannot be written as $\sum _{q=1}^k{y}_q$, where $(y_1,\dots ,y_k)$ is additively equivalent to some $v_j$, and $y_1,\dots ,y_k$ are integers played by Bob at various times.
• Reject $x$, thereby playing $y_1,\dots ,y_k$, where $x=\sum _{q=1}^k{y}_q$ and $(y_1,\dots ,y_k)$ is additively equivalent to some $v_j$, and promises that $x$ is never played by Bob.

Let $v_1,\dots ,v_p\in {\mathbb{\mathbb{N}}}^k$. In RCA₀, it can be proven that Bob always has a winning strategy for any given game. Let $v_1,\dots ,v_p\in {\mathbb{\mathbb{N}}}^k$. If $m$ is sufficiently large, then Bob wins $G_m(v_1,\dots ,v_p;n,s)$, where Bob accepts all factorials $>m$ offered by Alice. However, once again, this cannot be proven in any given consistent fragment of $\mathsf{S}\mathsf{M}\mathsf{A}\mathsf{H}$, and only $\mathsf{S}\mathsf{M}\mathsf{A}{\mathsf{H}}^{\mathsf{+}}$. The function $FLCI(a)$ is the smallest $N$ such that Bob can win $G_m(v_1,\dots ,v_p;n,s)$ for any $(m,v_1,\dots ,v_p;n,s)$ such that $m$ is greater than or equal to $N$, $n,s$ are positive and all the following values are less than $a$:

• $k$
• $p$
• the number of components of each vector in $v$

Functions

As shown by Friedman, the three functions $FPLCI(a)$, $FPCI(a)$ and $FLCI(a)$ are extremely fast-growing, eventually dominating any functions provably recursive in any consistent fragment of $\mathsf{S}\mathsf{M}\mathsf{A}\mathsf{H}$ (one of these is ZFC), but they are computable and provably total in $\mathsf{S}\mathsf{M}\mathsf{A}{\mathsf{H}}^{\mathsf{+}}$.

Greedy clique sequences

${\mathbb{\mathbb{Q}}}^{*}$ denotes the set of all tuples of rational numbers. We use subscripts to denote indexes into tuples (starting at 1) and angle brackets to denote concatenation of tuples, e.g. $⟨(0,1),(2,3)⟩=(0,1,2,3)$. Given $a\in {\mathbb{\mathbb{Q}}}^{*}$, we define the upper shift of $a$, denoted $\text{<mrow data-mjx-texclass="ORD">us</mrow>}(a)$ to be the result of adding 1 to all its nonnegative components. Given $a,b\in {\mathbb{\mathbb{Q}}}^{*}$, we say that $a⪯b⟺\text{<mrow data-mjx-texclass="ORD">max</mrow>}(a)\le \text{<mrow data-mjx-texclass="ORD">max</mrow>}(b)$ and $a\prec b⟺\text{<mrow data-mjx-texclass="ORD">max</mrow>}(a)<\text{<mrow data-mjx-texclass="ORD">max</mrow>}(b)$. $a,b\in {\mathbb{\mathbb{Q}}}^{*}$ are called order equivalent if and only if they have the same length and for all $i,j$, $a_i<a_j$ iff $b_i<b_j$. A set $E\subseteq {\mathbb{\mathbb{Q}}}^{*}$ is order invariant iff for all order equivalent $x$ and $y$, $x\in E⟺y\in E$.

Let $H$ be a graph with vertices in ${\mathbb{\mathbb{Q}}}^{*}$. Let $E$ be the set defined as follows: for every edge $(x,y)$ in $H$, their concatenation $⟨x,y⟩$ is in $E$. Then if $E$ is order invariant, we say that $H$ is order invariant. When $H$ is order invariant, $H$ has infinite edges. We are given $k\in \mathbb{\mathbb{N}}$, $S\subseteq {\mathbb{\mathbb{Q}}}^{*}$, and a simple graph $G$ (or a digraph in the case of upper shift greedy down clique sequences) with vertices in $S$. We define a sequence $x$ as a nonempty tuple $(x_1,\dots ,x_n)$ where $x_i\in S$. This is not a tuple but rather a tuple of tuples. When $S={\mathbb{\mathbb{Q}}}^k$, $x$ is said to be an upper shift greedy clique sequence in ${\mathbb{\mathbb{Q}}}^k$ if it satisfies the following:

• $x_1$ consists only of zeroes.
• Let $m$ be an integer such that $2\le 2m\le k-1$, or a positive integer if we allow infinite sequences. $Y=⟨x_1,\dots ,x_{2m-1}⟩$ and let $y=(Y_m,\dots ,Y_{m+k-1})$. Then, $x_{2m}⪯y$, $(y,x_{2m})$ is not an edge of $G$, and $x_{2m+1}=\text{<mrow data-mjx-texclass="ORD">us</mrow>}(x_{2m})$.
• $\{x_2,\dots ,x_n\}$ is a clique in $G$, i.e. $G$ contains as an edge every pair of vertices in $\{x_2,\dots ,x_n\}$.

When $S={\mathbb{\mathbb{Q}}}^k$, $x$ is said to be an upper shift down greedy clique sequence in ${\mathbb{\mathbb{Q}}}^k$ if it satisfies the following:

• $x_1$ consists only of zeroes.
• Let $m$ be an integer such that $2\le 2m\le k-1$, or a positive integer if we allow infinite sequences. $Y=⟨x_1,\dots ,x_{2m-1}⟩$ and let $y=(Y_m,\dots ,Y_{m+k-1})$. Then, $x_{2m}=y$ or $x_{2m}\prec y$ and $(y,x_{2m})$ is not an edge of $G$; and $x_{2m+1}=\text{<mrow data-mjx-texclass="ORD">us</mrow>}(x_{2m})$.
• $\{x_2,\dots ,x_n\}$ is a down clique in $G$, i.e. for all $f,g\in \{x_2,\dots ,x_n\}$ and $g\prec f$, $(f,g)$ is an edge of $G$.

When $S={\mathbb{\mathbb{Q}}}^k\cup {\mathbb{\mathbb{Q}}}^{k+1}$, $x$ is said to be an extreme upper shift down greedy clique sequence in ${\mathbb{\mathbb{Q}}}^k\cup {\mathbb{\mathbb{Q}}}^{k+1}$ if it satisfies the following:

• $x_1$ consists only of zeroes.
• Let $m$ be an integer such that $2\le 2m\le k-1$, or a positive integer if we allow infinite sequences. $Y=⟨x_1,\dots ,x_{2m-1}⟩$ and let $y=(Y_m,\dots ,Y_{m+k-1})$. Then, $x_{2m}=y$ or $x_{2m}\prec y$ and $(y,x_{2m})$ is not an edge of $G$; and $x_{2m+1}=\text{<mrow data-mjx-texclass="ORD">us</mrow>}(x_{2m})$.
• If $x_{2m}\in [0,k{]}^k$, then $x_{2m+1}=(k+\frac{1}{2},\text{<mrow data-mjx-texclass="ORD">us</mrow>}(x_{2m}))$.
• If $x_{2m}\in {\mathbb{\mathbb{Q}}}^k\setminus [0,k{]}^k$, then $x_{2m+1}=\text{<mrow data-mjx-texclass="ORD">us</mrow>}(x_{2m})$.
• If $x_{2m}=(k+\frac{1}{2},z)$ and $x_{2m}\in {\mathbb{\mathbb{Q}}}^{k+1}$, then $x_{2m+1}={\text{<mrow data-mjx-texclass="ORD">us</mrow>}}^{-1}(z)$
• $\{x_2,\dots ,x_n\}$ is a down clique in $G$

The thread of $x$ is a subsequence $(u_1,\dots ,u_r)\in [1,n]$ defined inductively like so:

• $u_1=1$
• $u_{i+1}=\text{<mrow data-mjx-texclass="ORD">max</mrow>}(j\in [u_i,2^{u_1}]:x_j\prec x_{u_i})$

Given a thread $u$, we say that is open if $2^{u_r}\le n$. Using this Harvey Friedman defined three very powerful functions:

• $USGCS(k)$ is the smallest $N$ such that every simple, order invariant graph $G$ has an upper shift greedy clique sequence in ${\mathbb{\mathbb{Q}}}^k$ of length at most $N$ with an open thread.
• $USGDCS(k)$ is the smallest $N$ such that every order invariant digraph $G$ has an upper shift greedy down clique sequence in ${\mathbb{\mathbb{Q}}}^k$ of length at most $N$ with an open thread.
• $USGDC{S}_2(k)$ is the smallest $N$ such that every order invariant digraph $G$ has an extreme upper shift greedy down clique sequence in ${\mathbb{\mathbb{Q}}}^k\cup {\mathbb{\mathbb{Q}}}^{k+1}$ of length at most $N$ with an open thread.

$USGCS$ and $USGDCS$ eventually dominate all functions provably recursive in $\mathsf{S}\mathsf{R}\mathsf{P}$, but are themselves provably recursive in $\mathsf{S}\mathsf{R}{\mathsf{P}}^{\mathsf{+}}$. $USGDC{S}_2$ eventually dominates all functions provably recursive in $\mathsf{H}\mathsf{U}\mathsf{G}\mathsf{E}$, but is itself provably total in $\mathsf{H}\mathsf{U}\mathsf{G}{\mathsf{E}}^{\mathsf{+}}$.

References

• Friedman, Harvey (2009-09-02). "Finite Promise Games". https://cs.nyu.edu/pipermail/fom/2009-September/014007.html. 
• Friedman, Harvey (2009-12-30). "Upper Shift Greedy Clique Sequences and Large Cardinals 1". https://cs.nyu.edu/pipermail/fom/2009-December/014276.html. 
• Friedman, Harvey (2010-01-01). "Terrifically and Extremely Long Finite Sequences". https://cs.nyu.edu/pipermail/fom/2010-January/014282.html.