\section{A higher-dimensional obstruction at every budget} \label{sec:obstruction} The planar constant cannot be extrapolated to arbitrary dimension. The obstruction can exceed both the rare-point and balanced regular-simplex examples, as shown below at $(d,n)=(4,3)$: a simplex of rare points placed above a frequent anchor produces an additional loss mechanism. We first solve the selection problem exactly on this family, then optimize a tractable branch. The resulting expression is a \emph{lower bound} for the unrestricted profile; we do not identify it with the unknown optimum over all datasets. \subsection{An exact family of selection problems} Fix integers $k\geq2$ and $n\geq1$. Let $e$ be a unit vector and let $v_1,\ldots,v_k$ be the vertices of a unit regular $(k-1)$-simplex in $e^\perp$. Thus \[ \sum_{i=1}^k v_i=0,\qquad \langle v_i,v_j\rangle=-\frac1{k-1}\quad(i\ne j), \qquad \lVert v_i\rVert=1. \] These vectors can be realized in $\mathbb R^k$. For $00$, set \begin{equation}\label{eq:ob-family} x_0=0,\qquad x_i=\sqrt\rho\,e+v_i\quad(1\leq i\leq k), \qquad p_0=1-t,\qquad p_i=\frac tk. \end{equation} The mean and variance are \begin{equation}\label{eq:ob-moments} \mu=t\sqrt\rho\,e,\qquad V=t\bigl((1-t)\rho+1\bigr). \end{equation} Rational $t$ makes these masses the empirical distribution of a finite multiset of original examples. \begin{theorem}[Exact rare-simplex selection formula]\label{thm:ob-family} For the distribution in \eqref{eq:ob-family}, the minimum squared mean error normalized by $V$ is exactly \begin{equation}\label{eq:ob-exact-family} \mathcal R_{k,n}(t,\rho) =\min_{0\leq r\leq n} \frac{\displaystyle \rho\left(\frac rn-t\right)^2+ \frac{s_r(k-s_r)}{(k-1)n^2}} {t\bigl((1-t)\rho+1\bigr)}, \qquad s_r=r\bmod k. \end{equation} The integer $r$ is the total number of nonzero examples selected. For each fixed $r$, a minimizing selection distributes these draws as evenly as possible among the $k$ nonzero vertices and fills the remaining $n-r$ slots with $x_0$. \end{theorem} \begin{proof} Let $c_1,\ldots,c_k$ be the multiplicities of the nonzero vertices, so that $\sum_i c_i=r$. Orthogonality of $e$ and the simplex span gives \begin{align} \left\lVert\frac1n\sum_{i=1}^k c_i x_i-\mu\right\rVert^2 &=\rho\left(\frac rn-t\right)^2 +\frac1{n^2}\left\lVert\sum_{i=1}^k c_i v_i\right\rVert^2\notag\\ &=\rho\left(\frac rn-t\right)^2 +\frac{k\sum_i c_i^2-r^2}{(k-1)n^2}. \label{eq:ob-count-error} \end{align} If $c_i\geq c_j+2$, replacing $(c_i,c_j)$ by $(c_i-1,c_j+1)$ decreases $\sum_i c_i^2$ by $2(c_i-c_j-1)>0$. A minimum therefore has counts differing by at most one. Writing $r=ak+s_r$, its counts are $a+1$ on $s_r$ vertices and $a$ on the other $k-s_r$ vertices. Direct substitution yields \[ k\sum_i c_i^2-r^2=s_r(k-s_r). \] Every such selection is legal because repetitions are allowed and the remaining slots can be filled by $x_0$. Minimizing over $r$ and dividing by \eqref{eq:ob-moments} proves the formula. \end{proof} This calculation includes selections with more than $k$ nonzero draws. The residue $s_r$ is essential: once a complete copy of the rare simplex has been selected, its transverse contribution cancels exactly. \subsection{An explicit all-budget lower bound} \begin{theorem}[Rare-simplex obstruction in every dimension $k\geq4$] \label{thm:ob-main} For every $k\geq4$ and $n\geq2$, define \begin{align} A_{k,n}&=2n(k-2)-(k-3),\notag\\ \Delta_{k,n}&=(k-3)\bigl(2n(n-2)(k-2)+(k-3)\bigr),\notag\\ B_{k,n}&=\frac{A_{k,n}-\sqrt{\Delta_{k,n}}}{k n^2}. \label{eq:ob-bound} \end{align} Then the finite-dataset profile obeys \begin{equation}\label{eq:ob-profile} F(k,n)\geq 1+B_{k,n}. \end{equation} The same lower bound applies in any ambient dimension $d\geq k$ by isometric embedding. The expression $B_{k,n}$ is the maximum on the explicit family branch constructed in the proof, not an asserted value of $F(k,n)-1$. \end{theorem} \begin{proof} Put $u=nt$ and restrict it to \begin{equation}\label{eq:ob-interval} \frac321/(k-1)>0$ and $0k$, the true transverse numerator $s_r(k-s_r)$ is nonnegative, while $r(k-r)<0$. Hence the true error at such an $r$ is at least $Q(r)/n^2$, which in turn is at least $Q(1)/n^2$. This proves that the \emph{global} minimizing selections contain one or two distinct rare vertices, including when $n>k$. Substituting \eqref{eq:ob-rho} into the exact ratio gives \begin{equation}\label{eq:ob-Ru} R(u)=\frac{(k-3)u^2+4u-2k}{u(Du-2kn)}, \qquad D=2n(k-1)-k+3. \end{equation} Its denominator is positive on \eqref{eq:ob-interval}: after clearing the positive factor $(k-1)(2u-3)$, it is the variance denominator in \eqref{eq:ob-exact-family}. Define \[ H=kn(k-3)+2D=n(k^2+k-4)-2(k-3)>0. \] Differentiating \eqref{eq:ob-Ru} shows that the sign of $R'(u)$ is the negative of the sign of \begin{equation}\label{eq:ob-derivative-poly} P(u)=Hu^2-2kDu+2k^2n. \end{equation} There is a unique root of $P$ in the interval \eqref{eq:ob-interval}. To check this without an implicit admissibility assumption, observe that \begin{align*} 4P(3/2) &=(k-3)\bigl(-n(7k-12)+6(2k-3)\bigr)<0,\\ P(k/2) &=\frac{k^2(k-3)}4\bigl(n(k-4)+2\bigr)>0. \end{align*} For the other possible upper endpoint, write $P(n)=n f(n)$, where \[ f(n)=n^2(k^2+k-4)-n(4k^2-2k-6)+4k^2-6k. \] Here $f(2)=2k-4>0$, $f'(2)=6k-10>0$, and $f''(n)>0$. Thus $P(n)>0$ for $n\geq2$. Since $P$ has positive leading coefficient and is negative at $3/2$, its larger root is the unique root between $3/2$ and either upper endpoint. It is therefore the unique maximizer of $R$ in \eqref{eq:ob-interval}. The discriminant calculation gives \begin{equation}\label{eq:ob-ustar} u_* = \frac{k\bigl(D+\sqrt{\Delta_{k,n}}\bigr)}{H}, \qquad D^2-2nH=\Delta_{k,n}. \end{equation} Substitution into \eqref{eq:ob-Ru} yields $R(u_*)=B_{k,n}$. Equivalently, the critical values satisfy \[ k^2 n^2 B^2-2k A_{k,n}B+2(k-1)(k-2)=0; \] the larger-$u$ critical point gives its smaller root, which is \eqref{eq:ob-bound}. It remains to connect real probability weights to the finite-dataset supremum. If $t_*=u_*/n$ is rational, the construction is already a finite empirical multiset. Otherwise choose rational $t_\ell\to t_*$ in $(0,1)$ and keep the geometric parameter $\rho_*$ fixed. The expression \eqref{eq:ob-exact-family} is a minimum of finitely many continuous functions of $(t,\rho)$ with strictly positive denominator near $(t_*,\rho_*)$. It is therefore continuous there. For each $\ell$, the probabilities $1-t_\ell,t_\ell/k,\ldots,t_\ell/k$ are realized by integer multiplicities in a finite multiset, and its exact excess ratio tends to $B_{k,n}$. Replicating all multiplicities, if needed, ensures that its total size is at least $n$. Taking the supremum over finite datasets proves \eqref{eq:ob-profile}. This argument makes no claim of finite attainment at an irrational maximizing mass. \end{proof} For numerical evaluation one may avoid subtraction of nearly equal terms by using the equivalent expression \begin{equation}\label{eq:ob-stable} B_{k,n}=\frac{2(k-1)(k-2)}{k\bigl(A_{k,n}+\sqrt{\Delta_{k,n}}\bigr)}. \end{equation} It follows from $A_{k,n}^2-\Delta_{k,n}=2n^2(k-1)(k-2)$. \subsection{The planar law fails in dimension four at every budget} \begin{corollary}[Strict four-dimensional separation]\label{cor:ob-four} For every $n\geq2$, \begin{equation}\label{eq:ob-four} F(4,n)\geq 1+\frac{4n-1-\sqrt{4n^2-8n+1}}{4n^2} >1+\frac1{2n-1}. \end{equation} Consequently the planar profile $2n/(2n-1)$ is false for every $n\geq2$ in every dimension $d\geq4$. \end{corollary} \begin{proof} Set $k=4$ in Theorem~\ref{thm:ob-main}. For the strict inequality, let \[ C=\frac{4n^2-6n+1}{2n-1}>0. \] The exact identity \[ (4n^2-6n+1)^2-(4n^2-8n+1)(2n-1)^2=4n^2>0 \] implies $C>\sqrt{4n^2-8n+1}$. Rearrangement gives the strict comparison in \eqref{eq:ob-four}. Embedding the same data in $\mathbb R^d$ proves the last statement. \end{proof} At $n=2$, the bound reduces to $B_{k,2}=(k-1)/(2k)$, the known dimension-dependent branch of the exact pair-selection theorem~\cite{pair}. At $(k,n)=(4,3)$ it gives \begin{equation}\label{eq:ob-four-three} F(4,3)\geq 1+\frac{11-\sqrt{13}}{36} \approx 1.205401353459334. \end{equation} The familiar rare-point obstruction gives $1.2$ in this cell, while the largest uniform-simplex obstruction among at most five vertices is smaller. Thus \eqref{eq:ob-four-three} establishes that those two elementary obstruction families do not determine the higher-budget profile. \subsection{A finite witness with integer coordinates} The strict separation does not rely on irrational limiting masses. Consider the following dataset in $\mathbb R^4$: \begin{center} \begin{tabular}{c c r} \toprule Atom & Coordinates & Multiplicity\\ \midrule $x_0$ & $(0,0,0,0)$ & $52$\\ $x_1$ & $(4,3,3,3)$ & $19$\\ $x_2$ & $(4,3,-3,-3)$ & $19$\\ $x_3$ & $(4,-3,3,-3)$ & $19$\\ $x_4$ & $(4,-3,-3,3)$ & $19$\\ \bottomrule \end{tabular} \end{center} The total size is $128$, the rare mass is $t=19/32$, and direct moment calculation gives \[ \mu=(19/8,0,0,0),\qquad V=\frac{1273}{64}. \] At budget $n=3$, the best squared mean errors for $r=0,1,2,3$ nonzero draws are respectively \[ \frac{361}{64},\qquad \frac{2353}{576},\qquad \frac{2353}{576},\qquad \frac{361}{64}. \] The balancing argument in Theorem~\ref{thm:ob-family} shows that every unbalanced count pattern has at least the displayed error for its value of $r$. Hence \begin{equation}\label{eq:ob-rational-witness} \frac{L_D^*(3)}{V} =1+\frac{2353}{11457} =\frac{13810}{11457} >\frac65, \qquad \frac{13810}{11457}-\frac65=\frac{308}{57285}>0. \end{equation} All coordinates, masses, moments and comparisons are rational. Exhausting the $\binom{7}{4}=35$ count vectors of total size three independently checks the optimum; the proof above establishes why those are the only relevant cases. \subsection{Asymptotic dimension dependence and normalization} \begin{corollary}[A dimension-dependent asymptotic obstruction] \label{cor:ob-asymptotic} For fixed $k\geq4$, \begin{equation}\label{eq:ob-asymptotic} \liminf_{n\to\infty}n\bigl(F(k,n)-1\bigr) \geq\gamma_k, \qquad \gamma_k=\frac{2(k-2)-\sqrt{2(k-2)(k-3)}}{k}. \end{equation} Here $\gamma_4=1/2$, $\gamma_k>1/2$ for $k>4$, and $\lim_{k\to\infty}\gamma_k=2-\sqrt2$. \end{corollary} \begin{proof} Divide \eqref{eq:ob-bound} by its powers of $n$ and take the limit at fixed $k$. For strict comparison with $1/2$, note that $3k-8>0$ and \[ (3k-8)^2-8(k-2)(k-3)=(k-4)^2. \] This proves equality at $k=4$ and strictness for $k>4$. Dividing the definition of $\gamma_k$ by $k$ proves the final limit. \end{proof} The order of limits in this corollary is explicit: first $n$ tends to infinity at fixed dimension, then the dimension varies. The result supplies a necessary constant for any proposed dimension-dependent replay law. It does not identify the full asymptotic optimum. Radius-normalized approximate Carath\'eodory bounds and the present variance-normalized bounds measure different quantities. In the maximizing family above, $t_*=\Theta(1/n)$ at fixed $k$, the support radius remains bounded, $V=\Theta(1/n)$, and the optimal squared mean error is $\Theta(1/n^2)$. Consequently a squared error of order $1/n^2$ corresponds to excess loss of order $1/n$ after division by $V$. This explains why a sharp radius-based approximation result does not establish the planar variance law in higher dimension. \subsection{Additional branches with prescribed rare counts} The construction admits a broader exact parametric family. Let $j\geq1$ satisfy $2j+1k$ proves that globally minimizing selections contain $j$ or $j+1$ distinct rare vertices. Their exact normalized error is \begin{equation}\label{eq:ob-general-branch} R_j(u)= \frac{(k-h)u^2+2Ju-kJ} {u\bigl((2n(k-1)-k+h)u-2kjn\bigr)}. \end{equation} Every rational admissible $u$ gives a finite-data lower bound. If an interior stationary value $R$ is used, it must satisfy \begin{align} &\frac{k^2jn^2}{j+1}R^2 -k\bigl(2n(k-j-1)-(k-2j-1)\bigr)R\notag\\ &\hspace{42mm}+(k-j)(k-j-1)=0. \label{eq:ob-general-critical} \end{align} This identity follows by requiring the quadratic numerator of $R_j(u)-R$ to have a double root. Any candidate root still requires an admissible $u$ in the displayed interval. Theorem~\ref{thm:ob-main} proves that placement uniformly for $j=1$; no unverified placement or global-optimality claim is needed for the other branches. \section{An exact fixed-mass minimax theorem and a matching coupling} \label{sec:ob-minimax} The lower-bound construction also has a matching upper certificate when its probability masses are fixed. This resolves a family of minimax problems over \emph{all} point geometries, while leaving the unrestricted optimization over probability vectors separate. For $0