Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma C.3 — incompatibility without regularity assumptions

Open
KTaxi.Competitive.Supplement.lemma_C_3

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

online-algorithmsp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1probabilitytaxi-problem

For any finite ρ≥1\rho\ge1ρ≥1, no finite nonnegative function F:R2→[0,∞)F:\mathbb R^2\to[0,\infty)F:R2→[0,∞) can satisfy all of the following constraints. For every x,yx,yx,y,

∣x−y∣≤F(x,y)≤ρ∣x−y∣,|x-y|\le F(x,y)\le\rho|x-y|,∣x−y∣≤F(x,y)≤ρ∣x−y∣,

and for every pairwise distinct x,y,zx,y,zx,y,z there must be one p∈[0,1]p\in[0,1]p∈[0,1] satisfying both

F(x,y)≥p∣x−y∣+(1−p)(∣z−y∣+F(x,z)),F(x,y)\ge p|x-y|+(1-p)(|z-y|+F(x,z)),F(x,y)≥p∣x−y∣+(1−p)(∣z−y∣+F(x,z)), F(z,y)≥(1−p)∣z−y∣+p(∣x−y∣+F(z,x)).F(z,y)\ge(1-p)|z-y|+p(|x-y|+F(z,x)).F(z,y)≥(1−p)∣z−y∣+p(∣x−y∣+F(z,x)).

There is no symmetry, continuity, measurability or algorithm-realizability hypothesis. This independent incompatibility result supplies the final contradiction for Theorem 1.3.

Differences from the source:

  • encoding: a finite nonnegative function on ℝ² and finite ρ ≥ 1 → a curried function ℝ → ℝ → ℝ≥0 and ρ : ℝ≥0 with 1 ≤ ρ; reason: currying and the nonnegative real type change no instance; both bounds and both comparisons are expanded in the theorem
Preamble
import Mathlib
import Definitions.Def_KTaxi_Competitive_Supplement_Memoryless

open scoped ENNReal NNReal
Formal statement
namespace KTaxi.Competitive.Supplement

/-- Lemma C.3, PDF p. 24: arbitrary finite nonnegative oriented functions,
without regularity or algorithm-realizability assumptions. -/
theorem lemma_C_3 (ρ : ℝ≥0) (hρ : 1 ≤ ρ) :
    ¬ ∃ F : ℝ → ℝ → ℝ≥0,
      (∀ x y : ℝ, |x - y| ≤ (F x y : ℝ) ∧
        (F x y : ℝ) ≤ (ρ : ℝ) * |x - y|) ∧
      (∀ x y z : ℝ, x ≠ y → x ≠ z → y ≠ z → ∃ p : ℝ,
        0 ≤ p ∧ p ≤ 1 ∧
        p * |x - y| + (1 - p) * (|z - y| + (F x z : ℝ)) ≤ (F x y : ℝ) ∧
        (1 - p) * |z - y| + p * (|x - y| + (F z x : ℝ)) ≤ (F z y : ℝ)) := by sorry

end KTaxi.Competitive.Supplement
Source
Christian Coester, Yichen Huang, Tze-Yang Poon, STOC 2027 submission #96 (October 2026), https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/96.pdf, Lemma C.3, PDF p. 24 (printed p. 23)
Human review
  • Endorsed by Shuze Chen · Nov 18, 2026

    Confirmed by the moderator at approval.

  • Endorsed by martelus trismortuus · Nov 18, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me