{"id":"444d0380-aab2-49b7-ab77-9e469c20ee44","arxiv_id":"1908.08933","paper_version":3,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Every empty lattice 4-simplex belongs to one of 49 infinite families or to one of 2461 sporadic simplices with volume at most 419, completing a 30-year classification program.","lead":"This paper completes the classification of four-dimensional empty lattice simplices, a problem open since 1988. It proves that every such simplex belongs to a small set of infinite families or to 2461 sporadic examples with volume at most 419.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Completeness of the k=3 case depends on Lemma 4.2, an unproved computer enumeration of 5-point subconfigurations of the twelve maximal hollow 3-polytopes; a missed triangular bipyramid would create an unlisted infinite family of empty 4-simplices.","rationale":"The theoretical reduction in Sections 2 through 4 is coherent: Corollary 2.12 gives a clean parametrization of cyclic simplices projecting to a fixed hollow configuration, and Propositions 2.14 and 2.15 convert emptiness into finite modular checks. The paper also gives a plausible proof of the volume bound 5184 in Theorem 5.1. The single point where completeness could fail without leaving a trace in the written proof is Lemma 4.2, which is stated as a computational summary with no certificate. A missed triangular bipyramid would create an entire family of empty 4-simplices absent from Theorem 1.6, so this is more fundamental than the finite enumeration behind Theorem 1.9. The proposed check is a finite exhaustive recomputation, feasible because the twelve maximal hollow 3-polytopes have volume at most 36. I do not find a mathematical inconsistency in the derivations; the concern is about auditability and completeness of a finite enumeration. The reader's weakest_assumption identified both this lemma and the brute-force enumeration; I partially agree, singling out Lemma 4.2 as the more load-bearing of the two, which leaves the conditional verdict unchanged.","tokens_in":30926,"tokens_out":6256,"duration_ms":55905,"concrete_test":"Independently enumerate all size-five multisets of lattice points in each of the twelve maximal hollow 3-polytopes from [AKW17] that affinely span R^3 and do not project to a hollow 2-polytope, using a short script fed with the explicit polytope descriptions from that paper. Check that the resulting counts match Lemma 4.2 (tetrahedra, 24 quadrilateral pyramids, 29 primitive and 23 nonprimitive bipyramids), and that each primitive bipyramid's unique affine dependence is a scalar multiple of a row of Table 1, while each nonprimitive one matches a pair (a,b) from Table 5. This directly tests the only unverified input to the k=3 classification.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Lemma 4.2 is the load-bearing computational input for the infinite part of the classification. It asserts a complete list of five-point subconfigurations of the twelve maximal hollow 3-polytopes from [AKW17], separating them into tetrahedra, 24 quadrilateral pyramids, 29 primitive bipyramids, and 23 nonprimitive bipyramids; the bipyramids become the 29 primitive and 17 nonprimitive 1-parameter families of Theorem 1.6 via Corollary 2.12. The paper states only that the computation was performed by M. Blanco and gives no verifier code, certificate, or independent derivation. If a primitive bipyramid were missing or misclassified as nonprimitive, the corresponding family would either be absent from Tables 1 and 2 or carry the wrong index condition, invalidating the completeness of Theorem 1.6 for infinitely many volumes. The Section 5 brute-force enumeration of sporadic simplices is a second computational pillar, but a failure there would only change the finite count 2461; Lemma 4.2 underpins the infinite families, so I single it out as the most load-bearing concern.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper claims a complete classification of empty lattice 4-simplices up to affine unimodular equivalence. The classification is organized by the minimal dimension k of a hollow polytope onto which a simplex projects: k=1 gives one 3-parameter family, k=2 gives two 2-parameter families, k=3 gives 29 primitive and 17 nonprimitive 1-parameter families together with finitely many exceptions of volume at most 72, and k=4 gives 2461 sporadic simplices with volumes between 24 and 419. The proof develops a 5-tuple representation of cyclic simplices, uses the cyclicity theorem of Barile et al., reduces the k=3 case to five-point subconfigurations of the twelve maximal hollow 3-polytopes of Averkov et al., and proves a volume bound of 5184 for the k=4 case via a width-two slicing argument; the sporadic list is then obtained by enumeration up to volume 7600.","tokens_in":31044,"tokens_out":11444,"duration_ms":116537,"significance":"If the classification is correct, it completes a thirty-year program initiated by Mori, Morrison, and Morrison and corrects the claimed classification of Barile et al. The 5-tuple and facet-volume framework is elegant, the families are explicit, and the volume bound of Theorem 5.1 is a substantial result in its own right. The paper also gives concrete consequences for facet volumes, Ehrhart polynomials, and terminal quotient singularities, and it honestly reports discrepancies with the earlier enumeration of Mori et al. However, the completeness of the classification rests on two computational pillars that the manuscript does not make independently verifiable: Lemma 4.2, an exhaustive enumeration of five-point subconfigurations summarized without proof or certificate, and the Section 5 enumeration that produces the 2461 sporadic examples. These are load-bearing for the central claim, so the paper is not yet fully self-contained as a complete classification.","major_comments":[{"comment":"The completeness of the k=3 case of Theorem 1.6 depends on Lemma 4.2, which asserts an exhaustive list of five-point subconfigurations of the twelve maximal hollow 3-polytopes, separated into tetrahedra, 24 quadrilateral pyramids, 29 primitive bipyramids, and 23 nonprimitive bipyramids. The manuscript states only that the computations were done by Mónica Blanco and gives no proof, certificate, or reproduction instructions. A missing or misclassified bipyramid would remove or add an entire one-parameter family, thereby invalidating the completeness statement for infinitely many volumes. Please provide a verifiable certificate, the enumeration code, or an independent derivation of the list.","section":"§4, Lemma 4.2"},{"comment":"The count of 2461 sporadic empty 4-simplices is a central claim, but it is obtained by discarding from the output of an enumeration whose details appear in the separate paper [IVnS19], and the current manuscript does not include the enumeration code, the pruning code, or a verifier for the ancillary list. A reader can check the statistics in Table 3 but cannot verify completeness. Please make the code and data available and include a machine-checkable verification that each listed 5-tuple represents an empty simplex and that the list is complete under the isomorphism criterion of Corollary 1.4.","section":"§5, Theorem 1.9"},{"comment":"The bound of 72 for the finite exceptions in the k=3 case is asserted after stating that formula (2) gives that bound 'for the 24 pyramids of Lemma 4.2,' but the individual computations of the ratio |xz|/|yz| for the 24 pyramids are not shown. Since this bound is what separates the infinite families from the finite exceptions in case k=3, please include the table of the 24 cases or an easily checkable script that produces the bound.","section":"§4, Proposition 4.3"}],"minor_comments":[{"comment":"The abstract says the sporadic simplices have volumes ranging between 29 and 419, while Theorem 1.9 and Table 3 state that volumes range from 24 to 419; the abstract should be corrected.","section":"Abstract"},{"comment":"The sentence '1+17=46 one-parameter families' should read '29+17=46 one-parameter families'.","section":"§1, after Theorem 1.9"},{"comment":"The notation '±k ∈ ∅' and conditions such as '±k ≠ 1' are explained only in the proof of Proposition 4.7; a sentence in the table caption would make the table readable independently.","section":"§4, Table 7"},{"comment":"There is a typo, 'mutiplication', and the statement would be clearer if it explicitly said that the tuple entries are integers considered modulo V.","section":"§1, Corollary 1.4"},{"comment":"Theorem 1.8 is presented as the converse of Theorem 1.6, but Theorem 1.6 includes the k=4 case only by reference to Theorem 1.9; please clarify that the converse concerns the parametric families, not the sporadic list.","section":"§1, Theorem 1.8"}],"recommendation":"major_revision","confidential_remarks":"The paper is strong and the theoretical framework is convincing, but it is a 'complete classification' whose two central computational inputs are not currently verifiable from the manuscript. I would ask the authors to deposit the enumeration codes and certificates for Lemma 4.2 and Theorem 1.9 before publication. No circularity problem is apparent: [IVnS19] and [AKW17] are published external results, and the reliance on them is legitimate."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Punchline: this is the complete classification of empty lattice 4-simplices, and it corrects the flawed 2011 claim of Barile et al. The main theorem is credible and the theoretical structure is solid, but completeness of the infinite families rests on Lemma 4.2, a computer enumeration that is reported without verifier code or certificate. That gap should be closed before the result is treated as fully settled.\n\nWhat is new and good: the paper adds 17 nonprimitive 1-parameter families, a second 2-parameter family, and 2461 sporadic simplices with volumes 24–419, after proving a volume bound of 5184 for width-two hollow 4-simplices. The 5-tuple/cyclicity framework, the facet-volume emptiness criteria (Propositions 2.14 and 2.15), and the projection-to-hollow-polytopes scheme are coherent and largely checkable by hand. The sufficiency proofs in Propositions 3.2, 4.6 and 4.7 do what they claim. The paper is also honest about discrepancies with Mori–Morrison–Morrison and correctly relies on the published companion paper [IVnS19] for width ≥ 3.\n\nSoft spots: Lemma 4.2 is the load-bearing piece for the infinite part of the classification. It asserts a complete list of five-point subconfigurations of the twelve maximal hollow 3-polytopes, separating 29 primitive and 23 nonprimitive bipyramids. The computation was done by M. Blanco, and no verifier code, certificate, or independent derivation is provided. If one primitive bipyramid were missing or misclassified as nonprimitive, the corresponding infinite family would be absent or carry the wrong modular conditions, breaking Theorem 1.6 for infinitely many volumes. The second computational pillar—the brute-force enumeration up to volume 7600—matters only for the finite count 2461, so a failure there would be less serious; and it relies on the published [IVnS19]. I would not call the paper circular: the external anchors (AKW17, BBBK11, IVnS19) are published. Minor issue: some checks in Propositions 4.6/4.7 are left to the reader, but they are simple modular arithmetic and I found no error.\n\nBottom line: this is a significant and mostly rigorous paper. The reader's conditional verdict is right. Who gains: lattice polytope people, toric geometers, anyone tracking terminal quotient singularities. It should go to peer review—not desk rejected—but I would ask the authors to ship the enumeration code and a certificate for Lemma 4.2 (and ideally for Theorem 1.9).","headline":"Complete classification of empty 4-simplices, credible and important, but the infinite families rest on an unverified computer enumeration in Lemma 4.2 that should be certified.","tokens_in":31718,"tokens_out":2973,"would_cite":true,"duration_ms":28469,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["52B20","14E30","52C07","14M25"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper completes the classification of empty lattice 4-simplices: every such simplex belongs to one 3-parameter family, two 2-parameter families, 46 one-parameter families, or one of 2461 explicitly listed sporadic simplices.","keywords":["empty lattice simplex","lattice polytopes","hollow polytope","unimodular equivalence","terminal quotient singularities","5-tuple","normalized volume","toric geometry"],"falsifier":"Run an independent, verifier-equipped enumeration of all empty 4-simplices of volume at most 5184 and confirm that, after removing the $1+2+46$ infinite families, the surviving isomorphism classes are exactly the 2461 sporadic 5-tuples of Table 3; separately regenerate the five-point subconfigurations of the twelve maximal hollow 3-polytopes and confirm the counts in Lemma 4.2, namely 24 pyramids, 29 primitive and 23 non-primitive bipyramids. A single missing or spurious configuration disproves the completeness of the classification.","tokens_in":30601,"feed_emoji":"📐","tokens_out":9639,"duration_ms":81863,"temperature":0.7,"pith_summary":"The paper proves a complete classification of empty lattice 4-simplices, the four-dimensional analogue of the 1964 classification of empty tetrahedra. Every empty 4-simplex, they show, has a hollow projection to a configuration of dimension at most four; depending on the minimal such dimension, it lies in one 3-parameter family, two 2-parameter families, 46 one-parameter families, or one of 2461 sporadic examples with volumes between 24 and 419. This corrects and completes an earlier classification effort that had been shown to be wrong, and it provides the first full list of the finitely many exceptions together with a proof that the list is exhaustive. The reader should care because empty simplices are the indivisible building blocks of lattice polytopes and correspond to terminal quotient singularities in algebraic geometry, so a complete four-dimensional list has consequences for both fields.","feed_headline":"All empty 4-simplices classified: 49 families plus 2461 exceptions","feed_subtitle":"A 30-year-old classification problem is now complete, correcting a 2011 claim and listing every sporadic case.","key_machinery":"The load-bearing object is the 5-tuple: for a cyclic simplex of volume $V$, take any generator of the quotient lattice $\\Lambda/\\Lambda_P$ and record $V$ times its barycentric coordinates with respect to the five vertices; two simplices are unimodularly equivalent exactly when their 5-tuples agree up to multiplication by a unit modulo $V$ and permutation of coordinates. The argument then reduces the classification to a parametrization result: a simplex that projects to a hollow configuration $S$ in dimension $k<4$ has 5-tuple $Va+b$, where $a$ encodes a generator of the quotient group $\\pi(\\Lambda)/\\Lambda_S$ and $b$ runs over integer affine dependences among the five projected points. The hard part is the $k=3$ case, where the finite list of twelve maximal hollow 3-polytopes yields, after deleting configurations with no empty lifts, 29 primitive and 17 non-primitive bipyramids. The $k=4$ case is settled by a volume bound of 5184 proved through successive-minima and symmetrization arguments, followed by brute-force enumeration up to that bound.","core_discovery":"The central discovery is that every empty 4-simplex of volume $V$ projects, by an affine lattice map, to a hollow $k$-dimensional polytope with $k\\le 4$, and the possible simplices are exactly the following. If $k=1$, the 5-tuple is $(\\alpha+\\beta,-\\alpha,-\\beta,-1,1)$ with $\\gcd(\\alpha,\\beta,V)=1$. If $k=2$, either the primitive family $(1,-2,\\alpha,-2\\alpha,1+\\alpha)$ with $V$ odd, or the non-primitive family $\\frac{V}{2}(0,1,0,1,0)+(-1,-1,\\alpha,-\\alpha,2)$ with $V$ a multiple of 4. If $k=3$, apart from finitely many simplices of volume at most 72, it lies in 29 primitive or 17 non-primitive one-parameter families whose 5-tuples are listed in the paper, with modular restrictions on $V$. If $k=4$, there are exactly 2461 sporadic simplices, with volumes from 24 to 419, listed on the authors' website and in an ancillary file. The converse is also proved: every simplex described by these tuples is indeed empty. The classification is stated modulo unimodular equivalence, using a 5-tuple of barycentric coordinates of a generator of the cyclic quotient group, which is a complete invariant for empty 4-simplices because all such simplices are cyclic.","pith_inferences":["An independent reimplementation of the enumeration would settle residual doubt about the count 2461; the paper distributes the resulting data but not verifier code, so a small standalone verification script is a natural companion artifact.","The same projection-to-lower-dimensional-configurations scheme, with $n-k-1$ parameters per fine family, suggests that classifications in higher dimensions will be driven by explicit finite lists of maximal hollow polytopes, with the volume bound for sporadic cases as the main bottleneck.","If the new counts in the paper's comparison table supersede the historical prime-volume enumeration, then the corrected number of sporadic terminal quotient singularities of prime volume below 60 follows; the discrepancies concentrate there, consistent with an earlier redundancy-checking error.","One could test the machinery in a smaller setting by reproducing the classification of empty tetrahedra through the same fine-family parametrization, validating the pipeline before trusting the four-dimensional results."],"forward_implications":["Every empty 4-simplex is now explicitly known: the classification gives a complete list of all isomorphism classes, so any proposed property of empty 4-simplices can be checked against the families and the 2461 sporadic cases.","The earlier claim that all but finitely many empty 4-simplices have width one or two is corrected: there is a new two-parameter family, 17 additional one-parameter families, and the sporadic list refines the exceptional set.","Every empty 4-simplex has at least two unimodular facets, and the ones with exactly two are characterized explicitly: the width-one family with three non-unimodular facets, one width-two primitive family when $V$ is a multiple of 30, and three sporadic simplices.","The $h^*$-vector, and therefore the Ehrhart polynomial, of any empty 4-simplex is determined by its volume and surface area, and the paper tabulates the possible facet-volume configurations across all cases.","The projection method yields a partial classification of all hollow 4-simplices: they form finitely many fine families, with a volume bound of 5184 for those that do not project to dimension three, leaving explicit enumeration as a computational challenge."],"supporting_citations":[{"why":"Supplies the three-dimensional classification of empty tetrahedra, used as a base case and in facet-emptiness checks.","marker":"[Whi64]"},{"why":"Introduced the 5-tuple invariant and the 29 primitive families, and gives the prime-volume enumeration that this paper corrects.","marker":"[MMM88]"},{"why":"Proved the prime-volume classification conjecture that this paper extends to all volumes.","marker":"[San90]"},{"why":"Gave a simplified proof of the prime-volume classification.","marker":"[Bob09]"},{"why":"Established that all empty 4-simplices are cyclic and gave the flawed classification that this paper corrects.","marker":"[BBBK11]"},{"why":"Showed the earlier non-prime classification was wrong, motivating the new completeness proof.","marker":"[BHHS16]"},{"why":"Provides the twelve maximal hollow 3-polytopes whose five-point subconfigurations drive the $k=3$ case.","marker":"[AKW17]"},{"why":"Provides the finiteness theorem underpinning the coarse and fine family decomposition used throughout.","marker":"[NZ11]"},{"why":"Contains the brute-force enumeration details and the width-larger-than-two classification used for the sporadic volume bound.","marker":"[IVnS19]"},{"why":"Gives the hollow-polygon area bounds used in the volume bound for the $k=4$ case.","marker":"[AW12]"}],"fun_headline_variants":["Empty 4-simplices fully classified: 49 families plus 2461 sporadic cases","Complete enumeration of empty 4-simplices: 49 families, 2461 exceptions","Final answer for empty 4-simplices: 49 families and 2461 individual","30-year-old problem solved: all empty 4-simplices now listed","All empty 4-simplices catalogued: 49 families, 2461 outliers"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The completeness claims rest on two computer-generated lists: the five-point subconfigurations of the twelve maximal hollow 3-polytopes, which are stated without proof and were produced by another researcher, and the brute-force enumeration of all empty 4-simplices of volume up to 7600, whose details appear in a companion paper rather than in the text; if either list is incomplete, the classification is incomplete.","fun_headline_variants_meta":{"raw":{"variants":["Empty 4-simplices fully classified: 49 families plus 2461 sporadic cases","Complete enumeration of empty 4-simplices: 49 families, 2461 exceptions","Final answer for empty 4-simplices: 49 families and 2461 individual","30-year-old problem solved: all empty 4-simplices now listed","All empty 4-simplices catalogued: 49 families, 2461 outliers"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00078,"raw_usage":{"total_tokens":3564,"prompt_tokens":1180,"completion_tokens":2384,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":796,"completion_tokens_details":{"reasoning_tokens":2267}},"tokens_in":796,"tokens_out":2384,"duration_ms":15990,"temperature":1.0,"reasoning_tokens":2267,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T11:25:16.056116+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run an independent, verifier-equipped enumeration of all empty 4-simplices of volume at most 5184 and confirm that, after removing the $1+2+46$ infinite families, the surviving isomorphism classes are exactly the 2461 sporadic 5-tuples of Table 3; separately regenerate the five-point subconfigurations of the twelve maximal hollow 3-polytopes and confirm the counts in Lemma 4.2, namely 24 pyramids, 29 primitive and 23 non-primitive bipyramids. A single missing or spurious configuration disproves the completeness of the classification.","supporting_citations":[],"review_version":1}