Exact Uniform L1 Spacing for Solow-Polasky Diversity on Lines and Ordered Pareto Fronts

Jes\'us Guillermo Falc\'on Cardona; Mahboubeh Nezhadmoghaddam; Michael T. M. Emmerich

arxiv: 2605.21922 · v1 · pith:YKDQVBR2new · submitted 2026-05-21 · 🧮 math.OC · cs.CG· cs.NE

Exact Uniform L1 Spacing for Solow-Polasky Diversity on Lines and Ordered Pareto Fronts

Michael T. M. Emmerich , Mahboubeh Nezhadmoghaddam , Jes\'us Guillermo Falc\'on Cardona This is my paper

Pith reviewed 2026-05-22 05:07 UTC · model grok-4.3

classification 🧮 math.OC cs.CGcs.NE

keywords Solow-Polasky diversityuniform spacingPareto front approximationL1 distanceexponential kernelmultiobjective optimizationfixed-cardinality selectiondiversity measures

0 comments

The pith

For Solow-Polasky diversity on the unit interval the unique maximizing k-point set is the equally spaced configuration.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that the inverse-matrix Solow-Polasky diversity, built from an exponential distance kernel, reaches its maximum on [0,1] precisely when the k selected points are placed at equal intervals. The argument begins with a known decomposition that writes the total diversity as a sum of independent terms, each a function of one consecutive gap. Because each term is strictly maximized only when its gap equals the others, the global maximum forces every gap to be identical. The same spacing property transfers by isometry to any ordered curve equipped with L1 distance, so that finite approximations to monotone Pareto fronts become uniform in accumulated objective-space length.

Core claim

For every k greater than or equal to 2 the unique maximizing k-point subset of the unit interval is the equally spaced set. The proof uses the finite-line gap formula for the exponential kernel, which expresses excess inverse-matrix diversity as an additive sum of functions of consecutive gaps, and shows this sum attains its unique maximum only when all gaps are equal. The result extends by isometry to ordered L1 curves, yielding uniform spacing in accumulated length on monotone biobjective Pareto fronts.

What carries the argument

The gap formula for the exponential kernel, which decomposes excess inverse-matrix diversity into a sum of terms each depending on a single adjacent gap.

If this is right

On the real line the objective selects a uniform gap representation.
On ordered L1 curves the maximizing sets are uniform in accumulated L1 length.
Monotone biobjective Pareto fronts admit Solow-Polasky optimal approximations that are uniformly spaced in accumulated objective-space change.
The uniform-gap pattern appears on both dense connected fronts and finite disconnected fronts such as ZDT3.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The result supplies a concrete, parameter-free rule for choosing representative points that cover every region of a continuous front.
The converse kernel proposition implies that only the exponential family produces an adjacent-gap additive structure among normalized non-increasing kernels.
The same spacing logic may inform diversity-preserving selection steps inside evolutionary algorithms for multiobjective problems.

Load-bearing premise

The diversity admits an exact additive decomposition into terms that each depend on only one consecutive gap.

What would settle it

For k equals 3, compute the diversity value at the equal-spacing points versus the same points with one interior point shifted by a small amount and check whether the equal-spacing value is strictly larger.

Figures

Figures reproduced from arXiv: 2605.21922 by Jes\'us Guillermo Falc\'on Cardona, Mahboubeh Nezhadmoghaddam, Michael T. M. Emmerich.

**Figure 1.** Figure 1: The gap contribution function f(t) = tanh(βt/2) and its second derivative on the domain 0 ≤ t ≤ 10, shown for β = 1. The positivity of f and negativity of f ′′ away from t = 0 visualize the increasing, strictly concave behavior used in the Jensen argument. Remark 2 (Relation to minimum-gap criteria). Maximizing the minimum pairwise distance on a line is equivalent to maximizing the smallest consecutive gap… view at source ↗

**Figure 2.** Figure 2: A dense ordered Pareto-front sample on f2 = 1 − f 2 1 with 70 candidate points (blue) and the exact optimal 10-point Solow–Polasky subset under the ℓ1 norm (red), computed by the polynomialtime Bellman recursion from [1]. The selected points are nearly uniformly spaced in the induced line coordinate t = x − (1 − x 2 ) = x 2 + x − 1, with target spacing 2/9 ≈ 0.222222 and realized gaps 0.223903, 0.220542,… view at source ↗

**Figure 3.** Figure 3: Disconnected ZDT3 Pareto-front example with [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗

read the original abstract

We study fixed-cardinality maximization of the inverse-matrix Solow--Polasky diversity, equivalently finite metric magnitude for the exponential kernel, on one-dimensional and ordered metric sets. The analysis starts from the known finite-line gap formula for the exponential kernel, which writes the excess inverse-matrix diversity as a sum of functions of consecutive gaps. Building on this formula, the main interval theorem proves that, for every $k\geq 2$, the unique maximizing $k$-point subset of $[0,1]$ is the equally spaced set. Thus the objective selects a uniform gap representation on the real line. A converse kernel proposition shows that, among normalized non-increasing distance kernels, requiring the corresponding adjacent-gap additive structure forces the exponential family. Further results transfer the interval theorem to ordered $\ell_1$ (L1, or Manhattan) curves by isometry: the maximizing sets are uniform in accumulated $\ell_1$ length. As a consequence, monotone biobjective Pareto fronts admit Solow--Polasky optimal finite approximations that are uniformly spaced in accumulated objective-space change, a natural representation when all parts of a continuous front should be covered. Examples, including a dense connected front and a finite disconnected ZDT3 front, illustrate how the continuous uniform-gap result appears on discrete candidate sets. Solow-Polasky diversity; diversity measures; finite metric magnitude; L1 distance; uniform spacing; Pareto-front approximation; multiobjective optimization; fixed-cardinality subset selection

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This paper proves that uniform spacing is the unique maximizer for Solow-Polasky diversity on the unit interval and transfers the result to ordered L1 Pareto fronts via isometry.

read the letter

The main thing here is that the paper establishes an exact result: for every k at least 2, the equally spaced k-point set is the unique maximizer of the inverse-matrix Solow-Polasky diversity on [0,1]. It then uses an isometry to carry the same uniform-gap property over to ordered L1 curves, which directly gives a spacing rule for approximating monotone Pareto fronts in accumulated length. The examples on a dense front and on ZDT3 make the discrete case visible without extra claims. What they do well is start from the existing gap formula for the exponential kernel and derive the interval theorem without introducing fitted parameters or simulation steps. The argument stays additive over consecutive gaps that sum to one, and the kernel converse proposition is a clean side result that identifies when the structure holds. The L1 transfer is simple and fits the multiobjective setting where even coverage matters. The soft spot is small and limited to presentation. Uniqueness rests on the per-gap function being strictly concave, and while the abstract describes a direct derivation from the gap formula, the text does not appear to include an explicit expression for that function or a quick second-derivative check. If the full proof supplies that verification, the point is settled; if it is only asserted, a reader checking the math by hand would have to reconstruct it. Nothing else looks circular or dependent on post-hoc choices. This work is for people already using diversity measures for fixed-cardinality subset selection or for continuous front approximation. A reader who needs a theoretical reason to prefer uniform spacing over other heuristics will get concrete value. It deserves peer review because the central theorem is new, the math is internally consistent, and the application is immediate.

Referee Report

1 major / 2 minor

Summary. The manuscript proves that, for the inverse-matrix Solow-Polasky diversity (finite metric magnitude with the exponential kernel) on the unit interval, the unique maximizing k-point subset for every k≥2 is the equally spaced configuration. The proof begins from the known gap formula, which decomposes excess diversity as a sum of functions of consecutive gaps, and derives an interval theorem asserting that this sum is uniquely maximized when all gaps are equal. The result is transferred by isometry to ordered L1 curves and hence to monotone Pareto fronts, where optimal finite subsets are uniformly spaced in accumulated L1 length. A converse proposition shows that the exponential family is the only normalized non-increasing kernel admitting this adjacent-gap additive structure.

Significance. If the central claims hold, the work supplies an exact, parameter-free characterization of optimal fixed-cardinality diversity subsets on lines and ordered fronts, with immediate consequences for Pareto-front approximation in multiobjective optimization. The derivation rests on a previously established gap formula rather than new fitting or data selection, and the converse kernel result adds theoretical value by isolating the exponential case. These elements together give a clean, falsifiable prediction for uniform spacing that can be checked on both continuous intervals and discrete candidate sets.

major comments (1)

[Interval Theorem section] Interval Theorem (the section deriving the main result from the gap formula): the uniqueness claim requires that the per-gap function f be strictly concave on (0,1]. The manuscript invokes the known exponential-kernel gap formula and treats excess diversity as ∑ f(g_i) subject to ∑ g_i = 1, but does not exhibit the explicit expression for f nor compute or cite a verification that f''(g) < 0. Because the theorem's conclusion of a unique maximizer at equal gaps fails if f is merely concave or concave only on a subinterval, this verification is load-bearing for the central claim and should be supplied (or a precise reference to a prior derivation of f'' < 0 given).

minor comments (2)

[Abstract] The abstract states that the interval theorem is obtained 'directly' from the gap formula; a one-sentence pointer to the precise equation in the gap formula that yields the additive structure would improve readability.
[Examples section] In the Pareto-front examples, the text asserts that the continuous uniform-gap result 'appears' on the discrete ZDT3 candidate set; adding a short table or sentence quantifying the deviation of the selected points from exact 1/(k-1) spacing would make the illustration more precise.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their constructive feedback and positive evaluation of the manuscript's contributions. We address the major comment as follows and will make the corresponding revisions.

read point-by-point responses

Referee: [Interval Theorem section] Interval Theorem (the section deriving the main result from the gap formula): the uniqueness claim requires that the per-gap function f be strictly concave on (0,1]. The manuscript invokes the known exponential-kernel gap formula and treats excess diversity as ∑ f(g_i) subject to ∑ g_i = 1, but does not exhibit the explicit expression for f nor compute or cite a verification that f''(g) < 0. Because the theorem's conclusion of a unique maximizer at equal gaps fails if f is merely concave or concave only on a subinterval, this verification is load-bearing for the central claim and should be supplied (or a precise reference to a prior derivation of f'' < 0 given).

Authors: We agree with the referee that the explicit expression for the per-gap function f and a verification of its strict concavity are essential for the proof. In the revised manuscript, we will exhibit the closed-form expression for f derived from the known gap formula for the exponential kernel. We will also compute the second derivative f''(g) and show that f''(g) < 0 for all g ∈ (0,1], thereby confirming strict concavity on the relevant interval. If the gap formula originates from a cited reference, we will ensure the derivation of f is either reproduced or precisely referenced. This addition will strengthen the rigor of the Interval Theorem without altering its conclusions. revision: yes

Circularity Check

0 steps flagged

Derivation builds on external gap formula with independent optimality step; no reduction by construction or self-citation loop

full rationale

The manuscript explicitly starts from the known finite-line gap formula for the exponential kernel and derives the interval theorem from the resulting additive structure ∑f(g_i) under the constraint ∑g_i=1. This step is presented as a direct consequence of the formula's properties rather than presupposing the equal-spacing conclusion or fitting parameters to the target result. No self-citation is shown to be load-bearing for the uniqueness claim, and the paper does not rename a known empirical pattern or smuggle an ansatz via citation. The derivation therefore retains independent mathematical content beyond its inputs, consistent with a minor reliance on prior established results.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper takes the finite-line gap formula for the exponential kernel as given and derives the uniform-spacing optimality from it; no free parameters are fitted and no new entities are postulated.

axioms (1)

domain assumption The finite-line gap formula for the exponential kernel holds and expresses excess inverse-matrix diversity as a sum of functions of consecutive gaps.
Explicitly invoked as the starting point for the main interval theorem.

pith-pipeline@v0.9.0 · 5825 in / 1317 out tokens · 59223 ms · 2026-05-22T05:07:48.286971+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Dβ({x1,...,xk})=1 + sum_{i=1}^{k-1} tanh(β δ_i /2). ... f''(t)= - (β²/2) sech²(β t/2) tanh(β t/2) <0 (t>0). ... Jensen’s inequality gives the uniformly spaced gap vector
IndisputableMonolith/Foundation/DimensionForcing.lean alexander_duality_circle_linking unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Theorem 1 (Uniform spacing on the unit interval). ... the maximizing k-point subset is unique and is given by S*_k

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

13 extracted references · 13 canonical work pages · 4 internal anchors

[1]

Emmerich, M. (2026). Exact Dynamic Programming for Solow–Polasky Diversity Subset Selection on Lines and Staircases. arXiv preprint arXiv:2604.26929

work page internal anchor Pith review Pith/arXiv arXiv 2026
[2]

M. T. M. Emmerich, K. Pereverdieva, and A. H. Deutz. Maximum Solow–Polasky diversity subset selection is NP-hard even in the Euclidean plane. arXiv:2604.19484, 2026

work page internal anchor Pith review Pith/arXiv arXiv 2026
[3]

M. T. M. Emmerich, K. Pereverdieva, and A. H. Deutz. Selecting a maximum Solow–Polasky diversity subset in general metric spaces is NP-hard. arXiv:2604.05495, 2026

work page internal anchor Pith review Pith/arXiv arXiv 2026
[4]

G. H. Hardy, J. E. Littlewood, and G. P ´olya.Inequalities. 2nd ed., Cambridge University Press, 1952

work page 1952
[5]

Huntsman

S. Huntsman. Diversity enhancement via magnitude. InEvolutionary Multi-Criterion Optimization, pages 377–

work page
[6]

Springer Nature Switzerland, Cham, 2023

work page 2023
[7]

Leinster and M

T. Leinster and M. W. Meckes. Maximizing diversity in biology and beyond.Entropy, 18(3):88, 2016

work page 2016
[8]

Leinster and M

T. Leinster and M. W. Meckes. The magnitude of a metric space: from category theory to geometric measure theory. InMeasure Theory in Non-Smooth Spaces, pages 156–193. De Gruyter Open, 2017. doi:10.1515/9783110550832-005

work page doi:10.1515/9783110550832-005 2017
[9]

On the asymptotic magnitude of subsets of Euclidean space

T. Leinster and S. Willerton. On the asymptotic magnitude of subsets of Euclidean space.Geometriae Dedicata, 164:287–310, 2013. arXiv:0908.1582 [math.MG]

work page internal anchor Pith review Pith/arXiv arXiv 2013
[10]

G., Emmerich, M

Nezhadmoghaddam, M., Ju ´arez, J., Falc´on-Cardona, J. G., Emmerich, M. T., & Deutz, A. (2026). Approximating optimalµ-point distributions over a generalized sphere for riesz s-energy using a gradient descent algorithm. Information Sciences, 123470

work page 2026
[11]

Pereverdieva, A

K. Pereverdieva, A. Deutz, T. Ezendam, T. B ¨ack, H. Hofmeyer, and M. T. M. Emmerich. Comparative analysis of indicators for multi-objective diversity optimization. InEvolutionary Multi-Criterion Optimization, pages 58–71. Springer Nature Singapore, Singapore, 2025

work page 2025
[12]

Solow, S

A. Solow, S. Polasky, and J. Broadus. On the measurement of biological diversity.Journal of Environmental Economics and Management, 24(1):60–68, 1993

work page 1993
[13]

Ulrich, J

T. Ulrich, J. Bader, and L. Thiele. Defining and optimizing indicator-based diversity measures in multiobjective search. InParallel Problem Solving from Nature – PPSN XI, pages 707–717. Springer, Berlin, Heidelberg, 2010. 14

work page 2010

[1] [1]

Emmerich, M. (2026). Exact Dynamic Programming for Solow–Polasky Diversity Subset Selection on Lines and Staircases. arXiv preprint arXiv:2604.26929

work page internal anchor Pith review Pith/arXiv arXiv 2026

[2] [2]

M. T. M. Emmerich, K. Pereverdieva, and A. H. Deutz. Maximum Solow–Polasky diversity subset selection is NP-hard even in the Euclidean plane. arXiv:2604.19484, 2026

work page internal anchor Pith review Pith/arXiv arXiv 2026

[3] [3]

M. T. M. Emmerich, K. Pereverdieva, and A. H. Deutz. Selecting a maximum Solow–Polasky diversity subset in general metric spaces is NP-hard. arXiv:2604.05495, 2026

work page internal anchor Pith review Pith/arXiv arXiv 2026

[4] [4]

G. H. Hardy, J. E. Littlewood, and G. P ´olya.Inequalities. 2nd ed., Cambridge University Press, 1952

work page 1952

[5] [5]

Huntsman

S. Huntsman. Diversity enhancement via magnitude. InEvolutionary Multi-Criterion Optimization, pages 377–

work page

[6] [6]

Springer Nature Switzerland, Cham, 2023

work page 2023

[7] [7]

Leinster and M

T. Leinster and M. W. Meckes. Maximizing diversity in biology and beyond.Entropy, 18(3):88, 2016

work page 2016

[8] [8]

Leinster and M

T. Leinster and M. W. Meckes. The magnitude of a metric space: from category theory to geometric measure theory. InMeasure Theory in Non-Smooth Spaces, pages 156–193. De Gruyter Open, 2017. doi:10.1515/9783110550832-005

work page doi:10.1515/9783110550832-005 2017

[9] [9]

On the asymptotic magnitude of subsets of Euclidean space

T. Leinster and S. Willerton. On the asymptotic magnitude of subsets of Euclidean space.Geometriae Dedicata, 164:287–310, 2013. arXiv:0908.1582 [math.MG]

work page internal anchor Pith review Pith/arXiv arXiv 2013

[10] [10]

G., Emmerich, M

Nezhadmoghaddam, M., Ju ´arez, J., Falc´on-Cardona, J. G., Emmerich, M. T., & Deutz, A. (2026). Approximating optimalµ-point distributions over a generalized sphere for riesz s-energy using a gradient descent algorithm. Information Sciences, 123470

work page 2026

[11] [11]

Pereverdieva, A

K. Pereverdieva, A. Deutz, T. Ezendam, T. B ¨ack, H. Hofmeyer, and M. T. M. Emmerich. Comparative analysis of indicators for multi-objective diversity optimization. InEvolutionary Multi-Criterion Optimization, pages 58–71. Springer Nature Singapore, Singapore, 2025

work page 2025

[12] [12]

Solow, S

A. Solow, S. Polasky, and J. Broadus. On the measurement of biological diversity.Journal of Environmental Economics and Management, 24(1):60–68, 1993

work page 1993

[13] [13]

Ulrich, J

T. Ulrich, J. Bader, and L. Thiele. Defining and optimizing indicator-based diversity measures in multiobjective search. InParallel Problem Solving from Nature – PPSN XI, pages 707–717. Springer, Berlin, Heidelberg, 2010. 14

work page 2010