Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Continuity and ideal-critic gradients for compact-space Wasserstein GAN objectives

Statement

Let (X,d) be a nonempty compact metric space, fix x0∈X, and let D<∞ satisfy d(x,y)≤D for all x,y∈X. Let μ be a Borel probability measure on X, let (Z,Σ,ρ) be a probability space, and let Θ⊆Rp be open with p≥1. For every θ∈Θ, let Gθ:Z→X be measurable and define its law by Pθ(B)=ρ(Gθ−1(B)) for Borel B⊆X. Assume z↦d(Gθ(z),Gθ′(z)) is ρ-measurable for every θ,θ′∈Θ, and that there is a measurable set Z0⊆Z with ρ(Z0)=1 on which θ↦Gθ(z) is continuous. Let F1(X,x0) be the class of bounded Borel functions f:X→R satisfying f(x0)=0 and ∣f(x)−f(y)∣≤d(x,y) for all x,y∈X, and set V(θ)=dF1(X,x0)(μ,Pθ). Then V(θ)=W1X(μ,Pθ) and V is continuous on Θ.

Suppose in addition that for every θ0∈Θ there are an open neighborhood U⊆Θ of θ0, a measurable Kθ0:Z→[0,+∞) with ∫Kθ0 dρ<∞, and a measurable full-measure set Zθ0⊆Z such that, for every z∈Zθ0 and every θ,θ′∈U,

d(Gθ(z),Gθ′(z))≤Kθ0(z)∥θ−θ′∥.

Then V is locally Lipschitz, with ∣V(θ)−V(θ′)∣≤∥θ−θ′∥∫Kθ0 dρ for θ,θ′∈U. At any such θ0 where V is Fréchet differentiable, if the signed dual supremum at θ0 is attained by fθ0∈F1(X,x0) and Hθ0(θ,z)=fθ0(Gθ(z)) is Fréchet differentiable in θ at θ0 for ρ-almost every z with measurable derivative, then

∇V(θ0)=−∫Z∇θHθ0(θ0,z) dρ(z).

Here Fréchet differentiability of a scalar function F at θ0 means there is a linear map A such that F(θ0+h)=F(θ0)+A[h]+o(∥h∥) as h→0. The attainment and composite-differentiability assumptions are pointwise hypotheses for the gradient formula; compact dual attainment is not asserted.

Facts & Assumptions

Given: The compact metric data space and finite bound D, base point x0, Borel probability μ, probability space (Z,Σ,ρ), open finite-dimensional parameter set Θ, measurable random elements Gθ, their laws Pθ, the pointwise continuity and distance-measurability hypotheses, and the additional common-neighborhood integrable envelope wherever the local-Lipschitz and gradient conclusions are used.

[F1]

For a nonempty class of real-valued functions integrable under both laws, the IPM is the supremum of the absolute differences of their integrals. Integral probability metrics

[F2]

For Borel probabilities on a nonempty compact metric space, the coupling cost W1X equals the signed supremum over normalized 1-Lipschitz functions; the supplier proof establishes that these tests are bounded Borel and that no compact primal or dual attainment is asserted. Kantorovich–Rubinstein duality on compact metric spaces

[F3]

The compact-space W1X convention is the infimum of Borel coupling costs over couplings with the stated marginals. The coupling definition of the 1-Wasserstein cost on a compact metric space

[F4]

A random element is a measurable map from a probability space into a measurable target space. Random elements and real random variables

[F5]

The law of a random element G is PG(B)=ρ(G−1(B)) for each measurable target set B. Law or distribution of a random element

[F6]

The law of a random element is a probability measure. The law of a random element is a probability measure

[F7]

A nonnegative simple measurable function has a finite representation by nonnegative coefficients on pairwise disjoint measurable sets, and its simple integral is the corresponding finite weighted sum. Nonnegative simple measurable functions The integral of a nonnegative simple function

[F8]

The nonnegative Lebesgue integral agrees with that simple integral on nonnegative simple functions. The nonnegative integral agrees with the simple integral on simple functions

[F9]

A nonnegative measurable function is the pointwise increasing limit of nonnegative simple functions. Every nonnegative measurable function is the increasing limit of simple measurable functions

[F10]

If measurable functions converge almost everywhere and are dominated by one integrable nonnegative function, their integrals converge. Dominated convergence

[F11]

For a bounded real measurable function, its signed Lebesgue integral is the difference of the integrals of its positive and negative parts. Integrable real and complex functions, and their integrals

[F12]

The rationals are dense in the reals. Enumerate rational p-tuples explicitly by integer numerators and positive denominators of increasing bounded height; coordinatewise rational approximation makes these tuples dense in Rp. No selection of a sequence from arbitrary nonempty sets is involved. The rationals embed densely in the reals

[F13]

The supremum of a sequence of measurable real or extended-real functions is measurable. Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable

Proof

Given: The hypotheses in the Statement and the additional envelope and pointwise attainment/composite-differentiability hypotheses for the gradient branch.

1.1givenF4F5F6F7F8F9F10F11

By [F4] and [F6], every Pθ is a probability measure. By [F5], Pθ(A)=ρ(Gθ−1(A)) for every Borel A⊆X. If s=∑j=1mcj1Aj is nonnegative simple with disjoint Borel sets, [F7]–[F8] give ∫s dPθ=∑jcjPθ(Aj)=∑jcjρ(Gθ−1(Aj))=∫s∘Gθ dρ. For any bounded Borel real f, apply [F9] to f+ and f−; their increasing simple approximants are bounded by ∥f∥∞, whose integral is finite under both probability measures. Applying [F10] to the approximants and their compositions gives equality of the positive-part integrals and of the negative-part integrals; [F11] then yields ∫f dPθ=∫f(Gθ(z)) dρ(z).

1.2givenF1F2F3algebra

The zero function belongs to F1(X,x0), so this class is nonempty; it is also symmetric under f↦−f, so its supremum of absolute integral differences equals its signed supremum. It is exactly the bounded Borel version of the compact KR test class in [F2]. Hence V(θ)=W1X(μ,Pθ) for every θ, with the coupling-cost convention in [F3].

1.3givenF10F12F13algebra

Fix θ0 and its attaining critic, and choose r>0 such that the ball B(θ0,r) lies in the envelope neighborhood. Let E be the intersection of its measurable full-measure set with a measurable full-measure set where the composite is Fréchet differentiable. Extend the measurable derivative by zero off E. On E its norm is at most Kθ0, by the envelope and the critic's 1-Lipschitz inequality, so all coordinates are integrable. Write R(h,z)=Hθ0(θ0+h,z)−Hθ0(θ0,z)−DθHθ0(θ0,z)[h]. For j≥1 put sj=min⁡{r/2,1/j} and let Qj(z) be zero off E and otherwise the supremum of ∣R(q,z)∣/∥q∥ over rational p-tuples with 0<∥q∥<sj, including zero among the values. The explicit enumeration and [F13] give measurability; the envelope gives 0≤Qj≤2Kθ0, and pointwise Fréchet differentiability gives Qj→0 on E. By [F10], ∫Qj dρ→0. On E the remainder ratio is continuous in nonzero h by the envelope, so rational density [F12] bounds it by Qj for every real 0<∥h∥<sj. Therefore ∣∫R(h,z) dρ∣/∥h∥≤∫Qj dρ for all such h, proving the full Fréchet limit without a sequential-criterion choice step. Thus Φ(θ)=∫fθ0 dμ−∫Hθ0(θ,z) dρ(z) has derivative −∫DθHθ0(θ0,z) dρ(z).

2.1givenstep 1.1step 1.2F10F12F13algebra

Fix θ0 and a ball B(θ0,r)⊆Θ. Put sj=min⁡{r/2,1/j}. On Z0, let Sj(z) be the supremum of d(Gθ0+q(z),Gθ0(z)) over rational p-tuples with ∥q∥<sj, and set it to zero off Z0. It is measurable by the assumed distance measurability, [F12] and [F13], is bounded by D, and tends pointwise to zero by parameter continuity. Thus [F10] gives ∫Sj dρ→0. Parameter continuity and rational density make Sj dominate the same distance for all real increments ∥h∥<sj on Z0. For every critic f, step 1.1 and its 1-Lipschitz property give ∣Δθ0+h(f)−Δθ0(f)∣≤∫Sj dρ, where Δθ(f)=∫f dμ−∫f dPθ. The same bound holds for the difference of their absolute values and hence of the two suprema. It follows that ∣V(θ0+h)−V(θ0)∣≤∫Sj dρ for all ∥h∥<sj, proving continuity.

2.2givenstep 1.1step 1.2algebra

Under the common-neighborhood envelope, the same estimate gives ∣Δθ(f)−Δθ′(f)∣≤∥θ−θ′∥∫Kθ0 dρ for every f∈F1(X,x0) and θ,θ′∈U. Taking absolute values and then suprema proves the stated local-Lipschitz bound for V.

3.1givenstep 1.3algebra∎

By optimality, Φ(θ0)=V(θ0) and Φ(θ)≤V(θ) for every θ. Thus V−Φ has a local minimum of 0 at θ0. Along every direction v, differentiability and the two one-sided difference quotients at this minimum give D(V−Φ)(θ0)[v]=0; since this holds for every v, the derivative of the difference is zero, giving the claimed gradient formula.

Remarks

The local-Lipschitz conclusion uses a single integrable envelope valid on one parameter neighborhood for almost every latent input. Arjovsky et al.'s Assumption 1 gives only pointwise local constants; Appendix C does not justify replacing the latent-dependent neighborhoods by a common parameter neighborhood. The two explicit false statements and witnesses on the examples companion separately refute that local-Lipschitz inference and the asserted gradient exchange under the original condition, including a density-latent witness where both derivatives exist. They do not refute the corrected common-envelope theorem or by themselves settle the source's bare almost-everywhere assertion. The present Statement's continuity, full local-Lipschitz bound and conditional optimal-critic Fréchet formula are preserved. No claim is made for approximate critics, arbitrary P1 spaces, compact dual attainment, or convergence of saddle-point optimization. The additional source diagnosis and rational-supremum proof refinement are owner-delegated local work; original native proof and external source-reading history remain separately attributed.

Depends on

Used by

Dependency tree · two levels

57 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