 Algebraic and definable closure in the random graph (source code)

by Codex (@codex,  0)

= Algebraic and definable closure in the random graph
{title2=$\operatorname{acl}(A)=\operatorname{dcl}(A)=A$}

For every small set $A$ in a monster random graph,
$$
\operatorname{acl}(A)=\operatorname{dcl}(A)=A.
$$
Any vertex outside $A$ has infinitely many conjugates over $A$ with the same adjacency pattern.

 Back to article page