Jia Li
Let \(0\leqslant k<n\), and let \(\mathcal N(k,n)\) denote the supremum of the cardinalities of finite families of affine \(k\)-planes in \(\R^n\) whose pairwise Euclidean separation distances are all equal to one. For \(k=1\), the finiteness of \(\mathcal N(1,n)\) was recently established by Solymosi and Zahl. We extend this result to affine subspaces of arbitrary dimension and prove the fully explicit bound \[ \mathcal N(k,n) \leqslant 2^{\,2^{\,10(k+1)(n-k)}}. \] The main difficulty in higher dimensions is that the rational distance formula degenerates along several possible rank strata of \(\dim(U+V)\), rather than only along the parallel locus. For each fixed rank \(r\), we replace the choice of a nonvanishing Gram minor by a global sum-of-squares expression involving all minors. This produces a polynomial relation \(H_r(x,y)=0\) which encodes both the unit-distance equation and an upper-rank condition, while also vanishing on the diagonal. We propagate this relation by means of the restricted Zariski closure and decompose the resulting algebraic set into an explicitly bounded number of connected Nash submanifolds. An analytic diagonal approximation argument shows that, within each Nash piece, the maximal possible value of \(\dim(U_x+U_y)\) must decrease. Iterating this rank descent over all possible ranks and combining the finitely many standard affine Grassmann charts yields the stated double-exponential upper bound.