Alphabeta Math
TheoremStatement: 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 duality and complementary slackness

Statement

Let X={x1,…,xm} be a nonempty finite set, let d:X×X→R satisfy d(x,y)=0 if and only if x=y, d(x,y)=d(y,x), and d(x,z)≤d(x,y)+d(y,z), and let p=(pi)i=1m, q=(qi)i=1m have nonnegative coordinates with each vector summing to 1. Let Γ(p,q) consist of matrices πij≥0 with row sums pi and column sums qj, and let

W1(p,q)=min⁡π∈Γ(p,q)∑i=1m∑j=1md(xi,xj)πij.

Then

W1(p,q)=max⁡f∈Rm, f1=0∣fi−fj∣≤d(xi,xj) for all i,j∑i=1m(pi−qi)fi.

Both extrema are attained. Moreover, for every minimizing coupling π and every maximizing vector f, πij>0 implies fi−fj=d(xi,xj).

Facts & Assumptions

Given: The finite metric space, probability vectors, and coupling set in the Statement.

[F1]

A metric is real-valued and satisfies separation, symmetry and the triangle inequality (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

[F2]

Metric values are nonnegative, although this is derived from the metric axioms rather than assumed (Nonnegativity of a metric is a consequence of the other axioms, not an axiom).

[F3]

The vectors p,q have nonnegative coordinates and total mass one (Finite probability vectors).

[F4]

Γ(p,q) consists of nonnegative matrices with row sums pi and column sums qj (Couplings of finite probability vectors).

[F5]

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

[F6]

The coupling set is nonempty compact and its cost minimum is attained; the normalized 1-Lipschitz potential set is nonempty compact and its linear objective maximum is attained (Finite-metric transport and normalized dual optima are attained).

[F7]

The nonnegative span of finitely many Euclidean vectors is closed and closed under nonnegative linear combinations (A cone generated by finitely many Euclidean vectors is closed).

[F8]

If C is a nonempty closed convex subset of Rn, n≥1, and y∉C, there are a nonzero vector h and a real β such that ⟨h,z⟩≤β<⟨h,y⟩ for all z∈C (A point outside a nonempty closed convex set is strictly separated from it).

[F9]

A nonempty finite list of real numbers has an attained minimum (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

[F10]

On the library's Rn, coordinates are indexed by k<n and the Euclidean pairing is ⟨x,y⟩=∑k<nxkyk (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn).

[F11]

A subset of Euclidean space is convex when it contains (1−t)x+ty for every pair of its points and every t∈[0,1] (A convex subset of Rm contains every line segment between two of its points).

Proof

Given: The finite metric space, probability vectors, and coupling set in the Statement.

1.1givenF2F3F4algebra

For any π∈Γ(p,q) and any f∈Rm with f1=0 and ∣fi−fj∣≤d(xi,xj), the marginal equations give ∑i(pi−qi)fi=∑i,jπij(fi−fj)≤∑i,jπijd(xi,xj). The inequality uses πij≥0 and fi−fj≤∣fi−fj∣≤d(xi,xj). Thus every feasible dual value is at most every feasible primal cost.

1.2F1F2F3F4F5F6F7F11

Write dij=d(xi,xj), and for i=1,…,m let ei∈Rm have value 1 at library coordinate k=i−1 and 0 at every other coordinate. For alphabet-indexed tuples u=(ui)i=1m and v=(vj)j=1m, identify (u,v,t) with the vector in R2m+1 whose coordinate k<m is uk+1, whose coordinate m+k is vk+1, and whose coordinate 2m is t. Let K be the nonnegative span of (ei,ej,dij) for all i,j, together with (0,0,1). By [F7], K is closed and closed under nonnegative linear combinations. For x,y∈K and s∈[0,1], [F7] gives sx+(1−s)y∈K, so [F11] makes K convex; the zero representation gives 0∈K. Put c∗=W1(p,q), which is finite and attained by [F6]. For every ε>0, the vector yε=(p,q,c∗−ε) under this identification is outside K: if it had a representation with coefficients λij≥0 and t≥0, its first two coordinate blocks would make λ∈Γ(p,q) and its last coordinate would give c∗−ε=∑i,jdijλij+t≥c∗, contradicting minimality.

2.1F7F8F10step 1.2algebra

Apply [F8] to K and yε. It gives a vector h and threshold β with ⟨h,z⟩≤β<⟨h,yε⟩ for all z∈K. Since 0∈K, β≥0. By [F7], sz∈K for every z∈K and s≥0. If c:=⟨h,z⟩>0 for some z∈K, take s=(β+1)/c>0; then sz∈K but ⟨h,sz⟩=β+1>β, a contradiction. Hence ⟨h,z⟩≤0 for every z∈K, while ⟨h,yε⟩>0.

3.1step 2.1F3F10algebra

Decompose h=(a,b,g) with a,b∈Rm and g∈R. By [F10], pairing with (0,0,1)∈K gives g≤0. If g=0, pairing with every (ei,ej,dij) gives ai+bj≤0. Multiplying by piqj≥0 and summing yields ∑ipiai+∑jqjbj=∑i,jpiqj(ai+bj)≤0. When g=0 this left-hand side is ⟨h,yε⟩, contrary to step 2.1. Therefore g<0.

4.1step 2.1step 3.1algebra

Define ui=ai/(−g) and vj=bj/(−g). The generator inequalities and g<0 give ui+vj≤dij for all i,j. Dividing the strict point inequality by −g>0 gives ∑ipiui+∑jqjvj>c∗−ε.

5.1step 4.1F1F3F9algebra

Set fi=min⁡1≤j≤m(dij−vj), whose minimum is attained by [F9]. From ui+vj≤dij we have ui≤fi. For any i,k,j, the triangle inequality gives dij−vj≤dik+dkj−vj; taking finite minima yields fi≤dik+fk, and symmetry gives ∣fi−fk∣≤dik. Also fj≤djj−vj=−vj, so −fj≥vj. Since p,q are nonnegative, ∑i(pi−qi)fi≥∑ipiui+∑jqjvj>c∗−ε. Replacing fi by fi−f1 preserves all Lipschitz inequalities and the objective because ∑ipi=∑iqi=1; the resulting vector is normalized with first coordinate zero.

6.1step 1.1step 5.1F5F6algebra

Let D be the attained maximum in [F6]. Step 5.1 shows D>c∗−ε for every ε>0, so D≥c∗; otherwise ε=(c∗−D)/2 contradicts that inequality. Step 1.1 gives D≤c∗. Hence D=c∗=W1(p,q), and both extrema are attained by [F6].

7.1step 1.1step 6.1F4algebra∎

Let π be any minimizing coupling and f any maximizing normalized potential. By the marginal equations and optimal-value equality, 0=c∗−∑i(pi−qi)fi=∑i,jπij(dij−(fi−fj)). Each summand is nonnegative by feasibility. A finite sum of nonnegative reals can be zero only if each term is zero: if one term were positive, adding the other nonnegative terms would keep the total positive. Thus if πij>0, its factor dij−(fi−fj) is zero, proving fi−fj=dij.

Depends on

Used by

Dependency tree · two levels

51 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