Theorem 3 — exact unrestricted-degree capacity, competitiveness, gap, and optimizer
OpenRankingCertGap.Supplement.theorem_3asymptotic-analysisonline-matchingp2o-gran-per-chapterp2o-plan-paperp2o-v1randomized-primal-dualranking-algorithm
Let be the nondecreasing, right-continuous admissible gain-sharing profiles. For every , the unrestricted finite-instance certifying value is
Moreover,
The unique optimizer is on .
This identifies both the exact inner value for every admissible monotone profile and the unique profile attaining the classical unrestricted RANKING guarantee.
Formalization Note The minimum is stated by exhibiting an attaining point and comparing it with every other point of . Optimizer uniqueness is pointwise on the paper's domain .
Differences from the source:
- encoding: and → total real functions whose values on are unchanged; reason: the published profile class uses total functions and scores only read the source interval
- encoding: → an attaining whose value is no larger than every other value; reason: this is the literal minimum and avoids a junk real infimum
- encoding: unique optimizer as a function on → equality at every point of ; reason: total-function extensions outside the source domain are irrelevant
Preamble
import Mathlib import Definitions.Def_RankingCertGap_Supplement_Objects set_option autoImplicit false
Formal statement
namespace RankingCertGap.Supplement
/-- **Theorem 3 (Unrestricted online degree).** Xu, *Certifying Capacity and Gaps of the
Rank-Dependent Gain-Sharing Framework for Ranking*, arXiv:2610.17545 (held file sha256 75896dd9…),
Theorem 3, p.8, eqs. (14)–(15). For every `f ∈ 𝒽`, the inner value is the attained minimum of
`H_f` on `[0,1]`; the capacity and competitiveness are `1 - 1/e`, the gap is zero, and the
exponential profile is the unique optimizer.
**Formalization Note.** `unrestricted` is the class of all finite instances, not an
infinity-regular class. The attained minimum is written with its minimizer, avoiding any real
`sInf` convention. Optimizer equality is pointwise on `[0,1]`, the source domain; total-function
extensions outside that interval are immaterial. -/
theorem theorem_3 :
(∀ f : ℝ → ℝ, f ∈ classF →
∃ t ∈ Set.Icc (0 : ℝ) 1,
chiC f unrestricted = Hf f t ∧ ∀ u ∈ Set.Icc (0 : ℝ) 1, Hf f t ≤ Hf f u) ∧
GammaC classF unrestricted = 1 - 1 / Real.exp 1 ∧
gammaC unrestricted = 1 - 1 / Real.exp 1 ∧
gapC classF unrestricted = 0 ∧
expProfile ∈ classF ∧
chiC expProfile unrestricted = GammaC classF unrestricted ∧
(∀ f : ℝ → ℝ, f ∈ classF →
chiC f unrestricted = GammaC classF unrestricted →
∀ y ∈ Set.Icc (0 : ℝ) 1, f y = expProfile y) := by sorry
end RankingCertGap.Supplement
Source
Xu, Certifying Capacity and Gaps of the Rank-Dependent Gain-Sharing Framework for Ranking, arXiv:2610.17545 (held file sha256 75896dd9…), Theorem 3, p.8, eqs. (14)–(15)