In this paper
AbstractIntroductionThe geometric questionHistorical and analytic contextMain resultsProof strategyGeometric reductions and exact distance evaluationRational subspaces and real raysA full-support averaging lemmaOdd-center witnesses and complete periodsLattice coverings and finite product boundsWhy a finite vertex certificate is sufficientDimension eightDimension nineHigh directions and exceptional planesExceptional directions, a norm bound, and the full censusDimension tenThe base census and the plane boundAdditional KZ inputs and short relationsComplete Gram extension and exact exclusionsThe special family and the final branch ledgerIntersection at the critical radiusThe deficit in general dimensionNormalization of the theta-block invariantFourier expansion and a uniform comparisonThe lower bound, including repeated speedsThe upper bound with prescribed total multiplicityConsequences and the limits of the boundsVerification and further questionsExact certificates and verification levelsArchived verification recordsFurther questionsAI assistance declarationData and code availabilitySingle-tail, two-tail and interval certificatesA single appended coordinateTwo appended coordinatesExact whole-interval skippingThe three-tail covering certificateVerification map for the supplementary archiveReferencesWorksMathematics
Euclidean view-obstruction in dimensions eight to ten and the asymptotic deficit
Abstract
The Euclidean view-obstruction problem asks for the critical radius of balls centered at the half-integer lattice that meet every positive ray from the origin. Writing for its square, we determine , and by computer-assisted proofs using Kahlon's seven-dimensional theorem.The upper bounds combine full-support subspace averaging, projected lattice coverings and exact finite certificates; dimension ten also requires a finite search through short integer relations. Explicit directions attain all three values, including a ten-dimensional direction previously listed by Gritsenko, Skoruppa and Zagier. In arbitrary dimension, we express their theta-block invariant in geometric normalization and derive the known bounds , with repeated coordinates allowed throughout. Thus , while the deficit tends to infinity more slowly than every positive power of . The supplementary archive contains the executable verifiers, exact certificates and archived verification records.
2020 Mathematics Subject Classification. Primary 11H31; Secondary 11H06, 11H55, 42A05.
Keywords: view obstruction; Euclidean balls; lattice covering radius; Korkin–Zolotarev reduction; computer-assisted proof; theta blocks; trigonometric polynomials.
Introduction
The geometric question
Consider a periodic array of identical opaque balls, with one ball centered at every point of
An observer is at the origin. A viewing direction is blocked if the ray meets at least one of the balls; tangency counts as intersection. The problem asks for the threshold radius at which all such directions are blocked. The half-lattice translation avoids placing an obstacle at the observer and makes the coordinate symmetries explicit. Only positive directions are considered, but repeated coordinates are allowed throughout.
For a precise definition, let be the infimum of the radii that block every positive ray, and put . If the reference ball has diameter one and its dilation factor is denoted by , then
This conversion is essential when comparing the older literature with squared-distance computations.
The geometry has an equivalent periodic formulation. For , define
where and denotes the fractional part of . Then
The reduction, including the distinction between an infimum and actual intersection at the critical radius, is proved in § 2. Multiplication of by a positive integer does not change . One may therefore restrict the supremum to primitive vectors, although the finite censuses deliberately include all their multiples.
The integral of is . Consequently . Determining the exact constant requires a direction that remains as far as possible from the shifted lattice over an entire period, together with an upper bound valid for infinitely many directions. The second requirement is the central obstacle to a finite computation.
Historical and analytic context
The problem originates in Cusick’s papers of 1972–1974 [7, 8, 9], which formulate view obstruction in the geometry of numbers. The replacement of balls by axis-parallel cubes connects the problem with simultaneous Diophantine approximation and the lonely runner problem [22, 10]. For a cube of side centered at a half-integer point, intersection means that, at some time , all coordinates satisfy
For a ball the condition instead bounds the sum of the squared deviations from half-integers. This coupling of coordinates leads naturally to projected lattices and covering radii.
For spheres, Dumir and Hans-Gill determined the three-dimensional constant in 1986 [11]. Chen studied dimensions three and four in 1994 [4, 5]; Dumir, Hans-Gill and Wilker treated dimension four in 1994 and dimension five in 1996 [13, 14]. The general theory of rational subspaces, critical parameters and related isolation phenomena was developed in [12, 15]; Chen also studied the connection with Kronecker’s theorem [6]. Kahlon’s preprint [17] proves the values in dimensions six and seven using exact lattice searches and transference bounds, including Banaszczyk’s theorem [1]. Our use of that preprint is confined to its seven-dimensional upper bound and to the context of the method. The computations in dimensions eight, nine and ten are separate from those of Kahlon and are supplied with this paper.
A second connection is to theta blocks. Gritsenko, Skoruppa and Zagier [16 Sections 5–6] study the same minimum of a sum of periodic quadratics, with a factor-of-two change of normalization. Their Theorem 5.3 already establishes logarithmic and cubed-logarithmic bounds for the corresponding deficit. We give a geometric formulation of their asymptotic theorem and a detailed derivation that includes repeated coordinates. The analytic inputs are Littlewood’s inequality [20, 18] and the integer-coefficient cosine-polynomial construction of Belov and Konjagin [2]. The experimental table in [16 Table 2] also supplies the lower bounds and in dimensions eight and nine. The corresponding values considered here are and . The direction and its ten-dimensional lower bound already appear in [16 Table 2], after normalization. For this direction, the further finite-dimensional task is to prove the matching global upper bound.
Main results
The finite-dimensional contribution consists of the exact constants in dimensions eight through ten, the finite reductions proving their upper bounds, and explicit directions attaining them. The computations are organized into three components: plane classification and a bounded direction census in dimension eight; an enlarged catalogue, fourth-moment constraints and a bounded census in dimension nine; and a finite relation-lattice search in dimension ten. Appendix § 13 relates these proof components to the supplementary archive.
Theorem 1.1 (Exact constants). The squared critical radii in dimensions eight, nine and ten are
The respective primitive attaining directions can be chosen as
For each of these three dimensions, balls of radius itself block every positive real ray.
The theorem supplies one attaining direction in each dimension. The repeated entry in is intentional; equality directions need not have distinct coordinates. The dependency order of the upper bounds is
The dimension-ten proof also uses the published KZ inequalities of Pendavingh and van Z&#xwam [21], with their positive error terms retained.
Theorem 1.2 (Known asymptotic bounds in geometric normalization). Set . There are absolute constants such that for every ,
In particular,
All logarithms are natural. The bounds in (4) are the bounds of [16 Theorem 5.3] after normalization. § 7 gives a derivation from the two stated analytic inputs for arbitrary positive integer multisets. Determining the precise order of remains open.
Proof strategy
The proof has three stages. First, the closure of a real ray on the torus reduces the geometric problem to rational subspaces. An averaging lemma bounds a full-support subspace of dimension by , and a finite quadratic calculation evaluates any fixed integer direction.
Second, projected lattices transfer the remaining upper-bound problem to Korkin–Zolotarev heights. Covering estimates and plane bounds constrain their product. In dimensions eight and nine this produces a finite norm bound for every possible counterexample. Dimension ten additionally uses bounded short relations and a finite sequence of Gram-matrix extensions. Exact finite certificates close these reductions; their verification and the recorded coverage checks are described in § 8 and Appendix § 13.
| An attaining direction | Source | ||
| 1 | 0 | (1) | Immediate |
| 2 | 1/20 | (1, 2) | [9] |
| 3 | 3/28 | (1, 2, 3) | [11] |
| 4 | 11/60 | (1, 1, 2, 3) | [5, 13] |
| 5 | 41/168 | (2, 3, 5, 7, 9) | [14] |
| 6 | 107/312 | (2, 3, 5, 7, 9, 12) | [17] |
| 7 | 73/180 | (1, 3, 4, 7, 8, 10, 11) | [17] |
| 8 | 8/17 | (1, 2, 3, 4, 5, 7, 9, 11) | Section 4 |
| 9 | 1087/1980 | (2, 3, 5, 7, 8, 11, 13, 15, 18) | Section 5 |
| 10 | 7/11 | (1, 1, 2, 3, 4, 5, 6, 7, 8, 9) | Section 6 |
Table 1. Squared critical radii and one attaining direction. Rows 8–10 give the exact constants established in this paper.
Finally, in arbitrary dimension a Fourier expansion connects the distance function to cosine sums. The McGehee–Pigno–Smith inequality gives the logarithmic lower bound for the deficit, including repeated speeds. A nonnegative integer-coefficient construction of Belov–Konyagin gives the cubed-logarithmic upper bound. This argument is independent of the finite certificates.
Geometric reductions and exact distance evaluation
This section relates positive real rays to rational subspaces and gives an exact finite calculation for a fixed integer direction. These two reductions separate the global upper-bound problem from the verification of explicit lower bounds.
Rational subspaces and real rays
For a rational subspace , write
Call full-support if it is contained in no coordinate hyperplane. A subspace containing a positive vector has this property; the converse need not hold. We use full-support statements because they remain invariant under independent changes of coordinate signs.
Proposition 2.1. The identity (3) holds for the critical radius defined as an infimum. For a positive real vector , let be the smallest rational linear subspace containing . Then
Proof. The continuous version of Kronecker’s theorem identifies the closure of the positive orbit with ; see the view-obstruction formulation in [12, 17]. Every tail of this positive orbit has the same closure. The squared distance to is continuous on the torus, so its infimum on the orbit is its minimum on that subtorus. This minimum equals .
Since is rational and is a nonempty relatively open set, it contains a positive rational vector, hence a positive integer vector . Thus . Integer directions are themselves allowed real directions, giving equality of the two suprema. A radius strictly above their square root blocks every ray, and a radius strictly below it misses some ray. This proves the assertion about the infimum. ∎
At the critical radius, an orbit with an unattained distance infimum requires separate care. For dimensions eight through ten the strict subspace margins established below settle this point.
A full-support averaging lemma
Lemma 2.2. If is a full-support rational subspace of dimension , then .
Proof. Let be an integral basis matrix for , with rows , and let . For uniform , set . Each is nonzero, so has mean zero and second moment . If are linearly independent, their joint character map is onto , and . Otherwise write , for a primitive integral row and nonzero integers . The Fourier series of the periodic sawtooth, or direct integration over a common period, gives
Their product is nonnegative, including when . Hence , and . Since and for an integer vector , is the negative of the orthogonal residual of a half-integer center. Every such squared residual is at least .
Odd-center witnesses and complete periods
For , put . Every odd integer vector gives the valid upper bound
This inequality needs no assumption that is the nearest center at the orthogonal projection time. To establish a lower bound, however, one must minimize over all possible times, not merely exhibit a witness.
On , form the ordered union of , and all crossing times in that interval. Inside each resulting cell the nearest odd center is fixed, say , and
Its minimum on the closed cell is obtained by clipping to . The minimum of these cell minima is , since . All quantities are rational. This is also an independent way to audit a fast nearest-center sweep, whose projection values are useful as upper witnesses.
For the three displayed directions, the numbers of half-period cells are 16, 32 and 14. Complete clipped calculations give the minima in Theorem 1.1. The squared norms are respectively 306, 990 and 286. The last direction reproduces the lower bound in [16 Table 2]. Equality times in are
The supplementary verifier regenerates all cells, odd centers, clipped minimizers and exact values using rational arithmetic. These calculations establish the three lower bounds independently of the upper-bound censuses and relation searches.
Lattice coverings and finite product bounds
We next bound the distance to a rational subspace through covering radii of projected lattices. The resulting inequalities reduce a global upper bound to a finite product calculation. Background on reduced bases and reciprocal lattices can be found in [3, 19]. For a rational -dimensional subspace , let . The lattice has rank and squared covolume . Indeed its dual is , and complementary primitive subgroups of the unimodular lattice have equal covolumes. Choose a Korkin–Zolotarev (KZ) basis of , and let be its squared Gram–Schmidt lengths. Then
The second assertion follows from the shortest-vector property in each projection and a size-reduction coefficient of absolute value at most .
Lemma 3.1 (Fiber covering). Let be obtained by adjoining integer lifts of the first projected basis vectors to . If is full-support, then
where is the covering radius of the lattice generated by those first projected vectors in their span.
Proof. Choose a half-integer center minimizing the normal distance to . Adding an integer combination of the chosen lifts leaves this normal component unchanged and changes the component in by an element of the prefix lattice. Choose such a combination with remaining component of norm at most . The two errors are orthogonal. The second inequality is Lemma 2.2.
Lemma 3.2 (Adjacent two-dimensional blocks). For adjacent KZ heights , the corresponding projected rank-two lattice has covering radius squared at most
For a matching of disjoint adjacent pairs in , define
Then .
Proof. Write the two-dimensional basis as and , with and . Triangulating a fundamental parallelogram gives the squared circumradius bound
This expression decreases with on : after scaling , its derivative has the sign of , which is nonpositive because . If , the value at suffices. If , set and use to obtain . The required comparison reduces to . Round successive blocks from the end of a prefix, adding the orthogonal squared errors. Finally replace by , which only enlarges the upper bound.
Why a finite vertex certificate is sufficient
The inequalities (8) and (9)–(11) produce rational polyhedra in the positive heights. The objective is a lower bound on their product, hence an upper bound on or . For the unbounded polyhedra used here, the following detail is needed. Every coordinate has a positive lower bound, and every recession direction satisfies , . Thus all its coordinates are nonnegative. By the vertex–recession decomposition of a pointed polyhedron [23], any feasible point is a convex combination of vertices plus a nonnegative recession vector. Increasing coordinates cannot decrease their product. Concavity of then shows that the product is bounded below by the smallest vertex product. This argument does not presume compactness.
The vertex-traversal programs first relax each right-hand side by a fixed, tiny positive rational number. The feasible region expands, so a lower bound on the expanded region remains valid for the original one. Exact inverse-matrix and slack checks establish simplicity of each visited vertex. Releasing each active constraint identifies every outgoing edge by rational ratio comparisons, or certifies it as unbounded. Closure of the queue, together with connectivity of the vertex graph, establishes exhaustiveness. The perturbation is not trusted generically: nondegeneracy is checked at every vertex. All products and comparisons use arbitrary-precision integers.
Dimension eight
Put . We first reduce a classification of full-support planes to finite checks, then bound the norm of a putative counterexample. The supplementary archive contains the exact certificates for the plane classification, the norm bound and the final direction census.
Proposition 4.1 (Eight-dimensional plane certificate). Every full-support rational plane satisfies , unless, up to signed coordinate permutations, its saturated integer lattice has basis matrix
For this exceptional plane, , , and .
Proof and finite certificate. Suppose . There are six projected KZ heights. The ordinary nearest-plane bound in (9), with , implies
Relax the strict inequalities. At a tight prefix , subtraction of the preceding prefix inequality gives , whereas the next prefix gives . Thus the ratio constraint immediately following a tight prefix cannot also be tight. At a vertex, active ratio edges consequently form geometric blocks, each terminated by a tight prefix. The blocks are precisely the 32 compositions of 6; the first block has sum equal to its length minus 21/25, and each subsequent block has sum equal to its length. The positive coordinate bounds and the recession argument of § 3 reduce the product minimum to these vertices. Their exact products give , hence .
Choose a Gauss-reduced basis of , and write
Then , so . If , contains a coordinate axis, and deletion of that coordinate, followed by (3) in dimension seven, gives .
The remaining finite classification is implemented by verify_planes.js. It first covers all 174 047 114 sorted positive eight-tuples of squared norm at most 4000, retaining only 195 not certified below 43/100. Let be their norm set. No norm is in , so cannot have full support. For every with whose norm is not in , must have a zero coordinate. Distinct require distinct nonzero coordinates of ; there are at most of them. All relevant lie in . This leaves ten Gram matrices.
For each forced zero at , a row of the basis matrix is with . Enumerating these rows and all completions with the prescribed Gram matrix yields 63 row multisets, of which 45 are saturated. Saturation is checked by the gcd of all minors. Forty-four have explicit odd-center witnesses at most 43/100; the remaining matrix is (12). For it, the all-ones odd vector gives . These finite row and witness checks are retained in planes_certificate.json.
Suppose now that a primitive has , and put . The first projected KZ vector lifts to a plane . Since this vector is primitive in the projected lattice, the lift together with is a saturated basis of , so . If is exceptional, the one-dimensional fiber bound gives
Otherwise, . For every prefix and adjacent matching, (9) implies
Together with the six adjacent KZ constraints and the bound, these are 60 inequalities. The exact outward-perturbed vertex check visits 2933 vertices, 19 830 directed bounded edges and 701 unbounded edges, proving . Thus every strict counterexample must have .
The complete direction census at this bound contains 18 766 118 836 sorted positive eight-tuples. It certifies
for odd-center witnesses, either individually or for whole families by the extension bounds in Appendix § 11. The recorded disjoint counts are
| Deletion using the seven-dimensional theorem | 507 096 272 |
| Whole tails from a seven-coordinate center | 18 246 848 326 |
| Adaptive whole-tail bounds | 10 229 385 |
| Individual additional centers | 1 944 853 |
Their sum agrees with an independent generating-function count; the 790 944 734 extendable seven-coordinate prefixes also agree. No counterexample remains. The exact period evaluation of supplies the matching lower bound, proving .
Dimension nine
Put . Here a larger low-norm catalogue and fourth-moment constraints make the plane classification finite and manageable. The supplementary archive records the catalogue, the plane certificates and the complete partitioned census used below.
High directions and exceptional planes
The complete census of sorted positive nine-tuples with contains 29 044 309 143 tuples. Retaining every tuple not proved at most gives 2368 directions and 1365 distinct squared norms. Each retained distance is checked by the clipped rational cell method. Their maximum is ; within this catalogue its attainers are . This local observation is not a global uniqueness assertion.
Proposition 5.1 (Nine-dimensional plane certificate). A full-support rational plane in either has or admits, after signed coordinate permutations, one of the seven bases in Table 2. In particular, every such plane has .
| Rows | |||
| 75 | |||
| 75 | |||
| 450 | |||
| 576 | |||
| 576 | |||
| 2352 | |||
| 2352 |
Table 2. Exceptional nine-dimensional plane bases, written as ordered lists of rows. The last column is an upper bound, not an asserted exact offset.
Table 2: Exceptional nine-dimensional plane bases, written as ordered lists of rows. The last column is an upper bound, not an asserted exact offset.
Proof and finite certificate. If , the seven projected heights satisfy
With the six KZ chain constraints this gives 59 inequalities. Exact traversal of 3181 vertices, 21 480 directed bounded edges and 787 unbounded edges proves . Thus a reduced Gram matrix has and . The case is excluded using .
For the 1 735 940 remaining Gram triples, set . If but its norm is absent from the high catalogue, must have a zero coordinate. The relevant range is . The maximum number of such zeros is if is absent from the catalogue, and otherwise. Moreover the residual Gram matrix after subtracting the forced matrices must be positive semidefinite. These tests leave 713 triples. Let be the set of fourth moments of retained vectors of norm . The polynomial must have degree at most four, and except at the allowed zero-coordinate positions must belong to . If the zero-coordinate allowance is and positions have empty , then any nonempty positions contain five genuine full-support positions. The program checks that enough positions exist, enumerates every such five-point selection and value choice, and interpolates exactly. Integer coefficient, moment and compatibility tests leave 282 polynomials on 261 Gram triples.
Writing , complete enumeration of the second and fourth moments of and , followed by all pairings and signs, enforces
The Cauchy, convexity and rearrangement bounds used to shorten this search are necessary conditions only. There are 449 row matrices, 119 saturated. For an odd vector , put , , . Its squared residual is
Saved witnesses bound 112 matrices by 51/100; the seven remaining matrices have the bounds in Table 2, using the all-minus-ones vector. Saturation, Gram data and all witnesses are rechecked with arbitrary-precision integers.
Exceptional directions, a norm bound, and the full census
If is primitive in an exceptional plane with offset upper bound , the one-dimensional fiber inequality gives
Thus forces the bounds
Write . Positive definiteness gives , , so a finite integer rectangle suffices. Saturation makes equivalent to primitivity of . Discard zero coordinates and sort the absolute values. The exact check covers 1186 Gram-labelled cases modulo overall sign and 76 136 cells, all at most ; for it also includes the safe extra boundary .
For a strict counterexample outside these planes, the first projected KZ height satisfies
The eight-height product is . The prefix constraints are
There are 87 prefix matchings, seven chain constraints and the additional first-height constraint: 95 in total. The exact vertex check has 17 812 vertices, 138 862 directed bounded edges and 3634 unbounded edges. It bounds the reciprocal product strictly below 45960, so .
The full census at this bound partitions by the first three coordinates into 79 075 disjoint jobs. It covers 21 484 571 760 845 sorted positive nine-tuples and finds none above . The disjoint coverage categories are
Seven-coordinate whole intervals 18 999 514 214 339 Eight-coordinate intervals 2 017 779 983 325 Deletion using the eight-dimensional bound 16 453 487 495 Uniform single tails 450 702 840 824 Adaptive tails 104 693 510 Individual directions 16 541 352.
Each job satisfies the sum identity, and independent generating-function counts agree job by job. The census uses the proved two-tail and convex interval inequalities of Appendix § 11; logical coverage does not mean separate numerical minimization for every tuple. Together with the exact lower bound from , this proves .
Dimension ten
Put . In this dimension, a bounded direction census is combined with a finite search on short integer relations. The upper bound uses the complete branch coverage specified below, with exact certificates and independent set audits in the supplementary archive.
The base census and the plane bound
The complete census of sorted positive ten-tuples with contains 3 519 937 718 862 tuples, split into 19 048 completed jobs, and certifies throughout. A separate complete catalogue at and threshold contains 895 707 071 005 tuples; exactly 111 directions on 96 norms exceed . Every retained value has a rational clipped-cell audit. The stronger three-tail bound in Appendix § 12 is part of the census proof.
Proposition 6.1. Every full-support rational plane satisfies .
Proof and finite certificate. Assuming , the eight projected KZ heights and the block inequalities yield , by an exact traversal of 19 124 vertices. Thus and a reduced Gram matrix satisfies . If , delete the coordinate axis and use . If , the short vector has two entries . At a fixed value of the other parameter, these two coordinates can be adjusted with remaining squared error at most . The other eight coordinates give
For , there is no high-catalogue norm at most 209, so must have a zero coordinate. Each for which is not a high norm forces a distinct nonzero coordinate of to vanish in . There can be at most such . All 4 136 388 admissible Gram triples violate this necessary condition, by at least four. A direct enumeration and an independent discriminant-based reverse enumeration agree. This excludes every possible plane.
For a primitive strict counterexample , the projected lattice has nine heights with product . The plane bound gives
Additional KZ inputs and short relations
Besides the classical inequalities, the following hold for every valid consecutive index range:
The last three are precisely the proved versions of [21 Theorems 6.1–6.2]. Their error-free analogues are not assumed. Nonnegative rational linear combinations of these inequalities and (11) give , with
The saved multipliers are checked by direct rational vector addition; no numerical linear-programming output is accepted without this check.
Reverse the dual basis of to obtain a basis of . Successively reduce each new vector to a nearest representative modulo its predecessors. This operation corresponds in the primal basis to adding earlier vectors to later ones, preserving every projected KZ lattice and height. The relation prefix is primitive in . Write for its Gram matrix and ; set . Its squared Gram–Schmidt lengths satisfy
Primitivity makes the integral pairing map onto . Since , the minimum squared normal offset of the half-integer centers is
The complementary subspace contains and is full-support, so for and . More importantly, the fiber bound is
A particular parity-compatible gives an upper bound on and suffices in this inequality. It does not certify a lower bound on . The final proof has no exclusions based on a claim that the characteristic minimum exceeds the subspace mean; all recorded “mean-exclusion” lists are empty.
Since , one has . Norm one is impossible because has full support. If , then
Thus the first two relations both have squared norm at most seven. For a general prefix, putting and using a covering-radius upper bound yields
If a rational height certificate also gives , then . The strict bound uses as the integer upper limit; the weak bound uses .
Complete Gram extension and exact exclusions
Let and . Nearest reduction implies
Enumerating the whole latter box and every allowed is therefore complete; tests with only prune by necessary conditions. Negating the new vector permits the first nonzero entry of to be positive. No additional symmetry deletion is needed for completeness. A further necessary dual-KZ test is
If a violating vector exists, it lies in the finite box
This follows from and integrality of the adjugate quadratic form. The square-root endpoints are checked by integer comparisons.
Each surviving Gram prefix fixes the last primal heights. Equations (19), (18), the mean-fiber bounds and (23) define a rational polyhedron in the remaining heights. The following exclusions are used.
A rational Farkas certificate proves infeasibility by a nonnegative combination of the original inequalities. A numerical solver may propose multipliers, but exact arithmetic accepts them.
A product certificate proves , reducing the branch to the completed base census. All free heights have positive lower bounds and finite upper bounds from the fixed tail, so the product minimum is attained at a vertex. For small , every -element active set is tested with exact Cramer arithmetic, including degenerate vertices. Earlier layers also use complete box trees and lower chords for logarithms, with rational series remainder bounds. Both children of every split must be covered.
A necessary integral embedding condition fails. A realizable Gram matrix must equal for integral columns . Full support requires for every , and primitivity requires the gcd of all maximal minors to equal one. Complete finite searches with positive-semidefinite residuals certify negative instances. Timeouts remain unresolved, never excluded.
The covering bounds for the relation lattice may use one-dimensional rounding or exact adjacent Gauss-reduced blocks: a planar Gram with , has squared covering radius . Taking the minimum over all partitions into singleton and adjacent pair blocks is valid even though the dual basis need not itself be KZ-reduced.
Local embedding obstructions provide an additional inexpensive filter. A primitive -row integer matrix has row rank over every , so
If equality holds at an odd prime, the determinant square class of the nonsingular quotient must be . Indeed the row space then contains as its radical of dimension . Splitting off that many hyperbolic planes in the ambient determinant-one quadratic space leaves with the stated determinant class. These are necessary conditions, not sufficient embedding criteria.
The special family and the final branch ledger
The exact product computations through rank five give, for the remaining branches,
One rank-six Gram matrix has exactly 24 primitive full-support embeddings in the finite classification. They are all of type. Signed coordinate permutations and Weyl symmetries reduce their full-support integer directions to
with norm . All 15 093 137 parameter tuples with have an odd-center witness satisfying
The family closes the whole Gram branch because all its embeddings were classified, not just one representative.
The initial complete tables have 63 rank-two Gram matrices and 1943 rank-three candidates. After exclusions, 290 rank-three parents generate 21 839 rank-four candidates. A safe superset of 794 rank-four parents generates 164 085 rank-five candidates. Exact certificate and embedding checks leave 1717 rank-five parents for the final stages.
| Rank 6 | Rank 7 | Rank 8 | |
| Parents | 1717 | 2203 | 61 |
| Candidates passing dual KZ | 1 126 981 | 3 970 866 | 295 391 |
| Local embedding exclusions | 2032 | 113 648 | 37 572 |
| Height certificates | 1 088 664 | 3 811 705 | 257 819 |
| Exact product bounds | 34 055 | 45 415 | 0 |
| Complete embedding negatives | 26 | 37 | 0 |
| Complete special-family closure | 1 | 0 | 0 |
| Remaining for next rank | 2203 | 61 | 0 |
Table 3. Complete high-rank relation ledger in dimension ten. Each row is a disjoint classification of the candidate set at that rank.
The archived set audits reconcile the actual sets, in addition to these cardinalities. Rank seven uses parts 0, 1, 2, 3, 4, 5, 6; rank eight uses parts 5, 40, 41, 42, 43, 44, 45. Their parent sets are disjoint and have unions equal to the preceding full survivor selections. Each excluded Gram is linked to its exact certificate, and every survivor is passed to the next layer. The final gate and independent set audit both record zero unresolved branches. Any actual counterexample would produce a prefix in every one of these complete tables, contradicting the empty rank-eight remainder. The exact period calculation for supplies the matching lower bound, proving .
Intersection at the critical radius
For an irrational positive direction, the rational orbit closure from Proposition 2.1 has dimension at least two. The established plane bounds and Lemma 2.2 give
| 8 | |||
| 9 | |||
| 10 |
Table 4.
Both subspace bounds are strictly smaller than . Density of the positive orbit therefore gives an actual intersection with the interior of a critical-radius ball. For rational directions the minimum occurs in a period and can be shifted to a positive time. Every orbit tail is dense in the same subtorus, so intersections can also be taken arbitrarily far along the ray. If only positive half-integer centers are retained in the geometric formulation, this last observation ensures that the same critical radii apply. This completes Theorem 1.1 for real rays, including its boundary assertion.
The deficit in general dimension
For a positive integer multiset , define
The averaging bound makes these quantities nonnegative. The results in this section do not depend on any finite-dimensional census.
Normalization of the theta-block invariant
The function used in [16] is . Accordingly its extremal quantity is , and its definition (5.1) gives the exact identity
Here is the extremal quantity as defined there, allowing fractional powers of the eta function; no additional integral-weight rounding is imposed. This is why their logarithmic bounds transfer directly to the sphere problem. Their experimental theta-block tables are useful constructions but are not substitutes for the global upper bounds of § 4–§ 6.
Fourier expansion and a uniform comparison
Put
and define and . All integrals on use probability Haar measure. Twice integrating by parts gives
Both series converge absolutely and uniformly. In particular,
Writing for the Möbius function, inversion also gives
Substitution of (30) proves this formula: the coefficient of is , which vanishes except at . Absolute convergence justifies regrouping the double sum.
Proposition 7.1. For every multiset , .
Proof. Write and , so . Separate the positive and negative Möbius coefficients:
The Euler products give
Thus , while and . Multiplication by an integer preserves Haar measure, which justifies these integrals. Since and , .
This convenient comparison supplies all that is needed below. Its role is to transfer an lower bound to the geometric deficit.
The lower bound, including repeated speeds
We use the following form of the McGehee–Pigno–Smith inequality [20 Theorem 2]: there is an absolute such that for distinct integers and complex coefficients ,
Konyagin independently resolved Littlewood’s problem [18]; the weighted formulation (33) is the input used in this proof.
Suppose has distinct positive speeds, of multiplicities summing to . The exponential form of has distinct frequencies, with coefficients . Consequently
Moreover every Fourier coefficient is bounded in absolute value by the norm, giving
If , the logarithmic bound suffices; otherwise the multiplicity bound is larger than and also dominates a fixed positive multiple of . Thus uniformly over all multisets, . Proposition 7.1, followed by the infimum over , gives .
The upper bound with prescribed total multiplicity
The needed consequence of Belov–Konyagin [2 Theorem 0.5(2) and Corollary 5.4] is that, for every integer , there are nonnegative integers , with , and a real such that
This is the bound for , whose coefficient sum is exactly ; a bound merely along a subsequence of lengths would not suffice. Choose speed with multiplicity , omitting zero multiplicities. This gives a vector of exactly coordinates and . Equation (30) therefore gives , so
Enlarging the absolute constants handles and proves Theorem 1.2. The deep analytic inputs (33) and (34) are invoked as external theorems; their original proofs are not reproduced here.
Consequences and the limits of the bounds
The exact identity
and imply, for sufficiently large ,
In particular, , which excludes a positive square-root term in the deficit. The exact deficits from the three computations are
Their variation is compatible with the general asymptotic bounds and does not by itself determine the growth rate of .
There is also a structural limit to the argument. Put . The previous proof gives . Conversely, gives , where is the Dirichlet kernel. For , , whence
Thus , and improving only the constant in cannot yield a higher-order deficit lower bound. Nor does a lower bound for a restricted monotone-coefficient cosine problem transfer backwards through the one-sided inequality (31). The precise order of remains beyond the conclusions proved here.
Verification and further questions
The computer-assisted proof combines mathematical reductions with exact finite calculations. This section describes the role of the supplementary archive (which is available at https://zenodo.org/records/24037416) and distinguishes its verification levels; the logical map is given in Appendix § 13.
Exact certificates and verification levels
The archive contains executable sources, exact witnesses, rational certificates, partition records and verification logs. Its main entry point uses Python’s standard library. The archived implementations also use JavaScript, Node.js and checked C# arithmetic. Python integers and rational fractions, JavaScript arbitrary-precision integers and integer cross-multiplication implement the decisive comparisons. In the JavaScript censuses that use ordinary numbers, integer intermediate values are bounded below . Floating-point calculations may propose an endpoint or a certificate, but acceptance uses an exact check.
The verification levels have distinct mathematical scopes. An integrity check validates the file manifest, the source-archive hash and nested archive checksums. The quick check also recomputes every cell for the three lower-bound directions. The selected replay checks saved ledgers, the nine-dimensional two-tail identities and plane witnesses, and the ten-dimensional gate, short-relation bounds and three-tail identities. The terminal replay additionally recomputes all rank-eight local and height exclusions, using the archived candidate sets. Full eight-dimensional verification regenerates its plane classification, norm bound and direction census. Complete regeneration in dimensions nine and ten additionally requires the large censuses and relation generation procedures described in the archive’s reproduction guide.
These levels should be interpreted through the corresponding proof obligations. File identity establishes which evidence is being checked. Population counts check the sizes of finite search domains. The distance witnesses, exact exclusions and parent–child set reconciliations establish the geometric bounds and the completeness of the finite search. Neither hashes nor cardinalities alone provide those conclusions.
Archived verification records
The archive contains records of a complete eight-dimensional rerun, selected nine-dimensional arithmetic and ledger audits, and ten-dimensional independent candidate-set audits and terminal replays. In particular, its terminal replay records all 37 572 local and 257 819 height exclusions at rank eight. That replay verifies the exclusion arithmetic for the archived candidate population; the separate set-generation audits establish the population to which it applies. The full nine-dimensional census and ten-dimensional base censuses and relation generations have their own archived records.
The present revision aligns the mathematical exposition with those sources and records. The large computations were not regenerated during this revision. The analytic argument in § 7 is independent of the finite censuses. Kahlon’s seven-dimensional theorem and the inequalities of Pendavingh and van Zwam remain external inputs.
Further questions
The finite method raises two further problems: classifying all attaining directions and constructing smaller independent verifiers for the large relation tables. In general dimension, the main analytic question is to determine the order of between the logarithmic and cubed-logarithmic bounds. A sharper estimate would need information beyond improving only the constant in the comparison.
AI assistance declaration
OpenAI GPT-6 Astra was used in the determination of the exact view-obstruction constants in dimensions eight to ten. OpenAI Codex assisted with the preparation of the manuscript, including expository editing, literature checks, local exact-arithmetic checks and the comparison of the manuscript with the supplementary archive. The authors are responsible for the mathematical statements, proofs and computational evidence.
Data and code availability
The source code and exact verification data accompany this paper in a separate archive (https://zenodo.org/records/24037416). It includes the verification entry point, reproduction instructions, the original dimensional packages and the later audit records. The mathematical paper is supplied separately as a standalone LaTeX source; the code archive contains no LaTeX source files. Original computational evidence is preserved byte for byte inside the archive.
Single-tail, two-tail and interval certificates
A single appended coordinate
For a positive prefix and an odd center , write , , , . Appending a coordinate and odd center coordinate gives
The nearest odd integer to is at distance at most one. Hence
Taking an optimal center for yields the deletion bound . For , and , a strict counterexample requires ; retaining equality in a census is a harmless enlargement of its candidate set.
Two appended coordinates
Lemma A.1. Let , , and . Then
An arbitrary odd-center upper bound may replace .
Proof. The normal prefix residual and the tail fiber are orthogonal. The latter has Gram matrix
Normalize , . If , nearest-plane rounding in a suitable order gives
For , the standard two-triangle tiling gives
Put . If , the numerator of after multiplication by the positive factor is
If the final coefficient is negative, combine its term with the linear term inside the braces, using . The result is at least , which is positive for : its derivative is , and its value at is . The other terms are nonnegative.
If , the numerator of after multiplication by is
For , the last three terms are at least . This is nonnegative when ; for smaller use . For , the cubic term is nonnegative and the quadratic and quartic terms are at least . Therefore . Finally, is nondecreasing and .
Exact whole-interval skipping
For the nine-dimensional census, another valid two-tail bound is the successive single-tail bound
With and , define
Then certifies every allowed two-tail extension. When the last prefix coordinate increases, with preceding norm fixed, decreases and both tail bounds improve. Freezing the current is therefore conservative.
For a fixed odd center and variable last prefix coordinate , its projection numerator is
The inequality has a convex quadratic left-minus-right side, since in the implemented seven-coordinate case (, ). Exact verification at two endpoints proves the entire interval. Eight-coordinate intervals use the same reasoning with the single-tail bound. Every proposed endpoint is checked by integer arithmetic; a floating-point quadratic root is only a proposal. If no witness succeeds, enumeration continues down to the complete period test.
The three-tail covering certificate
The ten-dimensional census uses the following finite polynomial certificate for all real tail parameters, not a numerical grid.
Lemma B.1. Let , and . For and , the lattice with Gram has covering radius satisfying
Proof with explicit polynomial verification. Normalize the parameters by setting , and . Thus the normalized parameters are . Since and is nondecreasing, it suffices to prove the bound for , . In the following calculation write for the normalized variable .
If , first quotient by the third basis vector and then round in its direction. The squared covering radius is at most
For this is less than . Otherwise use from Lemma A.1 and bound the second term by . Let , . Positivity of the difference from reduces to positivity of
With , , the polynomial has bidegree on . All 49 tensor-Bernstein coefficients are positive; their minimum is 140. The exact verifier constructs the polynomial, computes these coefficients and re-expands them to recover the original identity.
In the complementary region , the entire domain has the parametrization
The six coordinate-order path simplices triangulate a fundamental cube. The maximum of their circumradii bounds the lattice covering radius: for barycentric coordinates in a simplex of circumcenter and radius ,
Reversal of the path gives the same radius, so three orders suffice. Put
and in order set . Solving the circumcenter equations with gives
For , substitute . The inequality is ; after removing a factor , each of the three polynomials has tridegree and all 605 tensor-Bernstein coefficients are nonnegative. For , substitute . The inequality becomes
Each polynomial has tridegree and all 770 tensor-Bernstein coefficients are nonnegative. In total the obtuse-region check has coefficients, with independent monomial re-expansion for every identity.
For clarity, these checks use the exact basis-conversion identity
in each variable. All arithmetic is rational, and every Bernstein basis polynomial is nonnegative on the unit interval. Thus the coefficient signs prove the continuum inequalities. ▫
For a sorted seven-coordinate prefix, automatically. The normal-prefix residual is orthogonal to the three-tail fiber, so . With , , the integer certificate
therefore proves an entire three-coordinate tail safe. This is the envelope required by the dimension-ten census. The polynomial identities and coefficient signs above establish its continuum validity once checked in exact arithmetic.
Verification map for the supplementary archive
The archive follows the same dependency order as the proof. Its eight-, nine- and ten-dimensional packages contain the original sources and exact data. A later ten-dimensional review package contains independent candidate-set generation and exclusion checks. The following map describes the evidence needed at each stage without tying the mathematical argument to individual implementation file names.
| Proof component | Verification evidence and acceptance condition |
| Candidate lower bounds | Complete rational half-period cells for the three displayed directions, with clipped minimizers and the values 8/17, 1087/1980 and 7/11. |
| Dimension eight | Exact plane witnesses, the height-product certificate giving , and a complete census of 18 766 118 836 sorted positive directions. The seven-prefix count is 790 944 734; no counterexample remains. |
| Dimension nine | The high-direction catalogue, fourth-moment and plane certificates, exceptional-plane checks, and the height-product bound . The final census has 79 075 partitions and covers 21 484 571 760 845 directions, with zero counterexamples. |
| Dimension-ten base | The census at covers 3 519 937 718 862 directions in 19 048 partitions. The high catalogue at and the reverse Gram enumeration support the plane bound. |
| Covering and norm bounds | Exact rational combinations of the KZ inequalities, parity-compatible witnesses and the 4174 Bernstein coefficient checks in Appendix § 12. |
| Relation generation | Complete bounded Gram extensions and parent–child set audits. Ranks six, seven and eight contain respectively 1 126 981, 3 970 866 and 295 391 candidate Grams after the stated dual-KZ tests. |
| Terminal exclusions | Every candidate is linked to an exact exclusion certificate or to the next-rank survivor set. Rank seven uses parts 0, 1, 2, 3, 4, 5, 6; rank eight uses parts 5, 40, 41, 42, 43, 44, 45. The terminal split is 37 572 local and 257 819 height exclusions, with zero unresolved branches. |
| Special family | All 24 primitive full-support embeddings are accounted for, followed by the complete check of 15 093 137 parameter tuples at . |
Table 5.
The executable guide specifies commands, parameters and expected outputs for each component. The independent set audits compare the mathematical sets passed between stages, while the saved logs document the original completed computations. New runs use fresh working directories so that the original evidence remains available for comparison.
References
- [1]W. Banaszczyk, New bounds in some transference theorems in the geometry of numbers, Math. Ann. 296 (1993), 625–635. 10.1007/BF01445125.
- [2]A. S. Belov and S. V. Konyagin, An estimate of the free term of a non-negative trigonometric polynomial with integer coefficients, Izv. Math. 60 (1996), no. 6, 1123–1182. 10.1070/IM1996v060n06ABEH000095.DOI
- [3]J. W. S. Cassels, An Introduction to the Geometry of Numbers, Grundlehren der mathematischen Wissenschaften, vol. 99, Springer-Verlag, Berlin, 1959.DOI
- [4]Y.-G. Chen, The view-obstruction problem for 3-dimensional spheres, Acta Math. Sinica (Engl. Ser.) 10 (1994), no. 2, 158–167. 10.1007/BF02580423.DOI
- [5]Y.-G. Chen, The view-obstruction problem for 4-dimensional spheres, Amer. J. Math. 116 (1994), no. 6, 1381–1419. 10.2307/2375051.DOI
- [6]Y.-G. Chen, View-obstruction problems and Kronecker’s theorem, Proc. Amer. Math. Soc. 123 (1995), no. 11, 3279–3284. 10.1090/S0002-9939-1995-1277102-1.
- [7]T. W. Cusick, View-obstruction problems, Aequationes Math. 8 (1972), no. 1–2, 197–198. 10.1007/BF01832753.
- [8]T. W. Cusick, View-obstruction problems, Aequationes Math. 9 (1973), 165–170. 10.1007/BF01832623.
- [9]T. W. Cusick, View-obstruction problems in n-dimensional geometry, J. Combin. Theory Ser. A 16 (1974), no. 1, 1–11. 10.1016/0097-3165(74)90066-1.DOI
- [10]T. W. Cusick and C. Pomerance, View-obstruction problems, III, J. Number Theory 19 (1984), no. 2, 131–139. 10.1016/0022-314X(84)90097-0.
- [11]V. C. Dumir and R. J. Hans-Gill, View-obstruction problem for 3-dimensional spheres, Monatsh. Math. 101 (1986), 279–289. 10.1007/BF01559391.DOI
- [12]V. C. Dumir, R. J. Hans-Gill and J. B. Wilker, Contributions to a general theory of view-obstruction problems, Canad. J. Math. 45 (1993), no. 3, 517–536. 10.4153/CJM-1993-027-9.DOI
- [13]V. C. Dumir, R. J. Hans-Gill and J. B. Wilker, A Markoff-type chain for the view-obstruction problem for spheres in ℝ⁴, Monatsh. Math. 118 (1994), 205–217. 10.1007/BF01301689.DOI
- [14]V. C. Dumir, R. J. Hans-Gill and J. B. Wilker, The view-obstruction problem for spheres in ℝ⁵, Monatsh. Math. 122 (1996), 21–34. 10.1007/BF01298453.DOI
- [15]V. C. Dumir, R. J. Hans-Gill and J. B. Wilker, Contributions to a general theory of view-obstruction problems, II, J. Number Theory 59 (1996), no. 2, 352–373. 10.1006/jnth.1996.0102.DOI
- [16]V. Gritsenko, N.-P. Skoruppa and D. Zagier, Theta blocks, J. Eur. Math. Soc. 28 (2026), no. 1, 113–169. Published online 13 June 2024. 10.4171/JEMS/1471.
- [17]V. Kahlon, The view-obstruction problem for spheres in dimensions six and seven, preprint, arXiv:2610.37711v1, 26 October 2026. https://arxiv.org/abs/2610.37711v1. Accompanying data: 10.5281/zenodo.23130200.
- [18]S. V. Konyagin, On a problem of Littlewood, Math. USSR-Izv. 18 (1982), no. 2, 205–225; Russian original in Izv. Akad. Nauk SSSR Ser. Mat. 45 (1981), no. 2, 243–265. 10.1070/IM1982v018n02ABEH001386.
- [19]J. C. Lagarias, H. W. Lenstra, Jr., and C. P. Schnorr, Korkin–Zolotarev bases and successive minima of a lattice and its reciprocal lattice, Combinatorica 10 (1990), no. 4, 333–348. 10.1007/BF02128669.DOI
- [20]O. C. McGehee, L. Pigno and B. Smith, Hardy’s inequality and the L¹ norm of exponential sums, Ann. of Math. (2) 113 (1981), no. 3, 613–618. 10.2307/2007000.DOI
- [21]R. A. Pendavingh and S. H. M. van Zwam, New Korkin–Zolotarev inequalities, SIAM J. Optim. 18 (2007), no. 1, 364–378. 10.1137/060658795.DOI
- [22]J. M. Wills, Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen, Monatsh. Math. 71 (1967), 263–269. 10.1007/BF01298332.
- [23]G. M. Ziegler, Lectures on Polytopes, Graduate Texts in Mathematics, vol. 152, Springer-Verlag, New York, 1995. 10.1007/978-1-4613-8431-1.