Generically globally rigid graphs have generic universally rigid frameworks (Q2182252)

A framework in \(\mathbb{R}^d\) is a pair \((G,\mathrm{p})\), where \(G\) is a finite graph with \(n\) vertices and \(\mathrm{p}:=(\mathrm{p}_1,\ldots,\mathrm{p}_n)\) is a realization of its vertices in \(\mathbb{R}^d\). A framework \((G,\mathrm{p})\) for \(G\) is \textit{globally rigid} in \(\mathbb{R}^d\) if every framework \((G,\mathrm{q})\) for \(G\) in \(\mathbb{R}^d\), with edges of the same length as \((G,\mathrm{p})\), is congruent to \((G,\mathrm{p})\). A framework \((G,\mathrm{p})\) is \textit{universally rigid} if every framework \((G,\mathrm{q})\) for \(G\) in any finite-dimensional Euclidean space, with the same edge lengths, is congruent to \((G,\mathrm{p})\). A graph \(G\) is \textit{generically globally rigid} in \(\mathbb{R}^d\) if every ``generic framework'' for \(G\) is \textit{globally rigid}. The authors prove that any graph \(G\) that is generically globally rigid in \(\mathbb{R}^d\) has a realization in \(\mathbb{R}^d\) that is both generic and universally rigid. This implies that \(G\) must also have a realization in \(\mathbb{R}^d\) that is both infinitesimally rigid and universally rigid.