{"id":"af0fff1b-9e3c-4cd8-95a1-8d9509f5377e","arxiv_id":"2411.16651","paper_version":1,"verdict":"REJECT","confidence":"HIGH","novelty_score":5.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"For simultaneous optimal transport, the paper proves existence, characterizes discrete optimal mixing points, and claims Monge and Kantorovich solutions coincide when density ratios are simple functions, but that claim fails for singular measures.","lead":"This paper studies moving several probability measures into one common target measure at minimum cost, with the target either fixed or free. It proves existence of solutions, analyzes the discrete case, and claims that in Euclidean space the optimal map and optimal plan coincide.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 5.8 fails for n=1 when μ is singular: the segment-to-perpendicular-segment example has optimal non-graph plans, so the advertised Monge–Kantorovich coincidence is false as stated.","rationale":"The reader's rejection is supported by the strongest counterexample. The central advertised result is the equality of Monge and Kantorovich solutions in Euclidean space; Theorem 5.8 is the only proof of that claim. Its proof relies on Lebesgue-almost-everywhere single-valuedness of subdifferentials to conclude the optimal plan is supported on a graph. But λ-a.e. statements cannot control the mass of an arbitrary source measure μ. Since the problem allows arbitrary atomless measures, including singular ones, the gap is real and not a mere regularity artifact. The n=1 case shows the theorem cannot be saved by a small tweak: with one source measure, the 'simple density ratio' condition is vacuous and the theorem would assert determinism for every classical quadratic transport problem. The uniform segment-to-perpendicular-segment example is a textbook instance where all couplings are optimal and the product coupling is not a graph. Thus Theorem 5.8 is false as stated. The paper also sketches discrete results and equality theorems that may be repairable, but the advertised Euclidean coincidence is the headline claim. The correct verdict remains rejection unless the hypotheses are amended, for example by requiring μ_i ≪ λ, and the proof is reworked to control μ-null sets.","tokens_in":7729,"tokens_out":5128,"duration_ms":47040,"concrete_test":"Add to Section 5 the following sanity check: instantiate Theorem 5.8 with n=1, μ=Uniform([0,1]×{0}), ν=Uniform({0}×[0,1]) on R^2, and c(x,y)=||x−y||². Verify that for every coupling π∈Π(μ,ν) the cost equals E[X²]+E[Y²], which is constant, so the product measure is optimal. Since the product measure is not supported on a graph, the theorem's conclusion fails. If the authors intended n≥2 or μ≪λ, that hypothesis must be added; otherwise the theorem is false.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The load-bearing step is in the proof of Theorem 5.8: after dividing X into sets A_k on which dμ_i/dμ is constant, the argument invokes Rockafellar's theorem and then 'the subdifferential of the convex function λ-a.e. consists of one element' to conclude π is supported on a graph. This only yields a graph outside a Lebesgue-null set. The theorem states no hypothesis that μ is absolutely continuous with respect to Lebesgue measure, nor that μ assigns zero mass to the exceptional set; in a simultaneous transport problem the source marginal is μ = (1/n)Σμ_i, and μ may charge λ-null sets. The omission is decisive. For n=1, dμ_1/dμ ≡ 1 is simple and continuous λ-a.e., so Theorem 5.8 applies to every classical quadratic optimal transport problem with atomless marginals on R^d. Now take X=Y=R^2, μ = uniform on [0,1]×{0}, ν = uniform on {0}×[0,1]. For every π∈Π(μ,ν), ∫||x−y||²dπ = ∫x²dμ + ∫y²dν, which is independent of π. Hence the product measure μ×ν is optimal, but it is not supported on the graph of any function. This is a direct counterexample to Theorem 5.8, so the advertised Monge–Kantorovich coincidence fails without an absolute-continuity-type assumption.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies simultaneous optimal transportation, where several source measures μ_i are transported to a common target measure ν (fixed or variable) by a single plan or map, with cost c(x,y). It claims existence of optimal plans on completely regular spaces (Theorem 2.6), a structural reduction for discrete problems, equality of the Monge and Kantorovich values (Theorem 4.2), and a Euclidean result asserting that, when the density ratios dμ_i/dμ are simple and continuous λ-a.e., the optimal plan is supported on the graph of a map and is unique (Theorem 5.8). The arguments rely on Lyapunov's theorem, a variational lemma from [12], Rockafellar's theorem, and Prokhorov compactness.","tokens_in":7916,"tokens_out":8311,"duration_ms":89437,"significance":"If the main claims were correct, the paper would provide an attractive extension of classical optimal transport: simultaneous transport with variable target marginal, a linear-programming reduction on finite sets, and a Monge–Kantorovich coincidence theorem for simple density ratios. The discrete reduction in Section 3 is potentially useful, and the Lyapunov-based viewpoint is natural. However, the central Euclidean theorem is false as stated, and the proofs of the existence theorem and of the Monge–Kantorovich equality contain substantial gaps. The advertised coincidence of Monge and Kantorovich solutions in Euclidean space therefore does not follow from the manuscript as written.","major_comments":[{"comment":"Theorem 5.8 is false as stated. Take n=1, X=Y=R^2, μ uniform on [0,1]×{0}, and ν uniform on {0}×[0,1]. Then dμ_1/dμ ≡ 1, so the hypotheses hold. For every π ∈ Π(μ,ν), the quadratic cost ∫||x−y||² dπ equals ∫x² dμ + ∫y² dν, which is independent of π; hence the product measure μ×ν is optimal. But μ×ν is not supported on the graph of any function. The proof's step that the subdifferential of the convex function is a singleton λ-a.e. only excludes a Lebesgue-null set, and the statement contains no hypothesis that the source marginal μ gives zero mass to that exceptional set. In the n=1 case the theorem would imply that every atomless measure has a deterministic optimal map for the quadratic cost, which is false for singular marginals. The theorem and the abstract's claim of coincidence in Euclidean space need an assumption such as μ ≪ λ, or an explicit condition that μ charges no Rockafellar exceptional set.","section":"Section 5, Theorem 5.8"},{"comment":"The compactness proof for Π(→μ,ν) is not supported as written. To prove closedness, the text invokes Proposition 4.3.17 of [5] to pass from π_n → π to (dμ_i/dμ)π_n → (dμ_i/dμ)π. This requires more than μ-a.s. continuity of the densities; the densities are not assumed bounded, and multiplication by an unbounded μ-a.e. continuous function need not preserve weak convergence. In addition, Prokhorov's theorem is invoked for completely regular spaces, although the standard form of that theorem requires complete metric or otherwise Prokhorov spaces. The existence theorem 2.6 therefore needs either a Polish-space hypothesis, bounded densities, or a different argument for compactness.","section":"Section 2, proof of Theorem 2.6"},{"comment":"The construction of the map T in the proof of equality (4.1) is incomplete. After partitioning each A_i into sets X^i_k with vector measure (μ_1(X^i_k),...,μ_n(X^i_k)) equal to (∫ g_k dμ_1,...,∫ g_k dμ_n), the proof asserts that a map T^i_k defined on X^i_k can 'translate the constraints of measures μ_1,...,μ_n to the constraint of measure ν on B_k multiplied by μ_j(X^i_k)'. No such map is constructed. Since the total masses μ_j(X^i_k) generally vary with j, a single map on X^i_k cannot push all μ_j forward to a common target measure on B_k; a further Lyapunov-type splitting inside X^i_k is required. As it stands, the equality of the Monge infimum and Kantorovich minimum is not established.","section":"Section 4, proof of Theorem 4.2"}],"minor_comments":[{"comment":"The notation Π(µ,ν) is used for the constrained simultaneous-transport plans, while later in the same paragraph Π(µ,ν) denotes the usual set of couplings with fixed marginals; this overloaded notation should be disambiguated.","section":"Equation (1.1)"},{"comment":"The sentence 'The sets {A_k} can be considered closed, since the functions dμ_i/dμ are continuous λ-a.e.' is not justified; a function that is λ-a.e. equal to a continuous function need not have closed level sets. This point is secondary to the failure of the theorem, but it should be corrected in any revision.","section":"Section 5, proof of Theorem 5.8"},{"comment":"The tightness argument for the marginal measures ν_n implicitly assumes that the relevant second moments are uniformly bounded; if μ does not have finite second moment, the statement that mass escaping to infinity makes the cost arbitrarily large needs additional justification or a growth condition on μ.","section":"Proposition 2.8"}],"recommendation":"reject","confidential_remarks":"The counterexample in Section 5 is decisive and directly disproves the main Euclidean claim. The theorem can probably be repaired by adding an absolute-continuity hypothesis, but that changes the advertised scope of the paper, and the proofs of Theorems 2.6 and 4.2 need substantive repair as well. I do not see a path to acceptance without a substantial rewrite of the central results."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Read it so you know what the counterexample to Theorem 5.8 is; the rest is mostly salvageable but not in this form.\n\nThe paper does have some genuinely useful pieces. Lemma 3.2, the discrete free-target characterization, is a clean convex-geometry observation: for finite X, optimal mixing points are barycenters of minimal subsets whose ψ-images contain the simplex center. I think that's correct and could be a small note by itself. The alternative proof of the Monge–Kantorovich equality (Theorem 4.2) by adapting Pratelli's open-cover argument to the simultaneous setting is plausible and worth preserving. The existence theorem on completely regular spaces is a legitimate attempt, though the proof relies on Prokhorov's theorem in a setting where it needs more hypotheses; that's repairable with Polish spaces or a different compactness argument.\n\nThe soft spot is not soft: Theorem 5.8 is false as stated. Take n=1, μ uniform on [0,1]×{0}, ν uniform on {0}×[0,1], quadratic cost. The density ratio condition is vacuous, but every coupling is optimal because the inner product term vanishes. The product measure is optimal and is not supported on a graph. So the advertised coincidence of Monge and Kantorovich solutions fails. The proof's leap from 'the subdifferential is single-valued λ-a.e.' to 'π is supported on a graph' only works if μ is Lebesgue-continuous and the exceptional set has zero μ-measure, which is neither stated nor true in general. This is a load-bearing error, not a technical gap.\n\nTheorem 2.6 also has a gap: tightness alone does not give weak compactness on completely regular spaces, so that argument needs more care. Minor issues: Remark 2.2 and Proposition 5.9 have a conversational tone, but the mathematics around them is not central.\n\nWho is this for? Someone working on simultaneous transport might find the discrete lemma and the equality proof interesting, but they should not rely on the main claim. The paper deserves a serious referee? No—the central theorem is disproven by a standard example. I'd suggest the authors fix the statement (e.g., add absolute continuity or a proper uniqueness assumption), extract the discrete and equality results, and resubmit. With that, the peer-review process would be productive.","headline":"The paper's discrete and equality results have merit, but the headline coincidence theorem is false—the n=1 perpendicular-segment counterexample kills it.","tokens_in":8557,"tokens_out":4019,"would_cite":false,"duration_ms":36171,"reading_group":"no","serious_thinker":"yes","would_accept_peer_review":false},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["49Q22","60B05"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper proves that simultaneous optimal transport with quadratic cost on Euclidean space has a deterministic optimal map whenever the density ratios are simple and continuous almost everywhere, so the Monge and Kantorovich solutions…","keywords":["simultaneous optimal transport","optimal mixing","Monge–Kantorovich problem","quadratic cost","simple density ratios","c-monotone plans","convex subdifferential","linear programming"],"falsifier":"Take $n=1$, $X=Y=\\mathbb{R}^2$, quadratic cost, and let $\\mu$ be normalized one-dimensional surface measure on the unit circle, with $\\nu$ uniform on the unit disk. The only density ratio is $d\\mu_1/d\\mu=1$, which is simple and continuous $\\lambda$-a.e., so the theorem would force the optimal plan onto a single-valued graph; solving the Kantorovich problem in this classical configuration shows the optimal plan's fibers over the circle are not singletons, contradicting the claimed graph support.","tokens_in":7402,"feed_emoji":"🎯","tokens_out":20754,"duration_ms":199836,"temperature":0.7,"pith_summary":"Simultaneous optimal transport asks how several probability measures on one space can be moved to a single target measure at minimal total cost, and the paper is trying to show when that problem has a definite, deterministic answer. It proves existence of optimal transport plans for the constrained problem on completely regular spaces, and it proves that on compact Souslin spaces the Monge (map) and Kantorovich (plan) formulations have equal values. Its main structural claim is that for quadratic cost on Euclidean space, if the density ratios $d\\mu_i/d\\mu$ are simple, meaning piecewise constant, and continuous except on a Lebesgue-null set, then the optimal plan is supported on the graph of one function and unique with respect to Lebesgue measure. That result would make simultaneous optimal transport behave like classical optimal transport in the absolutely continuous regime: all sources are moved by the same deterministic map.","feed_headline":"Simple densities make optimal mixing a single deterministic map","feed_subtitle":"For quadratic cost, Kantorovich plans collapse to a Monge map and the two problems share one solution.","key_machinery":"The load-bearing object is the constrained plan set $\\Pi(\\vec\\mu,\\nu)$, defined by the requirement that the conditional kernel $\\pi_x$ sends each source measure $\\mu_i$ to the same target $\\nu$; this is what makes the transport simultaneous. The argument is carried by rewriting the constraint as $\\int \\frac{d\\mu_i}{d\\mu}\\, d\\pi_y = 1$ for $\\nu$-almost every $y$, by a variational lemma showing optimal plans are $c$-monotone with respect to competitors that respect these constraints, and by the convex-analysis theorem that every cyclically monotone set lies in the subdifferential of a convex function. In the discrete case the central object is the simplex-valued map $\\psi(x)=\\frac1n(\\frac{d\\mu_1}{d\\mu}(x),\\ldots,\\frac{d\\mu_n}{d\\mu}(x))$: optimal mixing points are exactly barycenters of minimal subsets, of size at most $n$, whose $\\psi$-images contain the centre of the simplex.","core_discovery":"On the paper's own terms, the central discovery is Theorem 5.8: in $\\mathbb{R}^d$ with cost $\\|x-y\\|^2$, under the hypotheses that the density ratios $d\\mu_i/d\\mu$ are simple and continuous $\\lambda$-a.e., the solution of the simultaneous Kantorovich problem is supported on the graph of a function and is unique with respect to Lebesgue measure. The same map therefore solves the Monge problem, so the minimum of the Kantorovich functional and the infimum of the Monge functional coincide, and the solution is shared. The proof divides the space into sets on which the density ratios are constant, shows the optimal plan is cyclically monotone on each such set, and then uses the fact that a convex function's subdifferential is single-valued almost everywhere to conclude the plan concentrates on a graph.","pith_inferences":["The theorem's reliance on Lebesgue almost-everywhere differentiability suggests that for non-simple densities, simultaneous optimal transport should have a gradient-of-a-convex-function representation only when the source measures are absolutely continuous; singular source measures are where the graph conclusion should fail.","The discrete barycenter characterization implies an algorithmic route for multidimensional optimal mixing: enumerate minimal subsets of size at most $n$ whose $\\psi$-images surround the simplex centre, then solve a linear program over their barycenters.","Because the constraint set is linear, the same reformulation connects the problem to other constrained transport problems, and the region-wise $c$-monotonicity may yield structural results for constrained plans beyond the simultaneous case.","For $n=1$, the theorem should reproduce the classical one-dimensional monotone rearrangement; checking that special case against known singular examples would test whether the Lebesgue-a.e. argument really controls the full source mass."],"forward_implications":["If Theorem 5.8 holds, simultaneous optimal transport in Euclidean space with simple density ratios is a deterministic problem: one function moves every $\\mu_i$ onto the common target, and that function is the unique solution up to Lebesgue-null changes.","The equality of Monge infimum and Kantorovich minimum on compact Souslin spaces means the map-based and plan-based formulations cannot disagree about the optimal cost for simultaneous transport.","For the discrete problem with unfixed target, the characterization by barycenters of subsets of size at most $n$ turns the search for the optimal target into a finite linear program.","The $c$-monotonicity of optimal constrained plans means that on each region of constant density ratio, the standard convex-potential machinery applies even though the global plan is constrained."],"supporting_citations":[{"why":"Supplies the linear-constraint reformulation and the variational lemma that proves optimal constrained plans are c-monotone.","marker":"[12]"},{"why":"Introduces the simultaneous transport problem and provides the dual theorem and equality-of-minima result that the paper extends.","marker":"[11]"},{"why":"Provides the convexity theorem for vector measures that guarantees maps exist and is used in Lemma 4.1.","marker":"[9]"},{"why":"Provides the method for proving equality of Monge infimum and Kantorovich minimum that Section 4 adapts to simultaneous transport.","marker":"[2]"},{"why":"Another source for the equality between Monge's infimum and Kantorovich's minimum, used with [2].","marker":"[10]"},{"why":"Used in the compactness proof for the weak convergence of the constrained product measures.","marker":"[5]"}],"fun_headline_variants":["Optimal mixing: one map solves both Kantorovich and Monge","When density ratios are simple, mixing picks a single map","Simple density ratios collapse optimal mixing to a function","Kantorovich and Monge agree on optimal mixing for simple ratios","One deterministic map achieves optimal mixing under simple ratios"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that \"almost everywhere\" with respect to Lebesgue measure is enough to control where the source measures sit: the sources must not put mass on the negligible set where a convex potential has more than one slope.","fun_headline_variants_meta":{"raw":{"variants":["Optimal mixing: one map solves both Kantorovich and Monge","When density ratios are simple, mixing picks a single map","Simple density ratios collapse optimal mixing to a function","Kantorovich and Monge agree on optimal mixing for simple ratios","One deterministic map achieves optimal mixing under simple ratios"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000631,"raw_usage":{"total_tokens":2817,"prompt_tokens":753,"completion_tokens":2064,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":369,"completion_tokens_details":{"reasoning_tokens":1992}},"tokens_in":369,"tokens_out":2064,"duration_ms":15083,"temperature":1.0,"reasoning_tokens":1992,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T12:54:04.736564+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take $n=1$, $X=Y=\\mathbb{R}^2$, quadratic cost, and let $\\mu$ be normalized one-dimensional surface measure on the unit circle, with $\\nu$ uniform on the unit disk. The only density ratio is $d\\mu_1/d\\mu=1$, which is simple and continuous $\\lambda$-a.e., so the theorem would force the optimal plan onto a single-valued graph; solving the Kantorovich problem in this classical configuration shows the optimal plan's fibers over the circle are not singletons, contradicting the claimed graph support.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the linear-constraint reformulation and the variational lemma that proves optimal constrained plans are c-monotone."},{"cited_title":"Simultaneous Optimal Transport","cited_arxiv_id":"2201.03483","evidence_quote":"Introduces the simultaneous transport problem and provides the dual theorem and equality-of-minima result that the paper extends."},{"cited_title":"Lyapunov","cited_arxiv_id":null,"evidence_quote":"Provides the convexity theorem for vector measures that guarantees maps exist and is used in Lemma 4.1."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the method for proving equality of Monge infimum and Kantorovich minimum that Section 4 adapts to simultaneous transport."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Another source for the equality between Monge's infimum and Kantorovich's minimum, used with [2]."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Used in the compactness proof for the weak convergence of the constrained product measures."}],"review_version":1}