TheoremBase

Laplacian Test Functions on the Torus: Uniqueness of the Gradient Field, a Criterion, and Linearity of the Test Classes

A function has at most one gradient field. A continuous function with a tangent-valued gradient field is a Laplacian test function. Intrinsic and Laplacian test functions are closed under linear combinations, with linear gradients and gradient fields.

Statement

In the setting of Optimal Transport on the Flat Torus: Standing Notation, let intrinsic test functions on a subset of P(Td)\mathcal{P}(\mathbb{T}^{d}) and their gradients along couplings ∇φ(μ)\nabla\varphi(\mu) be as in that definition, let gradient fields and Laplacian test functions be as in Gradient Fields and Laplacian Test Functions on the Torus Wasserstein Space, and let TμT_{\mu} be the tangent space at μ\mu. Then the following hold.

1. (Uniqueness of the gradient field) Every φ:P(Td)→R\varphi:\mathcal{P}(\mathbb{T}^{d})\to\mathbb{R} has at most one gradient field.

2. (Criterion) Let φ:P(Td)→R\varphi:\mathcal{P}(\mathbb{T}^{d})\to\mathbb{R} and let gg be a gradient field of φ\varphi such that the class of g(μ,⋅)g(\mu,\cdot) in L2(μ;Rd)L^{2}(\mu;\mathbb{R}^{d}) belongs to TμT_{\mu} for every μ∈P(Td)\mu\in\mathcal{P}(\mathbb{T}^{d}). Then φ\varphi is a Laplacian test function.

3. (Linearity) Let K⊆P(Td)\mathcal{K}\subseteq\mathcal{P}(\mathbb{T}^{d}), let φ\varphi and ψ\psi be intrinsic test functions on K\mathcal{K}, and let a,ba,b be real numbers. Then aφ+bψa\varphi+b\psi is an intrinsic test function on K\mathcal{K} with ∇(aφ+bψ)(μ)=a∇φ(μ)+b∇ψ(μ)\nabla(a\varphi+b\psi)(\mu)=a\nabla\varphi(\mu)+b\nabla\psi(\mu) for every μ∈K\mu\in\mathcal{K}. If φ\varphi and ψ\psi are Laplacian test functions with gradient fields gg and hh, then aφ+bψa\varphi+b\psi is a Laplacian test function with gradient field ag+bhag+bh.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…