Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Finite-metric transport and normalized dual optima are attained

Statement

Let X={x1,…,xm} be a nonempty finite metric space, and let p,q be probability vectors on X. The coupling set Γ(p,q) is nonempty and compact in Rm2, so the finite-metric transport cost W1(p,q) attains its minimum. The normalized 1-Lipschitz potential set

L1(X,d)={f∈Rm:f1=0, ∣fi−fj∣≤d(xi,xj) for all i,j}

is also nonempty and compact, so the linear functional f↦∑i=1m(pi−qi)fi attains a maximum on it.

Facts & Assumptions

Given: A nonempty finite set X={x1,…,xm} with metric d, and probability vectors p,q on X.

[F1]

A probability vector has nonnegative coordinates with total sum one (Finite probability vectors).

[F2]

A coupling is a nonnegative matrix whose row sums are pi and column sums are qj (Couplings of finite probability vectors).

[F3]

A metric has real values, vanishes exactly on equal points, is symmetric, and satisfies the triangle inequality (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

[F4]

Every metric is nonnegative, although nonnegativity is not listed as a separate metric axiom (Nonnegativity of a metric is a consequence of the other axioms, not an axiom).

[F5]

On Rn for n≥1, d2(x,y)=∑k<n(xk−yk)2 is a metric (Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it). Closedness and openness refer to its metric topology; a set is closed when its complement is open, and open sets contain a ball around each of their points (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement).

[F7]

Every lower semicontinuous real function on a nonempty compact Euclidean set attains a minimum, and every upper semicontinuous one attains a maximum (Semicontinuous extreme value theorem on compact Euclidean sets).

[F8]

The real line has metric dR(a,b)=∣a−b∣ (The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (x−r,x+r), and it is unbounded), and continuity at x means that for each ε>0 some δ>0 makes dX(x,y)<δ imply dY(f(x),f(y))<ε (Continuity of a map between metric spaces, at a point and globally, in the ε-δ form).

[F9]

A continuous real function on a Euclidean subset is both lower and upper semicontinuous (Upper and lower semicontinuity on subsets of Rn).

[F10]

The finite-metric transport cost is W1(p,q)=min⁡π∈Γ(p,q)∑i,jd(xi,xj)πij (The finite-metric 1-Wasserstein transport cost).

[F11]

Every nonzero real has positive square and 02=0; finite sums of nonnegative terms dominate each term, termwise inequalities may be summed, and finite sums scale by a common scalar; for nonnegative reals, comparison of squares is equivalent to comparison of the reals; square roots are nonnegative and square to their radicands; absolute values are nonnegative and satisfy ∣a∣=0  ⟺  a=0, ∣ab∣=∣a∣∣b∣, ∣a+b∣≤∣a∣+∣b∣, and ∣a∣2=a2; multiplication by a nonnegative real preserves nonstrict inequalities (Squares of nonzero elements are positive, Integer powers am, Multiplication by zero: 0⋅a=0, Laws of finite sums and finite products, Squaring is monotone on the nonnegatives, Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}, Absolute value in an ordered field, Basic properties of the absolute value, The triangle inequality, Sign rules for products and monotonicity of multiplication).

[F12]

A property holding at 0 and passing from n to n+1 holds for every natural n (The principle of mathematical induction).

Proof

1.1givenF1F2construct

Define πij=piqj. These entries are nonnegative by [F1], and their row sums are pi∑jqj=pi while their column sums are qj∑ipi=qj. Thus π∈Γ(p,q) and the coupling set is nonempty.

1.2givenF1F2F5F6F11F12algebra

Flatten a matrix into Rm2 in row-major order, assigning entry πij to library coordinate k=(i−1)m+(j−1)<m2; likewise potential coordinate fi corresponds to library coordinate i−1<m. In any dimension n≥1, for u∈Rn and k<n, [F11] gives uk2≤∑j<nuj2; by [F5,F11], ∣uk∣2=uk2≤d2(u,0)2, and both ∣uk∣ and d2(u,0) are nonnegative, so [F11] gives ∣uk∣≤d2(u,0). By induction on n, every finite list satisfies ∣∑k<nak∣≤∑k<n∣ak∣: the empty case is equality and the successor step follows from ∣a+b∣≤∣a∣+∣b∣ in [F11]. Thus for every finite linear form L(z)=∑k<nckzk, this bound, ∣ab∣=∣a∣∣b∣, the coordinate estimate, multiplication by nonnegative coefficients, finite-sum monotonicity and scaling in [F11] give ∣L(z)−L(w)∣≤(∑k<n∣ck∣)d2(z,w). The same estimate holds for every affine form H(z)=L(z)+b, since the constant cancels in H(z)−H(w). The set Γ(p,q) is defined by finitely many affine equalities and weak inequalities. Each row or column equality, after moving its marginal to one side, has m coefficients equal to 1; each entrywise nonnegativity constraint has one coefficient equal to 1, so the coefficient sum C=∑∣ck∣ is positive for every constraint. If an affine equality H(z)=0 fails at z0, then for d2(z,z0)<∣H(z0)∣/(2C) the estimate gives ∣H(z)−H(z0)∣<∣H(z0)∣/2, so H(z)≠0. If an affine inequality H(z)≥0 fails at z0, then for d2(z,z0)<−H(z0)/(2C) the estimate gives H(z)<H(z0)/2<0. Thus every point outside Γ(p,q) has a ball in its complement, so [F5,F6] make Γ(p,q) closed. Also 0≤πij≤pi≤1 by [F1,F2], so the set is bounded. Since m2≥1, [F6] makes Γ(p,q) compact.

2.1step 1.1step 1.2F1F4F7F8F9F10F11

For a matrix difference z−w, the objective changes by at most Cd2(z,w), where C=∑i,jd(xi,xj)≥0 is finite; the coordinate bound is the same as in step 1.2. For any ε>0, taking δ=ε/(C+1) shows that inputs within δ have output difference less than ε, so the objective is continuous by [F8] and lower semicontinuous by [F9]. It is real-valued because all distances are finite reals; by [F4] and [F1] its values are nonnegative. The nonempty compact set from steps 1.1–1.2 and [F7] therefore give a finite attained minimum, which is W1(p,q) by [F10].

2.2givenF3F4F5F6F11step 1.2algebra

The set L1(X,d) contains the zero vector. It is closed because its constraints are finitely many linear equalities and weak inequalities: f1=0 has one nonzero coefficient, and writing each ∣fi−fj∣≤d(xi,xj) as d(xi,xj)−(fi−fj)≥0 and d(xi,xj)+(fi−fj)≥0 gives two nonzero coefficients in each inequality when i≠j; when i=j the constraint is the identity 0≤0. Thus every violated constraint has positive coefficient sum and the strict-violation ball argument in step 1.2 applies using [F5,F6,F11]. Since f1=0 and ∣fi−f1∣≤d(xi,x1), every f∈L1(X,d) satisfies ∣fi∣≤d(xi,x1)≤1+∑k=1md(xk,x1) by [F3,F4]; thus the set is bounded. Since m≥1, [F6] makes it compact.

3.1step 2.2F7F8F9F11algebra∎

The objective f↦∑i(pi−qi)fi changes by at most C′d2(f,g), where C′=∑i∣pi−qi∣≥0; taking δ=ε/(C′+1) for each ε>0 proves continuity by [F8] and upper semicontinuity by [F9]. The nonempty compact set from step 2.2 and [F7] give an attained maximum.

Depends on

Used by

Cited to discharge well-definedness by The finite-metric 1-Wasserstein transport cost.

Dependency tree · two levels

74 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources