{"id":"cef1e747-e082-49d5-a1c5-ca3b0e824f05","arxiv_id":"2505.09736","paper_version":3,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For any triangulation of the 2-sphere, the minimum L1-norm filling equals the minimum number of tetrahedra in a triangulation of the 3-ball, and every optimal filling is shellable and flag.","lead":"The paper proves that every optimal L1-norm filling of a triangulated sphere is in fact a genuine triangulation of the 3-ball, and that such fillings are always shellable and flag. This answers a stronger version of a question by Sleator, Tarjan, and Thurston about the minimal number of tetrahedra needed to fill a triangulated sphere.","discovery_kind":"unification","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The unsupported 'disjointly eligible tets' assertion in §6 is the load-bearing weak spot: the counting bound yields only maxdeg eligible tets, not pairwise-disjoint ones, and Theorems 2–4 depend on it.","rationale":"The reader identified exactly the step I consider most load-bearing. The paper's central claim is that every taut filling of a triangulated 2-sphere is a clean, shellable, flag triangulation of the 3-ball. The proof of this is built on the minimality argument in Theorem 2, whose key move is the assertion that at least maxdeg 'disjointly eligible' tets exist. The preceding counting argument proves only that at least maxdeg tets are assigned two boundary faces; the jump to pairwise face-disjointness is a genuine unproved combinatorial claim. It is used not once but repeatedly: to rule out repeated tetrahedra in Theorem 2, to select a safe flipping tet in the shelling proof of Theorem 3, and to avoid destroying taboo configurations in Theorem 4. If the claim fails, the structural conclusions lose their proof, even though the equality Zvol = tetvol might still be true. I did not find a way to derive the claim from the stated inequalities, and the paper gives no separate lemma or reference for it. The claimed Lean formalization, mentioned in the abstract, is not shipped, so it cannot be checked and does not close the gap. The other shorter gaps I noticed—the general-n version of Theorem 1 is only sketched through the n = 2 case, and some type-assignment details in the splitting proof are compressed—are secondary because the actual application is n = 2 for the main theorem. Since the reader already returned a CONDITIONAL verdict, my read does not move the verdict; the missing lemma should be supplied or the proof modified before the central claim can be accepted.","tokens_in":7754,"tokens_out":24786,"duration_ms":273599,"concrete_test":"Restate the step as a lemma and test it at small size: for every prime triangulation σ of S^2 with no vertex of degree 3 and v ≤ 10, and for every taut filling M of σ (found by exhaustive search over 3-chains, or generated by the paper's flip construction), compute the maximum number of eligible tets in M whose boundary face-pairs are pairwise disjoint, and compare it with maxdeg(σ). A single instance where this number is less than maxdeg refutes the inference as written. If the check always passes, attempt to prove the matching lemma from |M| ≤ f − maxdeg together with primeness and tautness; a proof would remove the gap. The octahedron (maxdeg = 4) and the double cone over a pentagon (maxdeg = 5) are natural first cases.","verdict_should_be":"UNCHANGED","load_bearing_attack":"In Section 6, the proof of Theorem 2 uses Proposition 2 to get |M| ≤ f − maxdeg(σ). It then assigns each boundary 2-simplex of σ to one tet of M, observes that each tet can receive at most two assigned faces, and concludes: 'there must be at least maxdeg elements of M where this map is 2-to-1, giving us at least maxdeg disjointly eligible tets, meaning eligible tets whose pairs of boundary faces are mutually disjoint.' The counting part is fine: the excess f − |M| ≥ maxdeg forces at least maxdeg tets that are assigned two boundary faces, and those tets are distinct. But the final clause is not a consequence of the displayed inequalities. Nothing in the argument excludes eligible face-pairs from overlapping; around a high-degree vertex, for instance, the d incident dual edges form a cycle in which a matching has size at most floor(d/2). The stronger assertion is reused in Case (1) of Theorem 2 to choose a second eligible tet that is not a clone of the first, and again in Theorems 3 and 4 to choose flips that avoid a specified tet or a taboo edge. Without a proof that at least maxdeg pairwise face-disjoint eligible tets exist, the minimality argument for cleanness, the shelling construction, and the flagness argument are all unsupported. The abstract's claim of a Lean formalization is not backed by any uploaded artifact, so it cannot substitute for the missing combinatorial lemma.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies minimal L1-norm fillings of integral 2-cycles arising from simplicial triangulations of the 2-sphere. It defines Zvol(σ) as the minimum L1-norm of an integral 3-chain whose boundary is the oriented cycle X(σ), and tetvol(σ) as the minimum number of tetrahedra in a simplicial triangulation of the 3-ball extending σ. The main claim is that Zvol(σ)=tetvol(σ) and that every taut (norm-minimizing) filling of X(σ) is exactly the chain of tetrahedra of some simplicial triangulation of the ball; moreover, this filling is clean, shellable, and flag. The proof strategy is to prove a general splitting theorem (Theorem 1) for taut fillings under 'almost disjoint unions', reduce to a prime minimal counterexample, and then use eligible tetrahedra (those sharing two boundary faces with σ) to perform edge flips and derive a contradiction to minimality. The paper also states that the splitting and structural results were formalized in Lean using AI assistance.","tokens_in":7997,"tokens_out":20933,"duration_ms":206441,"significance":"If the main theorem is correct, it gives a clean structural characterization of optimal fillings of 2-sphere triangulations, sharpening the Sleator–Tarjan–Thurston problem and connecting L1 filling norms to triangulations of the ball. The splitting theorem for almost disjoint unions is a natural and potentially reusable tool. The proof is largely self-contained and parameter-free, and the shellability and flagness conclusions are strong and falsifiable. However, the manuscript as written has proof gaps: Theorem 1 is stated for all n≥2 but proved only for n=2, one subcase of the minimality argument in Theorem 2 is incomplete, and a special case in Theorem 4 is asserted without treatment. These issues are fixable within the paper's scope, so the central claim appears defensible but needs revision. I also checked the reader's specific concern about the 'disjointly eligible tets' assertion in Section 6; in my reading the counting argument does justify the face-disjointness used later, so that particular objection does not land.","major_comments":[{"comment":"The proof of Theorem 1 explicitly says 'we can assume n=2, |C|=3, as this case illustrates all the issues,' but no argument is given that the n=2 case implies the general n≥2 statement. The theorem and the abstract advertise a general splitting result for all n≥2, so as stated the theorem is not established. Since the S^2 application only needs n=2, the main geometric result may survive, but the paper must either supply the general proof or restrict the statement and abstract to the case actually used.","section":"Theorem 1, §5"},{"comment":"The contradiction with minimality in case (1) is incomplete. After choosing the auxiliary eligible tet u, the proof says '(σ_u, M−u) is bad filling pair' and appeals to minimality. But if removing u splits σ_u into an almost disjoint union, σ_u is not a simplicial triangulation of S^2, so (σ_u, M−u) is not a filling pair as defined on page 8. The proof must apply Theorem 1 to split M−u into two filling pairs and locate the doubled tet in one of them to obtain a strictly smaller bad filling pair. This step is not written and is needed for the contradiction.","section":"Theorem 2, §6, case (1)"},{"comment":"The proof of the K4 case asserts 'By treating the octahedron separately as a special case, we can assume maxdeg≥5' but the octahedron case is never treated. The subsequent counting of flipping options uses maxdeg−2 ≥ 3, which fails for the octahedron (maxdeg=4). Please add the omitted argument for the octahedron or adjust the counting so that the proof does not rely on an unproved special case.","section":"Theorem 4, §8"}],"minor_comments":[{"comment":"The phrase 'disjointly eligible tets' is terse and could be misread as requiring a nontrivial matching argument in the dual graph. The proof should state explicitly that the two boundary faces assigned to each of the r tets are disjoint across tets because the chosen map from boundary faces to tets is a function; with this clarification the asserted counting is valid.","section":"§6, 'disjointly eligible tets'"},{"comment":"The abstract claims that the splitting, cleanness, shellability, and flagness results were formalized and proved in Lean, but no Lean code, repository, or artifact is provided. Please either make the formalization available or remove the claim, since it cannot be verified or used by readers in its current form.","section":"Abstract, Lean claim"},{"comment":"There are several typos and informal phrases, e.g., 'designated intial tet' in the proof of Theorem 3, 'removetand shuck' later in the same proof, and 'Through gritted teeth' in Section 8. The paper would benefit from a careful proofreading pass.","section":"General presentation"},{"comment":"The sentence 'Obviously v>4' is slightly misleading: the tetrahedron boundary has v=4, and the exclusion of degree-3 vertices later justifies v>4. Please clarify that v>4 follows from the prime/no-degree-3 reduction.","section":"§6, start of Theorem 2"}],"recommendation":"major_revision","confidential_remarks":"The paper contains a promising main theorem and a plausible proof strategy, but the current version has several unproved assertions that are load-bearing for the stated results. In particular, the general-n splitting theorem is only proved for n=2, and the minimality argument in one case of Theorem 2 needs a missing step involving splitting. These are fixable with additional detail. The authors should also clarify the status of the Lean formalization and consider whether the abstract overclaims the generality of the splitting theorem."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Punchline: the main theorem — minimal L1 fillings of a triangulated 2-sphere are exactly triangulations of the ball, and those triangulations are shellable and flag — looks right, and the splitting theorem for taut fillings under almost disjoint union is a genuinely useful addition. The paper is worth serious refereeing, though it needs a revision that fills in the general-n proof and either ships the Lean formalization or drops the claim.\n\nWhat's actually new: Ellison had proved additivity of Zvol under almost disjoint unions. The new content here is that for n≥2 any taut filling splits (Theorem 1), and for n=2 the application to Zvol = tetvol and the structural corollaries. The proof strategy is a natural normalization/flip argument, and the exposition is clear enough to follow.\n\nWhere it's soft: Theorem 1 is stated for all n≥2 but the proof only treats n=2, with the comment 'this case illustrates all the issues.' For the main application n=2 that's fine, but the general statement isn't actually proved. The abstract's claim of a Lean formalization is not backed by any artifact; as it stands that sentence is unverifiable and should either point to code or be removed. The shelling proof has a small edge case: when maxdeg=4 it's possible that every eligible tet shares a face with the initial tet, so 'pick one that shares no face' may be impossible; this needs a few more sentences.\n\nAbout the stress-test note: I went into §6 expecting the 'disjointly eligible tets' claim to be the load-bearing gap, but on reading it the claim follows from the counting. The map sends each boundary face to a unique tet; if a tet receives two faces, those face pairs are automatically disjoint across different tets because each face has only one image. The counting f − |M| ≥ maxdeg then gives exactly maxdeg such tets. So that particular objection doesn't land. The real gaps are the ones above.\n\nWho it's for: people working on flip graphs, triangulations, and minimal fillings. The main result answers a natural strengthening of the STT question. As a referee I'd engage without hesitation; the paper likely needs minor-to-moderate revision rather than rejection.","headline":"A credible and interesting proof that taut fillings of 2-spheres are triangulations of the 3-ball, with a few unpolished corners; the 'disjointly eligible' worry from the stress-test doesn't survive contact with the text.","tokens_in":8587,"tokens_out":9405,"would_cite":true,"duration_ms":86585,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["57Q15","57K20"],"pacs":[],"model":"deepseek-v4-flash","headline":"Every taut filling of a triangulated 2-sphere is a simplicial triangulation of the 3-ball, so the minimum number of tetrahedra equals the minimal $\\ell^1$-norm of a filling chain.","keywords":["taut fillings","integral chains","tetvol","Zvol","almost disjoint union","shellable complexes","flag complexes","triangulations of the 2-sphere"],"falsifier":"Search all small triangulations $\\sigma$ of $S^2$ and compare every $\\ell^1$-minimal integral 3-chain $M$ with $\\partial M = X(\\sigma)$ against the set of simplicial triangulations of the 3-ball; any optimal chain with a repeated tetrahedron, a clique of its 1-skeleton that is not a simplex, or an interior vertex would falsify the theorem. A targeted check of the proof's gap is to find a taut filling in which the number of pairwise-disjoint eligible tetrahedra is less than the maximum vertex degree of $\\sigma$, which would break the induction in Theorem 2 even if the theorem itself remained true.","tokens_in":7503,"feed_emoji":"🧊","tokens_out":15343,"duration_ms":134824,"temperature":0.7,"pith_summary":"This paper proves that the most efficient way to fill a triangulated 2-sphere with an integral 3-chain is always an actual triangulation of the 3-ball. More precisely, it establishes the equality $\\mathrm{Zvol}(\\sigma) = \\mathrm{tetvol}(\\sigma)$: the minimal $\\ell^1$-norm of an integral 3-chain whose boundary is the oriented sphere equals the minimum number of tetrahedra needed to extend $\\sigma$ to a triangulation of the ball. Every optimal filling is clean, meaning it has no repeated tetrahedra and no interior vertices, and its support complex is shellable and flag: every clique of its 1-skeleton occurs as a simplex. The engine is a general splitting theorem: for $n$-dimensional cycles, every taut filling of an almost disjoint union, where summand vertex sets overlap in at most $n+1$ vertices, splits into taut fillings of the summands when $n \\ge 2$. This turns a numerical optimization problem into a structural statement about simplicial balls.","feed_headline":"Minimum sphere fillings are always 3-ball triangulations","feed_subtitle":"The cheapest integral chain filling a triangulated sphere is always a genuine simplicial ball.","key_machinery":"The almost-disjoint-union splitting theorem is the load-bearing mechanism. It says that if $X,Y$ are integral $n$-cycles whose vertex supports intersect in at most $n+1$ vertices, then any taut filling of $X+Y$ decomposes into taut fillings of $X$ and $Y$ (for $n \\ge 2$), so the minimal norm adds. Its proof uses projection chain maps that collapse the shared vertices to two chosen points, sending each tetrahedron to one side or the other; a type analysis of tetrahedra as pure $X$, pure $Y$, or hybrid rules out the hybrid cases with a complete-cone argument. The splitting theorem is then applied to a 2-sphere filling by decomposing the boundary under edge flips, which is why the sphere-specific conclusions of shellability and flagness follow from the splitting.","core_discovery":"The central claim is that taut fillings are real triangulations, not merely formal chains. Given a simplicial triangulation $\\sigma$ of $S^2$, orient its 2-simplices to get a 2-cycle $X$; a taut filling is an integral 3-chain $M$ with $\\partial M = X$ of minimal $\\ell^1$-size. The paper shows that any such $M$ is supported on a simplicial complex homeomorphic to the 3-ball that extends $\\sigma$, which immediately gives $\\mathrm{Zvol}(\\sigma) = \\mathrm{tetvol}(\\sigma)$. The proof goes through the almost-disjoint-union splitting theorem: whenever two $n$-cycles $X,Y$ have vertex sets meeting in at most $n+1$ points, $\\mathrm{Zvol}(X+Y)=\\mathrm{Zvol}(X)+\\mathrm{Zvol}(Y)$, and for $n \\ge 2$ every taut filling of the sum is the sum of taut fillings of $X$ and $Y$. Applying this to a minimal hypothetical counterexample, the authors show that removing an eligible tetrahedron flips an edge of the boundary sphere and produces a smaller counterexample, which forces the structure of a ball triangulation. The same argument yields free shelling and flagness of the support complex.","pith_inferences":["Where the rational and integral minimal volumes differ, real-optimal fillings may fail to be simplicial ball triangulations; this would make the clean structure theorem special to integral tautness rather than a property of all optimal fillings.","The flagness result suggests a practical certificate: if one can show the converse, checking that a filling's support is a flag ball with the correct boundary could certify optimality without solving an integer program.","The paper's own comparison with flip-path convexity points toward a common convexity principle; a natural test is whether the same normalization technique proves splitting for other rewrite systems, such as polygon dissections or higher flip graphs."],"forward_implications":["For any triangulation $\\sigma$ of the 2-sphere, $\\mathrm{Zvol}(\\sigma)=\\mathrm{tetvol}(\\sigma)$, so the minimum number of tetrahedra in a ball extension can be computed as an $\\ell^1$-minimization over integral chains rather than searched over triangulations.","Every taut filling is a clean simplicial 3-ball: no repeated tetrahedra and no vertices interior to the filling, so minimal fillings are genuine triangulations rather than formal chains with cancellations.","Every taut filling is freely shellable: any chosen tetrahedron can be the first in a shelling order, giving a constructive one-tetrahedron-at-a-time building sequence for the ball.","Every taut filling is a flag complex: each clique of its 1-skeleton occurs as a simplex, so the filling is combinatorially determined by its graph.","Taut fillings split under almost disjoint union for cycles of dimension at least 2, so the minimal filling of a connected-sum triangulation is the union of minimal fillings of its prime components."],"supporting_citations":[{"why":"Introduced the minimal-extension question, supplied the coning bound $\\mathrm{Zvol} \\le |X|-\\max\\deg$, and contributed the normalization technique reused in the splitting proof.","marker":"[5]"},{"why":"Proved additivity of $\\mathrm{Zvol}$ under almost disjoint union and, via LP duality, of $\\mathrm{Qvol}$; Theorem 1 extends this from additivity to splitting of individual taut fillings.","marker":"[2]"},{"why":"The authors' earlier work producing triangulations with $\\mathrm{Qvol}=2v-10$ for all $v \\ge 13$ and examples with $\\mathrm{Qvol}<\\mathrm{Zvol}$, which motivate the upgrade from numerical bounds to structural conclusions.","marker":"[1]"}],"fun_headline_variants":["Cheapest sphere fillings are simplicial balls","Taut fillings: minimal chains are real 3-balls","Sphere fillings: minimal always implies ball shape","Taut fillings are genuine simplicial 3-balls","Minimal integral fillings are simplicial balls"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"In the proof of Theorem 2, the authors assert without giving a proof that a minimal counterexample contains as many pairwise-disjoint eligible tetrahedra as the maximum vertex degree of the sphere triangulation; an eligible tetrahedron is one that shares two boundary faces with the sphere. This assertion is reused in the shelling and flagness theorems, and if it fails, the minimality argument that produces the ball triangulation loses its foundation.","fun_headline_variants_meta":{"raw":{"variants":["Cheapest sphere fillings are simplicial balls","Taut fillings: minimal chains are real 3-balls","Sphere fillings: minimal always implies ball shape","Taut fillings are genuine simplicial 3-balls","Minimal integral fillings are simplicial balls"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000276,"raw_usage":{"total_tokens":1669,"prompt_tokens":993,"completion_tokens":676,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":609,"completion_tokens_details":{"reasoning_tokens":595}},"tokens_in":609,"tokens_out":676,"duration_ms":6238,"temperature":1.0,"reasoning_tokens":595,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T21:26:47.351105+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Search all small triangulations $\\sigma$ of $S^2$ and compare every $\\ell^1$-minimal integral 3-chain $M$ with $\\partial M = X(\\sigma)$ against the set of simplicial triangulations of the 3-ball; any optimal chain with a repeated tetrahedron, a clique of its 1-skeleton that is not a simplex, or an interior vertex would falsify the theorem. A targeted check of the proof's gap is to find a taut filling in which the number of pairwise-disjoint eligible tetrahedra is less than the maximum vertex degree of $\\sigma$, which would break the induction in Theorem 2 even if the theorem itself remained true.","supporting_citations":[{"cited_title":"Lower bounds and integrality gaps in simplicial decomposition","cited_arxiv_id":"2404.01279","evidence_quote":"Proved additivity of $\\mathrm{Zvol}$ under almost disjoint union and, via LP duality, of $\\mathrm{Qvol}$; Theorem 1 extends this from additivity to splitting of individual taut fillings."}],"review_version":1}