{"id":"ada925b1-b1c6-43ae-a608-2da6264db1a9","arxiv_id":"2509.06811","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Cosmological polytopes and Graev polytopes are unified through ternary relations on 2-dimensional simplicial posets, yielding new facet families for some root-system polytopes.","lead":"This paper shows that two seemingly unrelated families of polytopes, one from Einstein metrics on homogeneous spaces and one from cosmological physics, are actually special cases of a single construction based on ternary relations. A generalist might read it to see how abstract combinatorics can unify problems from differential geometry and quantum cosmology.","discovery_kind":"unification","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 4.10's new D_n facet family rests on unproved contraction claims; the Reader's specific chord edge case is likely not fatal, but the contraction lemma needs proof.","rationale":"The central claim of the paper—the cosmological polytope construction is a special case of the Graev construction—is well supported: Lemma 2.2 gives a clean isomorphism T(C_G)≃T(G), and the later isomorphisms for A, B, D root systems are straightforward. The marking-to-cocycle theorem (Theorem 3.2) is well argued. The main weakness is in Section 4: Theorem 4.10's proof leaves essential contraction and isometric-cycle facts unproved. I agree with the Reader that these are a legitimate concern and that the verdict should be CONDITIONAL rather than full ACCEPT. However, the Reader's specific edge case about a chord of H belonging to G appears to be based on a misreading of notation: the diagonal used is the negative edge e_{i s^2(i)}, which is never in G because G is a spanning subgraph of K^+_n. The contraction claims are likely fixable, and small-case computational verification or an independent proof would settle whether they hold. The central unification does not depend on these facet results, so they should not drive the verdict below CONDITIONAL unless a concrete counterexample is found.","tokens_in":23736,"tokens_out":25179,"duration_ms":259971,"concrete_test":"Implement the combinatorial objects for small n (e.g., n=5,7,8, all with n-1 not divisible by 3). For each Hamiltonian graph H on n-1 vertices (exhaustive for n=5, random/sample for n=7,8), construct G⊂K^+_n as in Theorem 4.10. Then computationally verify: (a) for every edge in E(K^+_{n-1})\\E(H), the specified odd-length walk contracts to the positive edge using the triangle rules of K_n; (b) the two diagonals of each 4-cycle C_i and of the E(H)\\E(C) 4-cycles are negative edges not in E(G), and both length-2 arcs are shortest contractable walks; (c) the ic-coloring algorithm produces a single color class. If any instance fails, the theorem is false. If all pass, run an independent analytic proof of the odd-walk contraction lemma for simple walks.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The paper's main new facet results for D_n are Theorem 4.10, whose proof contains three assertions stated with 'one can show' or 'the similar argument holds': (i) any walk in K^+_n connecting v_i and v_j with an odd number of edges contracts to the positive edge e^j_i; (ii) the 4-cycles C_i are isometric; (iii) the analogous 4-cycles for E(H)\\E(C) are isometric. These are load-bearing: if any fails for some Hamiltonian H, the bypassing or 1-ic-colorability of G fails, and the claimed D_n facet family is not established. The Reader's specific worry about the diagonal edge e_i^{s^2(i)} belonging to H appears to be a misreading: the argument uses the negative edge e_{i s^2(i)}, which never lies in E(G) because G⊂K^+_n contains only positive edges. That particular edge case is not fatal. However, the unproved odd-walk contraction lemma is a real gap; it is plausible for the simple walks actually used, but it is not stated or proved as a separate lemma, and the assertion in full generality (any walk, allowing repeated edges) may even be false. The theorem's conclusion is likely correct, but the proof as written is incomplete.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper develops a common framework for three a priori unrelated constructions: Graev's ternary-relation polytopes (which bound the number of Einstein metrics on homogeneous spaces), cosmological polytopes of Arkani-Hamed, Benincasa and Postnikov, and the metric cone of finite metric spaces. Section 2 introduces ternary relations attached to 2-dimensional simplicial posets and proves exact isomorphisms showing that any cosmological polytope is a ternary polytope (Lemma 2.2), that the Graev polytope P(A_{n-1}) is P(K_n) (Lemma 2.3), and that D_n and B_n polytopes are represented by the simplicial posets K_n and (C K_n)^{(2)} (Lemmas 2.4 and 2.5). Section 3 extends the marking technique from cosmological polytopes to simplicial posets, proving a bijection between one-corner markings and Z_2 1-cocycles (Theorem 3.2). Section 4 defines metrics on simplicial posets, generalizes Avis's criterion for extremality (Theorem 4.9), and claims an infinite family of facets for the D_n polytope for n ≥ 5 with 3 ∤ (n−1) (Theorem 4.10).","tokens_in":24040,"tokens_out":21362,"duration_ms":217060,"significance":"If the results are correct, the paper gives a clean conceptual unification: the cosmological polytope construction is literally a special case of Graev's construction, and the metric cone is also recovered as the dual of a Graev polytope. The cocycle reformulation in Theorem 3.2 is elegant and is proved from first definitions. The explicit isomorphisms in Section 2 are exact and are the strongest parts of the paper. The proposed D_n facet family in Theorem 4.10 would be a genuinely new contribution to the metric-cone literature, but the proof as written relies on unproved contraction assertions; until those are supplied, this part of the paper should be viewed as conditional.","major_comments":[{"comment":"The assertion 'One can show that any walk in K^+_n connecting v_i and v_j which contains odd number of edges can be contracted to the edge e_j^i along K_n' is not proved and, as stated, is false. For example, in K_4 the odd walk e_1^2, e_2^1, e_1^3 (a backtrack along the same positive edge) cannot be contracted, since no triangle contains a repeated edge. This matters because the bypassing argument for edges in E(K^+_{n-1})\\E(H) uses exactly this statement. The lemma that is actually needed is the simple-path version: a simple path in K^+_n of odd length from v_i to v_j contracts to e_i^j. This is plausible and can be proved by induction on length using triangles of the form \\Delta_b^{ac} and \\Delta_d^{ac}, but it must be stated and proved explicitly. As written, Theorem 4.10 is not established.","section":"Section 4.2, proof of Theorem 4.10"},{"comment":"The isometricity of the 4-cycles C_i is asserted with 'One can show', and the analogous claim for the cycles used for E(H)\\E(C) is asserted with 'the similar argument holds'. These are load-bearing for the 1-ic-colorability of G. The arguments are likely repairable: for the pair (v_{s(i)}, v_n) one should use the ordinary edge e_{s(i),n}, which is not in E(G), and exhibit the two length-2 contractable walks in G. Please provide these details explicitly, including the corresponding B_G witnesses, rather than leaving them as unchecked assertions.","section":"Section 4.2, proof of Theorem 4.10"}],"minor_comments":[{"comment":"The last line says 'd'(e_1)+\\cdots+d'(e_n)=d'(e_n)'; this should read '=d'(e)'.","section":"Section 4.2, proof of Theorem 4.7"},{"comment":"The proof assumes there is a multiplier \\lambda\\in R_{>0} with d'=\\lambda d_G on E(G). If d' vanishes on E(G), one must allow \\lambda=0. This is harmless (then induction gives d'=0), but it should be stated so the proof is formally correct.","section":"Section 4.2, proof of Theorem 4.9"},{"comment":"The notation K_n for the boolean 2-skeleton and K_n for its extension is hard to distinguish in plain text. A different letter or font (e.g. K'_n) would improve readability.","section":"Section 2.2, after Definition 2.1"},{"comment":"The statement 'one can show that markings from Mmin_f(P) are in one-to-one correspondence with extreme rays of P(P)^∨' is standard but is not proved or referenced; a short justification would be helpful.","section":"Section 3, before Lemma 3.1"},{"comment":"There are several typographical errors: 'inlcusion', 'simlicial', 'partial case' for 'special case', and the reference title 'metic cone' in [5]. These do not affect the mathematics.","section":"Throughout"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Read this for Section 2 and Theorem 3.2; treat Theorem 4.10 as provisional.\n\nThe central move is to define ternary relations on 2-dimensional simplicial posets. The isomorphisms in Lemmas 2.3–2.5 are clean and exact: A_{n-1}, D_n, and B_n all become ternary polytopes of specific posets, and Lemma 2.2 embeds cosmological polytopes into the same framework. Theorem 3.2 is the real contribution: a canonical bijection between one-mark-per-triangle locally feasible markings and 1-cocycles over Z_2, with minimality preserved. That is a neat, useful tool.\n\nThe weak spot is Section 4, specifically the proof of Theorem 4.10. The bypassing proof and the 1-ic-colorability argument rely on \"one can show\" claims: that any odd-length positive-edge walk contracts to the positive edge between its endpoints, and that the 4-cycles C_i are isometric. The stress-test rescues the reader's chord worry correctly—the diagonal edge e_{i s^2(i)} is a negative-type edge, so it cannot lie in H ⊂ G ⊂ K^+_n. But the odd-walk contraction assertion is genuinely unproved, stated in full generality with repeated edges allowed, and it is load-bearing: without it the bypassing property for edges in E(K^+_{n-1})\\E(H) fails, and the D_n facet family is not established. The claim is plausible for the simple walks actually used, and I suspect the theorem is true, but the proof as written is incomplete. The paper also asserts the existence of P(A_n) facets outside M_min_loc without proof or reference; that may be known, but it needs support.\n\nBottom line: the unification and the cocycle theorem are solid, and the paper deserves a serious referee. The referee should push for a separate contraction lemma and a proof or reference for the A_n facet claim. I would send it out, not desk-reject.","headline":"A clean unification of Graev and cosmological polytopes with a genuinely useful marking/cocycle theorem; the new D_n facet family rests on a proof gap that should be fixed.","tokens_in":24565,"tokens_out":2368,"would_cite":true,"duration_ms":25902,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["52B12","05E45","53C25"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper establishes that cosmological polytopes, introduced for computing the wavefunction of the Universe, are a special case of Graev's ternary-relation polytopes, and uses this to transfer extreme-metric techniques to root-system polyt","keywords":["ternary relations","ternary polytopes","cosmological polytopes","Graev polytopes","root systems","extreme metrics","metric cone","simplicial posets"],"falsifier":"Compute the ternary relation T(C_G) for a single-edge graph G and compare its polytope with the triangle P(G); if the vertex sets or facet counts differ, Lemma 2.2 and the unification fail. To target Theorem 4.10 directly, take n=5 and a Hamiltonian graph H containing the diagonal chord e_i^{s^2(i)} used in the proof, then check whether the 4-cycle C_i is isometric in G; the proof's 'similar argument' is exactly the point that would break.","tokens_in":23608,"feed_emoji":"🔺","tokens_out":13470,"duration_ms":116204,"temperature":0.7,"pith_summary":"The paper's central claim is that the cosmological polytope construction, invented for computing the wavefunction of the Universe, is a special case of a polytope construction due to Graev that arose in the study of left-invariant Einstein metrics. The bridge is an isomorphism of ternary relations: for every graph G, the ternary relation built from the cone over G is isomorphic to the ternary relation built from G itself, so the two polytopes coincide. The author then inserts 2-dimensional simplicial posets between graphs and root systems, showing that the Graev polytopes for A_{n-1}, D_n, and B_n are ternary polytopes of such posets. Using the marking/cutset technique and a generalization of Avis' extreme-metric criterion, the paper produces new families of extreme metrics and hence facets for these polytopes. If correct, the two theories—one from cosmology, one from homogeneous-space geometry—are one combinatorial subject.","feed_headline":"Cosmological polytopes are Graev ternary polytopes","feed_subtitle":"A cone isomorphism ties cosmological polytopes to Graev's Einstein-metric polytopes and yields new facet families.","key_machinery":"The central object is the symmetric ternary relation T=(Σ,R) and its ternary polytope P(T)=Conv(e_i+e_j−e_k, e_i−e_j+e_k, −e_i+e_j+e_k : [i,j,k]∈R). The load-bearing identity is Lemma 2.2: for any graph G seen as a 1-dimensional simplicial poset, T(C_G)≃T(G), which forces P(C_G)=P(G). The cone C_G adds an apex vertex; its edges encode exactly the original edges and vertices of G, and its triangles encode the relation triples [v_1,e,v_2]. For root systems, the 2-dimensional simplicial posets K_n (doubled complete graph) and (C K_n)^(2) play the analogous role. The facet machinery in Section 4 is carried by 'bypassing subgraphs' and '1-ic-colorable' graphs: a subgraph whose every missing edge","core_discovery":"The paper claims that the cosmological polytope of a graph G is the ternary polytope P(T(G)) from Definition 1.1. Lemma 2.2 proves the stronger isomorphism T(C_G)≃T(G), where C_G is the cone over G viewed as a 1-dimensional simplicial poset, so P(C_G)=P(G); this makes the cosmological construction a special case of Graev's. The same dictionary gives P(A_{n−1})=P(K_n), P(D_n)=P(K_n), and P(B_n)=P((C K_n)^(2)). On facets, Theorem 3.2 identifies minimal one-corner markings with minimal 1-cocycles, yielding a cutset description when H^1(P,Z2)=0; Theorem 4.9 shows a bypassing, 1-ic-colorable subgraph induces an extreme graph metric; Theorem 4.10 builds such subgraphs in K_n for n≥5 with n−1 not d","pith_inferences":["Extension: since the isomorphism T(C_G)≃T(G) holds at the level of ternary relations, constructions on cosmological polytopes that depend only on the relation—triangulations, Ehrhart data, facet complexes—should transfer verbatim to the corresponding Graev polytopes.","Extension: applying Theorem 4.9 to the B_n simplicial poset (C K_n)^(2) is the natural next step; the paper sets up the definitions but does not carry out the search for bypassing 1-ic-colorable subgraphs there.","Extension: the number-theoretic condition 'n−1 not divisible by 3' in Theorem 4.10 comes from iterating a 3-step shift around the Hamiltonian cycle; other cycle structures or auxiliary edges might produce analogous facet families when n−1 is divisible by 3.","Extension: the metric-on-poset definition is new; testing it on other finite configurations, such as other root systems, could yield new extreme metrics on M_n for n=8, where the complete classification is not known."],"forward_implications":["The known facet theorem for cosmological polytopes (facets correspond to connected subgraphs of G) transfers to the corresponding Graev polytope, giving a direct geometric interpretation of cut-metric facets for type A.","Because P(A_{n−1})^∨ is the metric cone M_n, the marking/cutset description of Corollary 3.3 reconstructs the classic cut-metric facets of M_n and isolates where higher A_n needs new extreme rays.","Theorem 4.9 gives a general sufficient condition—bypassing plus 1-ic-colorable—for a graph metric on an arbitrary 2-dimensional simplicial poset to be extreme, extending Avis' criterion beyond the complete graph case.","Theorem 4.10 supplies, for every n≥5 with n−1 not divisible by 3, a family of spanning subgraphs of the doubled complete graph K_n whose induced graph metrics are extreme; under Lemma 2.4 these are facets of P(D_n).","The cone identifications put the B_n Graev polytope into the same simplicial-poset framework, so the same extreme-metric machinery is available for it."],"supporting_citations":[{"why":"Introduces the cosmological polytope construction that the paper shows is a special case of Graev's ternary polytope.","marker":"[2]"},{"why":"Introduces the ternary-relation polytope P(T) and its Einstein-metric motivation, the construction being unified with cosmological polytopes.","marker":"[16]"},{"why":"Provides the root-system Graev polytopes P(Ω) that the paper re-expresses via simplicial posets.","marker":"[17]"},{"why":"Supplies the extreme-ray criterion for the metric cone that Theorem 4.9 generalizes to simplicial posets.","marker":"[5]"},{"why":"Defines the metric cone and cut-metric theory used to identify P(A_{n−1})^∨ with M_n.","marker":"[13]"},{"why":"Gives the definition and basic theory of simplicial posets on which the cone and skeleton constructions rest.","marker":"[22]"}],"fun_headline_variants":["Cosmological polytopes are Graev's","Ternary polytopes unify two theories","Same polytope, two names","Two polytope theories, one object","Cone isomorphism unifies polytope theories"],"cache_read_input_tokens":2688,"weakest_assumption_plain":"The load-bearing premise of the new D_n facet family is that certain walks in the doubled complete graph always contract to straight edges and that the specific 4-cycles C_i are isometric; the second assertion is only sketched and stops applying if the chosen Hamiltonian graph already contains the diagonal edge used in the argument.","fun_headline_variants_meta":{"raw":{"variants":["Cosmological polytopes are Graev's","Ternary polytopes unify two theories","Same polytope, two names","Two polytope theories, one object","Cone isomorphism unifies polytope theories"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001452,"raw_usage":{"total_tokens":5649,"prompt_tokens":674,"completion_tokens":4975,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":418,"completion_tokens_details":{"reasoning_tokens":4907}},"tokens_in":418,"tokens_out":4975,"duration_ms":40467,"temperature":1.0,"reasoning_tokens":4907,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-04T23:03:41.984442+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the ternary relation T(C_G) for a single-edge graph G and compare its polytope with the triangle P(G); if the vertex sets or facet counts differ, Lemma 2.2 and the unification fail. To target Theorem 4.10 directly, take n=5 and a Hamiltonian graph H containing the diagonal chord e_i^{s^2(i)} used in the proof, then check whether the 4-cycle C_i is isometric in G; the proof's 'similar argument' is exactly the point that would break.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Introduces the ternary-relation polytope P(T) and its Einstein-metric motivation, the construction being unified with cosmological polytopes."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the root-system Graev polytopes P(Ω) that the paper re-expresses via simplicial posets."},{"cited_title":"Avis, On the extreme rays of the metic cone, Can","cited_arxiv_id":null,"evidence_quote":"Supplies the extreme-ray criterion for the metric cone that Theorem 4.9 generalizes to simplicial posets."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines the metric cone and cut-metric theory used to identify P(A_{n−1})^∨ with M_n."},{"cited_title":"Stanley, Enumerative Combinatorics, Vol","cited_arxiv_id":null,"evidence_quote":"Gives the definition and basic theory of simplicial posets on which the cone and skeleton constructions rest."}],"review_version":1}