{"id":"3d6b4f01-3848-45a8-a5ca-6b3ef2ab3af4","arxiv_id":"2507.11186","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"A convex semilattice is cancellative if and only if it embeds into a Riesz space, the lattice-ordered-vector-space analogue of the Stone-Kneser theorem.","lead":"This paper proves that any cancellative convex semilattice, a structure modeling probabilistic and nondeterministic choice, can be represented as a convex subset of a Riesz space. The result extends a classical theorem by Stone and Kneser and may simplify semantic models of mixed probabilistic and nondeterministic computation.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified; the proof is sound modulo the standard Stone-Kneser theorem.","rationale":"The paper's central theorem is a clean structural characterization: cancellative convex semilattices are exactly the convex subsemilattices of Riesz spaces. The proof is self-contained once the classical Stone-Kneser theorem is granted. I focused on the most intricate parts of Proposition 14, because that is where a hidden flaw would most likely live: the geometric definition of W, the construction and well-definedness of ⊞, and the verification of distributivity. Each step survives close scrutiny. The negative-closure argument, which is easy to get wrong with perspective shifts, uses Lemma 11 correctly and produces coefficients in the allowed intervals. The well-definedness proof of ⊞ handles two different choices of (c,p) and (d,q) by composing inverses of Equation (6), and the resulting equality is algebraically correct. The associativity and distributivity proofs are careful and use common witnesses provided by Step 2, which is legitimate because the operation is independent of the witness. Lemma 15, converting the constructed vector-space convex semilattice into a Riesz space, is also correct: it proves positive homogeneity and translation invariance, and then obtains infima via the standard duality x∧y = -((-x)∨(-y)). The converse direction is immediate from the defining properties of Riesz spaces and convex subsets. The only substantive external assumption is Stone-Kneser, a standard and well-cited classical result; its use is appropriate and clearly flagged. I find no reason to doubt the acceptance verdict.","tokens_in":13268,"tokens_out":25838,"duration_ms":282705,"concrete_test":"Independently verify the coefficient identity in the negative-closure step of Proposition 14 (Step 3, last paragraph) by expanding both sides as affine combinations in a computer algebra system: with q=2p/(1+p) and s=p/(1+p), confirm P(c,q,P(x,1/2,-x)) = P(P(x,1-p,c), s, -x) symbolically for arbitrary vectors x,c and p in (0,1), and confirm q,s in (0,1). If the coefficients fail to match, the closure of W under negation would fail and Proposition 14 would collapse.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim rests on Theorem 6, proven via the Stone-Kneser embedding (Theorem 3) and the construction in Proposition 14. The only genuinely external dependency is Stone-Kneser, a classical and correctly cited theorem; the paper does not re-derive it, but that is not a flaw. I checked the internal argument in detail. Step 1 of Proposition 14 correctly uses Lemma 10.2 to fill the perspective interval; Step 2 correctly constructs a common center via the mean of the c_i and Equation (10), with the coefficient p_i/(n - p_i(n-1)) in (0,1). Step 3 establishes that W is a subspace: convexity and positive scalar closure are straightforward, and the negative-closure argument, using Lemma 11 with the substitution p=1/2, r=1-p, yields q=2p/(1+p), s=p/(1+p), both in (0,1), and the displayed identity is numerically correct. Step 4's well-definedness of ⊞ is the most delicate part; the inversion of Equation (6) and the use of Lemma 13 to pass homomorphisms through the X-level join are valid, and the independence proof is coherent. Step 5's semilattice axioms and the two-stage distributivity proof are sound; in particular, the use of Equation (12) in the final distributivity step is legitimate because it is applied with the convex-combination parameter q and the elements lifted into X-compatible perspectives. Lemma 15 then correctly derives the ordered-vector-space and lattice properties, using Equation (13) and the translation-invariance computation. No internal gap or missing case was found; the only caveat is the standard heavy reliance on Stone-Kneser, which the reader already identified.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proves a representation theorem for cancellative convex semilattices: every cancellative convex semilattice is isomorphic to a convex subset of a Riesz space that is closed under binary suprema, with the convex semilattice operations induced by the ambient vector space (Theorem 6). The proof embeds the underlying cancellative convex algebra into a vector space via the classical Stone-Kneser theorem, translates so that 0 lies in the set, and then constructs a linear subspace W to which the semilattice operation is extended by a perspective-shift procedure (Proposition 14). A final lemma shows that any convex semilattice whose underlying convex algebra is a vector space is a Riesz space (Lemma 15). The development is self-contained apart from Stone-Kneser, and all perspective-shift properties used in the main construction are re-proved in Section 3.1.","tokens_in":13553,"tokens_out":18536,"duration_ms":176788,"significance":"The main theorem is a natural and nontrivial analogue of the Stone-Kneser theorem for convex algebras and provides a clean structural characterization of cancellative convex semilattices, relevant to the algebraic theory of probabilistic and nondeterministic computation. The proof is elementary, detailed, and constructive, making the result potentially useful for further study of convex semilattices. The paper is carefully written, and the external dependence on Stone-Kneser is clearly flagged and appropriate; the authors re-prove all auxiliary perspective-shift facts instead of relying on their previous work, so the argument is self-contained in the relevant sense.","major_comments":[],"minor_comments":[{"comment":"The notation p(x) for the supremum is misleading because the value depends on the fixed center c chosen at the start of the step; the dependence should be made explicit, e.g., by writing p_c(x) or by stating that c is fixed throughout the argument.","section":"Proposition 14, Step 1"},{"comment":"The displayed expression 'P(c,p,y⊕P(c,p,x))' is not well-formed, since ⊕ is not yet defined for arbitrary elements of W; it should read 'P(c,p,y)⊕P(c,p,x)' (or an equivalent correct expression).","section":"Proposition 14, Step 5, commutativity proof"},{"comment":"The sentence 'in particular for x=0 we get first needed property for ordered space' is mislabeled; the implication for x=0 yields the second property (positive homogeneity), while the first property (translation invariance) is proved immediately afterwards.","section":"Lemma 15"},{"comment":"The proofs of Lemmas 10 and 11 contain LaTeX artifacts (e.g., '/bracehtipupleft/.../') that should be cleaned up in the final version; these artifacts obscure the otherwise clear computations.","section":"Section 3.1"}],"recommendation":"minor_revision","confidential_remarks":"The paper is a strong contribution and the main result is convincing. The only issues are presentational and local; I have no concerns about novelty, circularity, or correctness beyond the standard Stone-Kneser input. I recommend minor revision to address the notation and typographical issues."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague —\n\nThe one thing to know: this paper delivers the expected Stone-Kneser analogue for convex semilattices, and the proof is solid. Cancellative convex semilattices are exactly the convex subsemilattices of Riesz spaces. That is a real theorem, not a corollary of the classical one, because you have to extend the semilattice operation from the original set to the whole vector space.\n\nWhat is genuinely new: Keimel and Plotkin had an embeddability criterion for ordered barycentric algebras under an order-cancellation axiom. This paper shows that when suprema exist, that order assumption is unnecessary. That is a clean gap to close, and the construction deserves credit.\n\nThe proof is the main achievement. The perspective-shift machinery is explained well, and the five-step construction in Proposition 14 is verified in detail. I checked the delicate step—well-definedness of the extended join—and it works: Lemma 13 gives homomorphisms, and the independence argument is coherent. The stress-test note goes through every step with numbers and they check out. Lemma 15, converting the vector-space convex semilattice into a Riesz space, is neat.\n\nSoft spots are minor: a couple of notation slips (the bound variable in Step 1 of Prop 14, a typo in the commutativity computation). They do not hinder the argument. The paper is dense, but the pictures help. It leans on Stone-Kneser as a black box, which is fine—it is a classical, correctly cited theorem.\n\nThis is for researchers in quantitative semantics, universal algebra, and monad theory. It is a solid structural result, not a flashy one. I would send it to peer review; it deserves careful refereeing, and I expect it to be accepted after minor revision.","headline":"Clean structural theorem: cancellative convex semilattices embed into Riesz spaces, with a careful proof worth refereeing.","tokens_in":14119,"tokens_out":2673,"would_cite":true,"duration_ms":30538,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["06F20","06A12","52A01"],"pacs":[],"model":"deepseek-v4-flash","headline":"Cancellative convex semilattices are exactly the convex subsemilattices of Riesz spaces.","keywords":["convex semilattice","cancellativity","Riesz space","lattice-ordered vector space","perspective shift","convex algebra","probability and nondeterminism","distributivity law"],"falsifier":"The theorem asserts an embedding for every cancellative convex semilattice, so one counterexample suffices to falsify it. Because the proof is constructive, a concrete check is available: take any cancellative convex semilattice $X$ embedded in a vector space, run the perspective-shift construction to form $W$ and $\\boxplus$, and verify the distributive law $(x \\boxplus y) +_p z = (x +_p z) \\boxplus (y +_p z)$; a single failure would disprove the theorem, while verification on nontrivial examples such as convex subsets of $\\mathbb{R}^2$ with a designated join would test the construction directly.","tokens_in":13057,"feed_emoji":"🧮","tokens_out":12579,"duration_ms":133483,"temperature":0.7,"pith_summary":"The paper proves a representation theorem for convex semilattices, the algebraic structures combining probabilistic choice (a family of 'biased coin' operations $+_p$ for $p \\in (0,1)$) with nondeterministic choice (a join operation $\\oplus$). The main result says that if the probabilistic operations are cancellative — meaning $x +_p z = y +_p z$ implies $x = y$ — then the whole structure is isomorphic to a convex subset of a Riesz space (a vector space whose order is a lattice) closed under binary suprema. This is the exact analogue, for probability plus nondeterminism, of the classical theorem that cancellative convex algebras are precisely the convex subsets of vector spaces. It matters because these algebras are the algebras for the monad of finitely generated convex subsets of probability distributions, so the result gives a concrete linear and order-theoretic home to the semantics of combined probabilistic and nondeterministic computation.","feed_headline":"Every cancellative convex semilattice embeds in a Riesz space","feed_subtitle":"Cancellativity alone forces a full lattice-ordered vector-space model for probability plus nondeterminism.","key_machinery":"The workhorse is the perspective shift $P(c,p,x) = p x + (1-p) c$, a geometric transformation that fixes the center $c$ and moves $x$ toward $c$ with ratio $p$; in the convex-algebra notation this is just $x +_p c$. The paper develops identities for composing perspective shifts (compositions and an associativity rule) and shows that, on a convex semilattice $X$ sitting inside a vector space, each $P(c,p,\\_)$ restricts to a convex semilattice homomorphism. These facts are used to construct a linear subspace $W$ of the ambient vector space, containing $X$, and a binary operation $\\boxplus$ on $W$ extending the original join; the construction is shown to be well-defined by the homomorphism property. A short lemma then proves that the order induced by $\\boxplus$ on $W$ is a lattice order compatible with the vector space structure, so $W$ is a Riesz space.","core_discovery":"The central discovery is Theorem 6: if $\\langle X, +_p, \\oplus\\rangle$ is a cancellative convex semilattice, then there exists a Riesz space $V$ and a convex subset $Y \\subseteq V$ closed under binary suprema such that $X$ is isomorphic to the convex semilattice induced by $V$ on $Y$, with $+_p$ computed as $p x + (1-p) y$ and $\\oplus$ as $\\sup\\{x,y\\}$. Equivalently, cancellative convex semilattices are exactly the convex subsemilattices of Riesz spaces. The theorem is established by first embedding the underlying convex algebra into a real vector space via the classical embedding theorem for cancellative convex algebras, then extending the semilattice operation from $X$ to a linear subspace $W$ by a perspective-shift construction, and finally showing the induced order on $W$ makes it a Riesz space. The converse, that any convex supremum-closed subset of a Riesz space is a cancellative convex semilattice, is immediate from linearity and lattice identities.","pith_inferences":["The perspective-shift extension is a general technique that should transfer to other varieties of algebras with a convex-algebra reduct plus additional idempotent operations; the same construction may yield representation theorems for cancellative variants of such mixed theories.","The paper leaves implicit that the result transfers to any ordered field: the classical embedding theorem holds over ordered skew fields, so the same proof should produce embeddings into Riesz spaces over other ordered fields.","A testable strengthening suggested by the proof: if a convex semilattice is cancellative, then the perspective-shift construction gives an explicit algorithmic representation, which could be implemented to compute the ambient Riesz space and the extended join for finitely presented examples.","The 'mid-point cancellativity' condition proposed at the end of the paper is a natural candidate for a weaker assumption under which the ordering, not just the convex structure, becomes recoverable from the semilattice; this is a possible direction for non-cancellative or partially cancellative structures."],"forward_implications":["Every cancellative convex semilattice is a subalgebra of a Riesz space, so all equational identities that hold in Riesz spaces (with $+_p$ and $\\sup$) also hold in all cancellative convex semilattices.","No additional assumption on the semilattice order is needed: cancellativity of the convex operations alone forces representability in an ordered vector space, improving on the earlier condition that an order-cancellation axiom be imposed.","The proof provides an explicit construction: embed the underlying convex algebra into a vector space, extend the join to the linear span via perspective shifts, and the resulting ordered vector space is automatically a Riesz space.","Since convex semilattices are the algebras for the monad of finitely generated convex subsets of probability distributions, the cancellative ones now have a complete geometric representation as convex subsemilattices of Riesz spaces."],"supporting_citations":[{"why":"supplies the classical theorem that every cancellative convex algebra embeds into a real vector space, which places the semilattice in an ambient vector space","marker":"[38]"},{"why":"independently provides the same embedding theorem, the starting point for the construction","marker":"[23]"},{"why":"introduces the perspective-shift technique and the geometric identities that the extension proof repeatedly uses","marker":"[36]"}],"fun_headline_variants":["Cancellative convex semilattices are Riesz space subsemilattices","Cancellative convex semilattices embed in lattice-ordered vector spaces","A convex semilattice is cancellative iff it embeds in a Riesz space","Riesz spaces model all cancellative convex semilattices","Cancellative convex semilattices are exactly convex subsemilattices of Riesz spaces"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The argument depends on the classical theorem that every cancellative convex algebra can be embedded into a real vector space; the entire construction of the subspace $W$ and the extended join takes place inside that ambient vector space, so if that embedding theorem were false the proof would have no starting point.","fun_headline_variants_meta":{"raw":{"variants":["Cancellative convex semilattices are Riesz space subsemilattices","Cancellative convex semilattices embed in lattice-ordered vector spaces","A convex semilattice is cancellative iff it embeds in a Riesz space","Riesz spaces model all cancellative convex semilattices","Cancellative convex semilattices are exactly convex subsemilattices of Riesz spaces"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000853,"raw_usage":{"total_tokens":3707,"prompt_tokens":946,"completion_tokens":2761,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":562,"completion_tokens_details":{"reasoning_tokens":2654}},"tokens_in":562,"tokens_out":2761,"duration_ms":22875,"temperature":1.0,"reasoning_tokens":2654,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T17:16:21.592725+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"The theorem asserts an embedding for every cancellative convex semilattice, so one counterexample suffices to falsify it. Because the proof is constructive, a concrete check is available: take any cancellative convex semilattice $X$ embedded in a vector space, run the perspective-shift construction to form $W$ and $\\boxplus$, and verify the distributive law $(x \\boxplus y) +_p z = (x +_p z) \\boxplus (y +_p z)$; a single failure would disprove the theorem, while verification on nontrivial examples such as convex subsets of $\\mathbb{R}^2$ with a designated join would test the construction directly.","supporting_citations":[],"review_version":1}