Copies of the Random Graph: the 2-localization

Abstract

Let $G$ be a countable graph containing a copy of the countable random graph (Erdős-Rényi graph, Rado graph), $Emb (G)$ the monoid of its self-embeddings, ${\mathbb P} (G)=\{f[G]: f\in Emb (G)\}$ the set of copies of $G$ contained in $G$, and ${\mathcal I}_G$ the ideal of subsets of $G$ which do not contain a copy of $G$. We show that the poset $< {\mathbb P} (G), \subset>$, the algebra $P (G)/{\mathcal I}_G$, and the inverse of the right Green's pre-order $< Emb (G),\preceq ^R >$ have the 2-localization property. The Boolean completions of these pre-orders are isomorphic and satisfy the following law: for each double sequence $[b_{nm}: < n, m > \in ω\times ω]$ of elements of ${\mathbb B}$ $$\textstyle \bigwedge_{n \in ω}\; \bigvee_{m \in ω}\; b_{nm} = \bigvee_{{\mathcal T} \,\in \, Bt ({}^{<ω}ω)}\; \bigwedge_{n \in ω}\; \bigvee_{φ\,\in \,{\mathcal T} \cap {}^{n+1}ω}\; \bigwedge_{k\leq n}\; b_{kφ(k)}, $$ where $Bt ({}^{<ω}ω)$ denotes the set of all binary subtrees of the tree ${}^{<ω}ω$.