On the toric lifting properties for simplicial $3$-spheres

Hyeontae Jang; Suyoung Choi; Yuanxin Guan; Zhi L\"u

REVIEW 4 major objections 4 minor 8 references

Every simplicial 3-sphere with at most 20 vertices has the toric lifting property: mod-2 characteristic maps lift to integral ones.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · deepseek-v4-flash

2026-08-01 14:36 UTC pith:I2ILKMX5

load-bearing objection Solid advance in toric lifting with a clean 20-vertex theorem, but the load-bearing bad-block facts are quoted rather than independently verified. the 4 major comments →

arxiv 2607.18706 v1 pith:I2ILKMX5 submitted 2026-07-21 math.AT math.CO

On the toric lifting properties for simplicial 3-spheres

Suyoung Choi , Yuanxin Guan , Hyeontae Jang , Zhi L\"u This is my paper

classification math.AT math.CO MSC 57S1214M2552B0505E45

keywords toric lifting propertycharacteristic mapssimplicial 3-spheresuniversal complexbad-block partitionlifting problemmod 2 characteristic maps

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves a vertex-count threshold for a basic lifting problem in toric topology: every simplicial 3-sphere with at most 20 vertices has the toric lifting property, meaning every mod-2 characteristic map (a labeling of vertices by vectors in Z_2^4 that makes each tetrahedron a basis) lifts to an integral characteristic map (a labeling by integer vectors making each tetrahedron unimodular). The proof reduces liftability to a count of tetrahedra. The 840 facets of the universal complex X(Z_2^4) split into 168 'bad blocks' of five facets each, and a map lifts as soon as its tetrahedron images miss one whole block. For a 20-vertex 3-sphere the number of tetrahedra is at most 165, so a miss is forced. The same criterion yields liftability for all neighborly 3-spheres, all flag 3-spheres on at most 25 vertices, all maps with at most 13 distinct vertex images (including every orientable map), and every nontrivial join.

Core claim

The central claim is that the obstruction to lifting mod-2 characteristic data over a simplicial 3-sphere is purely combinatorial and finite: it lives in the universal complex X(Z_2^4), whose 840 basis-facets partition into 168 five-facet 'bad blocks' under GL(4,Z_2). The paper proves (Lemma 2.2) that if a mod-2 characteristic map's facet images avoid at least one bad block, then an integral lift exists. Since a simplicial 3-sphere on m ≤ 20 vertices has at most 165 tetrahedra — by the upper bound theorem plus a 15-colorability argument that caps edges at 185 — the set of facet images has size < 168 and must miss a block, yielding Theorem 3.1. The same criterion drives the image-size (≤13) a

What carries the argument

The central object is the universal complex X(Z_2^4): its 15 vertices are the nonzero vectors of Z_2^4 and its 840 facets are the quadruples forming bases. Its facet set admits a partition into 168 'bad blocks' of five facets each, each a GL(4,Z_2)-translate of the standard block B = {{a_3,a_5,a_9,a_14},{a_3,a_6,a_10,a_13},{a_5,a_6,a_11,a_12},{a_7,a_9,a_10,a_12},{a_7,a_11,a_13,a_14}} — exactly the facets whose {0,1}-representatives have determinant of absolute value 3. The workhorse is the bad-block avoidance criterion (Lemma 2.2): a mod-2 characteristic map lifts whenever its facet images are disjoint from some block, which reduces lifting to the counting question of whether the number of d

Load-bearing premise

The whole argument depends on the quoted claim, borrowed from the authors' earlier work without re-derivation, that the 840 facets of X(Z_2^4) partition into 168 five-facet bad blocks and that the only facets whose 0-1 determinants have absolute value 3 are the five in the standard block B; if that classification is wrong, the avoidance criterion and Theorem 3.1 collapse.

What would settle it

A brute-force enumeration of the 840 facets of X(Z_2^4) checking two facts would settle the load-bearing classification: (i) the five listed facets of block B are exactly those with 0-1 determinant ±3, and (ii) the 168 translates of B under GL(4,Z_2) partition the facet set. If either fails, Lemma 2.2 is false. Separately, running Algorithm 1 with N = 8 on the 14-vertex induced subcomplex X[V \ {a_15}] and getting SAT would refute Proposition 5.2.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

If this is right

Every simplicial 3-sphere with at most 20 vertices has the toric lifting property, extending the previously known 8-vertex bound for PL 3-spheres (Theorem 3.1).
Every neighborly simplicial 3-sphere — where every pair of vertices spans an edge — has the toric lifting property (Corollary 3.2).
Every flag simplicial 3-sphere with at most 25 vertices has the toric lifting property (Theorem 3.4).
Every mod-2 characteristic map with at most 13 distinct vertex images lifts; in particular every orientable mod-2 map lifts (Theorem 3.6, Corollary 3.7).
Every simplicial 3-sphere that is a nontrivial join of lower-dimensional simplicial spheres has the toric lifting property (Theorem 4.3).

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The counting slack (165 < 168) leaves room for a sharper argument: a more refined 15-coloring bound on the 1-skeleton of a 21-vertex 3-sphere could push the vertex threshold beyond 20 without new ideas.
The sharpness result for 14-element subsets suggests that the true obstruction to lifting is the size of the image of the characteristic map, not the vertex count of the sphere; a general 'image-size lifting' principle may hold for other dimensions.
Algorithm 1 offers a practical, machine-checkable UNSAT obstruction test; applying it directly to a 21-vertex construction would test whether the 20-vertex bound is sharp.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Desk Editor's Note

Solid advance in toric lifting with a clean 20-vertex theorem, but the load-bearing bad-block facts are quoted rather than independently verified.

read the letter

Bottom line: the main theorem is real and the proof structure is sound, but the load-bearing piece is a finite combinatorial fact imported from the authors' own earlier paper, and the manuscript doesn't give the reader a way to check it. I'd send it to a referee, but I'd ask for the finite checks to be made reproducible.

What's new: the 20-vertex bound for all simplicial 3-spheres is a genuine advance over the previous 8-vertex result for PL spheres. The proof is clean: the upper bound theorem plus a 15-colorability argument gives f3(K) ≤ 165 < 168, and the bad-block avoidance criterion says any characteristic map whose facet images miss one of 168 blocks lifts. That criterion is a useful tool in its own right. The corollaries for neighborly spheres, flag spheres with at most 25 vertices, join complexes, and image-size at most 13 all extend the literature. The sharpness results—no lift for any 14-vertex induced subcomplex of X(Z2^4), and a facet-surjective map from a 3-sphere—are substantive.

The soft spot is verification. The partition of F(X(Z2^4)) into 168 five-facet blocks and the classification of facets with determinant ±3 are stated as facts from [3], the authors' earlier work. If either is wrong, Lemma 2.2 and Theorem 3.1 fall. I don't think they are wrong—the citation is legitimate—but a result this dependent on a specific finite partition should give the referee a way to see it: a short enumeration, a certificate, or a link to code. The same goes for the 'direct determinant computation' in Lemma 3.5 and the UNSAT run in Proposition 5.2; the table of surviving assignments helps, but an independent artifact would settle it. These are fixable, not fundamental.

Who this is for: people working on toric lifting, small covers, and universal complexes. The avoidance criterion might get reused. The paper does not resolve the general lifting problem, but it makes a solid dent.

Recommendation: accept for peer review. Ask the authors to include the finite verification for the bad-block partition, the det-±3 classification, and the UNSAT computation—preferably as a small script or an appendix with the enumeration. The mathematics is coherent; the missing piece is reproducibility.

Referee Report

4 major / 4 minor

Summary. The paper studies the toric lifting property for simplicial 3-spheres: given a mod 2 characteristic map λ_R over K, when does it admit an integral characteristic lift? The main result (Theorem 3.1) states that every simplicial 3-sphere with at most 20 vertices has the toric lifting property. The proof introduces a 'bad-block partition' of the 840 facets of the universal complex X(Z_2^4) into 168 five-facet blocks. Lemma 2.2 shows that if the set of facet images of a characteristic map avoids any one block, then a lift exists; Proposition 2.3 then gives liftability whenever the number of facets is <168. The vertex bound is obtained by combining the upper bound theorem for m≤19 and a 15-coloring argument for m=20, giving f_3(K)≤165<168. The paper also proves liftability for neighborly simplicial 3-spheres, flag 3-spheres with at most 25 vertices, maps with at most 13 distinct vertex images, orientable maps, and nontrivial joins. Finally, it shows that the 13-vertex bound in Lemma 3.5 is sharp in the universal-complex sense via a finite congruence obstruction, and constructs a simplicial 3-sphere mapping surjectively to the facets of X(Z_2^4).

Significance. If the main theorem is correct, it is a substantial extension of the previously known PL-sphere result (≤8 vertices) to all simplicial 3-spheres on ≤20 vertices, and it introduces a potentially useful bad-block avoidance criterion. The paper also gives elegant uniform treatments of neighborly spheres, flag spheres up to 25 vertices, orientable maps, and joins. The proof structure is transparent: the heavy lifting is reduced to finite combinatorial facts about X(Z_2^4). The join results (Section 4) are proved by careful counting and do not rely on unshown computations. However, the central claim depends on two finite assertions (the det-3 classification in Lemma 2.1 and the bad-block partition in Section 2) that are either quoted from the authors' earlier work or asserted without proof or machine-checkable certificate. The paper also contains a 'direct determinant computation' in Lemma 3.5 over 616 facets and a computational obstruction output in Proposition 5.2, neither of which is reproducible from the manuscript as written. These gaps do not appear to be conceptual, but they are load-bearing and should be fixed before the paper is accepted.

major comments (4)

[Section 2, Lemma 2.1] The statement that the five facets in B are exactly the facets of X(Z_2^4) whose {0,1}-representative determinant has absolute value 3 is load-bearing: Lemma 2.1, Lemma 2.2, Proposition 2.3, and Theorem 3.1 all depend on it. It is asserted without proof or citation. Since there are only 840 facets, this is a finite check, but the paper should either give a short argument (e.g., using the GL(4,Z_2) action and the explicit forms of determinant-±3 facets) or include a reproducible verification (e.g., code or a table). As it stands, the reader cannot independently confirm this classification from the manuscript.
[Section 2, bad-block partition] The partition F=⊔_{α=1}^{168} B_α, with each B_α a GL(4,Z_2)-translate of B, is quoted from [3, Theorem 6.1]. In addition, the paper asserts that 'the distinct sets P(τ), as τ runs over the facets, form the bad-block partition'. This latter claim — pairwise disjointness and covering — is not proved or given an exact theorem reference. Proposition 2.3's pigeonhole argument requires that the blocks be a true partition. Please either prove directly that the sets P(τ) partition F, or state precisely which result in [3] implies this and how.
[Section 3, Lemma 3.5] The proof says 'a direct determinant computation shows' that every facet of X[S] gives determinant ±1 under the explicit 4×13 integer matrix L. This is a finite verification over the 616 facets of X[V\{a_5,a_{14}}], and it underpins Theorem 3.6 and Corollary 3.7. As written, this is an unverifiable computation. The authors should provide the verification: either the code/script used, a table of the determinants, or a symmetry argument reducing the 616 cases to a manageable number. Without this, the image-size theorem rests on an unsupported claim.
[Section 5, Proposition 5.2] The proof of non-liftability of the 14-vertex inclusion depends on Algorithm 1, but the survivor counts after each assigned vertex are stated without the program or a certificate. While this is a sharpness result rather than the main theorem, it is still a computational proof. The authors should provide the code or a detailed reproducible trace so that the UNSAT claim can be independently checked. At minimum, specify the exact version of the algorithm and all data structures so that a reader could rerun the computation.

minor comments (4)

[Section 3, Corollary 3.2] In the proof, 'fλ_R' appears to be a typo; it should be the map cλ_R (or λ_R). The sentence 'Since K is neighborly, fλ_R is injective on vertices' should read 'cλ_R is injective on vertices'.
[Section 2, Lemma 2.1 proof] The assertion 'every 4×4 0-1 matrix has determinant of absolute value at most 3' is used without proof or reference. A one-sentence justification (e.g., by the Hadamard bound or by noting the maximum determinant of a 4×4 0-1 matrix is 3) would be helpful.
[Section 5, Algorithm 1] In the construction of D_N(v), the 'sign orbits' C_N(v)/{±1} may be confusing when N is even and a vector could coincide with its negative modulo N. Clarify that the algorithm chooses representatives in a fixed way; the proof of Lemma 5.1 handles this, but a remark at the definition would improve readability.
[Section 4, Lemma 4.2] In the case-by-case count, phrases such as 'we do not group the remaining case' are clear in context, but a brief explanation of why the ungrouped cases still contribute at most the stated number would aid the reader.

Circularity Check

0 steps flagged

No circular derivation: the main theorem is a conditional consequence of an imported finite combinatorial partition, not an equivalent reformulation of the lifting property.

full rationale

The derivation chain is not circular. Theorem 3.1 reduces the lifting property for simplicial 3-spheres with at most 20 vertices to the facet-count bound f3(K) <= 165 < 168, obtained from Stanley's upper bound theorem and a 15-coloring argument, and then invokes Proposition 2.3. Proposition 2.3 is a pigeonhole argument over the 168-block bad-block partition, and Lemma 2.2 gives an explicit construction of the lift: after moving a block to the standard bad block B via GL(4,Z2), the {0,1}-representative is shown to be unimodular by Lemma 2.1, and then an integral lift of the GL(4,Z2) element transforms it back. The lift is exhibited, not assumed. The only external input is the finite combinatorial fact, cited from the authors' prior paper [3], that F(X(Z2^4)) partitions into 168 GL(4,Z2)-translates of B, together with the finite identification of B as the facets of determinant ±3. These are parameter-free, finite, and independent of the lifting property; they do not include the target result as an assumption, and they are externally checkable by direct enumeration. A failure of these finite facts would undermine correctness, but that is a verification/reproducibility concern, not circularity. No fitted constants are renamed as predictions, and no result is defined in terms of the conclusion it is used to prove. The computational assertions in Section 5 (Algorithm 1 runs) are not used to prove the main lifting theorem except as sharpness examples, and they are likewise not circular. Therefore the appropriate finding is no significant circularity.

Axiom & Free-Parameter Ledger

0 free parameters · 6 axioms · 0 invented entities

The central liftability results rest on finite combinatorial structural facts about X(Z_2^4): the bad-block partition (from [3]) and the classification of det-3 facets (asserted). These are checkable in small search spaces but the paper does not supply code or certificates. No free parameters are fitted; all inputs are structural. No new entities are postulated.

axioms (6)

domain assumption The 840 facets of X(Z_2^4) admit a bad-block partition into 168 blocks, each a GL(4,Z_2)-translate of the standard bad block B.
Quoted from [3, Theorem 6.1] without reproof; the paper's Lemma 2.2 and Prop 2.3 depend on it. It is a finite combinatorial fact not verified in this paper.
ad hoc to paper The only facets of X(Z_2^4) whose {0,1}-representative determinant has absolute value 3 are the five facets in B.
Asserted in Section 2 without proof or enumeration; used in Lemma 2.1 to ensure that avoiding B gives unimodular {0,1}-determinants. Finite check not shown.
standard math Upper Bound Theorem for simplicial spheres: f_3(K) ≤ m(m-3)/2 for simplicial 3-spheres on m vertices (Stanley [6]).
Used in Theorem 3.1 to bound f_3 for m≤19.
standard math Flag upper bound theorem for flag 3-manifolds (Zheng [8]): f_1 ≤ floor(m^2/4)+m.
Used in Theorem 3.4.
standard math Reduction map GL(4,Z) → GL(4,Z_2) is surjective.
Used in Lemma 2.2 to lift the GL(4,Z_2) transformation to an integral one.
domain assumption Connected sum of simplicial 3-spheres along facets yields a simplicial 3-sphere.
Used in Lemma 5.3 and Proposition 5.4 without proof; standard PL topology fact.

pith-pipeline@v1.3.0-alltime-deepseek · 13534 in / 27940 out tokens · 219274 ms · 2026-08-01T14:36:08.343514+00:00 · methodology

0 comments

read the original abstract

We study the lifting problem for mod $2$ characteristic maps over simplicial $3$-spheres. Using a bad-block partition of the universal complex $X(\mathbb{Z}_2^4)$, we prove an avoidance criterion for liftability. We show that every simplicial $3$-sphere with at most $20$ vertices has the toric lifting property. We also obtain image-size and join-type results, and prove sharpness of the image-size bound in the universal-complex sense.

discussion (0)

Reference graph

Works this paper leans on

8 extracted references

[1]

Anton Ayzenberg,Buchstaber invariant, minimal non-simplices and related, Osaka J. Math. 53(2016), no. 2, 377–395. MR 3492804

2016
[2]

Djordje Barali´ c and Lazar Milenkovi´ c,Small covers and quasitoric manifolds over neighborly polytopes, Mediterr. J. Math.19(2022), no. 2, Paper No. 87, 31. MR 4396819

2022
[3]

Suyoung Choi, Hyeontae Jang, and Mathieu Vall´ ee,Toric wedge induction and toric lifting property for piecewise linear spheres with few vertices, J. Lond. Math. Soc. (2)112(2025), no. 1, Paper No. e70231, 24. MR 4931929

2025
[4]

Suyoung Choi and Hanchul Park,Wedge operations and torus symmetries, Tohoku Math. J. (2)68(2016), no. 1, 91–138. MR 3476138

2016
[5]

Math.42(2005), no

Hisashi Nakayama and Yasuzo Nishimura,The orientability of small covers and coloring simple polytopes, Osaka J. Math.42(2005), no. 1, 243–256. MR 2132014

2005
[6]

Stanley,The upper bound conjecture and Cohen-Macaulay rings, Studies in Appl

Richard P. Stanley,The upper bound conjecture and Cohen-Macaulay rings, Studies in Appl. Math.54(1975), no. 2, 135–142. MR 458437 ON THE TORIC LIFTING PROPERTIES FOR SIMPLICIAL 3-SPHERES 15

1975
[7]

Yi Sun,Buchstaber invariants of universal complexes, Chinese Ann. Math. Ser. B38(2017), no. 6, 1335–1344. MR 3721705

2017
[8]

Math.222 (2017), no

Hailun Zheng,The flag upper bound theorem for 3- and 5-manifolds, Israel J. Math.222 (2017), no. 1, 401–419. MR 3736511 Department of Mathematics, Ajou University, 206, World cup-ro, Yeongtong-gu, Suwon 16499, Republic of Korea Email address:schoi@ajou.ac.kr School of Mathematical Sciences, Fudan University, 220 Handan Road, Yangpu Dis- trict, Shanghai 20...

2017

[1] [1]

Anton Ayzenberg,Buchstaber invariant, minimal non-simplices and related, Osaka J. Math. 53(2016), no. 2, 377–395. MR 3492804

2016

[2] [2]

Djordje Barali´ c and Lazar Milenkovi´ c,Small covers and quasitoric manifolds over neighborly polytopes, Mediterr. J. Math.19(2022), no. 2, Paper No. 87, 31. MR 4396819

2022

[3] [3]

Suyoung Choi, Hyeontae Jang, and Mathieu Vall´ ee,Toric wedge induction and toric lifting property for piecewise linear spheres with few vertices, J. Lond. Math. Soc. (2)112(2025), no. 1, Paper No. e70231, 24. MR 4931929

2025

[4] [4]

Suyoung Choi and Hanchul Park,Wedge operations and torus symmetries, Tohoku Math. J. (2)68(2016), no. 1, 91–138. MR 3476138

2016

[5] [5]

Math.42(2005), no

Hisashi Nakayama and Yasuzo Nishimura,The orientability of small covers and coloring simple polytopes, Osaka J. Math.42(2005), no. 1, 243–256. MR 2132014

2005

[6] [6]

Stanley,The upper bound conjecture and Cohen-Macaulay rings, Studies in Appl

Richard P. Stanley,The upper bound conjecture and Cohen-Macaulay rings, Studies in Appl. Math.54(1975), no. 2, 135–142. MR 458437 ON THE TORIC LIFTING PROPERTIES FOR SIMPLICIAL 3-SPHERES 15

1975

[7] [7]

Yi Sun,Buchstaber invariants of universal complexes, Chinese Ann. Math. Ser. B38(2017), no. 6, 1335–1344. MR 3721705

2017

[8] [8]

Math.222 (2017), no

Hailun Zheng,The flag upper bound theorem for 3- and 5-manifolds, Israel J. Math.222 (2017), no. 1, 401–419. MR 3736511 Department of Mathematics, Ajou University, 206, World cup-ro, Yeongtong-gu, Suwon 16499, Republic of Korea Email address:schoi@ajou.ac.kr School of Mathematical Sciences, Fudan University, 220 Handan Road, Yangpu Dis- trict, Shanghai 20...

2017