For an injective start, the work function is the Lipschitz extension of its injective restriction
ProvedKServer.workFnU_injective_witnessFix a metric space , a number of servers, and an initial configuration that occupies distinct points. For a request sequence write for the unordered work function, and for configurations write for the labelled movement cost.
Statement. For every , every configuration and every there is an injective configuration with
Since the opposite inequality is the Lipschitz property of the work function, the two together say
that is, the work function is the largest -Lipschitz extension of its own restriction to injective configurations, and therefore carries no information at degenerate configurations beyond what it already carries at injective ones.
Role. The classical theory treats a configuration as a set of points, so degenerate configurations, which place two servers at a single point, do not occur in it. A formalization over maps must deal with them, and the growth bounds of the work function are consequently available only in their injective form. This lemma is the bridge: any inequality between work functions that is proved at injective configurations and is preserved by the Lipschitz extension holds at every configuration.
The hypothesis on is necessary. On the uniform three-point space with and , after the single request the work function vanishes at , while every injective configuration lies at distance from it and has work-function value ; the right-hand side above equals and the statement fails by . What survives for a degenerate start is the same statement with an additive slack equal to twice the distance from to the nearest injective configuration.
Formalization note. The error term is present because on a general metric space the infimum over injective configurations need not be attained. The movement cost is the labelled one; this is the stronger reading, since the witness may be relabelled freely and workFnU is invariant under relabelling.
import Mathlib import Definitions.Def_KServer_workfunctionU
namespace KServer
theorem workFnU_injective_witness (k : ℕ) (hk : 1 ≤ k) (M : Type) [MetricSpace M]
(C₀ : Config k M) (hC₀ : Function.Injective C₀) (σ : List M) (Y : Config k M)
(ε : ℝ) (hε : 0 < ε) :
∃ X : Config k M, Function.Injective X ∧
workFnU C₀ σ X + moveCost X Y ≤ workFnU C₀ σ Y + ε := by sorry
end KServer