Aumann (1974) showed that an atomless public randomization device makes the feasible- and equilibrium-payoff sets of a game with a fixed information structure convex, and asked whether they are closed. We show that, in every case the question leaves open, they need not be. One information structure drives all the examples: two sequences of fair signs whose coordinate correlations increase to a ceiling $ρ<1$ that no pair of separately measurable square-integrable rules attains. For every $0<ρ<1$ it yields a three-player game with a public randomization device whose equilibrium-payoff set is exactly the open interval $\{(0,0,t):-ρ<t<ρ\}$; a two-player game with a public randomization device whose equilibrium-payoff set is convex, full dimensional, and not closed; and, without any public device, nonclosed feasible- and equilibrium-payoff sets, the latter along equilibria with unique best replies modulo null events whose payoffs approach a vector that is not even feasible. With distinct but mutually absolutely continuous subjective priors, even the feasible-payoff set can fail to be closed in the presence of an objective public randomization device, together with every $\varepsilon$-equilibrium payoff set and the set of induced law tuples. Our construction also allows us to resolve a conjecture of Stinchcombe (2011). The main results and the lemmas supporting them are formalized in the Lean proof assistant; an appendix records the exact coverage of each statement, including the clauses for which only a paper proof is given.