{"id":"92f0be7d-b312-45ab-81fe-85e852748ddb","arxiv_id":"2607.17672","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":8.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"A uniform-distance-preserving Kirszbraun extension exists iff the reference map satisfies a barycentric inequality, for arbitrary real Hilbert targets and subsets.","lead":"A pure-math paper proves that a Lipschitz map between Hilbert spaces can always be extended while staying close to a given reference map exactly when a simple barycentric inequality holds. This settles a conjecture left open in previous work, which had only solved the problem in low dimensions or for convex domains.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"No significant objection identified.","rationale":"The reader's verdict (ACCEPT, HIGH confidence) is well supported. I re-examined the core proof: Proposition 2.1's minimal-support reduction is rigorous, including the boundary-minimizer argument and the linear-functional bound |ℓ(h)| ≤ ||h||; the calibrated Corollary 2.2 is a direct application with Riesz representation; Lemma 3.1 uses only variance identities; the construction of the isometric embedding Q and the limiting inequality are correct, and the dimension count dim w^⊥ = dim Y - 1 ≥ k - 1 is valid in infinite-dimensional Hilbert spaces. The applications (Propositions 6.1, 6.2, Corollary 6.4) derive from the main theorem under the stated hypotheses; I checked the pointwise application of (C) in Proposition 6.1 and the slope estimate in Proposition 6.2. The one dependency not proved here is (C)⇒(E), cited from the author's earlier published work [9]; this is standard practice and does not undermine the paper, since the new result is the converse direction. No ad hominem, no internal inconsistency, and no missing support beyond the acknowledged external theorem were found.","tokens_in":13561,"tokens_out":22210,"duration_ms":171313,"concrete_test":"Obtain the published version of [9] (K.J. Ciosmak, J. Lond. Math. Soc. 110 (2024) e70014) and independently verify the proof of Theorem 1.2, particularly the sufficiency direction (C)⇒(E) for arbitrary real Hilbert targets. If that theorem is correct, the full equivalence in Theorem 1.1 follows; if a flaw were found, the new direction (E)⇒(C) would still stand, but the advertised equivalence would need qualification.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Reviewing Theorem 1.1's proof in detail, I find no internal mathematical gap. The new direction (E)⇒(C) is proved via the minimal-support simplex principle (Proposition 2.1), the calibrated witness (Corollary 2.2), Lemma 3.1, and a limiting argument. Each step is sound: Proposition 2.1 is valid in arbitrary normed spaces and its extreme-point argument is correct; the construction of Q = wg* + UA in Section 4 uses dim w^⊥ ≥ dim L, which holds for Hilbert spaces of arbitrary cardinality; and the rationalisation contradiction is valid. The only external load-bearing premise is the converse (C)⇒(E), imported from [9, Theorem 1.2]. This is a published, citable theorem and the paper explicitly credits it; the new contribution—necessity under no dimension or convexity restrictions—stands independently. I therefore do not regard the imported converse as a genuine threat to the paper's central claim.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proves Theorem 1.1: for real Hilbert spaces Z, Y, any X⊂Z and v:X→Y, the uniform-distance-preserving Kirszbraun extension property (E) is equivalent to the barycentric condition (C). The new content is the implication (E)⇒(C), previously known only for dimY≤3 or convex X. The proof combines a minimal-support simplex principle (Prop. 2.1), a calibrated simplex witness (Cor. 2.2), an isometric test inequality (Lemma 3.1), and a rationalizing limit argument in §4. The converse (C)⇒(E) is quoted from the author's earlier paper [9, Theorem 1.2]. The paper also gives a finite-branching weak transport data-processing characterisation (Prop. 6.1) and, under a dimension assumption, a convex Lipschitz lifting theorem and transfer of convex Poincaré inequalities (Prop. 6.2, Cor. 6.4).","tokens_in":13767,"tokens_out":26162,"duration_ms":212296,"significance":"If correct, the main theorem resolves a conjecture from [7] and completes the equivalence of (E) and (C) for arbitrary real Hilbert targets, removing the dimension and convexity restrictions of earlier work. The new proof is self-contained: Proposition 2.1 is a clean independence result valid in arbitrary normed spaces, and the embedding Q in §4 is constructed explicitly. The applications to weak transport and convex Poincaré inequalities are natural and are derived without additional heavy machinery. The paper also explains the four-point obstruction from [9, Example 4.10], showing why the earlier method failed but the characterisation survives. The converse direction is imported from a published result of the author; this is disclosed and does not affect the novelty of the new implication.","major_comments":[],"minor_comments":[{"comment":"After choosing the minimizer p0, the display uses p* inconsistently; p* should be p0 throughout that paragraph. Please correct the notation.","section":"§2, Proposition 2.1 proof"},{"comment":"The supplied version contains typesetting artifacts in the title and abstract (e.g., 'PRESER VING DIST ANCE' and stray glyphs in the displayed formula). Please ensure the final compiled version is clean.","section":"Title/Abstract"},{"comment":"The construction of Q relies on the Riesz identification of L* with L; this is standard and correct, but a brief parenthetical 'after Riesz identification' would improve readability when stating Q*w = g.","section":"§4"},{"comment":"In the proof of Proposition 6.1, the equality σ(v(S),U') = σ(S,U) with U'=(S,U) is correct, but writing σ(v(S),S,U) would make the reasoning clearer and avoid the apparent omission of S.","section":"§6.1"}],"recommendation":"minor_revision","confidential_remarks":"No additional editor-only concerns. The converse (C)⇒(E) is imported from [9, Theorem 1.2]; this is a published, peer-reviewed result and the paper credits it explicitly. The new implication is substantial and, as far as I can verify, correct."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nYou can trust the reader's take: this is a solid paper. The new direction (E)⇒(C) for arbitrary real Hilbert targets and nonconvex X is genuinely new, and it resolves a conjecture that had only been settled in low-dimension or convex cases. The proof is the real deal. The minimal-support simplex principle (Prop 2.1) is an elegant piece of geometry: it shows a strict violation of the barycentric inequality can be witnessed on an affinely independent simplex with a 1-Lipschitz affine interpolant. The calibrated reduction (Cor 2.2) and the isometric embedding Q with Q*Q=Id and Q*w=g are the right tools to make the limiting argument work. I checked the dimension counting (dim w⊥ ≥ dim L) and the rationalizing limit; both check out. The four-point example in Section 5 is a nice explanation of why the old approach couldn't work, and it doesn't undermine the new method.\n\nThe main soft spot is structural rather than mathematical: the converse (C)⇒(E) is not proved here — it is imported from the author's earlier paper [9]. That is legitimate self-citation: [9] is a published, peer-reviewed result, and the new direction stands independently. But it means the full equivalence as stated in Theorem 1.1 is only as strong as [9]. If you want to use the equivalence as a black box, it's worth checking that [9]'s proof covers your case. I don't consider this a flaw, but it is a premise to be aware of.\n\nMinor issues: there are a few typographical slips (\"p*\" vs p0, etc.) that don't affect correctness. The applications section — the weak transport data processing inequality and the convex Poincaré transfer — is logically fine but dense; the connection to (C) is clear, though the paper doesn't spend much time on why the finite branching hierarchy is natural beyond the fact that it interpolates between Wasserstein and barycentric weak transport.\n\nThe paper is honest: it explicitly credits [9] for the reverse implication and includes the AI-assistance declaration. No signs of overclaiming. The math is checkable and, as far as I can tell, sound.\n\nWho is this for? Anyone working on Lipschitz extensions, Kirszbraun-type theorems, or weak transport. The main theorem will likely have more applications than the two listed.\n\nRecommendation: send it to a serious referee. It deserves full review, and I expect it to be accepted with minor revisions.","headline":"Ciosmak's equivalence is real: the new (E)⇒(C) direction is proven in full, and the imported converse from his earlier paper is legitimate.","tokens_in":14259,"tokens_out":1646,"would_cite":true,"duration_ms":14037,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["47H09","54C20","46C05","49Q22","60E15"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves that a 1-Lipschitz extension with a uniform-distance constraint is exactly equivalent to a barycentric inequality, for arbitrary real Hilbert spaces, removing previous dimension and convexity restrictions.","keywords":["Lipschitz extension","Kirszbraun theorem","Hilbert space","barycentric inequality","uniform distance","weak transport","data processing","convex Poincaré inequality"],"falsifier":"Exhibit a real Hilbert space pair Z,Y with dim Y ≥ 4, a subset X, and a map v:X→Y for which the barycentric condition (C) fails but the extension property (E) holds; or, to attack the converse direction, exhibit v satisfying (C) for which some 1-Lipschitz u within uniform distance ρ has no 1-Lipschitz extension within ρ of v. The four-point example in the paper satisfies (C) and is therefore not such a counterexample.","tokens_in":13444,"feed_emoji":"📏","tokens_out":6598,"duration_ms":56506,"temperature":0.7,"pith_summary":"This paper proves that two conditions on a map v from a subset of a real Hilbert space into another real Hilbert space are exactly equivalent: (E) every 1-Lipschitz map on a subset that stays within a uniform distance ρ of v extends to a 1-Lipschitz map on the whole domain staying within ρ of v, and (C) a barycentric inequality saying that v never expands convex combinations more than the underlying points do. The new result is the implication from (E) to (C), previously known only for target spaces of dimension at most three or for convex domains. The proof introduces a minimal support simplex principle showing that any violation of (C) is witnessed by an affinely independent simplex whose scalar projection has a 1-Lipschitz affine interpolant, which then feeds into an isometric embedding argument. If correct, the equivalence resolves a conjecture for finite-dimensional targets, extends to infinite-dimensional Hilbert spaces, and yields new characterizations of data processing for a hierarchy of weak transport costs, plus transfer of convex Poincaré inequalities without loss of constant.","feed_headline":"Barycentric inequality governs all Hilbert-space Lipschitz extensions","feed_subtitle":"Removes the old dimension-3 restriction; unifies data processing and convex Poincaré transfer.","key_machinery":"The load-bearing object is the minimal support simplex principle (Proposition 2.1): in any real normed space, a strict scalar violation f(x0)-Σt_i f(x_i) > ||x0-Σt_i x_i|| admits a witness with affinely independent support and a 1-Lipschitz affine interpolant on that simplex. Corollary 2.2 calibrates this to vector-valued v by choosing w as the unit norming direction, giving a vector g with ||g||≤1 that linearly reproduces ⟨w,v(·)⟩ on the simplex. The proof of (E)⇒(C) then hinges on an explicit isometric linear embedding Q: L→Y satisfying Q^*w=g; that is possible because dim w⊥ ≥ dim L, and the inequality in Lemma 3.1 (the isometric test inequality) converts a candidate isometric copy into a","core_discovery":"The central claim is Theorem 1.1: for real Hilbert spaces Z and Y, a map v:X→Y satisfies the extension property (E) if and only if it satisfies the barycentric condition (C), namely that for every k≤dim Y and every weighted average, ||v(x0)-Σt_i v(x_i)|| ≤ ||x0-Σt_i x_i||. The paper proves the previously open direction (E)⇒(C) by a limiting argument. Assuming (E) and a strict violation of (C), the minimal support simplex principle produces an affinely independent witness set together with a unit vector w and a vector g with ||g||≤1 that interpolates ⟨w,v(·)⟩ linearly on the witness simplex. Since the orthogonal complement of w has dimension at least the dimension of the simplex's linear span","pith_inferences":["Because the minimal support simplex principle holds in arbitrary real normed spaces, a similar (E)⇔(C) characterization might extend to Banach spaces if the isometric embedding construction can be replaced by a weaker geometric argument; Hilbert-space structure enters mainly through the dimension count and the existence of Q.","The finite branch hierarchy B^[q] with q ≤ dim Y suggests a testable refinement: for a given v, the data processing inequality at level q may fail for all q smaller than dim Y even when (E) holds, indicating that the branching level is an essential parameter rather than a proof artifact.","The lifting theorem gives a constructive way to pull convex test functions back along v, so the convex Poincaré inequality transfer might be iterated along chains of maps preserving (E), offering a tool for proving concentration for composite Lipschitz maps."],"forward_implications":["For finite-dimensional targets, the equivalence resolves the conjecture on necessity of the barycentric condition, without requiring convexity of X or a bound on dim Y.","Condition (E) is characterized by the data processing inequality for the finite branching weak transport cost at branching level dim Y (Proposition 6.1), linking the extension property to contraction of transport costs.","When Y is infinite-dimensional or its dimension exceeds the affine dimension of X, property (E) implies the unrestricted barycentric condition (B), yielding a lifting theorem for convex Lipschitz functions (Proposition 6.2) and transfer of convex Poincaré inequalities with the same constant (Corollary 6.4).","The known four-point obstruction to the earlier proof method is bypassed: the proof only needs simplex witnesses, which always exist, so that example no longer blocks the characterization."],"fun_headline_variants":["Barycentric rule characterizes all Hilbert-space Lipschitz extensions","Hilbert-space extension property tied to barycentric inequality","No dimension cap: barycentric condition proves extension equivalence","Barycentric condition is necessary and sufficient for extensions","Hilbert-space Lipschitz extension: dimension barrier removed"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The full equivalence in Theorem 1.1 depends on the previously published theorem that the barycentric condition (C) suffices for the extension property (E); this paper proves only the reverse direction, so the equivalence as stated inherits that earlier result's correctness.","fun_headline_variants_meta":{"raw":{"variants":["Barycentric rule characterizes all Hilbert-space Lipschitz extensions","Hilbert-space extension property tied to barycentric inequality","No dimension cap: barycentric condition proves extension equivalence","Barycentric condition is necessary and sufficient for extensions","Hilbert-space Lipschitz extension: dimension barrier removed"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000916,"raw_usage":{"total_tokens":3832,"prompt_tokens":867,"completion_tokens":2965,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":611,"completion_tokens_details":{"reasoning_tokens":2898}},"tokens_in":611,"tokens_out":2965,"duration_ms":19655,"temperature":1.0,"reasoning_tokens":2898,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-01T17:20:45.898901+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Exhibit a real Hilbert space pair Z,Y with dim Y ≥ 4, a subset X, and a map v:X→Y for which the barycentric condition (C) fails but the extension property (E) holds; or, to attack the converse direction, exhibit v satisfying (C) for which some 1-Lipschitz u within uniform distance ρ has no 1-Lipschitz extension within ρ of v. The four-point example in the paper satisfies (C) and is therefore not such a counterexample.","supporting_citations":[],"review_version":1}