{"id":"7350071b-f7d7-4e52-ae25-993c7f8dcc84","arxiv_id":"2608.08858","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"For every 1≤p≤∞, the persistence landscape is a 1-Lipschitz embedding from p-finite countable barcodes and persistence diagrams with a new p-Wasserstein distance into L^p.","lead":"The paper proves that a well-known summary of topological data, the persistence landscape, embeds spaces of barcodes and persistence diagrams into standard function spaces while never increasing the Wasserstein distance between two inputs. For p=2 this gives an embedding into a Hilbert space, opening the door to statistical and machine-learning tools.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 4.5/4.6's extension step is unproved: the pointwise landscape on p-finite countable barcodes is identified with the 1-Lipschitz completion extension without verifying L^p convergence of truncations or injectivity on the completed space.","rationale":"The finite case is solid: Lemma 3.3 and Theorem 3.1 give the 1-Lipschitz inequality, and injectivity on finite barcodes is cited. The problem is the passage from finite to countable. The text before Theorem 4.5 only states that a 1-Lipschitz map on a dense subspace extends to the completion; it does not state that injectivity survives. The proofs of Theorems 4.5 and 4.6 are each one sentence. The identification of the pointwise landscape with the extension is not automatic for p < ∞; the footnote on kmax addresses existence, not L^p convergence. This matters because without injectivity, 'embedding' reduces to a 1-Lipschitz map, and the Hilbert space claim for p = 2 weakens. I found no counterexample, and the p-finite condition together with the rank-function structure makes the claim plausible; however, the paper currently leaves the central theorem dependent on an unstated lemma. Thus the reader's CONDITIONAL verdict is appropriate and I do not change it.","tokens_in":8949,"tokens_out":21790,"duration_ms":262683,"concrete_test":"Run the rank-reconstruction check: for a p-finite countable barcode B, set r(s,t) = sup{k : Λ_B(k,(s+t)/2) > (t-s)/2} and prove that B is determined by r, with the multiset of intervals recovered from the jump discontinuities of r. Apply this to a concrete barcode such as B = {[-1/j, 1/j)}_{j≥1} and to a second barcode obtained by deleting one interval and adding a small interval; if any distinct pair has equal r, then the landscape is not injective and the embedding claim fails, while if reconstruction always succeeds it supplies the missing injectivity proof for Theorems 4.5 and 4.6.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section 4 extends the finite results by invoking the standard extension of a 1-Lipschitz map to a completion, and then Theorem 4.5's proof is the single sentence that the pointwise persistence landscape 'is the 1-Lipschitz extension.' Two assertions are made without proof. First, for a p-finite countable barcode B with truncations B_n, the pointwise-defined Λ_B must equal the L^p limit lim_n Λ_{B_n}. This is not automatic for p < ∞: order statistics of an infinite sequence are not continuous in ℓ^p pointwise, and the footnote in Section 2.5 only explains existence of the kth maximum. One needs an inequality such as ||Λ_B - Λ_{B_n}||_p ≤ (Σ_{j>n} ||△_{I_j}||_p^p)^{1/p}, which is not stated or proved. Second, and more load-bearing, an injective 1-Lipschitz map on a dense subspace need not extend to an injective map on the completion. Theorem 4.5 claims an embedding, so injectivity on D^Δ_p must be established separately; the finite-case injectivity citation in Theorem 3.5 does not cover the completed space. If two distinct countable barcodes had equal landscapes, the central claim would fail even though the finite inequality remains true.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proves that the persistence landscape gives a 1-Lipschitz embedding of spaces of countable barcodes and persistence diagrams, equipped with the p-Wasserstein distance W^△_p, into L^p(N×R) for 1≤p≤∞. For finite barcodes, Theorem 3.1 establishes the key Lipschitz inequality via a monotone-rearrangement lemma and Tonelli's theorem; injectivity is cited from earlier work. The countable case (Theorems 4.5 and 4.6) is treated by identifying the pointwise-defined landscape on p-finite countable barcodes with the 1-Lipschitz extension of the finite landscape map to the metric completion. The paper also relates W^△_1 and W^△_∞ to the rank-based distance and the bottleneck distance, and compares p-finiteness for d_p with p-finiteness for ℓ_p.","tokens_in":9229,"tokens_out":24112,"duration_ms":270616,"significance":"The finite-case inequality is clean and appears correct, and the overall strategy of extending by completion is natural and potentially valuable: for p=2 the result would give an explicit embedding into a separable Hilbert space, with resulting statistical and machine-learning applications. The paper is also careful to compare the new distances with existing ones. However, the passage from the finite to the countable case is not rigorously justified in the manuscript: the proof of Theorems 4.5 and 4.6 is a single sentence that asserts, rather than demonstrates, that the pointwise landscape is the L^p limit of truncated landscapes and that this limit map is injective on the completed space. In addition, Theorem 3.6 is stated for a domain that, by the paper's own definition, includes diagrams with infinite coordinates, for which the landscape is not L^p-valued. These are load-bearing issues for the main claims, so the manuscript needs a major revision.","major_comments":[{"comment":"The proof of Theorems 4.5 and 4.6 consists of the single assertion that the pointwise-defined landscape of a p-finite countable barcode is the 1-Lipschitz extension of the finite landscape map. This identification needs proof. For p<∞, order statistics of an infinite sequence are not continuous in ℓ^p pointwise, so one must show that for truncations B_n of B, Λ_{B_n} converges to Λ_B in L^p. An estimate such as ||Λ_B−Λ_{B_n}||_p ≤ (∑_{j>n} ||△_{I_j}||_p^p)^{1/p} (and the analogous sup-norm estimate for p=∞) is required but is not stated or proved.","section":"Section 4, Theorems 4.5 and 4.6"},{"comment":"Injectivity of the extended map on the completed space is not established. An injective 1-Lipschitz map on a dense subspace need not extend to an injective map on the completion, so the finite-case injectivity cited in Theorem 3.5 does not automatically carry over. The proof must separately show that two distinct p-finite countable barcodes (or diagrams) have distinct persistence landscapes; otherwise the term 'embedding' in the main theorems is not justified.","section":"Section 4, Theorems 4.5 and 4.6"},{"comment":"The domain D(R^2_<) is defined in Section 2.3 to include diagrams with coordinates in [−∞,∞], for example the single point (0,∞). For such a diagram α, Λ_α equals △_{[0,∞)}, whose L^p norm is infinite for every 1≤p≤∞, so Λ does not map D(R^2_<) into L^p(N×R). The proof of Theorem 3.6 only treats diagrams corresponding to bounded intervals. The theorem should be restricted to finite-coordinate diagrams (or to p-finite diagrams), and the notation should consistently distinguish R^2_< from its extended-coordinate counterpart.","section":"Theorem 3.6 and Section 2.3"}],"minor_comments":[{"comment":"The notation R^2_< is used for both finite-coordinate and extended-coordinate diagrams, for example in Definition 2.3 and Theorem 3.6; please introduce a clearly distinct symbol, such as an overline, and use it consistently.","section":"Throughout"},{"comment":"The proof invokes monotone rearrangement for the convex function |t|^p and then passes to p=∞ by a limit; a direct proof or a specific reference for the rearrangement inequality would make the argument more self-contained.","section":"Lemma 3.3"},{"comment":"The footnote defining kth maxima for infinite sequences is essential for the p=∞ case; consider moving that discussion into the main text.","section":"Definition 4.1"},{"comment":"The sentence 'From this construction, we obtain the following two results' is stronger than the construction alone provides; the construction gives a candidate extension, but the embedding property requires the additional convergence and injectivity arguments requested above.","section":"Section 4"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague—\n\nThe paper does one thing cleanly and then reaches for more than it proves. The finite-case inequality (Theorem 3.1) is correct, and the proof via monotone rearrangement is economical; the p=∞ limit and the reduction from diagrams to barcodes are fine. What's genuinely new is the extension to 1<p<∞ for the d_p-based Wasserstein distance W^Δ_p, plus the countable completion machinery. The p-finite condition equivalences in Section 5.1 are a nice addition, and the literature overview is appropriately positioned.\n\nThe soft spot is Section 4. The proofs of Theorems 4.5 and 4.6 are each a single sentence saying the pointwise-defined landscape 'is the 1-Lipschitz extension.' That hides two things. First, to identify the pointwise landscape with the completion extension you need to show that for a p-finite countable barcode B with truncations B_n, Λ_{B_n} → Λ_B in L^p. This is true—Λ_{B_n} increases pointwise to Λ_B and the norms are bounded by the p-finite tail sums, so monotone convergence gives it—but the paper doesn't state or prove it. Second, and more load-bearing: an injective 1-Lipschitz map on a dense subspace need not extend to an injective map on the completion. The paper never proves injectivity of the pointwise landscape on D^Δ_p. Without that, 'embedding' is not established. Finite-case injectivity doesn't automatically carry over. I don't have a counterexample, and I suspect injectivity holds, but it needs an argument or a citation.\n\nThe citation pattern is not circular: the earlier self-citations carry the completion setup and the p=1,∞ cases, and the new claim is proved independently for finite barcodes. No invented entities, no free parameters.\n\nBottom line: a solid incremental paper with a repairable gap. The finite result is publishable on its own. The countable embedding theorem should not be stated as proved until the missing convergence and injectivity arguments are supplied. A serious editor should send it out; a referee should ask for the missing details. For readers who care about embeddings of barcode spaces into L^p or Hilbert space, this is worth having after revision.","headline":"A correct and clean finite-case inequality; the countable embedding claim is asserted rather than proved.","tokens_in":9768,"tokens_out":7139,"would_cite":true,"duration_ms":73205,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["55N31"],"pacs":[],"model":"deepseek-v4-flash","headline":"For every $1\\le p\\le\\infty$, the persistence landscape is a 1-Lipschitz embedding of p-finite countable barcodes and persistence diagrams into $L^p(\\mathbb{N}\\times\\mathbb{R})$.","keywords":["persistence landscape","persistence diagrams","barcodes","p-Wasserstein distance","L^p space","1-Lipschitz embedding","Hilbert space embedding","topological data analysis"],"falsifier":"Take a p-finite countable barcode $B$, let $B_n$ be the barcode of its first $n$ intervals, and compute $\\|\\Lambda_B-\\Lambda_{B_n}\\|_p$: if this quantity does not converge to zero, then the pointwise landscape is not the continuous 1-Lipschitz extension required by Theorems 4.5 and 4.6. Alternatively, find two distinct p-finite countable barcodes with identical persistence landscapes; any such pair would refute the embedding claim directly.","tokens_in":8729,"feed_emoji":"📊","tokens_out":10139,"duration_ms":97602,"temperature":0.7,"pith_summary":"This paper proves that persistence landscapes are not merely stable summaries but genuine metric embeddings of barcodes and persistence diagrams into function spaces. For each $1\\le p\\le\\infty$, it shows that the landscape map sends the metric space of p-finite countable barcodes with the p-Wasserstein distance $W^\\triangle_p$ into $L^p(\\mathbb{N}\\times\\mathbb{R})$, and does so with Lipschitz constant one: the $L^p$ distance between two landscapes is never larger than the Wasserstein distance between the original barcodes or diagrams. The same statement holds for persistence diagrams, using the distance between ordered pairs induced by the $L^p$ difference of their triangle functions. When $p=2$ the target is a separable Hilbert space, which is the setting where statistical and machine-learning tools for topological data are usually developed.","feed_headline":"Persistence landscapes embed barcodes into L^p spaces","feed_subtitle":"For every p from 1 to infinity, the landscape is a 1-Lipschitz embedding; for p=2 it lands in a Hilbert space.","key_machinery":"The central mechanism is the triangle function and the persistence landscape built from it. For an interval $I=[b,d)$, the triangle function $\\triangle_I(t)$ is the distance from $t$ to the complement of $I$, a tent-shaped function of height half the interval's length; for a barcode $B$, the landscape is $\\Lambda_B(k,t)=\\operatorname{kmax}_j \\triangle_{I_j}(t)$, the kth largest of these tent values at $t$. The ground metric for Wasserstein distance between intervals is $d_p(I,J)=\\|\\triangle_I-\\triangle_J\\|_p$, and the p-Wasserstein distance $W^\\triangle_p$ is the optimal matching built on that ground metric. The load-bearing inequality is Lemma 3.3: for two sequences, replacing each by its order statistics cannot increase the $\\ell^p$ norm of their difference. That inequality turns the kth-largest construction into a 1-Lipschitz map, and the passage to countable p-finite barcodes is handled by completeness of the Wasserstein spaces.","core_discovery":"The central claim is Theorem 4.5 and Theorem 4.6: for every $1\\le p\\le\\infty$, the persistence landscape gives a 1-Lipschitz embedding $\\Lambda:(D^\\triangle_p(\\mathrm{cInt}(\\mathbb{R})_{bco}), W^\\triangle_p)\\to L^p(\\mathbb{N}\\times\\mathbb{R})$ of p-finite countable barcodes, and likewise $\\Lambda:(D^\\triangle_p(\\mathbb{R}^2_<), W^\\triangle_p)\\to L^p(\\mathbb{N}\\times\\mathbb{R})$ of p-finite countable persistence diagrams. The finite case is proved by a rearrangement inequality: sorting the interval-distance evaluations by size before taking an $\\ell^p$ norm can only shrink the distance, so the kth-largest landscape operation is 1-Lipschitz with respect to $W^\\triangle_p$. The countable case is obtained by declaring the landscape to be the 1-Lipschitz extension to the completion of the finite barcode space, relying on earlier completeness results for these Wasserstein spaces. Injectivity on finite barcodes is cited from an earlier paper, and the same injectivity is assumed to persist on the completed space.","pith_inferences":["Editorial inference: the theorem is one-sided—it guarantees that Wasserstein distance is at least $L^p$ landscape distance, but not the reverse. Statistical pipelines that approximate $W^\\triangle_p$ by $L^p$ landscape distance will compress distances and may fail to separate barcodes that are actually far apart in Wasserstein metric.","Editorial inference: the only part of the proof that is not fully explicit is the injectivity and continuity of the extension from finite to countable barcodes. If a counterexample pair of distinct countable barcodes with identical landscapes exists, the title result would still give a 1-Lipschitz map but not an embedding; checking truncation convergence is the natural next test.","Editorial inference: because the proof flows from order statistics and triangle functions, the same argument likely generalizes to other summaries built from sorted interval functions—for instance weighted landscapes or rank-transformed landscape variants—as long as the ground metric is the $L^p$ difference of the underlying interval functions."],"forward_implications":["For $p=2$, countable barcodes and diagrams sit explicitly inside a separable Hilbert space, so Hilbert-space methods such as means, PCA, and kernel evaluations apply directly to persistence summaries.","The inequality $\\|\\Lambda_B-\\Lambda_{B'}\\|_p \\le W^\\triangle_p(B,B')$ gives a computable lower bound on Wasserstein distance: whenever two landscapes differ, the barcodes must differ by at least that amount in Wasserstein distance.","For $p=\\infty$, the result contains the bottleneck stability statement, since $W^\\triangle_\\infty$ is the bottleneck distance; for $p=1$, it contains the rank-based Wasserstein case.","The p-finite condition on barcodes is expressed by a summability condition on interval lengths (Proposition 5.2), so the embedding applies exactly to barcodes whose interval-length data have the right moment.","The same statements hold for persistence diagrams as for barcodes, because the map sending an interval $[b,d)$ to the point $(b,d)$ is an isometry between the two metric spaces."],"supporting_citations":[{"why":"Establishes injectivity of the persistence landscape on finite barcodes, which Theorem 3.5 needs to promote the 1-Lipschitz inequality to an embedding.","marker":"[5]"},{"why":"Supplies Lemma 4.2, the completeness and completion theorem for Wasserstein spaces on countable formal sums, which is how Theorems 4.5 and 4.6 pass from finite to p-finite barcodes and diagrams.","marker":"[8]"},{"why":"Supplies Lemma 4.3 on separability of these Wasserstein spaces, used to describe $D^\\triangle_p$ as complete and separable.","marker":"[10]"},{"why":"Defines the $\\infty$-strengthening $(\\ell_\\infty)_\\infty$ and gives Corollary 5.3, used to identify $W^\\triangle_\\infty$ with the bottleneck distance in Proposition 5.4.","marker":"[7]"},{"why":"Gives Lemma 3.2 identifying $d_1$ with the rank-based distance, used in Proposition 5.5 to identify $W^\\triangle_1$ with the rank-based Wasserstein distance.","marker":"[12]"},{"why":"Provides the bottleneck distance whose definition is recovered as the $p=\\infty$ case.","marker":"[15]"}],"fun_headline_variants":["For every p, landscapes 1-Lipschitz embed barcodes","Persistence landscapes: 1-Lipschitz maps to L^p","Barcodes embedded in L^p with 1-Lipschitz landscapes","p=2 gives Hilbert space via persistence landscapes"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof that the landscape extends from finite to countable p-finite barcodes assumes, rather than verifies, that the pointwise landscape of a countable barcode is the $L^p$ limit of the landscapes of its finite truncations and that this extension remains injective on the completion; if two distinct countable barcodes shared one landscape, the map would no longer be an embedding.","fun_headline_variants_meta":{"raw":{"variants":["For every p, landscapes 1-Lipschitz embed barcodes","Persistence landscapes: 1-Lipschitz maps to L^p","Barcodes embedded in L^p with 1-Lipschitz landscapes","p=2 gives Hilbert space via persistence landscapes"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000339,"raw_usage":{"total_tokens":1809,"prompt_tokens":817,"completion_tokens":992,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":433,"completion_tokens_details":{"reasoning_tokens":914}},"tokens_in":433,"tokens_out":992,"duration_ms":9538,"temperature":1.0,"reasoning_tokens":914,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T04:25:09.294055+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take a p-finite countable barcode $B$, let $B_n$ be the barcode of its first $n$ intervals, and compute $\\|\\Lambda_B-\\Lambda_{B_n}\\|_p$: if this quantity does not converge to zero, then the pointwise landscape is not the continuous 1-Lipschitz extension required by Theorems 4.5 and 4.6. Alternatively, find two distinct p-finite countable barcodes with identical persistence landscapes; any such pair would refute the embedding claim directly.","supporting_citations":[{"cited_title":"Statistical Topological Data Analysis Using Persistence Landscapes","cited_arxiv_id":null,"evidence_quote":"Establishes injectivity of the persistence landscape on finite barcodes, which Theorem 3.5 needs to promote the 1-Lipschitz inequality to an embedding."},{"cited_title":"Virtual persistence diagrams, signed measures, Wasserstein distances, and Banach spaces","cited_arxiv_id":null,"evidence_quote":"Supplies Lemma 4.2, the completeness and completion theorem for Wasserstein spaces on countable formal sums, which is how Theorems 4.5 and 4.6 pass from finite to p-finite barcodes and diagrams."},{"cited_title":"Topological and metric properties of spaces of generalized persistence diagrams","cited_arxiv_id":null,"evidence_quote":"Supplies Lemma 4.3 on separability of these Wasserstein spaces, used to describe $D^\\triangle_p$ as complete and separable."},{"cited_title":"Universality of persistence diagrams and the bottle- neck and Wasserstein distances","cited_arxiv_id":null,"evidence_quote":"Defines the $\\infty$-strengthening $(\\ell_\\infty)_\\infty$ and gives Corollary 5.3, used to identify $W^\\triangle_\\infty$ with the bottleneck distance in Proposition 5.4."},{"cited_title":"A rank-based distance for interval modules and Wasserstein stability of persistence landscapes","cited_arxiv_id":"2509.20921","evidence_quote":"Gives Lemma 3.2 identifying $d_1$ with the rank-based distance, used in Proposition 5.5 to identify $W^\\triangle_1$ with the rank-based Wasserstein distance."},{"cited_title":"Stability for Persistence Diagrams","cited_arxiv_id":null,"evidence_quote":"Provides the bottleneck distance whose definition is recovered as the $p=\\infty$ case."}],"review_version":1}